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 |
Fingerprint
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
Cite this
Multiple Sink Placement Strategy for Underwater Wireless Sensor Networks. / Al-Salti, Faiza; Day, Khaled; Alzeidi, Nasser; Touzene, Abderezak.
2018 International Symposium on Networks, Computers and Communications, ISNCC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. 8531063.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Multiple Sink Placement Strategy for Underwater Wireless Sensor Networks
AU - Al-Salti, Faiza
AU - Day, Khaled
AU - Alzeidi, Nasser
AU - Touzene, Abderezak
PY - 2018/11/9
Y1 - 2018/11/9
N2 - 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.
AB - 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.
KW - approximation algorithm
KW - hop count
KW - k-median
KW - Multiple sink placement
KW - UWSNs
UR - http://www.scopus.com/inward/record.url?scp=85058445261&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85058445261&partnerID=8YFLogxK
U2 - 10.1109/ISNCC.2018.8531063
DO - 10.1109/ISNCC.2018.8531063
M3 - Conference contribution
BT - 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
ER -