Data forwarding with finite buffer capacity in opportunistic networks

Mohd Yaseen Mir, Chih-Lin-Hu, Sheng Zhi Huang

研究成果: 書貢獻/報告類型會議論文篇章同行評審

4 引文 斯高帕斯(Scopus)

摘要

The opportunistic networks evolved from mobile ad hoc networks cannot guarantee the existence of a complete network topology and end-to-end data forwarding paths. Routes are built dynamically, and any possible node can opportunistically be used as a next hop. The main challenge in opportunistic networks is to deliver messages with a minimum delay while maximizing delivery ratio. Replicating messages are thus used to hope that at least one of message replicas can reach to the destination. Most of existing replication studies, however, assume infinite buffer to store messages, which is infeasible. In this paper, we eliminate this assumption and let all nodes in a network have the minimum buffer capacity without loss of generality. Our approach selects a relay node that has a minimum drop with a maximum forward for replicating a message. When the buffer capacity of a node reaches to its upper limit, a message that has already been replicated multiple times will be dropped first. Simulation results show that our approach can attain a higher rate of successful message delivery as compared with Spray and Wait and Epidemic under SLAW mobility patterns in opportunistic networks.

原文???core.languages.en_GB???
主出版物標題2018 27th Wireless and Optical Communication Conference, WOCC 2018
發行者Institute of Electrical and Electronics Engineers Inc.
頁面1-5
頁數5
ISBN(電子)9781538649596
DOIs
出版狀態已出版 - 4 6月 2018
事件27th Wireless and Optical Communication Conference, WOCC 2018 - Hualien, Taiwan
持續時間: 30 4月 20181 5月 2018

出版系列

名字2018 27th Wireless and Optical Communication Conference, WOCC 2018

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???27th Wireless and Optical Communication Conference, WOCC 2018
國家/地區Taiwan
城市Hualien
期間30/04/181/05/18

指紋

深入研究「Data forwarding with finite buffer capacity in opportunistic networks」主題。共同形成了獨特的指紋。

引用此