Abstract
Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, and messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.
Highlights
A wireless sensor network (WSN) is a multi-hop wireless network composed of a number of randomly deployed sensors capable of communicating for a specific purpose
We propose a novel face routing method that uses the planar graphs of the message transfer node’s neighbors to forward a message to the most remote neighbor on the route within radio range without traveling via intermediate nodes to improve transfer efficiency and to solve the problems previously mentioned in existing face routing methods
We propose a new face routing to improve transfer efficiency by forwarding a message directly to the most distant hop node on the routing path within radio range using the planar graphs of neighbors
Summary
A wireless sensor network (WSN) is a multi-hop wireless network composed of a number of randomly deployed sensors capable of communicating for a specific purpose. Because the method requires the construction of a network graph using the increased information and performing planarization, the number of calculations is increased, as is the consumption of resources such as memory and energy This phenomenon makes the efficiency drop sharply due to the long computation time and the high energy consumption caused by the large number of nodes deployed within radio range and their position information in a high density WSN. Whenever a node within 2-hop range is added or deleted and regardless of whether it affects the routing, the message transfer node always receives information on the changed node and performs network graph generation, planarization, and routing again. In the proposed face routing, a message transfer node receives the information on the planar graph of its neighbors and it constructs a local full planar graph within radio range.
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.
