Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
SIAM Journal on Optimization
Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
SIAM Journal on Optimization
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
Localized topology control algorithms for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
Fidelity and yield in a volcano monitoring sensor network
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
LUSTER: wireless sensor network for environmental research
Proceedings of the 5th international conference on Embedded networked sensor systems
Design and analysis of an MST-based topology control algorithm
IEEE Transactions on Wireless Communications
Utilizing elevator for wireless sensor data collection in high-rise structure monitoring
Proceedings of the Nineteenth International Workshop on Quality of Service
Balancing energy consumption with mobile agents in wireless sensor networks
Future Generation Computer Systems
Hi-index | 0.00 |
Wireless sensor networks have been widely used for ambient data collection in diverse environments. While in many such networks the sensor nodes are randomly deployed in massive quantity, there is a broad range of applications advocating manual deployment. A typical example is structure health monitoring, where the sensors have to be placed at critical locations to fulfill civil engineering requirements. The raw data collected by the sensors can then be forwarded to a remote base station (the sink) through a series of relay nodes. In the wireless communication context, the operation time of a battery-limited relay node depends on its traffic volume and communication range. Hence, although not bounded by the civil-engineering-like requirements, the locations of the relay nodes have to be carefully planned to achieve the maximum network lifetime. The deployment has to not only ensure connectivity between the data sources and the sink, but also accommodate the heterogeneous traffic flows from different sources and the dominating many-to-one traffic pattern. Inspired by the uniqueness of such application scenarios, in this paper, we present an in-depth study on the trafficaware relay node deployment problem. We develop optimal solutions for the simple case of one source node, both with single and multiple traffic flows. We show however that the general form of the deployment problem is difficult, and the existing connectivity-guaranteed solutions cannot be directly applied here. We then transform our problem into a generalized version of the Euclidean Steiner Minimum Tree problem (ESMT). Nevertheless, we face further challenges as its solution is in continuous space and may yield fractional numbers of relay nodes, where simple rounding of the solution can lead to poor performance. We thus develop algorithms for discrete relay node assignment, together with local adjustments that yield high-quality practical solutions. Our solution has been evaluated through both numerical analysis and ns-2 simulations and compared with state-of-the-art approaches. The results show that it achieves up to 6 to 14 times improvement on the network lifetime over the existing traffic-oblivious strategies.