Link-level measurements from an 802.11b mesh network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
When Does Opportunistic Routing Make Sense?
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
System Services for Ad-Hoc Routing: Architecture, Implementation and Experiences
Proceedings of the 1st international conference on Mobile systems, applications and services
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Symbol-level network coding for wireless mesh networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Implementation of MANET routing protocols on OMNeT++
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Opportunistic networking in OMNeT++
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
CORE: a coding-aware opportunistic routing mechanism for wireless mesh networks
IEEE Wireless Communications
A framework for opportunistic routing in multi-hop wireless networks
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Hi-index | 0.00 |
Opportunistic routing may achieve significant performance gain under lossy wireless links or in scenarios of mobile ad hoc networks, where end-to-end connectivity is not always available. Instead of deterministically choosing one node to forward a packet to, the network layer selects a set of candidate nodes and then only one of them will be chosen dynamically as the actual forwarder based on the instantaneous channel conditions and node availability at the moment of transmission. Many protocols have been proposed and most of them are studied in specific simulation environments or real-world testbeds, and no systematic analysis has been given about the integrative performance of different protocols. In our previous work, we have shown that different opportunistic routing protocols share many common functions and these general functions could be abstracted and decoupled into a framework of functional components, which might facilitate the development and evaluation of opportunistic routing protocols. In this paper, we extend our work and present initial evaluation results of the ExOR and MORE protocols using our simulation framework in OMNeT++. Our simulation results justify scenarios where opportunistic routing may perform better than traditional MANET routing.