Abstract
This paper considers the correlated data routing problem in a wireless sensor network (WSN) and proposes an entropy coding based hybrid routing algorithm to solve the problem. The proposed hybrid routing algorithm takes into account both the correlation structure of the data between different sensor nodes and the path-cost of a node, and combines an entropy coding based routing algorithm and the shortest-path-tree (SPT) routing algorithm. Specifically, for a node that is away from the sink, it employs the entropy coding based algorithm to determine the next-hop node, while for a node close to the sink it employs the SPT routing algorithm to determine the next-hop node. Simulation results show that the proposed hybrid routing algorithm can significantly improve the overall transmission cost and the total amount of data transmitted in the network as compared with the SPT routing algorithm.
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.
