Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
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
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
k-means++: the advantages of careful seeding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Data delivery in fragmented wireless sensor networks using mobile agents
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
IEEE Transactions on Mobile Computing
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 large scale wireless sensor networks
Computer Communications
Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree
Journal of Parallel and Distributed Computing
Constrained relay node placement in wireless sensor networks: formulation and approximations
IEEE/ACM Transactions on Networking (TON)
On energy provisioning and relay node placement for wireless sensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.24 |
In multiple application scenarios, need arises to connect a set of disjoint nodes or segments. Examples include connecting a sparsely located data sources, repairing a partitioned network topology after failure, and federating a set of standalone networks to serve an emerging event. Contemporary solutions either deploy stationary relay nodes (RN) to form data paths or employ one or multiple mobile data carriers (MDCs) that pick packets from sources and transport them to destinations. In this paper we investigate the interconnection problem when the number of available RNs is insufficient for forming a stable topology and a mix of RNs and MDCs is to be used. We present a novel algorithm for determining where the RNs are to be placed and planning optimized travel paths for the MDCs so that the data delivery latency as well as the MDC motion overhead are minimized. The performance of the algorithm is validated through simulation.