Abstract
In this paper we study the effect of sink location on aggregation through many random Wireless Sensor Network topologies based on tree construction. The key idea is to build the tree out from the sink, taking into account node's degree of connectivity, in order to elect the node with the highest degree of connectivity as a parent, and the node with lowest degree of connectivity as a leaf. The shortest path between each sensor and the sink is established. Thus, the data transmitted on the network remains minimal and will propagate from parent to parent towards the sink. We then select the best location of the sink in order to obtain the minimal number of packets transmitted from all sensors towards the sink, and the maximum number of leaves. Simulations have shown that our new method provides promising results that are better than existing algorithms such as BFS, DFS and flooding.
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.
