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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2017-10-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/17/10/2402 |
| _version_ | 1798041758008868864 |
|---|---|
| author | Eun-Seok Cho Yongbin Yim Sang-Ha Kim |
| author_facet | Eun-Seok Cho Yongbin Yim Sang-Ha Kim |
| author_sort | Eun-Seok Cho |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T22:26:03Z |
| format | Article |
| id | doaj.art-dcab7292f6364c45a12cee16c66410c1 |
| institution | Directory Open Access Journal |
| issn | 1424-8220 |
| language | English |
| last_indexed | 2024-04-11T22:26:03Z |
| publishDate | 2017-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Sensors |
| spelling | doaj.art-dcab7292f6364c45a12cee16c66410c12022-12-22T03:59:40ZengMDPI AGSensors1424-82202017-10-011710240210.3390/s17102402s17102402Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNsEun-Seok Cho0Yongbin Yim1Sang-Ha Kim2Information Technology Management Division, Agency for Defense Development, Daejeon 305-150, KoreaDepartment of Computer Engineering, Chungnam National University, Daejeon 301-747, KoreaDepartment of Computer Engineering, Chungnam National University, Daejeon 301-747, KoreaFace 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.https://www.mdpi.com/1424-8220/17/10/2402face routingdistributed processingplanar graphtransfer efficiencyhigh density WSN |
| spellingShingle | Eun-Seok Cho Yongbin Yim Sang-Ha Kim Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs Sensors face routing distributed processing planar graph transfer efficiency high density WSN |
| title | Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs |
| title_full | Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs |
| title_fullStr | Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs |
| title_full_unstemmed | Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs |
| title_short | Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs |
| title_sort | transfer efficient face routing using the planar graphs of neighbors in high density wsns |
| topic | face routing distributed processing planar graph transfer efficiency high density WSN |
| url | https://www.mdpi.com/1424-8220/17/10/2402 |
| work_keys_str_mv | AT eunseokcho transferefficientfaceroutingusingtheplanargraphsofneighborsinhighdensitywsns AT yongbinyim transferefficientfaceroutingusingtheplanargraphsofneighborsinhighdensitywsns AT sanghakim transferefficientfaceroutingusingtheplanargraphsofneighborsinhighdensitywsns |