Minimum cost opportunistic routing with intra-session network coding

作者: Shun Cai , Sanfeng Zhang , Guoxin Wu , Yongqiang Dong , Taieb Znati

DOI: 10.1109/ICC.2014.6883368

关键词: Link-state routing protocolLinear network codingHierarchical routingTriangular routingStatic routingOptimized Link State Routing ProtocolEnhanced Interior Gateway Routing ProtocolWireless Routing ProtocolDestination-Sequenced Distance Vector routingThroughputMultipath routingDynamic Source RoutingZone Routing ProtocolRouting protocolRouting tableComputer networkNetwork packetRouting domainComputer scienceEqual-cost multi-path routingRouting Information ProtocolPolicy-based routingHazy Sighted Link State Routing ProtocolGeographic routing

摘要: Opportunistic routing with intra-session network coding (NCOR) is a promising communication paradigm in wireless multi-hop networks lossy links. Unlike traditional protocols, which use single path to route traffic between node pairs, NCOR broadcasts data packets set of forwarding candidates. Each candidate combines the overheard generate linearly independent packets, are then forwarded destination. The focus this paper on fundamental problem how select forwarder (CFS) and allocate among forwarders achieve optimal routing. In current literature, CFS selection allocation have typically been addressed separately. paper, we take an integrated approach propose minimum cost model, MIC-NCOR, addresses two aspects jointly. Based substructure derive provable algorithm that can be implemented distributed fashion, compute both portion for each candidate. An extensive simulation study indicates MIC-NCOR accurately predicts quality routes. results also show achieves significant throughput improvement over existing schemes, especially low high density.

参考文章(13)
Abdallah Khreishah, Issa M Khalil, Jie Wu, None, Distributed network coding-based opportunistic routing for multicast Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing - MobiHoc '12. pp. 115- 124 ,(2012) , 10.1145/2248371.2248390
Zifei Zhong, Junling Wang, Srihari Nelakuditi, Guor-Huar Lu, On selection of candidates for opportunistic anypath forwarding Mobile Computing and Communications Review. ,vol. 10, pp. 1- 2 ,(2006) , 10.1145/1215976.1215978
A Corominas, R Pastor, Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH) Journal of the Operational Research Society. ,vol. 62, pp. 1704- 1710 ,(2011) , 10.1057/JORS.2010.131
Dimitrios Koutsonikolas, Chih-Chun Wang, Y. Charlie Hu, Efficient network-coding-based opportunistic routing through cumulative coded acknowledgments IEEE ACM Transactions on Networking. ,vol. 19, pp. 1368- 1381 ,(2011) , 10.1109/TNET.2011.2111382
Henri Dubois-Ferriere, Matthias Grossglauser, Martin Vetterli, Valuable detours: least-cost anypath routing IEEE ACM Transactions on Networking. ,vol. 19, pp. 333- 346 ,(2011) , 10.1109/TNET.2010.2070844
Kai Zeng, Zhenyu Yang, Wenjing Lou, Location-Aided Opportunistic Forwarding in Multirate and Multihop Wireless Networks IEEE Transactions on Vehicular Technology. ,vol. 58, pp. 3032- 3040 ,(2009) , 10.1109/TVT.2008.2011637
Yunfeng Lin, Baochun Li, Ben Liang, CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding international conference on network protocols. pp. 13- 22 ,(2008) , 10.1109/ICNP.2008.4697020
Sachin Katti, Dina Katabi, Hari Balakrishnan, Muriel Medard, Symbol-level network coding for wireless mesh networks ACM SIGCOMM Computer Communication Review. ,vol. 38, pp. 401- 412 ,(2008) , 10.1145/1402946.1403004
Mingming Lu, Feng Li, Jie Wu, Efficient Opportunistic Routing in Utility-Based Ad Hoc Networks IEEE Transactions on Reliability. ,vol. 58, pp. 485- 495 ,(2009) , 10.1109/TR.2009.2020100
R. Laufer, H. Dubois-Ferriere, L. Kleinrock, Polynomial-time algorithms for multirate anypath routing in wireless multihop networks IEEE ACM Transactions on Networking. ,vol. 20, pp. 742- 755 ,(2012) , 10.1109/TNET.2011.2165852