On the performance modeling of opportunistic routing

2nd International Workshop on Mobile Opportunistic Networking, MobiOpp 2010

Volumn , Issue , 2010, Pages 15-21

  Cerdà Alabern, Llorenç ^a   Pla, Vicent ^b   Darehshoorzadeh, Amir ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

C.2.1 computer communication networks : architecture and design wireless communication; C.2.2 computer communication networks : network protocols routing protocols; Performance

Indexed keywords

COMPUTER COMMUNICATION NETWORKS; PERFORMANCE; WIRELESS COMMUNICATIONS;

AD HOC NETWORKS; COMMUNICATION; COMPUTER ARCHITECTURE; ELECTRIC NETWORK TOPOLOGY; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; RADIO WAVES; ROUTING PROTOCOLS; WIRELESS TELECOMMUNICATION SYSTEMS;

NETWORK ARCHITECTURE;

EID: 77952943054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1755743.1755747     Document Type: Conference Paper

References (18)

1. MIT roofnet. http://pdos.csail.mit.edu/roofnet.
2. The Network Simulator ns-2.
3. 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.
4. S. Biswas and R. Morris. Opportunistic routing in multi-hop wireless networks. SIGCOMM Comput. Commun. Rev., 34(1):69-74, 2004.
5. S. Biswas and R. Morris. ExOR: opportunistic multi-hop routing for wireless networks. SIGCOMM Comput. Commun. Rev., 35(4):133-144, 2005.
6. R. Bruno and M. Nurchis. Survey on Diversity Based Routing in Wireless Mesh Networks: Challenges and Solutions. Computer Communications, 33(3):269-282, 2010.
7. 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.
8. G. Csárdi and T. Nepusz. The igraph software package for complex network research. InterJournal, Complex Systems:1695, 2006.
9. 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. (Pubitemid 41067729)
10. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Valuable detours: Least-cost anypath routing. submitted, http: // icapeople. epfl. ch/grossglauser/publications. html , Mar. 2009.
11. 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.
12. 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.
13. 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.
14. 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.
15. M. F. Neuts. Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach. Dover Publications Inc., 1981.
16. 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.
17. Z. Zhong and S. Nelakuditi. On the efficacy of opportunistic routing. In SECON '07, pages 441-450, June 2007.
18. 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.