传感技术学报
傳感技術學報
전감기술학보
Journal of Transduction Technology
2014年
6期
814-820
,共7页
马晨明%王万良%洪榛
馬晨明%王萬良%洪榛
마신명%왕만량%홍진
异构无线传感器网络%拓扑控制%A3 M算法%拓扑构建%拓扑维护%最小连通支配集
異構無線傳感器網絡%拓撲控製%A3 M算法%拓撲構建%拓撲維護%最小連通支配集
이구무선전감기망락%탁복공제%A3 M산법%탁복구건%탁복유호%최소련통지배집
heterogeneous wireless sensor network%topology control%A3 M algorithm%topology construction%topology maintenance%minimum connected dominating set
拓扑控制是无线传感器网络中节约能量、延长网络生命的关键技术。针对现有拓扑控制方法主要集中在同构网络中作为拓扑构建或拓扑维护单独研究的问题,提出了包含两个过程的异构网络分布式拓扑控制算法A3 M。拓扑构建基于最小连通支配集构建虚拟骨干树,在保证连通性的同时关闭网络冗余节点以降低能耗;拓扑维护对网络性能进行评估,当现有网络性能严重下降时,改变拓扑以保障网络的稳定运行。理论分析和仿真实验证实算法能够以较小的时间和消息代价减少拓扑构建能耗并延长网络时间。
拓撲控製是無線傳感器網絡中節約能量、延長網絡生命的關鍵技術。針對現有拓撲控製方法主要集中在同構網絡中作為拓撲構建或拓撲維護單獨研究的問題,提齣瞭包含兩箇過程的異構網絡分佈式拓撲控製算法A3 M。拓撲構建基于最小連通支配集構建虛擬骨榦樹,在保證連通性的同時關閉網絡冗餘節點以降低能耗;拓撲維護對網絡性能進行評估,噹現有網絡性能嚴重下降時,改變拓撲以保障網絡的穩定運行。理論分析和倣真實驗證實算法能夠以較小的時間和消息代價減少拓撲構建能耗併延長網絡時間。
탁복공제시무선전감기망락중절약능량、연장망락생명적관건기술。침대현유탁복공제방법주요집중재동구망락중작위탁복구건혹탁복유호단독연구적문제,제출료포함량개과정적이구망락분포식탁복공제산법A3 M。탁복구건기우최소련통지배집구건허의골간수,재보증련통성적동시관폐망락용여절점이강저능모;탁복유호대망락성능진행평고,당현유망락성능엄중하강시,개변탁복이보장망락적은정운행。이론분석화방진실험증실산법능구이교소적시간화소식대개감소탁복구건능모병연장망락시간。
Topology Control is a key strategy to save energy and extend the lifetime of wireless sensor networks. In view of the problem that existing topology control methods mainly focus on the homogeneous network to research on topology construction or topology maintenance separately,a distributed topology control algorithm A3M in the hetero-geneous network is presented that contains both process. Topology construction is based on the Minimum Connected Dominating Set concept to construct the virtual backbone tree,which turns off redundant nodes to save energy while ensuring the network connectivity. Topology maintenance is related with the evaluation of the performance of the network,and changes the topology to maintain the stable operation of the network when the existing network performance degrades significantly. Theoretical analysis and simulation experiments confirm that our algorithm can reduce the energy consumption of topology construction and extend the network lifetime with low time and message complexity.