无线传感器网络中的多Sink动态目的地地理路由

2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI:10.1109/CYBERC.2010.30

Chen Xu, Lei Cao, Wei Shao

{"title":"无线传感器网络中的多Sink动态目的地地理路由","authors":"Chen Xu, Lei Cao, Wei Shao","doi":"10.1109/CYBERC.2010.30","DOIUrl":null,"url":null,"abstract":"In this work, we propose Multiple Sink Dynamic Destination Geographic Routing (MSDDGR), a routing protocol for multiple sink wireless sensor networks. MSDDGR is based on greedy forwarding scheme, which decides the route only using the neighboring information in the local network topology. When a packet needs to be sent, the sender selects the nearest sink as the current destination, which brings dynamic destination assignment. We also analyze the impact of routing holes problem in the deployment of multiple sinks. This is a common problem in greedy forwarding routing protocols. Our simulations demonstrate the effectiveness of MSDDGR’s performance.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"84 1-2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Multiple Sink Dynamic Destination Geographic Routing in Wireless Sensor Networks\",\"authors\":\"Chen Xu, Lei Cao, Wei Shao\",\"doi\":\"10.1109/CYBERC.2010.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we propose Multiple Sink Dynamic Destination Geographic Routing (MSDDGR), a routing protocol for multiple sink wireless sensor networks. MSDDGR is based on greedy forwarding scheme, which decides the route only using the neighboring information in the local network topology. When a packet needs to be sent, the sender selects the nearest sink as the current destination, which brings dynamic destination assignment. We also analyze the impact of routing holes problem in the deployment of multiple sinks. This is a common problem in greedy forwarding routing protocols. Our simulations demonstrate the effectiveness of MSDDGR’s performance.\",\"PeriodicalId\":315132,\"journal\":{\"name\":\"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"84 1-2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBERC.2010.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERC.2010.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

在这项工作中，我们提出了多Sink动态目的地地理路由(MSDDGR)，这是一种用于多Sink无线传感器网络的路由协议。MSDDGR基于贪婪转发方案，仅根据本地网络拓扑结构中的邻居信息确定路由。当需要发送数据包时，发送方选择最近的接收器作为当前目的地，从而实现动态目的地分配。我们还分析了路由孔问题在多汇部署中的影响。这是贪婪转发路由协议中常见的问题。仿真结果验证了MSDDGR算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Multiple Sink Dynamic Destination Geographic Routing in Wireless Sensor Networks

In this work, we propose Multiple Sink Dynamic Destination Geographic Routing (MSDDGR), a routing protocol for multiple sink wireless sensor networks. MSDDGR is based on greedy forwarding scheme, which decides the route only using the neighboring information in the local network topology. When a packet needs to be sent, the sender selects the nearest sink as the current destination, which brings dynamic destination assignment. We also analyze the impact of routing holes problem in the deployment of multiple sinks. This is a common problem in greedy forwarding routing protocols. Our simulations demonstrate the effectiveness of MSDDGR’s performance.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

自引率

0.00%

发文量