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
Article Menu
Issue 10 (October) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(10), 2402; doi:10.3390/s17102402

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

Information Technology Management Division, Agency for Defense Development, Daejeon 305-150, Korea
Department of Computer Engineering, Chungnam National University, Daejeon 301-747, Korea
Current address: P.O.Box 35, Yuseong, Daejeon 34186, Korea
These authors contributed equally to this work.
Author to whom correspondence should be addressed.
Received: 28 September 2017 / Revised: 17 October 2017 / Accepted: 19 October 2017 / Published: 20 October 2017
(This article belongs to the Section Sensor Networks)
View Full-Text   |   Download PDF [2136 KB, uploaded 7 November 2017]   |  


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

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

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.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top