TY - GEN
T1 - Multiple Sink Placement Strategy for Underwater Wireless Sensor Networks
AU - Al-Salti, Faiza
AU - Day, Khaled
AU - Alzeidi, N.
AU - Touzene, Abderezak
N1 - Funding Information:
This work is supported by The Research Council (TRC) of the Sultanate of Oman under the research grant number RC/SCI/COMP/15/02.
Publisher Copyright:
© 2018 IEEE.
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 - Multiple sink placement
KW - UWSNs
KW - approximation algorithm
KW - hop count
KW - k-median
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
AN - SCOPUS:85058445261
T3 - 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018
BT - 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018
Y2 - 19 June 2018 through 21 June 2018
ER -