Abstract
A convergecast is a popular routing in sensor networks. It periodically forwards collected data at every sensor node along a configured routing path to the outside of a sensor network via the base station (BS). To extend the lifetime of energy-limited sensor networks, many previous researches proposed schemes for data compression. However, few researches investigated the relation between packet compression ratio and spanning trees. We propose packet Compression ratio dependent Spanning Tree (CST) which can provide effective routing paths in terms of the tree length for all ranges of compression ratio f. CST is equivalent to the Shortest Path spanning Tree (SPT) which is optimum in the case of no-compression (f = 0) and is equivalent to the Minimum Spanning Tree (MST) in the case of full-compression (f = 1). CST outperforms SPT and MST for any range of f (0 < f < 1). Through simulation we show CST provides shorter paths than MST and SPT in terms of the tree length by 34.1% and 7.8% respectively. We confirm CST is very useful in convergecasts.
Highlights
A sensor network is a distributed wireless network to monitor various conditions of a remote area through an autonomously configured routing path [1,2,3,4]
We propose packet Compression ratio dependent Spanning Tree (CST) which can provide effective routing paths in terms of the tree length for all ranges of compression ratio f
Minimizing L(TS) at no-compression is equivalent to finding spanning Tree (SPT), and minimizing L(TS) at full-compression is equivalent to finding Minimum Spanning Tree (MST)
Summary
A sensor network is a distributed wireless network to monitor various conditions of a remote area through an autonomously configured routing path [1,2,3,4]. Each node forwards its packets to its neighbor once and only once If we trace these packet routes, we can build up a spanning tree. It is common in sensor networks that intermediate nodes try to reduce packet size during forwarding We could not find any packet compression related paper that investigates the interaction between spanning trees and packet compression ratio. The third idea is a packet Compression ratio dependent Spanning Tree (CST) which builds a spanning tree using the one-time compression model. This new type of tree bridges the gap between SPT and MST.
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.
