Coordinated opportunistic routing protocol for wireless mesh networks

被引:10
|
作者
Ajmal, Muhammad Mehran [1 ]
Madani, Sajjad A. [1 ]
Maqsood, Tahir [2 ]
Bilal, Kashif [3 ]
Nazir, Babar [2 ]
Hayat, Khizar [2 ]
机构
[1] COMSATS Inst Informat Technol, Abbottabad, Pakistan
[2] COMSATS Inst Informat Technol, Dept Comp Sci, Abbottabad, Pakistan
[3] N Dakota State Univ, Fargo, ND 58105 USA
关键词
D O I
10.1016/j.compeleceng.2013.06.012
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Opportunistic routing is an emerging research area in Wireless Mesh Networks (WMNs), that exploits the broadcast nature of wireless networks to find the optimal routing solution that maximizes throughput and minimizes packet loss. Opportunistic routing protocols mainly suffer from computational overheads, as most of the protocols try to find the best next forwarding node. In this paper we address the key issue of computational overhead by designing new routing technique without using pre-selected list of potential forwarders. We propose a novel opportunistic routing technique named, Coordinated Opportunistic Routing Protocol for WMNs (CORP-M). We compare CORP-M with well-known protocols, such as AODV, OLSR, and ROMER based on throughput, delivery ratio, and average end-to-end delay. Simulation results show that CORP-M, gives average throughput increase upto 32%, and increase in delivery ratio (from 10% to 20%). We also analyze the performance of CORP-M and ROMER based on various parameters, such as duplicate transmissions and network collisions, by analysis depicts that CORP-M reduces duplicate transmissions upto 70% and network collisions upto 30%. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2442 / 2453
页数:12
相关论文
共 50 条
  • [41] Load Distributed Routing Protocol for Wireless Mesh Networks
    Latiff, N. M. Abdul
    Ibrahim, I.
    Yusof, S. K. Syed
    Malik, N. N. Nik Abdul
    Arsat, R.
    Abdullah, A. S.
    2016 IEEE 3RD INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATION TECHNOLOGIES (ISTT), 2016, : 41 - 46
  • [42] Orthogonal rendezvous routing protocol for wireless mesh networks
    Cheng, Bow-Nan
    Yuksel, Murat
    Kalyanaraman, Shivkumar
    PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS, 2006, : 104 - +
  • [43] An opportunistic routing in wireless mesh network
    Han L.
    Qian H.-Y.
    Han, Li (hanli98@ahu.edu.cn), 1600, Inderscience Publishers (24): : 75 - 82
  • [44] QoS Oriented Opportunistic Routing protocol for Wireless Sensor Networks
    Lampin, Quentin
    Barthel, Dominique
    Auge-Blum, Isabelle
    Valois, Fabrice
    2012 IFIP WIRELESS DAYS (WD), 2012,
  • [45] A Dynamic and Reliable Mesh Routing Protocol for Wireless Mesh Networks (DRMRP)
    Omari, Ahmed H.
    Khrisat, Ala'a H.
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2009, 9 (04): : 16 - 21
  • [46] An Improved Opportunistic Routing Protocol for Underwater Wireless Sensor Networks
    Li, Pengfei
    Hu, Yifan
    Gai, Xiaobin
    2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 5702 - 5707
  • [47] Buffer occupancy and link state opportunistic routing for wireless mesh networks
    Bordier, Jean-Baptiste
    Merlhe, Christopher
    Fabian, Philippe
    Baey, Sebastien
    Garnaud, Dylan
    Bussereau, Keryann
    Livolant, Erwan
    Gueguen, Cedric
    WIRELESS NETWORKS, 2021, 27 (06) : 4133 - 4150
  • [48] Consort: Node-constrained Opportunistic Routing in Wireless Mesh Networks
    Fang, Xi
    Yang, Dejun
    Xue, Guoliang
    2011 PROCEEDINGS IEEE INFOCOM, 2011, : 1907 - 1915
  • [49] Cooperative Opportunistic Routing using Transmit Diversity in wireless mesh networks
    Kurth, Mathias
    Zubow, Anatolij
    Redlich, Jens-Peter
    27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), VOLS 1-5, 2008, : 1984 - 1992
  • [50] Buffer occupancy and link state opportunistic routing for wireless mesh networks
    Jean-Baptiste Bordier
    Christopher Merlhe
    Philippe Fabian
    Sébastien Baey
    Dylan Garnaud
    Keryann Bussereau
    Erwan Livolant
    Cédric Gueguen
    Wireless Networks, 2021, 27 : 4133 - 4150