Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks
With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In t...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2014-05-01
|
Series: | Axioms |
Subjects: | |
Online Access: | http://www.mdpi.com/2075-1680/3/2/177 |
id |
doaj-a27ec9a8c01d4022ba16d1da392aac2b |
---|---|
record_format |
Article |
spelling |
doaj-a27ec9a8c01d4022ba16d1da392aac2b2020-11-24T22:40:54ZengMDPI AGAxioms2075-16802014-05-013217720110.3390/axioms3020177axioms3020177Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor NetworksSu Xia0Xiaotian Yin1Hongyi Wu2Miao Jin3Xianfeng David Gu4Cisco Systems, Milpitas, CA 95035, USAMathematics Department, Harvard University, Cambridge, MA 02138, USAThe Center for Advanced Computer Studies, University of Louisiana, Lafayette, LA 70504, USAThe Center for Advanced Computer Studies, University of Louisiana, Lafayette, LA 70504, USADepartment of Computer Science, Stony Brook University, Stony Brook, NY 11790, USAWith both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research, we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC) mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping (VHM) of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network without or with one internal hole. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. For networks with multiple internal holes, a segmentation and tunnel-based routing strategy is proposed on top of VHM to support global end-to-end routing. As far as we know, this is the first work that realizes truly deterministic routing with constant-bounded storage and computation in general 3D wireless sensor networks.http://www.mdpi.com/2075-1680/3/2/1773D sensor networksharmonic mappingrouting |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Su Xia Xiaotian Yin Hongyi Wu Miao Jin Xianfeng David Gu |
spellingShingle |
Su Xia Xiaotian Yin Hongyi Wu Miao Jin Xianfeng David Gu Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks Axioms 3D sensor networks harmonic mapping routing |
author_facet |
Su Xia Xiaotian Yin Hongyi Wu Miao Jin Xianfeng David Gu |
author_sort |
Su Xia |
title |
Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks |
title_short |
Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks |
title_full |
Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks |
title_fullStr |
Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks |
title_full_unstemmed |
Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks |
title_sort |
deterministic greedy routing with guaranteed delivery in 3d wireless sensor networks |
publisher |
MDPI AG |
series |
Axioms |
issn |
2075-1680 |
publishDate |
2014-05-01 |
description |
With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research, we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC) mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping (VHM) of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network without or with one internal hole. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. For networks with multiple internal holes, a segmentation and tunnel-based routing strategy is proposed on top of VHM to support global end-to-end routing. As far as we know, this is the first work that realizes truly deterministic routing with constant-bounded storage and computation in general 3D wireless sensor networks. |
topic |
3D sensor networks harmonic mapping routing |
url |
http://www.mdpi.com/2075-1680/3/2/177 |
work_keys_str_mv |
AT suxia deterministicgreedyroutingwithguaranteeddeliveryin3dwirelesssensornetworks AT xiaotianyin deterministicgreedyroutingwithguaranteeddeliveryin3dwirelesssensornetworks AT hongyiwu deterministicgreedyroutingwithguaranteeddeliveryin3dwirelesssensornetworks AT miaojin deterministicgreedyroutingwithguaranteeddeliveryin3dwirelesssensornetworks AT xianfengdavidgu deterministicgreedyroutingwithguaranteeddeliveryin3dwirelesssensornetworks |
_version_ |
1725702849090813952 |