Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Routing with adaptive path and limited flooding for mobile ad hoc networks
Computers and Electrical Engineering
Opportunistic management of spontaneous and heterogeneous wireless mesh networks
IEEE Wireless Communications
Wireless Personal Communications: An International Journal
MaxOPP: A novel Opportunistic Routing for wireless mesh networks
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
Computers and Electrical Engineering
Adaptive opportunistic routing for wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Multi-path routing in Spatial Wireless Ad Hoc networks
Computers and Electrical Engineering
Joint scheduling and routing algorithm with load balancing in wireless mesh network
Computers and Electrical Engineering
Survey on diversity-based routing in wireless mesh networks: Challenges and solutions
Computer Communications
A survey on wireless mesh networks
IEEE Communications Magazine
| Hi-index | 0.00 |
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%.