Abstract
Recent researches show that inter-session network coding could decrease the number of packets transmission and achieve higher throughput in wireless network compared with traditional forwarding mechanism. In most existing relay mechanisms based on inter-session network such as COPE, relay node demands to collect the messages from its neighbor nodes to get notice of which packets already overheard by them so as to determine whether there exists coding opportunity between or among forwarding packets. However, transmission overhead of this message collection and computing cost of opportunity determination will degrade the performance of these mechanisms. It is observed that coding opportunity at relay node is much more related with the local topology, and the opportunity of encoding three or more packets together is far less than that of encoding two packets together in wireless network with general density. Based on this, a new coding-aware routing mechanism, named TCAR, is proposed. TCAR ignores the opportunity of encoding three or more than three packets together. Each relay node maintains an encoding mapping table being established according to the result of its local topology detection, which can be used to calculate the path cost during routing setup phase, and determine that which two packets can be encoded together during the packets forwarding phase. In TCAR, instead of periodic messages collection, each relay nodes just need once local topology detection, and the encoding determination is much simpler than that of the former mechanisms. Simulation results show that compared with typical inter-session network coding mechanisms COPE and COPE-based routing, TCAR achieves 12% and 7% throughput gains, and keeps the minimum end to end delay.
Similar content being viewed by others
References
AHLSWEDE R, CAI Ning, LI Shuo-yen. Network information flow [J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204–1216.
RAYANCHU S, SEN S, WU Jian-ming, BANERJEE S SENGUPTA S. Loss-aware network coding for unicast wireless sessions: design, implementation, and performance evaluation [J] ACM SIGMETRICS Performance Evaluation Review, 2008, 36(1): 85–96.
XIA Yin, ZHANG Ti-yuan, HUANG Jia-qing. New algorithm for variable-rate linear broadcast network coding [J]. Journal of Central South University of Technology, 2011, 18(4): 1193–1199
LUO Wei-zhong, WANG Jian-xin, GUO Jiong, CHEN Jian-er. Parameterized complexity of max-lifetime target coverage in wireless sensor networks [J]. Theoretical Computer Science, 2014, 518(1): 32–41.
KATTI S, RAHUL H, HU Wen-jun, KATABI D, MEDARD M. XORs in the air: Practical wireless network coding [J]. IEEE/ACM Transactions on Networking (TON), 2008, 16(3): 497–51.
SENGUPTA S, RAYANCHU S, BANERJEE S. An analysis of wireless network coding for unicast sessions: The case for coding-aware routing [C]// INFOCOM 2007. New York: Institute of Electrical and Electronics Engineers (IEEE), 2007: 1028–1036.
WU Yun-nan, DAS S M, CHANDRA R. Routing with a Markovian metric to promote local mixing [C]// INFOCOM 2007. New York: IEEE, 2007: 2381–2385.
YAN Yan, ZHANG Bao-xin, ZHENG Jun, MA Jian. Core: A coding-aware opportunistic routing mechanism for wireless mesh networks [J]. Wireless Communications, IEEE, 2010, 17(3): 96–103.
ZHANG Jin, ZHANG Qian. Cooperative network coding-aware routing for multi-rate wireless networks [C]// INFOCOM 2009, New York: IEEE, 2009: 181–189.
LE Ji-lin, LUI J C S, CHIU D M. DCAR: Distributed coding-aware routing in wireless networks [J]. IEEE Transactions on Mobile Computing, 2010, 9(4): 596–608.
PENG Yong-xiang, YANG Ya-ling, LU Xian-liang, DING Xu-yang. Practical network coding-aware routing protocol for multi-hop wireless networks [J]. High Technology Letters. 2011, 17(4): 395–400.
JHANG Ming-fong, LIN Sheng-wei, LIAO Wan-jun. C 2AR: Coding and capacity aware routing for wireless ad hoc networks [C]// Proceeding of IEEE International Conference on Communication, New York: IEEE, 2010: 1–5
WEI Xin, ZHAO Li, XI Ji. WANG Qing-yun. Network coding aware routing protocol for lossy wireless networks [C]// 5th International Conference on Wireless Communications, Networking and Mobile Computing, New York: IEEE, 2009: 1–4.
FAN Kai, LI Ling-xiong, LONG Dong-yang. Study of on-demand cope-aware routing protocol in wireless mesh networks [J]. Journal on Communications, 2009, 30(1): 128–34.
ZHAO F, MEDARD M. On analyzing and improving COPE performance [C]// Information Theory and Applications Workshop (ITA), New York: IEEE, 2010: 1–6.
SENGUPTA S, RAYANCHU S, BANERJEE S. Network coding-aware routing in wireless networks [J]. IEEE/ACM Transactions on Networking, 2010, 18(4): 1158–1170.
AZHAR I M, DAI Bin, HUANG Ben-xiong, HASSANA A, YU Shui. Survey of network coding-aware routing protocols in wireless networks [J]. Journal of Network and Computer Applications, 2011 34(6): 1956–1970.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Projects(61173169, 61106036) supported by the National Natural Science Foundation of China; Project(NCET-10-0798) Program for New Century Excellent Talents in University, China
Rights and permissions
About this article
Cite this article
Wang, Wp., Wu, W., Guan, Qj. et al. TCAR: A new network coding-aware routing mechanism based on local topology detection. J. Cent. South Univ. 21, 3178–3185 (2014). https://doi.org/10.1007/s11771-014-2289-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11771-014-2289-5