Abstract-We study the deployment of data back-haul nodes for wireless networks with energy constraints. We address the following problem: given the required lifetime of a sensor network, the energy constraint of back-haul nodes, and the area to be covered, what is the minimum number of nodes needed to construct such a back-haul network and what is the corresponding deployment scheme? Finding an efficient deployment scheme involves location management, routing, and power management. We focus on linear networks and formulate a deployment optimization problem. We then propose and analyze a greedy deployment scheme that achieves close to optimal performance. We reveal the closed-form relationship among different design parameters, namely, the number of sensor nodes, the desired lifetime, and the coverage distance. We also study the effect of miscellaneous power consumptions and non-uniform data density, and consider extensions to planar networks.
Liu and Mohapatra REF proposed a greedy deployment scheme that achieves suboptimal performance and reveals the relationship among the number of sensor nodes, the desired lifetime, and the coverage distance.
On the deployment of wireless data back-haul networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Mathematics Computer Science