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 条
  • [21] Opportunistic routing for multi-flow in wireless mesh networks
    College of Information Science and Engineering, Hunan University, Changsha, Hunan 410082, China
    Tien Tzu Hsueh Pao, 5 (1004-1008):
  • [22] Multicast delivery using opportunistic routing in wireless mesh networks
    Darehshoorzadeh, Amir
    Cerda-Alabern, Llorenc
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2014, 17 (04) : 216 - 233
  • [23] Distance Progress Based Opportunistic Routing for Wireless Mesh Networks
    Darehshoorzadeh, Amir
    Cerda-Alabern, Llorenc
    2012 8TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), 2012, : 179 - 184
  • [24] Opportunistic Routing in LoRa-based Wireless Mesh Networks
    Rosier, Sascha
    Zubow, Anatolij
    Dressler, Falko
    2023 IEEE 24TH INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS, WOWMOM, 2023, : 364 - 369
  • [25] Opportunistic routing for multiple multicast flows in wireless mesh networks
    He, S.-M. (smhe@hnu.edu.cn), 1600, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (07):
  • [26] Opportunistic Routing with Adaptive CSMA/CA in Wireless Mesh Networks
    Kurth, Mathias
    Redlich, Jens-Peter
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [27] An optimization framework for opportunistic multipath routing in wireless mesh networks
    Radunovic, Bozidar
    Gkantsidis, Christos
    Key, Peter
    Rodriguez, Pablo
    27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), VOLS 1-5, 2008, : 241 - 245
  • [28] A throughput efficiency oriented opportunistic routing in wireless Mesh networks
    Zhao, Chuan-Qiang
    Liu, Yuan-An
    Liu, Kai-Ming
    Tang, Bi-Hua
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2011, 34 (02): : 81 - 84
  • [29] A Hybrid Routing Protocol for Hierarchy Wireless Mesh Networks
    Zhao, Liqiang
    Yu, Zhi
    Niu, Jingwen
    Zhang, Hailin
    Ding, Wei
    2010 6TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS NETWORKING AND MOBILE COMPUTING (WICOM), 2010,
  • [30] Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
    Cheng, Bow-Nan
    Yuksel, Murat
    Kalyanaraman, Shivkumar
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2009, 17 (02) : 542 - 555