Border node placement method in wireless sensor networks
Yun Zhou, Huawei Zhan · Journal of Computer Applications · 2013
Because the base stations can only be placed at the border of the monitored area,the border placement problem was formally defined.For the goal to place the minimum number of base stations to cover as much as possible the monitored areas,an improved placement algorithm with polynomial time was proposed.The coverage percentage of initial algorithm was analyzed first.When initial coverage percentage is larger than guaranteed coverage percentage,it is possible to reduce the size of initial placement set.Finally,placement set was gradually improved to achieve the minimun of placement set.The results indicate that the coverage percentage and placement set of the proposed algorithm are superior to random algorithm in different test environments.