See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/329673185

Review on Optimization Structure for Data Collection in Wireless Sensor

Networks

Article · December 2017

CITATIONS READS

0 17

3 authors, including:

sheik dawood M M. Jehosheba Margaret

Sethu Institute of Technology Sethu Institute of Technology
18 PUBLICATIONS   36 CITATIONS    5 PUBLICATIONS   4 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

covid-19 View project

IMPLEMENTATION OF LPT USING SPIDER TECHNIQUE View project

All content following this page was uploaded by sheik dawood M on 15 December 2018.

The user has requested enhancement of the downloaded file.

 International Journal for Research in Applied Science & Engineering Technology (IJRASET)
ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor :6.887
Volume 5 Issue XII December 2017- Available at www.ijraset.com

Review on Optimization Structure for Data

Collection in Wireless Sensor Networks
M.Sheik dawood1, R.Jeyanthi2, M.Jehosheba Margaret3
1 2
Professor/Department of ECE, PG scholar /Department of ECE, 3Asst.Professor/Department of ECE, Sethu institute of
technology, Pulloor

Abstract: Wireless Sensor Networks (WSN) represents a very promising domain. They can be used in a large variety of
applications due to their easy deployment and, their low cost of construction. These networks are composed of plenty of sensor
nodes that are deployed in the monitoring field, and they form a self configured network by means of wireless communication.
The Major issues in Wireless sensor Networks (WSN) are Energy Consumption, node deployment, network lifetime, Localization
of nodes, task allocations, Coverage etc., to meet out the requirement at various Optimization frame work are proposed by several
researchers. A few node deployment Schemes are discussed as a solution of node failures with load balancing techniques.
Quantities of the optimization methodologies have studied at this point to maximize lifetime of wireless sensor network.
Keywords: Sensor Networks, Optimization, Data collection, Node deployment and Lifetime

I. INTRODUCTION
Current technological advances have made sensible the deployment of inexpensive sensor nodes over a region of interest to collect
sensor data, to process it and to route it to a sink node for aggregation that as an entire comprises wireless Sensor Network
(WSN).In Wireless Sensor Networks (WSN), the key challenge is to prolong the network life time by reducing the energy
consumption among sensor nodes and reduce energy dissipation in network operation, improve network load and stability(sheik
Dawood et al.2015&2016). In fact, WSN’s have numerous applications in weather monitoring, disaster management, inventory
tracking, smart spaces, habitat monitoring, target tracking, surveillance and many more. In a multi-hop Wireless Sensor Network
(WSN) with continuous traffic, each sensor node acts as a data originator that introduces a data packet into the network at regular
intervals, to send its data to the sink node. At the same time, each node also acts as a router to forward others data packets to the
sink node via minimum-hop paths.

Fig 1: Sensor Nodes deployed in Wireless Sensor Network

In many applications, the sensor nodes are battery-powered, and without any recharging Facility. Most of the energy of the sensor
nodes is depleted in the process of data communication. When the battery power is exhausted, a node fails to operate and
conventionally this ends the lifetime of the network which is the time duration of network operation until the first node fails, mainly
due to energy shortage. Hence for energy-efficiency, it is a fundamental issue to reduce the total number of packet transmissions in
the network. The network load, i.e. the total number of packets to be delivered to the sink node is lower bounded by the coverage
constraint. Given that bound, it is obvious that, each packet should follow the path with minimum hop to reduce the total number of
packet transmissions. But, if nodes always forward their packets to the sink node via minimum- hop paths, nodes nearer to the sink
will carry heavier traffic and will deplete their energy faster, creating energy holes around the sink. Hence, in a multi-hop WSN, it is
a challenging issue to exploit the energy of all the nodes uniformly so that the network lifetime is maximized.

©IJRASET (UGC Approved Journal): All Rights are Reserved 1450

 International Journal for Research in Applied Science & Engineering Technology (IJRASET)
ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor :6.887
Volume 5 Issue XII December 2017- Available at www.ijraset.com

A. Node Deployment Strategy for Wireless sensor Networks

The distributed greedy load balance algorithm proposed by way of Chatterjee et al. (2016).A novel graded strategy is proposed that
generates minimum traffic, just for coverage. Based on this node distribution ,a distributed nearly load balanced data gathering
algorithm is developed to deliver packets to the sink node via minimum- hop path that also in turns helps to limit the network traffic.
The proposed model gives a huge enhancement in network lifetime that significantly overrides the increase in cost due to over-
deployment.
Liu (2006) analyzed a deployment strategy of sensor nodes to extend the life time for multi-hop wireless sensor networks are
addressed based on load-balancing concept. An algorithm is proposed to deployment homogeneous sensor in a wireless network
within a given number of nodes which are continuously monitoring an area of interest. The densities of sensor nodes are determined
by solving optimization problem. It has extended lifetime and break down more gracefully than that for 2-D Poisson distribution
while maintaining satisfactory coverage. Node failure does not concentrate on this research. So, it has more number of redundant
nodes. The artificial Ant colony optimization algorithm proposed by way of Mahboubi and Labeau(2015) .It described a Voronoi-
primarily based diagram which assigns a distinct region to each sensor within the presence of limitations such that the regions are at
the same time disjointed. If one sensor cannot cowl a factor interior it’s any region, no different sensor can detect it both. The
proposed diagram referred to as obstructed guaranteed additively weighted (OGAW) Voronoi diagram is the main tool for
developing the sensor deployment algorithms in a network of mobile sensors with non identical sensing tiers within the presence of
limitations. This proposed algorithm is used to improving the Prioritized insurance .energy intake issue does no longer discussed on
this research. Zhang (2010) defined the effects of spatial and temporal distribution on the node deployment is considered. Firstly the
amount of data transmission network is calculated, taking the spatial distribution of the events and coverage effects into concern.
Exploiting this result the energy balance equation is proposed based on the temporal density of the events, for estimating the
network lifetime the non-uniform deployment of nodes should be leveraged to balance the energy consumption by deploying more
nodes close to the sink. Where Spatial and temporal distributions of events greatly influence the strategy of the node deployment,
for balancing the energy consumption of the network and Unpredictable deployment will occur. Bartolini and Calamoneri (2011)
investigated an autonomous deployment algorithm that guarantees the adaption of sensor density to the sink proximity and enables
their selective activation. The proposed algorithm also permits a fault tolerance and self-healing deployment, dynamic reallocation
and selective sensor activation. The proposed algorithm efficiently reaches a deployment at the desired variable density with
moderate energy consumption under a wide range of operative settings. Where high delay overhead for adaption.
Indhumathi and Venkatesan (2015) developed a Genetic Algorithm in to deploy Sensor Nodes for the Maximum coverage within
the area, where the sensors are different types. In this work, first analyze the total coverage area of the WSN, identify the types of
Sensor nodes and calculate the coverage sensing distance for the combination of all sensor types based on radius of each node.
Deployments of dynamic nodes are achieving maximum coverage by using genetic Algorithm. Proposed algorithm provides best
performance in coverage and improving network lifetime.
Mahboubi et al. (2017) described a sensor deployment algorithm in the presence of location estimation error, for sensors with non-
identical sensing ranges. It proposes a set of Voronoi-based diagrams, named guaranteed Voronoi diagrams, that guarantee single-
cell-based coverage hole detection algorithms, provided that upper bounds on localization errors are assumed. These localization
errors are affecting the total coverage. So, Deployment algorithm is increasing the network’s coverage in the presence of
localization error. The proposed Algorithm is complex in nature.
Djenouri et al. (2017) described the problem of communication Coverage for sustainable data forwarding in wireless sensor
Networks, where an energy-aware deployment model of relay Nodes is proposed. Considers constrained placement and is different
from the existing one -tiered and two-tiered models. It support two different types of Sensor nodes to be deployed, i) energy rich
nodes, and ii) energy limited nodes. It has some advantage of Proposed heuristic has runtime close to the Integer linear
programming (ILP) while clearly reducing the runtime compared to both ILP and existing heuristics. The author does not
concentrate on the network failure.
Un and Lei (2014) described a light application-orientated placement of actuator nodes (LUOPAN) for wireless sensor/actuator
networks (WSAN) to spread serving obligations amongst actuator nodes (ANs).via suitable placement of ANs and allocation of
serving duties. The device deployment value can be decreased, and the system toughness may be advanced. An energy intake
problem does not deal with this paper.
Sensor localization and obstacle boundary detection algorithm (SLOD)is developed by Das et al. (2013).It proposes a novel
approach for localizing obstacles and sensors nodes using four GPS enabled anchor nodes. Based on four high energy anchor nodes,

©IJRASET (UGC Approved Journal): All Rights are Reserved 1451

 International Journal for Research in Applied Science & Engineering Technology (IJRASET)
ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor :6.887
Volume 5 Issue XII December 2017- Available at www.ijraset.com

sensor localization is done, and an approximate rectangular boundary of each obstacle is detected. It has some advantage of Hostile
deployment area maintaining an acceptable accuracy level.
The greedy algorithm proposed by Abrams et al. (2004).It described a strategy for energy efficient monitoring in Wireless sensor
networks that partitions the sensors into covers, and then activates the covers iteratively in a round-robin fashion. The objective is to
partition the sensors into covers such that the number of covers that include an area, summed over all areas is maximized. It has
some advantages such as Fast, Easy to use and significantly increase the longevity of sensor networks. A delay complexity issue
does not concentrate on this research.

B. Optimization methods for data collection in Wireless Sensor Networks

Wang et al. (2016) discussed a mobile collector, called SenCar to collect data from designated sensors and balance energy
consumptions in the network. It presented a two-step approach for mobile data collection. First, adaptively select a subset of sensor
locations where the SenCar stops to collect data packets in a multi-hop fashion. Developed an adaptive algorithm to search for nodes
based on their energy and guarantee data collection tour length is bounded. Second, focus on designing distributed algorithms to
achieve maximum network utility by adjusting data rates, link scheduling and flow routing that adapts to the spatial-temporal
environmental energy fluctuations. This algorithm close to optimal and that it even beat the best centralized multi-hop routing
strategy. The author only concentrate on reliability but Security issues does not discussed in this research.
Hongchun Li developed a method to discuss relay node deployment with genetic algorithm in(2017).It investigated a relay node
placement problem in such complex environment relay node position optimization to minimize the relay node number and improve
network performance by optimizing route paths of sensor nodes. Heuristic operations for genetic algorithms are proposed to
optimize relay node positions. This proposed algorithm has advantage of Best cost among route paths of all feasible relay nodes.

C. Load Balancing Strategies in node deployment for wireless Sensor Networks

Kacimi and Dhaousand (2010) analyzed multihop transmissions in wireless sensor networks. An analytical model became proposed
to derive the higher bound of the sensor network lifetime, given the surveillance region and a Base station, the wide variety of
sensor nodes deployed and preliminary power of every node. The visitor’s pattern is extraordinarily non uniform, setting an
excessive burden at the sensor nodes close to the bottom station. It has achieved make certain maximum network lifetime by using
balancing the load as equally as viable and it has a few coverage losses.
Goa and Zhang (2004) defined routing algorithms on wi-fi networks that use most effective quick paths, for minimizing latency, and
achieve true load stability, for balancing the strength use. Proposed routing algorithms make routing decisions by only neighborhood
facts and, thus, are extra adaptive to topology changes due to dynamic node insertions or deletions because of mobility. This
algorithm used nearby facts and might deal with dynamic exchange and mobility effectively. Scalability problems does no longer
mentioned in this research.

Title of the work Algorithm/ Optimization Performance Advantage Disadvantage

technique Parameters
Load balanced coverage Greedy Algorithm Packet delivery Maximized network High cost deployment
with Graded node ratio and lifetime lifetime
deployment
Deployment Strategy for Gradient-based routing Coverage Extended network More number of
Multi-Hop WSN algorithm Ratio lifetime redundant nodes

Deployment Algorithms Obstructed Energy Improving the Consuming larger

for Coverage guaranteed additively Consumption prioritized coverage Energy for calculating
Improvement weighted (OGAW) Voronoi error
diagram, Ant Colony
Optimization
Non-Uniform Node Non-uniform distribution Life time waste Energy consumption Unpredictable node
Deployment Strategy ratio ,Life of the network deployment
expectation ratio
On Adaptive Density Autonomous deployment Energy Moderate energy High delay overhead

©IJRASET (UGC Approved Journal): All Rights are Reserved 1452

 International Journal for Research in Applied Science & Engineering Technology (IJRASET)
ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor :6.887
Volume 5 Issue XII December 2017- Available at www.ijraset.com

Deployment to Mitigate algorithm consumption consumption for adaptation

the Sink- Hole Problem
Coverage Deployment Genetic Algorithm Coverage area Best coverage and It has some positional
for Dynamic Nodes network lifetime. error
Deployment Subject to Voronoi-based diagrams Total coverage increasing the Algorithm is complex
Location Estimation ratio network’s coverage in nature
Error
Energy-Aware State-of-the art algorithm Cost value Reducing the runtime Network failed in
Constrained Relay Node presence of fault
Deployment nodes
Optimization Framework Adaptive algorithm, - Algorithm is close to Does not concentrate
for Mobile Data Distributed optimal on security only for
Collection in Energy- Algorithm reliability
Harvesting
Optimization of relay Genetic - Best cost among This network is
node position Algorithm route paths unfeasible relay
locations in
application area
Load-Balancing Shortest path routing, Network lifetime Ensure maximum coverage issue
Strategies Equiproportional network lifetime
Routing,
Heuristic proposition
Load-balanced short-path Greedy algorithm Packet delivery dynamic change and Scalability
routing ratio, Number of better mobility issue
energy node
Set K Cover Algorithms Greedy algorithm - Fast, easy to use Delay and complexity
for Energy Efficient
Monitoring
A Priori methods for Cluster based Periodic, Energy Successful Classification of node
Fault Tolerance Event-driven, Query- consumption transmission failures
(CPEQ) algorithm
Light Utility-Oriented Mixed integer linear - Low deployment cost Consuming additional
Placement of Actuator programming (MILP) and better longevity energy
Nodes Method
Sensor Localization SLOD Algorithm - Maintaining an Less Determination
And detection acceptable accuracy in exposure of
level obstacles

II. CONCLUSION
This Survey Study the range of Optimization techniques in Wireless sensor networks. It further more analyze is the load balancing
Strategies for data collection in WSN and also considers the techniques in WSN to extend the life time of networks.

REFERENCES
[1] S. Liu, ‘A Lifetime-Extending Deployment Strategy for Multi-Hop Wireless Sensor Networks’, Proceedings of the 4th Annual Communication Networks and
Services Research Conference (CNSR), pp.53-60, 2006.
[2] M.Sheik Dawood ,M.Prashanthi A Survey: For Energy Efficient Clustering Routing Protocol Using Mobile Nodes in Wireless Sensor Networks, International
Journal of Advanced Information Science and Technology, 141-146
[3] MSheik Dawood, P Abinaya, MJehosheba Margaret, Improving the Network Lifetime and Energy Conservation using Target Trail in Cluster of Mobile
Sensor Networks,Asian Journal of Research in Social Sciences and Humanities 6 (12), 430-447
[4] Hamid Mahboubi and Fabrice Labeau, ‘Deployment Algorithms for Coverage Improvement in a Network of Mobile Sensors with Measurement Error in the
Presence of Obstacles’, IEEE Sensors, pp.1-4, 2015.

©IJRASET (UGC Approved Journal): All Rights are Reserved 1453

 International Journal for Research in Applied Science & Engineering Technology (IJRASET)
ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor :6.887
Volume 5 Issue XII December 2017- Available at www.ijraset.com

[5] X. Zhang, Z. D. Wu, ‘A Non-Uniform Node Deployment Approach for Event Detection Sensor Networks’, IEEE 29th International Performance Computing
and Communications Conference (IPCCC) 2010, pp.42-49,2010.
[6] Novella Bartolini, Tiziana Calamoneri, Annalisa Massini, Simone sivestri, ‘On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile
sensor Networks’, Journal on mobile networks and applications, vol.16, issue1, pp.134-145, 2011.
[7] S.Indhumathi and D.Venkatesan, ‘Improving Coverage Deployment for Dynamic Nodes using Genetic Algorithm in Wireless Sensor Networks’, Indian Journal
of Science and Technology, vol. 8(16), pp.1-6, 2015.
[8] Hamid Mahboubi, mojtaba vaczi, fabric Labeau, ‘Mobile Sensors Deployment Subject to Location Estimation Error’, IEEE Transaction on Vehicular
Technology, IEEE Transactions on Vehicular Technology, vol. 66, issue 1, pp. 668-678, 2017.
[9] Djamel Djenouri, miloud Bagaa,’Energy-Aware Constrained Relay Node Deployment for Sustainable Wireless Sensor Networks’, IEEE Transaction on
vehicular technology Vol.2, issue1,2017.
[10] Cong wang,Songato guo,yuanywan ,’An Optimization Framework for Mobile Data Collection in Energy-Harvesting Wireless Sensor Networks’,IEEE
transaction on mobile computing, 2016.
[11] Hongchun Li,Chen Ao,Yi Xi,JunTian,Koichirou yamashita,’Relay Node Position Optimization in Complex Environment’, IEEE WCNC,2017.
[12] R. Kacimi, R. Dhaou and A.-L. Beylot, ‘Load-Balancing Strategies for Lifetime Maximizing in Wireless Sensor Networks’, IEEE ICC, 2010.
[13] J.Gao and L. Zhang, ‘Load-Balanced Short-Path Routing in Wireless Networks’, IEEE INFOCOM 2004, pp. 1098-1107, 2004
[14] M.Sheik Dawood, R Abdul Sikkandhar,G.Athisha, Energy Efficient Distance based Clustering Protocol for Wireless Sensor Networks’, IJAER 10 (28), 22090-
22095,2015
[15] M. Kalantari, M. shayman,’ Routing in wireless adhoc networks by analogy to electrostatic theory’, IEEE International Conference, 2004
[16] Z. Abrams, A. Goel and S. Plotkin,’Set k-cover algorithms for energy efficient monitoring in Wireless Sensor Network’, Proc. 3rd International Symposium on
Information Processing in Sensor Networks, pp.424-432,2004
[17] Chi-Un Lci, “Light Utility-Oriented Placement of Actuator Nodes in Sensor/ Actuator Networks”, IEEE international symposium on circuits and system,
pp.2563-2566, 2014.
[18] Tong Liu, Tao GU, Ningjin, Yamin Zhu,’A Mixed Transmission Strategy to Achieve Energy Balancing in Wireless Sensor Networks’, IEEE signals processing
society, 2017.
[19] Suspanth Das, Indrajit Banerjee, Juhina Samanta, ‘Sensor Localization and Obstacle Boundary Detection Algorithm in WSN’, Third international conference
on Advances in computing and communications (ICACC), 2013.
[20] M.Sheik Dawood,G.Athisha, Ayyanar,’ Adaptive Modulation and Coding Techniques for Heterogeneous Mobile Wireless Sensor Networks, IJAER 10
(28), 22051-22057, 2015

©IJRASET (UGC Approved Journal): All Rights are Reserved 1454

View publication stats