静态和移动无线传感器网络中的分布式容错拓扑控制

I. Saha, L. K. Sambasivan, R. Patro, S. K. Ghosh
{"title":"静态和移动无线传感器网络中的分布式容错拓扑控制","authors":"I. Saha, L. K. Sambasivan, R. Patro, S. K. Ghosh","doi":"10.1109/COMSWA.2007.382434","DOIUrl":null,"url":null,"abstract":"In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum power information from all the nodes in its vicinity, and then it adjusts the powers of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths. We prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum power Gmax is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been presented. Simulation results show that significant power saving can be achieved by using this algorithm.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks\",\"authors\":\"I. Saha, L. K. Sambasivan, R. Patro, S. K. Ghosh\",\"doi\":\"10.1109/COMSWA.2007.382434\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum power information from all the nodes in its vicinity, and then it adjusts the powers of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths. We prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum power Gmax is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been presented. Simulation results show that significant power saving can be achieved by using this algorithm.\",\"PeriodicalId\":191295,\"journal\":{\"name\":\"2007 2nd International Conference on Communication Systems Software and Middleware\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 2nd International Conference on Communication Systems Software and Middleware\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSWA.2007.382434\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Conference on Communication Systems Software and Middleware","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSWA.2007.382434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

在无线传感器网络中,最小化功耗并同时保持网络拓扑中所需的特性是至关重要的。在这项工作中,我们提出了一种分布式算法,为无线传感器网络中的所有节点分配尽可能小的功率,使网络是k连接的。在该算法中,节点收集其附近所有节点的位置和最大功率信息,然后调整其附近节点的功率,使其通过K条最优顶点不相交路径到达附近的所有节点。我们证明了,如果每个节点与其附近的所有节点保持K个最优顶点不相交路径,则所得到的拓扑是全局K连通的,前提是所有节点以其最大功率Gmax传输时得到的拓扑是K连通的。将该拓扑控制算法推广到移动场景,并给出了移动场景下的连通性证明。仿真结果表明,采用该算法可实现显著的节能效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks
In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum power information from all the nodes in its vicinity, and then it adjusts the powers of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths. We prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum power Gmax is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been presented. Simulation results show that significant power saving can be achieved by using this algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Fast and Efficient Authentication Protocol for a Seamless Handover between a WLAN and WiBro On Utilizing Directional Antenna in 802.11 Networks: Deafness Study An Architecture and a Programming Interface for Application-Aware Data Dissemination Using Overlay Networks An Efficient Management Method of Access Policies for Hierarchical Virtual Private Networks Real-time End-to-end Network Monitoring in Large Distributed Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1