Minimum cost opportunistic routing with intra-session network coding

2014 IEEE International Conference on Communications, ICC 2014

Volumn , Issue , 2014, Pages 502-507

  Cai, Shun ^a   Zhang, Sanfeng ^a   Wu, Guoxin ^a   Dong, Yongqiang ^b   Znati, Taieb ^b  

^a SOUTHEAST UNIVERSITY   (China)

^b University of Pittsburgh   (United States)

Author keywords

minimum cost routing; network coding; opportunisitc routing

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; COSTS; ROUTING PROTOCOLS;

COMMUNICATION PARADIGM; EXTENSIVE SIMULATIONS; MINIMUM COST ROUTING; OPPORTUNISITC ROUTING; OPPORTUNISTIC ROUTING; OPTIMAL SUBSTRUCTURES; THROUGHPUT IMPROVEMENT; WIRELESS MULTI-HOP NETWORK;

NETWORK CODING;

EID: 84906993105     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2014.6883368     Document Type: Conference Paper

References (14)

1. Aguayo, D., et al., Link-level measurements from an 802.11b mesh network. ACM SIGCOMM Computer Communication Review, 2004. 34(4): p. 121-132.
2. Biswas, S. and R. Morris, ExOR: Opportunistic multi-hop routing for wireless networks. ACM SIGCOMM Computer Communication Review, 2005. 35(4): p. 133-143.
3. Chachulski, S., et al., Trading structure for randomness in wireless opportunistic routing. ACM SIGCOMM Computer Communication Review, 2007. 37(4): p. 169-180.
4. Lin, Y., B. Li, and B. Liang. CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding. in IEEE International Conference on Network Protocols. 2008.
5. Koutsonikolas, D., W. Chih-Chun, and Y.C. Hu, Efficient networkcoding-based opportunistic routing through cumulative coded acknowledgments. IEEE/ACM Transactions on Networking, 2011. 19(5): p. 1368-1381.
6. Katti, S., et al., Symbol-level network coding for wireless mesh networks. SIGCOMM Comput. Commun. Rev., 2008. 38(4): p. 401-412.
7. Khreishah, A., I.M. Khalil, and J. Wu. Distributed network coding-based opportunistic routing for multicast. in ACM proc. MobiHoc. 2012. Hilton Head, South Carolina, USA: ACM.
8. Zeng, K., Z. Yang, and W. Lou, Location-aided opportunistic forwarding in multirate and multihop wireless networks. IEEE Transactions on Vehicular Technology, 2009. 58(6): p. 3032-3040.
9. Zhong, Z.F., et al., On selection of candidates for opportunistic anypath forwarding. SIGMOBILE Mob. Comput. Commun. Rev., 2006. 10(4): p. 1-2.
10. Dubois-Ferrière, H., et al., Valuable letours: Least-cost anypath routing. IEEE/ACM Transactions on Networking, 2011. 19(2): p. 333-346.
11. Lun, D.S., et al., Minimum-cost multicast over coded packet networks. IEEE/ACM Transactions on Networking, 2006. 14(SI): p. 2608-2623.
12. Cormen, T.H., et al., "Graph algorithms", in Introduction to Algorithms. 2009.
13. Lu, M.M., F. Li, and J. Wu, Efficient opportunistic routing in utilitybased ad hoc networks. IEEE Transactions on Reliability, 2009. 58(3): p. 485-495.
14. Laufer, R., H. Dubois-Ferriere, and L. Kleinrock, Polynomial-time algorithms for multirate anypath routing in wireless multihop networks. IEEE/ACM Transactions on Networking, 2012. 20(3): p. 742-755