Router Placement in Wireless Sensor Networks

In this paper we propose and evaluate algorithms for placement of routers in a wireless sensor network. There are two major requirements on router placement. First, a placement must guarantee connectivity, i.e. every sensor must be able to communicate through routers with a predefined computer-connected gateway node. Second, a placement must provide robust communication in the case of router failures. This is achieved by placing redundant routers that increase the number of possible routes. Both requirements should be met by placing as few routers as possible. The proposed algorithms compute placement in an efficient and reasonably fast way