Optimal forwarder list selection in opportunistic routing

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09

Volumn , Issue , 2009, Pages 670-675

  Li, Yanhua ^a   Chen, Wei ^b   Zhang, Zhi Li ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Dynamic programming; Forwarder list; Opportunistic routing; Wireless routing

Indexed keywords

ENERGY CONSUMPTION; EXTENSIVE SIMULATIONS; GENERAL THEORY; KEY ISSUES; OPPORTUNISTIC ROUTING; OPTIMAL SOLUTIONS; PACKET FORWARDING; SELECTION PROBLEMS; SELECTION SCHEME; TRANSMISSION TIME; WIRELESS COMMUNICATIONS; WIRELESS ROUTING; WIRELESS ROUTING PROTOCOLS;

DYNAMIC PROGRAMMING; ELECTRIC LOAD FORECASTING; OPTIMIZATION; ROUTING PROTOCOLS; SENSORS; TRANSMISSIONS; WIRELESS NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 74249087696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MOBHOC.2009.5336939     Document Type: Conference Paper

References (16)

1. MIT roofnet. http://pdos.csail.mit.edu/roofnet/.
2. S. Banerjee and A. Misra. Minimum energy paths for reliable communication in multi-hop wireless networks. In Proceedings of Mobihoc, 2002.
3. S. Biswas and R. Morris. Exor: Opportunistic routing in multi-hop wireless networks. In Proceedings of ACM SIGCOMM, Philadelphia, Pennsylvania, August 2005.
4. S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In Proceedings of ACM SIGCOMM, 2007.
5. R. R. Choudhury and N. H. Vaidya. Mac-layer anycasting in ad hoc networks. SIGCOMM Comput. Commun. Rev., 34(1):75-80 , 2004.
6. H. Dubois-Ferriere, M.Grossglauser, and M. Vetterli. Least-cost opportunistic routing. In Allerton Conference on Communication. Control. and Computing, 2007.
7. K. Fall and K. Varadhan. The ns-Z Manual. The VINT Project, UC Berkeley, LBL, and Xerox PARC, 2003,.
8. D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, pages 153-181. Kluwer Academic Publishers, 1996.
9. S. Katti, D. Katabi, H. Balakrishnan, and M. Medard. Symbol-level network coding for wireless mesh networks. In Proceedings of ACM SIGCOMM, Seattle, WA, August 2008.
10. R. Laufer and L. Kleinrock. Multirate anypath routing in wireless mesh networks. Technical Report UCLA-CSD-TR080025, Computer Science Department, University of California at Los Angeles, 2008.
11. Y. Li, W. Chen, and Z.-L. Zhang. Design of forwarder list selection scheme in opportunistic routing protocol. Technical Report TR-08-033, CSE Department of University of Minnesota, 2008.
12. Y. Lin, B. Li, and B. Liang. Codeor: Opportunistic routing in wireless mesh networks with segmented network coding. In Proceedings of the sixteenth IEEE International Conference on Network Protocols, ICNP, 2008.
13. X. Liu, E. K. P. Chong, and N. B. Shroff. A framework for opportunistic scheduling in wireless networks. Comput. Netw., 41(4):451-474 , 2003.
14. C. Perkins and E. Royer. Ad hoc on demand distance vector routing, mobile computing systems and applications. In Proceedings of WMCSA, 1999.
15. X. Zhang and B. Li. Dice: a game theoretic framework for wireless multipath network coding. In Proceedings of ACM MobiHoc, 2008.
16. Z. Zhong and S. Nelakuditi. On the efficacy of opportunistic routing. In Proceedings of the 4th Annual IEEE Communications Society Conf erence on Sensor; Mesh and Ad Hoc Communications and Networks, SECON, June 2007.