A reliable connectivity based node placement strategy in linear and hierarchical wireless sensor networks

Wireless Sensor Networks have been used extensively for environment data collection from dense as well as simple linear structure deployments. However, the need to collect data from all sensors in the network imposes constraints on internode distances. Critical issues related to optimal resource allocation still persist for even simplistic deployments like linear and hierarchical networks. In this work, we present a method for node placement in linear wireless sensor network with notion of provisioning reliable data delivery over extensive monitoring infrastructures. We provide a selection mechanism for required number of nodes that can cover a specific area while providing a margin for channel reliability. The reliability approach has been analyzed in a pipeline monitoring scenario and subsequently referred with analytical model to ensure consistency with minimum resource consumption and best network connectivity in real world. The proposed node placement strategy is based on a dynamic programming model for achieving reliability in received signals in a multi hop and long distance connectivity perspective.