科技广场
科技廣場
과기엄장
SCIENCE TECHNOLOGY PLAZA
2012年
6期
6-9
,共4页
分簇%无线传感器网络%数据聚合%Dijkstra算法
分簇%無線傳感器網絡%數據聚閤%Dijkstra算法
분족%무선전감기망락%수거취합%Dijkstra산법
Clustering%Wireless Sensors Networks%Data Aggregation%Algorithm of Dijkstra
无线传感器网络降低能耗、提高网络生存周期是研究的重要目标,本文针对LEACH算法缺陷,对簇首选择、簇首和Sink节点的通信进一步优化。簇头节点在接收簇内节点数据时进行数据聚合,减少传输数据的能耗,同时各簇头节点将聚合后的数据用改进的Dijkstra算法以最快的速度找到距离Sink的最短路径,提高网络性能,延长网络生存时间。
無線傳感器網絡降低能耗、提高網絡生存週期是研究的重要目標,本文針對LEACH算法缺陷,對簇首選擇、簇首和Sink節點的通信進一步優化。簇頭節點在接收簇內節點數據時進行數據聚閤,減少傳輸數據的能耗,同時各簇頭節點將聚閤後的數據用改進的Dijkstra算法以最快的速度找到距離Sink的最短路徑,提高網絡性能,延長網絡生存時間。
무선전감기망락강저능모、제고망락생존주기시연구적중요목표,본문침대LEACH산법결함,대족수선택、족수화Sink절점적통신진일보우화。족두절점재접수족내절점수거시진행수거취합,감소전수수거적능모,동시각족두절점장취합후적수거용개진적Dijkstra산법이최쾌적속도조도거리Sink적최단로경,제고망락성능,연장망락생존시간。
The primary aim of the study is to reduce the energy consumption of the networks of wireless sensors and to improve the life cycle of the networks, further optimizing the communications of cluster heads towards Sink nodes and cluster choices in view of the algorithmic defects of LEACH. Data aggregation is being conducted while cluster heads receiving the nodes data to reduce energy consumption in transmitting data. Simultaneously each cluster head finds the shortest route to Sink at the greatest speed for the aggregated data with the improved algorithm of Dijkstra to improve the network performance and to prolong the life time of the networks.
