An efficient low-delay routing algorithm for opportunistic networks based on exchange of increments in packet indexes

被引：1

作者：

Ren Z. ^{[1
,2
]}

Huang Y. ^{[1
,2
]}

Chen Q.-B. ^{[1
,2
]}

机构：

[1] School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications

[2] Key Laboratory of Mobile Communication Technology of Chongqing

来源：

Jisuanji Xuebao/Chinese Journal of Computers | 2010年 / 33卷 / 09期

关键词：

Exchange; Increments; Opportunistic networks; Packet indexes; Routing algorithms;

D O I：

10.3724/SP.J.1016.2010.01634

中图分类号：

学科分类号：

摘要：

Epidemic-based routing algorithms can reliably transmit data in opportunistic networks. However, they have some redundant control overhead in sensing encountered nodes and exchanging data packets. To address the issue this paper proposes ERBEI (Efficient Routing Based on Exchange of Increments of packet indexes), an efficient low-delay routing algorithm. ERBEI transmits only the increments of packet indexes in the process of packet exchange, deletes the packets reaching destinations from nodes' memory, utilizes only the Hello messages to sense the encountered nodes, and sends the packets approaching their destinations firstly. Theoretical analysis and simulation results show that ERBEI outperforms the classical epidemic routing algorithm and one of its present improvements in the terms of control overhead, end-to-end delay, and memory overhead.

引用

页码：1634 / 1642

页数：8

共 20 条

[1] Pelusi L., Passarella A., Conti M., Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks, IEEE Communications Magazine, 44, 11, pp. 134-141, (2006)
[2] Huang C.-M., Lan K.-C., Tsai C.-Z., A survey of opportunistic networks, Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, pp. 1672-1677, (2008)
[3] Kumar S., Challenges for ubiquitous computing, Proceedings of the 5th International Conference on Networking and Services 2009 (ICNS'09), pp. 526-535, (2009)
[4] (2010)
[5] Xiong Y.-P., Sun L.-M., Niu J.-W., Liu Y., Opportunistic networks, Journal of Software, 20, 1, pp. 124-137, (2009)
[6] Chen L.-J., Yu C.-H., Tseng C.-L., Chu H.-H., Chou C.-F., A content-centric framework for effective data dissemination in opportunistic networks, IEEE Journal on Selected Areas in Communications, 26, 5, pp. 761-772, (2008)
[7] Zhang Z.-S., Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges, IEEE Communications Surveys and Tutorials, 8, 1, pp. 24-37, (2006)
[8] Chen H., Fan X.-M., Shan Z.-G., Forwarded history-based asynchronous routing for challenged networks and research of the number of relays, Chinese Journal of Computers, 31, 10, pp. 1687-1694, (2008)
[9] Vahdat A., Becker D., Epidemic routing for partially connected ad hoc networks, (2000)
[10] Ramanathan R., Hansen R., Basu P., Rosales-Hain R., Krishnan R., Prioritized epidemic routing for opportunistic networks, Proceedings of the 1st ACM International MobiSys Workshop on Mobile Opportunistic Networking, pp. 62-66, (2007)

← 1 2 →