On the number of candidates in opportunistic routing for multi-hop wireless networks

MobiWac 2013 - Proceedings of the 11th ACM International Symposium on Mobility Management and Wireless Access, Co-located with ACM MSWiM 2013

Volumn , Issue , 2013, Pages 9-16

  Darehshoorzadeh, Amir ^a   Almulla, Mohammed ^a   Boukerche, Azzedine ^a   Chaiwala, Sonny ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

candidate selection; maximum number of candidates; opportunistic routing; wireless networks

Indexed keywords

CANDIDATE SELECTION; MAXIMUM NUMBER OF CANDIDATES; MULTIHOP WIRELESS NETWORK; NUMBER OF TRANSMISSIONS; OPPORTUNISTIC ROUTING; SIGNALING OVERHEADS; TRADITIONAL APPROACHES; WIRELESS MEDIUM;

WIRELESS NETWORKS;

EID: 84889638475     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2508222.2508224     Document Type: Conference Paper

References (17)

1. The Network Simulator ns-2.
2. S. Biswas and R. Morris. Opportunistic routing in multi-hop wireless networks. ACM SIGCOMM Computer Communication Review, 34(1):69-74, 2004.
3. A. Boukerche. Algorithms and Protocols for Wireless, Mobile Ad Hoc Networks. Wiley-IEEE Press, 2008.
4. A. Boukerche and L. Bononi. Simulation and Modeling of Wireless, Mobile, and AD HOC Networks.John Wiley Sons, Inc., pages 373-409. 2005.
5. A. Boukerche, B. Turgut, N. Aydin, M. Z. Ahmad, L. Bölöni, and D. Turgut. Routing protocols in ad hoc networks: A survey. Computer Networks, 55(13):3032-3080, 2011.
6. A. Cacciapuoti, M. Caleffi, and L. Paura. Optimal constrained candidate selection for opportunistic routing. In IEEE GLOBECOM, pages 1-5, Dec. 2010.
7. L. Cerdà-Alabern, V. Pla, and A. Darehshoorzadeh. On the performance modeling of opportunistic routing. In MobiOpp '10: Proceedings of the Second International Workshop on Mobile Opportunistic Networking, pages 15-21, New York, NY, USA, 2010. ACM.
8. A. Darehshoorzadeh and L. Cerdà-Alabern. Candidate selection algorithms in opportunistic routing. In PM2HW2N '10: Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks, pages 48-54, New York, NY, USA, 2010. ACM.
9. A. Darehshoorzadeh and L. Cerdà-Alabern. Distance progress based opportunistic routing for wireless mesh networks. In International Wireless Communications & Mobile Computing Conference, pages 179-184. IEEE, 2012.
10. A. Darehshoorzadeh, L. Cerdà-Alabern, and V. Pla. Modeling and comparison of candidate selection algorithms in opportunistic routing. Computer Networks, 55(13):2886- 2898, 2011.
11. 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.
12. H. Dubois-Ferriére, M. Grossglauser, and M. Vetterli. Valuable detours: Least-cost anypath routing. Networking, IEEE/ACM Transactions on, 19(2):333-346, april 2011.
13. R. Laufer, P. Velloso, L. Vieira, and L. Kleinrock. Plasma: A new routing paradigm for wireless multihop networks. In INFOCOM, 2012 Proceedings IEEE, pages 2706-2710, march 2012.
14. Y. Li, W. Chen, and Z.-L. Zhang. Optimal forwarder list selection in opportunistic routing. In Mobile Adhoc and Sensor Systems. MASS '09. IEEE 6th International Conference on, pages 670-675, oct. 2009.
15. E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu. Soar: Simple opportunistic adaptive routing protocol for wireless mesh networks. Mobile Computing, IEEE Transactions on, 8(12):1622-1635, Dec. 2009.
16. R. D. C. 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, 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.