%0 Journal Article
%T Efficient minimum unit disks set coverage algorithm in wireless sensor networks<br>WSN中有效的最小单位圆集覆盖算法*
%A ZHANG Jin
%A LIU Da-xin
%A XU Yue-zhu
%A <br>张晋
%A 刘大昕
%A 徐悦竹
%J 计算机应用研究
%D 2009
%I 
%X To overcome coverage and broadcasting data forwarding problems in wireless sensor networks with different transmission radius nodes,this paper proposed a novel algorithm based on minimum unit disks cover set to forward broadcasting data, which could calculate skyline set efficiently with the optimal time complexity O(n log n).The proposed algorithm covered each node with minimum unit disk cover set, and the minimum unit disk cover set of a node was equivalent to its skyline set. Detailed simulation results and comparisons with existed algorithms prove that the proposed algorithm not only covers all nodes with minimum nodes, but also prolongs the network lifetime.
%K wireless sensor networks(WSN)
%K covering algorithm
%K unit disk cover set
%K energy<br>无线传感器网络
%K 覆盖算法
%K 单位圆覆盖集
%K 能量
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=2B1D4AC2240AB7C58AE04EC6741CF2A4&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=8C0169D6BEAD5F6C&eid=96FE8C839284324D&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=8