Expressing combinatorial optimization problems by linear programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Data collection, storage, and retrieval with an underwater sensor network
Proceedings of the 3rd international conference on Embedded networked sensor systems
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Fault-resilient sensing in wireless sensor networks
Computer Communications
Clustering strategies for improving the lifetime of two-tiered sensor networks
Computer Communications
On the Optimal Robot Routing Problem in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Optimal placement and routing strategies for resilient two-tiered sensor networks
Wireless Communications & Mobile Computing
Relay node placement in large scale wireless sensor networks
Computer Communications
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
IEEE Transactions on Mobile Computing
Integrated clustering and routing strategies for large scale sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Fault-tolerant relay node placement in wireless sensor networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Computational complexity of relay placement in sensor networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Energy aware design strategies for heterogeneous sensor networks
Energy aware design strategies for heterogeneous sensor networks
On energy provisioning and relay node placement for wireless sensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
In this paper we have investigated the design of a multi-tier architecture for sensor networks that includes higher-powered relay nodes, and a mobile data collector (MDC). We have presented a new Integer Linear Program to determine a placement scheme for the relay nodes that (i) ensures that each sensor node can communicate with at least one relay node, using as few relay nodes as possible, and (ii) computes a ''shortest length'' trajectory of the MDC. We have also investigated, using a new heuristic for the Traveling Salesman Problem with Neighborhood (TSPN), the possibility of further reducing the MDC trajectory length by finding, for each relay node, a suitable point in its neighborhood to be visited by the MDC, while guaranteeing some feasible network lifetime.