A Self-Organizing Sensor Network Model and Its Computation Based on Random Graphs
Since sensor networks have requirements on minimized energy consumption, efficiently selforganizing a sensor network based on the sensing characteristics is an important and challenging problem. In this paper, we set up a randomly-distributed starcluster model of a self-organizing sensor network consisting of two types of sensors: junior sensors, which provide only detection information; and senior sensors, which instead have a capability of target tracking. They cooperate with each other to perform surveillance tasks by an asleep-awake mechanism. By means of random graphs, an upper bound to the estimated number of active sensors and some parameters such as bias errors of the tracking position at each time step are computed. The results of simulation experiment show that surveillance function can be performed efficiently by our selforganizing sensor network model with limited sensor prime power and a reduced number of sensors in the whole network.
Xiong Li Sheng Dang Zongchang Xu Gaotian Pan
Department of Command and Administration Academy of Armored Force Engineering Beijing, China 100072 Department of Technical Support Academy of Armored Force Engineering Beijing, China 100072
国际会议
南宁
英文
2007-07-20（万方平台首次上网日期，不代表论文的发表时间）