Geographic routing with cross links

Geographic routing is promising in wireless sensor network because its efficiency and scalability. However, none of the proposed geographic routing algorithms has been implemented in real sensor network application yet. The standard model for geographic routing represents sensor network by an textit...

全面介紹

Saved in:
書目詳細資料
Main Authors: Zha, Wei, Ng, Wee Keong
其他作者: School of Computer Engineering
格式: Conference or Workshop Item
語言:English
出版: 2013
主題:
在線閱讀:https://hdl.handle.net/10356/97812
http://hdl.handle.net/10220/16763
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
id sg-ntu-dr.10356-97812
record_format dspace
spelling sg-ntu-dr.10356-978122020-05-28T07:17:48Z Geographic routing with cross links Zha, Wei Ng, Wee Keong School of Computer Engineering International Conference on Knowledge, Information and Creativity Support Systems (7th : 2012 : Melbourne, VIC) DRNTU::Engineering::Computer science and engineering Geographic routing is promising in wireless sensor network because its efficiency and scalability. However, none of the proposed geographic routing algorithms has been implemented in real sensor network application yet. The standard model for geographic routing represents sensor network by an textit{Unit Disk Graph} (UDG), where each sensor node is assumed with the same communication radius. Then, a planar graph is extracted from UDG to perform geographic routing. In practice, however, the standard model may not hold true due to radio disturbance caused by environmental factors. Violating this assumption may result in an incomplete planarization. Delivery on an incomplete planarized graph is not guaranteed. In this paper, we explore how exactly incomplete planarization leads to delivery failure and introduce an algorithm to solve this problem. Experimental results confirm the correctness of our algorithm. 2013-10-24T06:06:11Z 2019-12-06T19:47:00Z 2013-10-24T06:06:11Z 2019-12-06T19:47:00Z 2012 2012 Conference Paper Zha, W., & Ng, W. K. (2012). Geographic routing with cross links. 2012 Seventh International Conference on Knowledge, Information and Creativity Support Systems (KICSS), pp.181-186. https://hdl.handle.net/10356/97812 http://hdl.handle.net/10220/16763 10.1109/KICSS.2012.10 en
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering
spellingShingle DRNTU::Engineering::Computer science and engineering
Zha, Wei
Ng, Wee Keong
Geographic routing with cross links
description Geographic routing is promising in wireless sensor network because its efficiency and scalability. However, none of the proposed geographic routing algorithms has been implemented in real sensor network application yet. The standard model for geographic routing represents sensor network by an textit{Unit Disk Graph} (UDG), where each sensor node is assumed with the same communication radius. Then, a planar graph is extracted from UDG to perform geographic routing. In practice, however, the standard model may not hold true due to radio disturbance caused by environmental factors. Violating this assumption may result in an incomplete planarization. Delivery on an incomplete planarized graph is not guaranteed. In this paper, we explore how exactly incomplete planarization leads to delivery failure and introduce an algorithm to solve this problem. Experimental results confirm the correctness of our algorithm.
author2 School of Computer Engineering
author_facet School of Computer Engineering
Zha, Wei
Ng, Wee Keong
format Conference or Workshop Item
author Zha, Wei
Ng, Wee Keong
author_sort Zha, Wei
title Geographic routing with cross links
title_short Geographic routing with cross links
title_full Geographic routing with cross links
title_fullStr Geographic routing with cross links
title_full_unstemmed Geographic routing with cross links
title_sort geographic routing with cross links
publishDate 2013
url https://hdl.handle.net/10356/97812
http://hdl.handle.net/10220/16763
_version_ 1681058327602135040