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

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

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...

Full description

Bibliographic Details
Main Authors: Eun-Seok Cho, Yongbin Yim, Sang-Ha Kim
Format: Article
Language:English
Published: MDPI AG 2017-10-01
Series:Sensors
Subjects:
face routing
distributed processing
planar graph
transfer efficiency
high density WSN
Online Access:https://www.mdpi.com/1424-8220/17/10/2402

Similar Items

Similar Items