与位置无关的节点调度算法比较分析.

???; ??

In wireless sensor networks，by reasonable scheduling of nodes，energy consumption balance and prolonging the network life cycle are achieved. The position-independent node scheduling algorithms is analyzed，and it is found that a random independent sleep algorithm（RIS）does not require scheduled time synchronization，and does not consider the influences of a node death on its running probability p and has poor adaptability. A lightweight node scheduling algorithm (LDAS）based on the deployment features considers the impact of coverage，and then it needs to exchange the information of neighbor nodes frequently. A range based sleep scheduling algorithm（RBSS）looks for regular hexagon coverage model by measuring distance with high coverage. The RBSS needs time synchronization and does not consider nodes energy balance. By simulation，the performance of the algorithms is compared from the number of the initial nodes and working nodes, and network coverage，which provides guidance for selection of valid node scheduling algorithms and subsequent improvement.

Journal of the Tianjin Polytechnic University / Tianjin Gongye Daxue Xuebao, 2016, Vol 35, Issue 1, p50

1671-024X

Academic Journal

10.3969/j.issn.1671-024x.2016.01.010