Abstract
Background & Objective: Currently, WSN (Wireless Sensor Networks) provides a variety of services in industrial and commercial applications. WSN consists of nodes that are used to sense the environments like humidity, temperature, pressure, sound, etc. As the use of WSN grows there are some issues like coverage, fault tolerance, a deployment problem, localization, Quality of Service, etc. which needs to be resolved. Sink deployment is a very important problem because it is not the only impact on performance, but also influence on deployment cost. In traditional WSN, a single sink is deployed in the network, which aggregates all the data. Due to this, the whole network is suffering from some serious issues like delay, congestion, network failure that reduces network performance.
Methods: One solution is to deploy multiple sinks instead of a single sink. Deploying multiple sinks can improve network performance, but increases sink deployment cost. In this paper, an ISDOA (Improved Sink Deployment Optimization Algorithm) is proposed to find the optimum number of sinks and their optimum location in ROI. Simulation is carried out in Matlab simulator. The impact of sensors and sinks on various network performance parameters like throughput, network lifetime, packet delivery ratio, energy consumption and cost of the network is analyzed.
Results & Conclusion: It is shown by simulation results that the number of sinks varies inversely with energy consumption of the nodes; and it is linearly proportional to the network lifetime, throughput and packet delivery ratio. Furthermore, results show that the proposed approach outperforms random deployment with 25% higher throughput, 30% better network lifetime, 15% lesser energy consumption and 21% optimized cost of the network, respectively.
Keywords: Cost of the network, deployment problem, energy consumption, network lifetime, optimization technique, packet delivery ratio, throughput, wireless sensor network.
Graphical Abstract
[http://dx.doi.org/10.1016/j.proeng.2014.11.577]]
[http://dx.doi.org/10.1109/DCOSS.2014.56]
[http://dx.doi.org/10.1109/SAS.2013.6493555]
[http://dx.doi.org/10.1109/TC.2007.1019]
[http://dx.doi.org/10.1016/j.comcom.2013.10.002]
[http://dx.doi.org/10.1016/j.cor.2014.11.002]
[http://dx.doi.org//10.1109/ICCSN.2010.33]
[http://dx.doi.org/10.1007/s10732-014-9256-z]
[http://dx.doi.org/10.1109/ICC.2012.6363906]
[http://dx.doi.org/10.1007/s11276-013-0600-2]
[http://dx.doi.org/10.1109/TNET.2011.2109394]
[http://dx.doi.org/10.1016/j.eij.2015.09.004]
[http://dx.doi.org/10.1109/LCOMM.2014.2379713]
[http://dx.doi.org/10.1109/TCYB.2015.2443062]
[http://dx.doi.org/10.1007/s11277-016-3800-0]
[http://dx.doi.org/10.1016/j.comcom.2007.10.004]
[http://dx.doi.org/10.1007/978-3-642-19186-2_12]
[http://dx.doi.org/10.1109/ACCESS.2017.2740382]