Abstract
In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose a light-weight Tree-based graph embedding (TGE) for sensor networks. Over the TGE, we design a weak greedy routing protocol, TGR. TGR can archive good performance on path stretch factor and load balance factor.
Highlights
Wireless sensor networks (WSN) are deployed in real-world for monitoring events and collecting data from the environment [1, 2]
In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing
Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network
Summary
Wireless sensor networks (WSN) are deployed in real-world for monitoring events and collecting data from the environment [1, 2]. The most popular greedy routing is based on geographic information, which is called geographic greedy routing In such protocol, the current node often selects the nearest node to the destination as the hop to transmit data. This work can achieve greedy routing over the spanning tree It wastes most links of the original network and cannot reach load balance. The existing weak greedy routing protocol solution is still based on the geographic information. We propose a new weak greedy routing method It does not need the geographic location. It establishes a tree-based graph embedding rather than a greedy embedding. We design a new greedy routing algorithm TGR (Tree-based Greedy Routing).
Sign-in/Register to view highlights & summary 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.
