Integer and combinatorial optimization
Integer and combinatorial 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
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Redundancy and coverage detection in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Fault-resilient sensing in wireless sensor networks
Computer Communications
Mobile data collector strategy for delay-sensitive applications over wireless sensor networks
Computer Communications
Clustering strategies for improving the lifetime of two-tiered sensor networks
Computer Communications
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Relay node placement in large scale wireless sensor networks
Computer Communications
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
A new architecture for hierarchical sensor networks with mobile data collectors
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
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
On energy provisioning and relay node placement for wireless sensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
Higher-powered relay nodes, used as cluster heads in hierarchical sensor networks, can improve network performances. Most existing relay node placement strategies consider only stationary nodes, where data are routed to the base station(s), possibly using multiple hops. We consider a relay node based network, where a Mobile Data Collector (MDC) collects data from each relay node and delivers the collected data to the base station. This reduces the energy dissipation of the relay nodes by relieving them of the burden of transmitting data over longer distances. The issue is to find the minimum number of relay nodes, along with their locations, such that network coverage and lifetime requirements are satisfied. We present an integrated Integer Linear Program (ILP) formulation that determines an optimal relay node placement scheme, which ensures that there is no data loss due to buffer overflow and the energy dissipation does not exceed a specified level.