Abstract
Network coding-aware routing has become an effective paradigm to improve network throughput and relieve network congestion. However, to detect coding opportunities and make routing decision for a data flow, most existing XOR coding-aware routing methods need to consume much overhead to collect overhearing information on its possible routing paths. In view of this, we propose low-overhead and dynamic Coding-Aware Routing via Tree-based Address (CARTA) for wireless sensor networks (WSNs). In CARTA, a Multi-Root Multi-Tree Topology (MRMTT) with a tree-based address allocation mechanism is firstly constructed to provide transmission paths for data flows. Then, a low-overhead coding condition judgment method is provided to detect real-time coding opportunities via tree address calculation in the MRMTT. Further, CARTA defines routing address adjustments caused by encoding and decoding to ensure the flows’ routing paths can be adjusted flexibly according to their real-time coding opportunities. It also makes additional constraints on congestion and hop count in the coding condition judgment to relieve network congestion and control the hop counts of routing paths. The simulation results verify that CARTA can utilize more coding opportunities with less overhead on coding, and this is ultimately beneficial for promoting network throughout and balancing energy consumption in WSNs.
Highlights
Network coding has attracted much interest in wireless network applications, because it can improve network throughput and relieve network congestion [1, 2]
Two important questions emerge: whether does there exist a low-overhead method to detect real-time XOR coding opportunities and how to flexibly adjust the routing paths of flows according to their real-time XOR coding opportunities? To solve these questions, we introduce the tree-based address allocation mechanism defined in the ZigBee standards [8] and combine it with the XOR network coding
We propose low-overhead and dynamic Coding-Aware Routing via Tree-based Address (CARTA) for wireless sensor networks (WSNs)
Summary
Network coding has attracted much interest in wireless network applications, because it can improve network throughput and relieve network congestion [1, 2]. (1) Firstly, a Multi-Root Multi-Tree Topology (MRMTT) is constructed, which uses the tree-based address allocation mechanism and is capable of providing transmission paths and coding opportunities for data flows (2) Secondly, a general coding condition is defined for both original flows and encoded flows, and a low-overhead coding condition judgment method is provided to detect real-time coding opportunities between flows via tree address calculation (3) Thirdly, a coding-aware routing algorithm is designed In this algorithm, routing address adjustments caused by encoding and decoding are defined to ensure flows’ routing paths can be adjusted flexibly, and additional constraints on congestion and hop count are defined in the coding condition judgment to relieve network congestion and control the hop counts of routing paths.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
