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 条
  • [1] On selection of forwarding nodes for long opportunistic routes
    Sajad Malekyan
    Mozafar Bag-Mohammadi
    Marzieh Ghasemi
    Mostafa Abdollahi
    Wireless Networks, 2019, 25 : 1847 - 1854
  • [2] Nodes Density Adaptive Opportunistic Forwarding Protocol for Intermittently Connected Networks
    Lu, Xiaofeng
    Lio, Pietro
    Hui, Pan
    Qu, Zhaowei
    2014 INTERNATIONAL CONFERENCE ON IDENTIFICATION, INFORMATION AND KNOWLEDGE IN THE INTERNET OF THINGS (IIKI 2014), 2014, : 297 - 300
  • [3] PRIOR: Prioritized Forwarding for Opportunistic Routing
    Yamazaki, Taku
    Yamamoto, Ryo
    Miyoshi, Takumi
    Asaka, Takuya
    Tanaka, Yoshiaki
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2017, E100B (01) : 28 - 41
  • [4] Eliminating Duplicate Forwarding in Wireless Opportunistic Routing
    Myung, Jihoon
    Lee, Wonjun
    IEEE COMMUNICATIONS LETTERS, 2012, 16 (04) : 510 - 513
  • [5] An Opportunistic Routing with Improved Node Forwarding Mechanism
    Xu, Shufang
    Xu, Dazhuan
    Huang, Qian
    Wang, Huibin
    Ping, Ping
    Liu, Yang
    2015 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2015, : 1718 - 1722
  • [6] Forwarding Mechanism Using Prioritized Forwarders for Opportunistic Routing
    Yamazaki, Taku
    Yamamoto, Ryo
    Miyoshi, Takumi
    Asaka, Takuya
    Tanaka, Yoshiaki
    2016 18TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS), 2016,
  • [7] ORGMA: Reliable opportunistic routing with gradient forwarding for MANETs
    Kang, Daeho
    Kim, Hyung-Sin
    Joo, Changhee
    Bahk, Saewoong
    COMPUTER NETWORKS, 2018, 131 : 52 - 64
  • [8] OODC: An Opportunistic and On-Demand Forwarding Mechanism for LPWA Networks
    Tanjung, Dion
    Byeon, Seunggyu
    Kim, Dong Hyun
    Kim, Jong Deok
    2020 34TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2020), 2020, : 301 - 306
  • [9] Network coding via opportunistic forwarding in wireless mesh networks
    Zhang, Jian
    Chen, Yuanzhu Peter
    Marsic, Ivan
    WCNC 2008: IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-7, 2008, : 1775 - +
  • [10] Adaptively prioritizing candidate forwarding set in opportunistic routing in VANETs
    Naderi, Mohammad
    Ghanbari, Mohammad
    AD HOC NETWORKS, 2023, 140