Abstract
We propose a mathematical model for multiple sink placement in Underwater Wireless Sensor Networks (UWSNs). The model is constructed for a 3D mesh topology. Our objective is to minimize the overall number of hops of every source-closest sink pair of cells. We analyze the constructed model, and prove its hardness by reducing the k-median problem, a well-known NP-hard problem to our problem. We then use the Partitioning Around Medoid (PAM) approximation algorithm to find a near optimal solution to our sink placement problem. We test the solutions obtained by this approximation algorithm by comparing them with the optimal solutions obtained using a brute force method. We also compare the approximate solutions with solutions obtained using a random-based heuristic. Results show that the proposed PAM-based approximation achieves remarkably near-optimal solutions.
Original language | English |
---|---|
Title of host publication | 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
ISBN (Electronic) | 9781538637784 |
DOIs | |
Publication status | Published - Nov 9 2018 |
Event | 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018 - Rome, Italy Duration: Jun 19 2018 → Jun 21 2018 |
Other
Other | 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018 |
---|---|
Country | Italy |
City | Rome |
Period | 6/19/18 → 6/21/18 |
Keywords
- approximation algorithm
- hop count
- k-median
- Multiple sink placement
- UWSNs
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Networks and Communications
- Hardware and Architecture
- Energy Engineering and Power Technology
- Safety, Risk, Reliability and Quality