{"title":"Geographic Routing with Cross Links","authors":"W. Zha, W. Ng","doi":"10.1109/KICSS.2012.10","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":309736,"journal":{"name":"2012 Seventh International Conference on Knowledge, Information and Creativity Support Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Seventh International Conference on Knowledge, Information and Creativity Support Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KICSS.2012.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.
地理路由以其高效性和可扩展性在无线传感器网络中具有广阔的应用前景。然而，所提出的地理路由算法尚未在传感器网络的实际应用中实现。地理路由的标准模型通过\textit{单元磁盘图(Unit Disk Graph}, UDG)表示传感器网络，其中假设每个传感器节点具有相同的通信半径。然后，从UDG中提取平面图形进行地理路由。然而，在实际应用中，由于环境因素引起的无线电干扰，标准模型可能不成立。违反这一假设可能导致不完全平面化。不能保证在不完全平面化图上交付。在本文中，我们探讨了不完全平面化是如何导致交付失败的，并引入了一种算法来解决这一问题。实验结果证实了算法的正确性。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
