Utility-based opportunistic routing in multi-hop wireless networks

Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008

Volumn , Issue , 2008, Pages 470-477

  Wu, Jie ^a   Lu, Mingming ^a   Li, Feng ^a  

^a Florida Atlantic Univ   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PACKETS; DISTRIBUTED COMPUTING SYSTEMS; DISTRIBUTED IMPLEMENTATIONS; EXHAUSTIVE SEARCHING; HEURISTIC SOLUTIONS; INTERNATIONAL CONFERENCES; LINK RELIABILITY; MULTI-HOP WIRELESS NETWORKS; OPTIMAL SCHEME; OPTIMALITY; OPTIMALITY ANALYSIS; PACKET DELIVERY; PACKET DELIVERY RATIO; RETRANSMISSION;

COMPUTER SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; PHOTOELECTRIC RELAYS; SOLUTIONS; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

OPERATING ROOMS;

EID: 51849154969     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2008.90     Document Type: Conference Paper

References (17)

1. C. Perkins. Ad Hoc On Demand Distance Vector (AODV) Routing IETF, Internet Draft, draft-ietf-manet-aodv-00.txt, November 1997.
2. D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad hoc Wireless Networks. Mobile Computing, 1994.
3. D. Aguayo, J. Bicket, S. Biswas, G. Judd, and R. Morris. Link-level measurements from an 802.11b mesh network. In Proceedings of ACM SIGCOMM, 2004, 2004.
4. S. Biswas and R. Morris. ExOR: Opportunistic multi-hop routing for wireless networks. In Proceedigs of ACM SIGCOMM'05, pages 133-144, 2005.
5. S. Chachulski, M. Jennings, Sachin K., and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In Proceedings of ACM SIGCOMM'07, 2007.
6. T. Cui, L. Chen, T. Ho, and S. Low. Opportunistic source coding for data gathering in wireless sensor networks. In Proceedings of the 4th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS'07), 2007.
7. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Least-Cost Opportunistic Routing. In Proceedings of 2007 Allerton Conference on Communication, Control, and Computing.
8. H. Füßler, J. Widmer, M. Käsemann, M. Mauve, and H. Hartenstein. Contention-based forwarding for mobile ad hoc networks. Elsevier's Ad Hoc Networks, 1(4):351-369, 2003.
9. B. Li, Y. Xuc, and K. Nahrstedt. Price-based resource allocation in wireless ad hoc networks. Technical report, UIUCDCS-R-2003-2331, Univ. of Illinios at Urbana-Champaign, 2003.
10. M. Lu and J. Wu. Social welfare based routing in ad hoc networks. In Proceedings of the 35th International Conference on Parallel Processing (ICPP'06), pages 211-218, 2006.
11. Y. Qiu and P. Marbach. Bandwidth allocation in wireless ad hoc networks: A price-based approach. In Proceedings of IEEE INFOCOM'03, 2003.
12. R. C. Shah, A. Bonivento, D. Petrovic, E. Lin, J. van Greunen, and J. Rabaey. Joint optimization of a protocol stack for sensor networks. In Proceedings of IEEE Military Communications Conference, 2004 (MILC0M'04), pages 480-486, 2004.
13. R. C. Shah, S. Wietholter, A. Wolisz, and J. M. Rabaey. When does opportunistic routing make sense? In Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'05), 2005.
14. B. Sklar. Digital Communications, 2nd ed. Prentice-Hall, Inc., 2001.
15. Y. Wang, M. Martonosi, and L. Peh. A new scheme on link quality prediction and its applications to metric-based routing. In Proceedings of ACM SENSYS'05, pages 288-289, New York, NY, USA, 2005.
16. S. Zhong, L. Li, Y. G. Liu, and Y. Yang. On designing incentive compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques. In Proceedings of ACM MOBICOM'05, pages 117-131, 2005.
17. M. Zorzi and R. Rao. Geographic random forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance. IEEE Transaction on Mobile Computing, 2(4), 2003.