Distance Progress Based Opportunistic Routing for wireless mesh networks

IWCMC 2012 - 8th International Wireless Communications and Mobile Computing Conference

Volumn , Issue , 2012, Pages 179-184

  Darehshoorzadeh, Amir ^a   Cerda Alabern, Llorenc ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Candidate selection; Opportunistic routing; Wireless mesh networks

Indexed keywords

CANDIDATE SELECTION; DELIVERY PROBABILITIES; EXPECTED DISTANCE; HOP BY HOP; MULTIHOP WIRELESS NETWORK; NEXT-HOP; OPPORTUNISTIC ROUTING; ORDERED SET; PRIORITIZATION;

MESH NETWORKING; MOBILE COMPUTING; WIRELESS MESH NETWORKS (WMN); WIRELESS TELECOMMUNICATION SYSTEMS;

ALGORITHMS;

EID: 84869168873     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWCMC.2012.6314199     Document Type: Conference Paper

References (19)

1. H. Liu, B. Zhang, H. Mouftah, X. Shen, and J. Ma, "Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions," Communications Magazine, IEEE, vol. 47, no. 12, pp. 103-109, dec. 2009.
2. S. Biswas and R. Morris, "Opportunistic routing in multi-hop wireless networks," ACM SIGCOMM Computer Communication Review, vol. 34, no. 1, pp. 69-74, 2004.
3. S. Yang, F. Zhong, C. K. Yeo, B. S. Lee, and J. Boleng, "Position based opportunistic routing for robust data delivery in manets," in Proceedings of the 28th IEEE conference on Global telecommunications, ser. GLOBECOM'09. Piscataway, NJ, USA: IEEE Press, 2009, pp. 1325-1330.
4. Z. Zhong, J. Wang, S. Nelakuditi, and G.-H. Lu, "On selection of candidates for opportunistic anypath forwarding," SIGMOBILE Mob. Comput. Commun. Rev., vol. 10, no. 4, pp. 1-2, 2006.
5. Y. Li, W. Chen, and Z.-L. Zhang, "Optimal forwarder list selection in opportunistic routing," in IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS 2009, 12-15 October 2009, Macau (S.A.R.), China, oct. 2009, pp. 670-675.
6. D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris, "A highthroughput path metric for multi-hop wireless routing," Wireless Networks, vol. 11, no. 4, pp. 419-434, 2005.
7. S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading structure for randomness in wireless opportunistic routing," in SIGCOMM. New York, NY, USA: ACM, 2007, pp. 169-180.
8. H. Dubois-Ferríere, M. Grossglauser, and M. Vetterli, "Valuable detours: Least-cost anypath routing," Networking, IEEE/ACM Transactions on, vol. 19, no. 2, pp. 333-346, april 2011.
9. 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. New York, NY, USA: ACM, 2010, pp. 48-54.
10. F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler, "On the performance of time-space opportunistic routing in multihop mobile ad hoc networks," in Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008. WiOPT 2008. Berlin, Germany, 6th International Symposium on, Apr. 2008, pp. 307-316.
11. M. Lu and J. Wu, "Opportunistic routing algebra and its applications," in INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 19-25 April 2009, Rio de Janeiro, Brazil, 2009, pp. 2374-2382.
12. A. Darehshoorzadeh, L. Cerdà-Alabern, and V. Pla, "Modeling and comparison of candidate selection algorithms in opportunistic routing," Computer Networks, vol. 55, no. 13, pp. 2886-2898, 2011.
13. Y. Li and Z.-L. Zhang, "Random walks on digraphs: A theoretical framework for estimating transmission costs in wireless routing," in 29th conference on Information communications (INFOCOM), San Diego, CA, U.S.A., march 2010, pp. 2775-2783.
14. L. Cerdà-Alabern, V. Pla, and A. Darehshoorzadeh, "On the maximum performance in opportunistic routing," in IEEE WoWMoM 2010, Montreal, Canada, 2010.
15. M. Zorzi and R. Rao, "Geographic random forwarding (geraf) for ad hoc and sensor networks: multihop performance," Mobile Computing, IEEE Transactions on, vol. 2, no. 4, pp. 337-348, Oct.-Dec. 2003.
16. K. Zeng, W. Lou, J. Yang, and D. R. Brown, III, "On throughput efficiency of geographic opportunistic routing in multihop wireless networks," Mob. Netw. Appl., vol. 12, pp. 347-357, December 2007.
17. B. Karp and H. T. Kung, "Gpsr: greedy perimeter stateless routing for wireless networks," in Proceedings of the 6th annual international conference on Mobile computing and networking, ser. MobiCom '00. New York, NY, USA: ACM, 2000, pp. 243-254.
18. 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.
19. "The Network Simulator ns-2." [Online] Available: http://www.isi.edu/nsnam/ns