摘要
针对非均匀分布的无线传感网的生存时间问题,提出多簇无线传感网的优化生存时间近邻功率控制(NPCAOL_MC)算法。该算法采用K-means算法确定网络的簇个数和对应每个簇的节点,利用近邻算法评估每个簇的节点密度,确定簇的最优通信距离。结合Friss自由空间模型计算当前簇的最优发送功率。Sink节点广播通知其他节点,如果是同一簇内的节点相互通信,则采用簇最优功率发送数据,否则采用默认最大发送功率发送数据。仿真结果表明,利用NPCAOL_MC算法可以分析整个网络节点的位置信息,采用簇最优发送功率发送数据,从而提高生存时间,并使能耗经济有效。在密度分布不均的无线传感网中,NPCAOL_MC比采用固定发送功率的Ratio_w算法更优。
For the lifetime problem of wireless sensor networks when nodes are non-uniform distribution,nearest-neighbor power control algorithm for optimizing lifetime in multi-clusters wireless sensor networks（NPCAOL_MC） is proposed.K-means algorithm is used to determine the number of clusters and the corresponding nodes in each cluster.Then nearest-neighbor algorithm is used to measure the node density of each cluster and determine optimal communication distance of each cluster.The optimal transmission powers of each cluster are calculated with Friss free space model.Finally sink node broadcasts to inform nodes that in the same cluster,nodes use cluster optimal transmission power to communication.Nodes between different clusters use the default maximum transmission power to communication.Simulation results show that NPCAOL_MC algorithm analyzes the entire node position information,uses the cluster optimal transmission power,then prolongs network lifetime and remains average energy consumption at a low level.In the wireless sensor network with node non-uniform distribution,NPCAOL_MC algorithm outperforms Ratio_w algorithm with fixed transmission power.
出处
《电信科学》
北大核心
2012年第3期50-56,共7页
Telecommunications Science
基金
国家青年自然科学基金资助项目(No.61004097)
浙江省教育厅基金资助项目(No.Y201018705)
关键词
无线传感网
优化生存时间
近邻算法
分簇
wireless sensor network
optimizing network lifetime
nearest-neighbor algorithm
clustering
