利用协作通信的中继节点放置问题研究  

Research on Relay Node Placement Via Cooperative Communication

作　　者：周涛[1,2] 邢凯[1,2] 刘刚[1,2] 谷天波 黄刘生[1,2] 

机构地区：[1]中国科学技术大学计算机科学与技术学院,合肥230027 [2]中国科学技术大学苏州研究院,江苏苏州215123

出　　处：《小型微型计算机系统》2013年第11期2508-2512,共5页Journal of Chinese Computer Systems

摘　　要：无线传感器网络的中继节点放置问题是在不连通的无线网络中部署最少的中继节点来满足特定连通性.而协作通信则能极大地扩大节点间的通信范围.因此,利用协作通信技术,能在无线传感网络的中继节点放置问题中减少中继节点的个数.本文首次提出了利用协作通信来解决无线多跳网络环境下的中继节点放置问题:放置最少的中继节点使传感器网络中的任何两个节点之间都能相互通信.我们证明这个问题是NP难的,为此提出了一个启发式的算法来高效地解决该问题.这个算法能有效地减少中继节点的个数.针对先前算法的研究,我们提出了一项对单跳范围内的中继节点放置问题的改进.最后我们通过仿真验证算法的性能.The relay node placement problem for wireless sensor networks seeks to deploy a minimum number of relay nodes into a sensor network to satisfy certain connectivity. Moreover, cooperative communication is shown to be a promising technology to extend transmission coverage. Thus, we can use cooperative communication to decrease the number of relay nodes in relay node placement problem for wireless sensor networks. In this paper, we address the relay node placement problem, which seeks to place a minimum number of relay nodes to satisfy certain connectivity via cooperative communication which deploys the minimum number of relay nodes so that each two nodes among all the sensor nodes and the sink node can connect each other. This problem is NP-complete and we present a heuristic algorithm. This algorithm can decrease the number of relay nodes in the cooperative sensor networks effective-ly. Moreover, we present an improvement for relay node placement in two hops after researching prior algorithm. Finally, the per-formance of the proposed algorithms is evaluated through simulations.

关 键 词：协作通信 中继节点放置 无线传感器网络 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]