Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Relay sensor placement in wireless sensor networks
Wireless Networks
Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks
IEEE Transactions on Parallel and Distributed Systems
Relay node placement in large scale wireless sensor networks
Computer Communications
Sink repositioning for enhanced performance in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On energy provisioning and relay node placement for wireless sensor networks
IEEE Transactions on Wireless Communications
Optimized relay placement for WSNs federation
Wireless Communications & Mobile Computing
A least-movement topology repair algorithm for partitioned wireless sensor-actor networks
International Journal of Sensor Networks
Towards augmented connectivity with delay constraints in WSN federation
International Journal of Ad Hoc and Ubiquitous Computing
A store-carry-process-and-forward paradigm for intelligent sensor grids
Information Sciences: an International Journal
Efficient deployment of wireless sensor networks targeting environment monitoring applications
Computer Communications
On optimal connectivity restoration in segmented sensor networks
EWSN'13 Proceedings of the 10th European conference on Wireless Sensor Networks
Towards augmenting federated wireless sensor networks in forestry applications
Personal and Ubiquitous Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.07 |
Federating disjoint segments may be necessary in some applications of wireless sensor networks (WSNs). The segments can be simply distinct WSNs that operate autonomously or partitions of a single WSN that has suffered a significant damage. Linking these segments is subject to varying distances among segments which may be longer than twice the communication range of a relay node. In this work, we focus on designing an effective approach for federating these segments by populating the least number of relay nodes. The deployment area is modeled as a grid with equal-sized cells. The optimization problem is then mapped to selecting the fewest count of cells to populate relay nodes such that all segments are connected. Finding the optimal number and positions of relay nodes with respect to length between segments is NP-hard and heuristics are thus pursued. We propose a distributed Cell-based Optimized Relay node Placement (CORP) algorithm and explain the beneficial aspects of the resulting topology with respect to connectivity, and traffic balance. The performance of CORP is validated through extensive simulation experiments.