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
相关论文
共 50 条
  • [31] Opportunistic Relay Selection for Wireless Network Coding
    Manssour, Jawad
    Osseiran, Afif
    Ben Slimane, Slimane
    2009 IEEE 9TH MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS (MICC), 2009, : 102 - 106
  • [32] Optimal Forwarder List Selection in Opportunistic Routing
    Li, Yanhua
    Chen, Wei
    Zhang, Zhi-Li
    2009 IEEE 6TH INTERNATIONAL CONFERENCE ON MOBILE ADHOC AND SENSOR SYSTEMS (MASS 2009), 2009, : 891 - 896
  • [33] Optimal Constrained Candidate Selection for Opportunistic Routing
    Cacciapuoti, Angela Sara
    Caleffi, Marcello
    Paura, Luigi
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [34] TCP adaptation with network coding and opportunistic data forwarding in multi-hop wireless networks
    Zhang, Chen
    Chen, Yuanzhu
    Li, Cheng
    PEERJ COMPUTER SCIENCE, 2016,
  • [35] Opportunistic Routing towards Mobile Sink Nodes in Bluetooth Mesh Networks
    Paulon, Marcelo J., V
    Olivieri de Souza, Bruno Jose
    Endler, Markus
    PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE SYSTEMS (WINSYS), 2021, : 67 - 75
  • [36] The Communication GSC System with Energy Harvesting Nodes aided by Opportunistic Routing
    Liu, Hanyu
    Teng, Lei
    An, Wannian
    Qin, Xiaoqi
    Dong, Chen
    Xu, Xiaodong
    2024 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, WCNC 2024, 2024,
  • [37] Modeling and comparison of candidate selection algorithms in opportunistic routing
    Darehshoorzadeh, Amir
    Cerda-Alabern, Llorenc
    Pla, Vicent
    COMPUTER NETWORKS, 2011, 55 (13) : 2886 - 2898
  • [38] Markovian model analysis for energy harvesting nodes in a modified opportunistic routing protocol
    Singh, Debabrata
    Pattanayak, Binod Kumar
    INTERNATIONAL JOURNAL OF ELECTRONICS, 2020, 107 (12) : 1963 - 1984
  • [39] Opportunistic Routing Aided Cooperative Communication MRC Network With Energy-Harvesting Nodes
    Teng, Lei
    An, Wannian
    Dong, Chen
    Xu, Xiaodong
    Han, Boxiao
    IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY, 2023, 4 : 1091 - 1110
  • [40] Candidate selection algorithms in opportunistic routing based on distance progress
    Darehshoorzadeh, Amir
    Cerda-Alabern, Llorenc
    Pla, Vicent
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2015, 20 (03) : 137 - 147