Candidate selection algorithms in opportunistic routing

PM2HW2N 2010 - Proceedings of the 5th ACM International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks, co-located with MSWiM 2010

Volumn , Issue , 2010, Pages 48-54

  Darehshoorzadeh, Amir ^a   Cerdà Alabern, Llorenç ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Candidate Selection; Opportunistic Routing; Performance; Wireless.

Indexed keywords

COMPUTER NETWORKS; INFORMATION SYSTEMS; MEASUREMENTS; RADIO;

CANDIDATE SELECTION; CANDIDATE SETS; DYNAMIC NETWORK; MULTIHOP WIRELESS NETWORK; OPPORTUNISTIC ROUTING; OPTIMAL ALGORITHM; PERFORMANCE; PERFORMANCE GAIN;

ROUTING ALGORITHMS;

EID: 84977798262     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1868612.1868621     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. ACM SIGCOMM Computer Communication Review, 34(1):69-74, 2004.
5. S. Biswas and R. Morris. ExOR: opportunistic multi-hop routing for wireless networks. ACM SIGCOMM Computer Communication Review, 35(4):133-144, 2005.
6. L. Cerda-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.
7. L. Cerda-Alabern, V. Pla, and A. Darehshoorzadeh. On the maximum performance in opportunistic routing. In IEEE WoWMoM 2010, Montreal, Canada.
8. 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.
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.
10. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Least-cost opportunistic routing. In Proceedings of 2007 Allerton Conference on Communication, Control, and Computing, 2007.
11. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Valuable detours: Least-cost anypath routing. submitted, http: //icapeople. epfl. ch/grossglauser/publications. html , Mar. 2009.
12. D. Fuste-Vilella, J. Garcia-Vidal, and J. Morillo-Pozo. Cooperative forwarding in ieee 802.11-based manets. In Wireless Days, 2008. WD '08. 1st IFIP, pages 1-5, nov. 2008.
13. P. Larsson. Selection diversity forwarding in a multihop packet radio network with fading channel and capture. SIGMOBILE Mob. Comput. Commun. Rev., 5(4):47-54, 2001.
14. Y. Li, Y. an Liu, and P. Luo. Link probability based opportunistic routing metric in wireless network. In Communications and Mobile Computing. CMC '09. WRI International Conference on, volume 2, pages 308-312, 2009.
15. 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.
16. J. Wu, M. Lu, and F. Li. Utility-based opportunistic routing in multi-hop wireless networks. In Distributed Computing Systems. ICDCS'08. The 28th International Conference on, pages 470-477, 2008.
17. Z. Zhong and S. Nelakuditi. On the eficacy 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.