On selection of forwarding nodes for long opportunistic routes

被引:2
作者
Malekyan, Sajad [1 ]
Bag-Mohammadi, Mozafar [2 ]
Ghasemi, Marzieh [3 ]
Abdollahi, Mostafa [4 ]
机构
[1] Islamic Azad Univ Kermanshah, Comp Sci Grp, Kermanshah, Iran
[2] Ilam Univ, Wireless Network Lab, Fac Engn, Ilam, Iran
[3] Islamic Azad Univ Arak, Fac Engn, Sci & Res Branch, Arak, Iran
[4] Kharazmi Univ, Fac Engn, Tehran, Iran
关键词
Opportunistic routing; Network coding; Wireless mesh networks;
D O I
10.1007/s11276-017-1636-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Opportunistic routing is a promising routing paradigm which increases the network throughput. It forces the sender's neighbors, who successfully overheard the transmitted packet, to participate in the packet forwarding process as intermediate forwarding nodes. As a seminal opportunistic routing protocol, MORE combines network coding idea with opportunistic routing to eliminate the need for strict coordination among active forwarding nodes. In this paper, we show that MORE performance does not scale well with the route length, especially when the route length goes beyond two hops. Also, we found that MORE fails to establish a working opportunistic route in sparse networks. Clearly, the network throughput is directly influenced by both the quantity and quality of forwarding nodes, and their cooperation order. In this paper, we propose a new forwarder selection mechanism which considers the route length, link qualities, the distance from the source, and nodes density. It eliminates the occasional route disconnectivity happening in MORE and improves the quality of the established opportunistic routes. The simulation result indicates that our proposal always outperforms MORE when dealing with long opportunistic routes.
引用
收藏
页码:1847 / 1854
页数:8
相关论文
共 16 条
[1]  
[Anonymous], P 14 ACM MOBIHOC
[2]  
[Anonymous], 2003, P ACM MOBICOM, DOI DOI 10.1145/938985.939000
[3]   ExOR: Opportunistic multi-hop routing for wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2005, 35 (04) :133-143
[4]   Opportunistic Routing in Wireless Networks: Models, Algorithms, and Classifications [J].
Boukerche, Azzedine ;
Darehshoorzadeh, Amir .
ACM COMPUTING SURVEYS, 2015, 47 (02)
[5]  
Chachulski S., 2007, P ACM SIGCOM
[6]  
Laufer R. P., P IEEE INFOCOM, P37
[7]  
Li P, 2012, IEEE INFOCOM SER, P100, DOI 10.1109/INFCOM.2012.6195456
[8]   Trading Optimality for Scalability in Large-Scale Opportunistic Routing [J].
Li, Yanhua ;
Mohaisen, Abedelaziz ;
Zhang, Zhi-Li .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2013, 62 (05) :2253-2263
[9]   From Rateless to Hopless [J].
Li, Zhenjiang ;
Du, Wan ;
Zheng, Yuanqing ;
Li, Mo ;
Wu, Dapeng .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (01) :69-82
[10]   Spatial Reusability-Aware Routing in Multi-Hop Wireless Networks [J].
Meng, Tong ;
Wu, Fan ;
Yang, Zheng ;
Chen, Guihai ;
Vasilakos, Athanasios V. .
IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (01) :244-255