%0 Journal Article
%T A Node Scheduling Scheme Based on Virtual Coordinate in Sensor Networks<br>传感器网络中基于虚拟坐标的节点调度方案
%A LI Xiao-Long
%A LIN Ya-Ping
%A YI Ye-Qing
%A YU Jian-Ping
%A LU Xin-Guo
%A <br>李小龙
%A 林亚平
%A 易叶青
%A 余建平
%A 卢新国
%J 软件学报
%D 2008
%I 
%X Firstly a maximum similarity distribution model is proposed. Secondly, a new definition, named virtual coordinate of a node which composes of the minimum hop counts to several special nodes, is introduced in instead of absolute physical coordinate of a node. Based on the theories, a distributed location-independent node scheduling scheme is proposed. The scheme consists of a coverage algorithm and a connection algorithm. The coverage algorithm takes advantage of the nodes' virtual coordinate to divide all nodes into several subsets. Without using location information, this scheduling scheme not only has the ability that sensor nodes in subsets are more uniformly distributed in the target region than other schemes, but also guarantees that all subsets are connective. The simulation results show that the scheme outperforms the randomized node scheduling scheme, on the coverage rate and network lifetime, as well as the number of external nodes when maintaining subsets to be connective.
%K sensor network
%K scheduling
%K maximum similarity distribution
%K coverage
%K connectivity<br>传感器网络
%K 调度
%K 极大相似分布
%K 覆盖
%K 连通
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=93B52247CFC8C14DD8F7640706C6F47A&yid=67289AFF6305E306&vid=2A8D03AD8076A2E3&iid=5D311CA918CA9A03&sid=F732F37FA82B687C&eid=1F552201CAFF2426&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=14