Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Approximations for Steiner trees with minimum number of Steiner points
Theoretical Computer Science
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Proceedings of the 1st international conference on Embedded networked sensor systems
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Relay sensor placement in wireless sensor networks
Wireless Networks
Improved Approximation Algorithms for Relay Placement
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Relay Node Placement in Heterogeneous Wireless Sensor Networks with Basestations
CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Relay node placement in large scale wireless sensor networks
Computer Communications
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Constrained relay node placement in wireless sensor networks: formulation and approximations
IEEE/ACM Transactions on Networking (TON)
Wireless Communications & Mobile Computing
Routing in ad hoc networks: a case for long hops
IEEE Communications Magazine
Hi-index | 0.00 |
This work addresses the relay node placement problem in wireless sensor networks. We consider a scenario in which all sensor nodes stream data towards sink nodes. Additional relay nodes can be placed with the aim of optimizing overall network performance in terms of data throughput. We formalize the problem with a linear, mixed integer mathematical programming model. We include a number of constraints and penalties to closely model the wireless environment. When relay nodes can be placed anywhere, we define their possible locations using a discrete grid. Model solutions specify both where to place the relays and the paths for routing. Through extensive simulation experiments, we compare model solutions against a state-of-the-art dynamic routing protocol to assess the quality of the routes, and against a relay node placement heuristic to evaluate relay positioning. To tackle the computational complexity, we also propose and study the effect of different strategies for determining the grid resolution. Additionally, an experimental validation carried out in a real testbed shows that the computed solutions clearly increase network performance by enabling the reception of larger number of data packets at the sinks and determining a fair QoS distribution among the nodes. Finally, we propose an on-line application, in which the model is built and solved on-demand, to adapt to changes in traffic patterns induced by external events, and the results are rapidly spread throughout the network and used to modify relay node positioning and routing paths.