The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2010 vol.9)
pp: 596-608
Jilin Le , The Chinese University of Hong Kong, Hong Kong
John C.S. Lui , The Chinese University of Hong Kong, Hong Kong
Dah-Ming Chiu , The Chinese University of Hong Kong, Hong Kong
Recently, there has been a growing interest of using network coding to improve the performance of wireless networks, for example, authors of [1] proposed the practical wireless network coding system called COPE, which demonstrated the throughput gain achieved by network coding. However, COPE has two fundamental limitations: 1) the coding opportunity is crucially dependent on the established routes and 2) the coding structure in COPE is limited within a two-hop region only. The aim of this paper is to overcome these limitations. In particular, we propose DCAR, the Distributed Coding-Aware Routing mechanism which enables: 1) the discovery for available paths between a given source and destination and 2) the detection for potential network coding opportunities over much wider network region. One interesting result is that DCAR has the capability to discover high throughput paths with coding opportunities, while conventional wireless network routing protocols fail to do so. In addition, DCAR can detect coding opportunities on the entire path, thus eliminating the “two-hop” coding limitation in COPE. We also propose a novel routing metric called Coding-aware Routing Metric (CRM) which facilitates the performance comparison between “coding-possible” and "coding-impossible” paths. We implement the DCAR system in ns-2 and carry out extensive evaluation. We show that when comparing to the coding mechanism in [1], DCAR can achieve much higher throughput gain.
Network coding, wireless networks, routing.
Jilin Le, John C.S. Lui, Dah-Ming Chiu, "DCAR: Distributed Coding-Aware Routing in Wireless Networks", IEEE Transactions on Mobile Computing, vol.9, no. 4, pp. 596-608, April 2010, doi:10.1109/TMC.2009.160
[1] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, "XORs in the Air: Practical Wireless Network Coding," Proc. ACM SIGCOMM, pp. 243-254, 2006.
[2] D. Couto, D. Aguayo, J. Bicket, and R. Morris, "A High-Throughput Path Metric for Multi-Hop Wireless Routing," Wireless Networks, vol. 11, no. 4, pp. 419-434, 2005.
[3] R. Draves, J. Padhye, and B. Zill, "Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks," Proc. ACM MobiCom, pp. 114-128, 2004.
[4] Y. Yang, J. Wang, and R. Kravets, "Designing Routing Metrics for Mesh Networks," Proc. IEEE Workshop Wireless Mesh Networks (WiMesh), 2005.
[5] Y. Yang and R. Kravets, "Contention-Aware Admission Control for Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 4, no. 1, pp. 363-377, July/Aug. 2005.
[6] T. Salonidis, M. Garetto, A. Saha, and E. Knightly, "Identifying High Throughput Paths in 802.11 Mesh Networks: A Model-Based Approach," Proc. IEEE Int'l Conf. Network Protocols (ICNP), pp. 21-30, 2007.
[7] R. Ahlswede, N. Cai, S. Li, and R. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[8] B. Ni, N. Santhapuri, Z. Zhong, and S. Nelakuditi, "Routing with Opportunistically Coded Exchanges in Wireless Mesh Networks," Proc. Poster Session Conf. Sensor, Mesh, and Ad Hoc Comm. and Networks (SECON), 2006.
[9] S. Sengupta, S. Rayanchu, and S. Banerjee, "An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing," Proc. IEEE INFOCOM, pp. 1028-1036, 2007.
[10] R.M. Karp, "Reducibility among Combinatorial Problems," Complexity of Computer Computations, pp. 85-103, Plenum, 1972.
[11] P. Chaporkar and A. Proutiere, "Adaptive Network Coding and Scheduling for Maximizing Throughput in Wireless Networks," Proc. ACM MobiCom, pp. 135-146, 2007.
[12] J. Le, J. Lui, and D. Chiu, "How Many Packets Can We Encode?—An Analysis of Practical Wireless Network Coding," Proc. IEEE INFOCOM, pp. 371-379, 2008.
[13] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading Structure for Randomness in Wireless Opportunistic Routing," Proc. SIGCOMM, pp. 169-180, 2007.
[14] T. Ho, R. Koetter, M. Médard, D.R. Karger, and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting," Proc. IEEE Int'l Symp. Information Theory (ISIT), 2003.
[15] P.A. Chou, Y. Wu, and K. Jain, "Practical Network Coding," Proc. Allerton Conf. Comm., Control, and Computing (Allerton), 2003.
[16] D. Johnson, D. Maltz, and J. Broch, "DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks," Ad Hoc Networking, chapter 5, pp. 139-172, Addison-Wesley, 2001.
[17] D. Johnson, Y. Hu, and D. Maltz, "The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4," IETF RFC 4728,, 2009.
[18] C. Perkins, E. Belding-Royer, and S. Das, "Ad Hoc On-Demand Distance Vector (AODV) Routing," IETF RFC 356, http://www.faqs. org/rfcsrfc3561.html, 2009.
[19] S. Das, C. Perkins, and E. Royer, "Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks," Proc. IEEE INFOCOM, 2000.
[20] D.D. Clark, "The Design Philosophy of the DARPA Internet Protocols," Proc. ACM SIGCOMM, pp. 106-114, 1988.
[21] "The Network Simulator, NS-2,", 2009.
[22] "Bryan's NS-2 DSR FAQ," http://www.geocities.comb_j_ hogan, 2009.
[23] J. Liu, D. Goeckel, and D. Towsley, "Bounds on the Gain of Network Coding and Broadcasting in Wireless Networks," Proc. IEEE INFOCOM, pp. 1658-1666, 2007.
[24] S. Xu and T. Saadawi, "Does the IEEE 802.11 MAC Protocol Work Well in Multihop Wireless Ad Hoc Networks?" IEEE Comm. Magazine, vol. 39, no. 6, pp. 130-137, June 2001.
[25] Q. Li, D.M. Chiu, and J. Lui, "On the Practical and Security Issues of Batch Content Distribution via Network Coding," Proc. Int'l Conf. Network Protocols (ICNP), pp. 158-167, 2006.
435 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool