Sensor and Sink Placement, Scheduling and Routing Algorithms for Connected Coverage of Wireless Sensor Networks
Banu Kabakulak

TL;DR
This paper introduces a comprehensive MILP model for optimizing sensor and sink placement, scheduling, and routing in wireless sensor networks to maximize operational lifetime while ensuring connected coverage.
Contribution
It presents the first integrated model combining placement, scheduling, and routing decisions for connected coverage in WSNs, along with heuristics for sink placement.
Findings
Heuristics achieve near-optimal solutions efficiently.
The model effectively maximizes network lifetime.
Heuristics outperform commercial solvers in solution time.
Abstract
A sensor is a small electronic device which has the ability to sense, compute and communicate either with other sensors or directly with a base station (sink). In a wireless sensor network (WSN), the sensors monitor a region and transmit the collected data packets through routes to the sinks. In this study, we propose a mixed--integer linear programming (MILP) model to maximize the number of time periods that a WSN carries out the desired tasks with limited energy and budget. Our sink and sensor placement, scheduling, routing with connected coverage () model is the first in the literature that combines the decisions for the locations of sinks and sensors, activity schedules of the deployed sensors, and data flow routes from each active sensor to its assigned sink for connected coverage of the network over a finite planning horizon. The problem is NP--hard and difficult to solve…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
