Analysis and scheduling of practical network coding in OFDMA relay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure network coding for wireless mesh networks: Threats, challenges, and directions
Computer Communications
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Network coding aware routing protocol for lossy wireless networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
The benefits of network coding over a wireless backbone
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Mechanism for maximizing area-centric coding gains in wireless multihop networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A load-balanced route selection for network coding in wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
CORE: a coding-aware opportunistic routing mechanism for wireless mesh networks
IEEE Wireless Communications
Entropy attacks and countermeasures in wireless network coding
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
On the practicality of cryptographic defences against pollution attacks in wireless network coding
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The practical network coding system proposed in [1] has two fundamental limitations: 1) the coding opportunity is crucially dependent on the established routes; 2) the coding structure is limited within a two-hop region. To overcome these limitations, we propose DCAR, the first distributed coding-aware routing mechanism which combines (a) the discovery for available paths between a given source and destination, and (b) the detection for potential network coding opportunities. DCAR has the potential to find high throughput paths with coding opportunities while conventional routing fails to do so. In addition, DCAR can detect coding opportunities on the entire path, thus eliminating the "two-hop" coding limitation in [1]. We also propose a novel routing metric called "CRM" (Coding-aware Routing Metric) which facilitates the comparison between coding-possible and coding-impossible paths. We implement the DCAR system in NS-2 and conduct extensive evaluation, which shows that DCAR achieves 7\% to 20\% throughput gain over the coding system in [1].