Next Article in Journal
Fabrication of Ordered SnO2 Nanostructures with Enhanced Humidity Sensing Performance
Previous Article in Journal
Crack Monitoring Method for an FRP-Strengthened Steel Structure Based on an Antenna Sensor
Open AccessArticle

Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs

by Eun-Seok Cho 1,†,‡, Yongbin Yim 2 and Sang-Ha Kim 2,*
1
Information Technology Management Division, Agency for Defense Development, Daejeon 305-150, Korea
2
Department of Computer Engineering, Chungnam National University, Daejeon 301-747, Korea
*
Author to whom correspondence should be addressed.
Current address: P.O.Box 35, Yuseong, Daejeon 34186, Korea
These authors contributed equally to this work.
Sensors 2017, 17(10), 2402; https://doi.org/10.3390/s17102402
Received: 28 September 2017 / Revised: 17 October 2017 / Accepted: 19 October 2017 / Published: 20 October 2017
(This article belongs to the Section Sensor Networks)
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. View Full-Text
Keywords: face routing; distributed processing; planar graph; transfer efficiency; high density WSN face routing; distributed processing; planar graph; transfer efficiency; high density WSN
Show Figures

Figure 1

MDPI and ACS Style

Cho, E.-S.; Yim, Y.; Kim, S.-H. Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs. Sensors 2017, 17, 2402.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop