Llorenç Cerdà-Alabern
ABSTRACT
In this paper we propose a discrete time Markov model to assess the improvement that may be achieved using opportunistic routing. We show that our model can be used to compute the probability distribution and moments of the number of transmissions needed to send a packet from the source to the destination in a variety of scenarios. We use our model to compute some opportunistic routing performance measures in a network with a shadowing radio propagation model with different network topologies, and varying the maximum number of candidates used by the opportunistic routing algorithm. Our model can be easily extended to evaluate other aspects of opportunistic routing not covered in this paper. Therefore, we believe that our model yields a simple, yet flexible and powerful tool to evaluate opportunistic routing protocols.
- MIT roofnet. http://pdos.csail.mit.edu/roofnet.Google Scholar
- The Network Simulator ns-2.Google Scholar
- F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler. On the performance of time-space opportunistic routing in multihop mobile ad hoc networks. In WiOpt, pages 307--316, Apr. 2008.Google ScholarCross Ref
- S. Biswas and R. Morris. Opportunistic routing in multi-hop wireless networks. SIGCOMM Comput. Commun. Rev., 34(1):69--74, 2004. Google ScholarDigital Library
- S. Biswas and R. Morris. ExOR: opportunistic multi-hop routing for wireless networks. SIGCOMM Comput. Commun. Rev., 35(4):133--144, 2005. Google ScholarDigital Library
- R. Bruno and M. Nurchis. Survey on Diversity Based Routing in Wireless Mesh Networks: Challenges and Solutions. Computer Communications, 33(3):269--282, 2010. Google ScholarDigital Library
- S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In SIGCOMM, pages 169--180, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- G. Csárdi and T. Nepusz. The igraph software package for complex network research. InterJournal, Complex Systems:1695, 2006.Google Scholar
- D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. Wireless Networks, 11(4):419--434, 2005. Google ScholarDigital Library
- H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Valuable detours: Least-cost anypath routing. submitted, http://icapeople.epfl.ch/grossglauser/publications.html, Mar. 2009.Google Scholar
- M. Kurth, A. Zubow, and J.-P. Redlich. Cooperative opportunistic routing using transmit diversity in wireless mesh networks. In IEEE INFOCOM, pages 1310--1318, 2008.Google ScholarCross Ref
- Y. Li, Y. an Liu, and P. Luo. Link probability based opportunistic routing metric in wireless network. In Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on, volume 2, pages 308--312, 2009. Google ScholarDigital Library
- H. Liu, B. Zhang, H. Mouftah, X. Shen, and J. Ma. Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. IEEE Communications Magazine, 47(12):103--109, dec 2009. Google ScholarDigital Library
- C.-P. Luk, W.-C. Lau, and O.-C. Yue. An analysis of opportunistic routing in wireless mesh network. In Communications, 2008. ICC '08. IEEE International Conference on, pages 2877--2883, May 2008.Google ScholarCross Ref
- M. F. Neuts. Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach. Dover Publications Inc., 1981.Google Scholar
- R Development Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, 2008. ISBN 3-900051-07-0.Google Scholar
- Z. Zhong and S. Nelakuditi. On the efficacy of opportunistic routing. In SECON '07, pages 441--450, June 2007.Google ScholarCross Ref
- Z. Zhong, J. Wang, S. Nelakuditi, and G.-H. Lu. On selection of candidates for opportunistic anypath forwarding. SIGMOBILE Mob. Comput. Commun. Rev., 10(4):1--2, 2006. Google ScholarDigital Library
Index Terms
- On the performance modeling of opportunistic routing
Recommendations
Opportunistic Routing in Presence of Selfish Nodes for MANET
Opportunistic Routing protocols use broadcast nature of wireless communication to improve packet delivery from source to destination in mobile ad hoc network (MANET). In traditional routing protocols for MANET, each node uses the best neighbor for ...
An Opportunistic Network Coding Routing for Opportunistic Networks
In opportunistic networks (OppNets), instead of assuming a complete path, messages are exchanged opportunistically when two nodes encounter. To support efficient and reliable end-to-end messaging in OppNets, a number of routing protocols based on ...
Performance evaluation of opportunistic routing protocols: a framework-based approach using OMNeT++
LANC '12: Proceedings of the 7th Latin American Networking ConferenceOpportunistic 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 ...
Comments