无线传感器网络中可靠的节能路由

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI:10.1109/MAHSS.2005.1542808

Eunjae Jung, D. M. Walker

{"title":"无线传感器网络中可靠的节能路由","authors":"Eunjae Jung, D. M. Walker","doi":"10.1109/MAHSS.2005.1542808","DOIUrl":null,"url":null,"abstract":"This paper describes algorithms for creation and maintenance of a spanning tree connecting nodes to the central observer (root) in wireless sensor networks. The tree is dynamically reconfigured to route around failed nodes, while minimizing energy consumption. Reconfiguration uses only local information, so that the algorithm scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Reliable energy efficient routing in wireless sensor networks\",\"authors\":\"Eunjae Jung, D. M. Walker\",\"doi\":\"10.1109/MAHSS.2005.1542808\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes algorithms for creation and maintenance of a spanning tree connecting nodes to the central observer (root) in wireless sensor networks. The tree is dynamically reconfigured to route around failed nodes, while minimizing energy consumption. Reconfiguration uses only local information, so that the algorithm scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme\",\"PeriodicalId\":268267,\"journal\":{\"name\":\"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MAHSS.2005.1542808\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAHSS.2005.1542808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文描述了无线传感器网络中节点与中心观测器(根)连接的生成树的创建和维护算法。树被动态重新配置以绕过故障节点，同时最小化能耗。重构仅使用局部信息，因此该算法可扩展到大型传感器网络。将该算法的性能与单路径修复路由方案进行了比较

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

查看原文本刊更多论文

Reliable energy efficient routing in wireless sensor networks

This paper describes algorithms for creation and maintenance of a spanning tree connecting nodes to the central observer (root) in wireless sensor networks. The tree is dynamically reconfigured to route around failed nodes, while minimizing energy consumption. Reconfiguration uses only local information, so that the algorithm scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme

求助全文

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

来源期刊

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.

自引率

0.00%

发文量