一种结合地理和虚拟坐标信息的无线传感器网络旁路空路由

Dejing Zhang, Enqing Dong
{"title":"一种结合地理和虚拟坐标信息的无线传感器网络旁路空路由","authors":"Dejing Zhang, Enqing Dong","doi":"10.1109/ICT.2015.7124668","DOIUrl":null,"url":null,"abstract":"Greedy forwarding is efficient in geographic routing, however, it fails inevitably when routing voids are encountered due to the distribution of nodes in wireless sensor network. To solve the void problem, long path and high control packet overhead are usually involved. In this paper, a bypassing void routing protocol combining of geographic and virtual coordinate information is proposed. When routing void is encountered, edges nodes of routing void are assigned virtual coordinates located on a virtual circle and two different forwarding regions around void are established. By utilizing the virtual circle structure and two forwarding regions, greedy forwarding can work without failing. Simulation shows the proposed protocol has shorter path length, less control packet overhead and energy consumption.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A bypassing void routing combining of geographic and virtual coordinate information for WSN\",\"authors\":\"Dejing Zhang, Enqing Dong\",\"doi\":\"10.1109/ICT.2015.7124668\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Greedy forwarding is efficient in geographic routing, however, it fails inevitably when routing voids are encountered due to the distribution of nodes in wireless sensor network. To solve the void problem, long path and high control packet overhead are usually involved. In this paper, a bypassing void routing protocol combining of geographic and virtual coordinate information is proposed. When routing void is encountered, edges nodes of routing void are assigned virtual coordinates located on a virtual circle and two different forwarding regions around void are established. By utilizing the virtual circle structure and two forwarding regions, greedy forwarding can work without failing. Simulation shows the proposed protocol has shorter path length, less control packet overhead and energy consumption.\",\"PeriodicalId\":375669,\"journal\":{\"name\":\"2015 22nd International Conference on Telecommunications (ICT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 22nd International Conference on Telecommunications (ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT.2015.7124668\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 22nd International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2015.7124668","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

贪婪转发在地理路由中是有效的,但由于无线传感器网络中节点的分布,当遇到路由空洞时,贪婪转发不可避免地会失败。为了解决空洞问题,通常涉及到较长的路径和较高的控制数据包开销。本文提出了一种结合地理和虚拟坐标信息的绕过空路由协议。当遇到路由空洞时,给路由空洞的边缘节点分配位于虚拟圆上的虚拟坐标,并在空洞周围建立两个不同的转发区域。利用虚拟圆结构和两个转发区域,可以实现贪婪转发不失败。仿真结果表明,该协议具有路径长度短、控制包开销小、能耗低等优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A bypassing void routing combining of geographic and virtual coordinate information for WSN
Greedy forwarding is efficient in geographic routing, however, it fails inevitably when routing voids are encountered due to the distribution of nodes in wireless sensor network. To solve the void problem, long path and high control packet overhead are usually involved. In this paper, a bypassing void routing protocol combining of geographic and virtual coordinate information is proposed. When routing void is encountered, edges nodes of routing void are assigned virtual coordinates located on a virtual circle and two different forwarding regions around void are established. By utilizing the virtual circle structure and two forwarding regions, greedy forwarding can work without failing. Simulation shows the proposed protocol has shorter path length, less control packet overhead and energy consumption.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信