SlideShare uma empresa Scribd logo
1 de 4
International Journal of Computational Engineering Research||Vol, 03||Issue, 6||
www.ijceronline.com ||June ||2013|| Page 11
Local Maximum Lifetime Algorithms For Strong K-Barrier
Darshan R V1
, Manjunath C R2
, Nagaraj G S3
,
1
M.Tech, School of Engineering and Technology, JAIN University
2
Asst Prof, School of Engineering and Technology, JAIN University
3
Assoc Prof, RVCE, VTU
I. INTRODUCTION:
The main applications of wireless sensors involves movement detection, such as when deploying
sensors along international borders to become aware of illegal intrusion, around a chemical factory to identify
the spread of lethal chemicals, on both sides of a gas pipeline to detect potential damages, etc. barrier coverage,
which guarantees that every movement crossing a barrier of sensors will be detected, which is known to be an
appropriate model of coverage for such applications [1]. Chen et al. [2] devised a centralized algorithm to find
out whether a region is k-barrier covered, and resulting the critical conditions for weak barrier coverage in a
randomly deployment sensor network. But the centralized algorithm could acquire high communication
overhead and computation cost on large sensor networks, and conditions for strong barrier coverage remain an
open problem. Liu et al[3]., first discussed the strong barrier coverage problem. They map the strong barrier
coverage as a discrete bond percolation model and derive the conditions of having multiple disjoint sensor
barriers.
Figure 1: Weak coverage and Strong coverage.
In Figure 1, it illustrates [3] the difference between strong barrier coverage and weak barrier coverage.
In the top figure, the network has weak barrier coverage for all orthogonal crossing paths (dashed paths).
However, there is an uncovered path (solid path) through the region. The bottom figure shows an example of
strong barrier coverage where no intruders can cross the region undetected, no matter how they choose their
crossing paths. The barrier is highlighted using shaded sensing areas.
ABSTRACT
Barrier coverage of wireless sensor networks are been studied intensively in recent years
under the assumption that sensors are deployed uniformly at random in a large area. In this paper a
new network construction method of sensor nodes for Border Security Systems is proposed. This
Barrier coverage are known to be a appropriate model of coverage for sensor barriers to detect
intruders moving along restricted crossing paths, which is achieved by barriers of sensors. A Border
Security System watches intruders by using sensor nodes with communication function. The detection
of some intruders and the use of a long-term operation system are required in this system. This paper
suggests a new Divide-and-Conquer scheme. Based on it, a new local maximal lifetime algorithm can
be designed and following protocol for strong k- barrier with coordinated sensors. By computer
simulation, we try to show that the proposed barrier coverage network construction methods are
suitable for Border Security Systems and reduce the power consumption of the whole network system
by effective control of sensor nodes.
KEYWORDS: barrier coverage, data fusion, local algorithm, security, wireless sensor network;
Local Maximum Lifetime Algorithms…
www.ijceronline.com ||June ||2013|| Page 12
In [3], they proposed a critical condition for weak barrier coverage. But conditions for strong barrier coverage
remain an open problem. In [5-8], detection coverage models have been suggested based on different event
scenarios and detection techniques. In [8], Yang and Qiao first induced the detection coverage model into
barrier coverage and theoretically analyzed the constraints between data fusion algorithm and coverage regions.
By considering the above reasons, this paper talks about the setbacks of constructing strong k- barrier based on
detection coverage model. We consider neighboring sensors can cooperate in surveillance by data fusion.
In particular, our contributions are as follows:
 First work is the problem of constructing strong k- barrier based on detection coverage model and data fusion.
 Second to formalize a coordinated detection coverage model, where the data fusion rule is described by a
general function f(x).
 Third is to analyze the influencing factors of barrier coverage lifetime, and transfer it to a multi-objective
optimization problem.
 And fourth to introduce a new Divide-and-Conquer scheme to design a new local maximal lifetime algorithm.
II. EARLIER METHODOLOGY:
The local barrier coverage algorithms that been introduced in [1, 2, 3, 4, 5, 6, 8] have introduced the
centralized algorithms. One of algorithms for local barrier coverage, called RIS (Random independent sleeping
algorithm). This algorithm is based on a power saving method, in which the sensor nodes are scheduled and
switch between two modes, Active and Sleep. RIS provides weak barrier coverage with the high probability of
intrusion detection, in such a way that each sensor, in certain periods, selects Active or Sleep mode, with a
predetermined probability rate, P. The presented method will be based on the power saving method, used by
RIS. However, the modes considered in sensor nodes have been changed to Active and Passive modes. It must
be noticed that RIS does not guarantee the barrier coverage, deterministically. Initially global active scheduling
algorithms are not achievable in a large scale sensor network. Second, [1] proved that one sensor cannot locally
determines whether the surveillance field is k-barrier covered or not.
2.1.Traditional Activity of Scheduling Strategy
One traditional method is to start the nodes with highest left energy [1,2,3,4], which can avoid the
nodes with less left energy died too early and prolong the barrier coverage lifetime. Yet there usually exists the
situation that the horizontal projection of above-mentioned nodes is relative small, i.e. the count of active nodes
is not optimal. The other method is to activate the least nodes by greedy algorithms [8][9]. The nodes in suitable
location can been activated frequently and died untimely, which affect the sensor network connectivity, and
further shorten barrier coverage lifetime.
2.2. Proposed work:
The main problem to be solved includes providing a k-barrier graph which creates and describes k-
barrier coverage in a barrier area. As a result, all paths crossing through the barrier area are covered k-times, by
the network sensors. The proposed method consists:
2.3.Modeling Maximum Barrier Coverage Lifetime
An effective sensor activity scheduling should tradeoff the count of nodes in a cover set, their left
energy and consumed energy in one cycle. As a result, maximum of barrier coverage lifetime essentially is a
multi objective optimization problem. We can form the problem as three minimizing objectives and one
maximization objective, i.e. minimizing the count of active nodes ,minimizing the total energy used in one
cycle, minimizing the ratio of an active node’s consumed energy in one cycle and its left energy, the
maximizing minimum ratio of an active node’s left energy and its initialized energy. The n nodes only can
switch between active state and sleep state, and the active nodes whose count is less than n can make up not less
than k-disjoint barrier, n and k are constraints.
2.4.k-CLBCS Algorithm
In this paper, it suggests a global k-CLBCS algorithm for constructing Local k-Barrier with
Coordinated Sensors, the main idea of k-CLBCS algorithm is described as follows:
step1: Calculate every edge’s capacity, and construct the coverage graph G(N);
step2: Search k disjoint paths from s to t in the G(N);
step3: If the k disjoint paths are found, return the nodes ID that should be activated to form k-barrier, otherwise,
return constructing failure.
Local Maximum Lifetime Algorithms…
www.ijceronline.com ||June ||2013|| Page 13
2.5.k-SBCCS Protocol
Based on the overlapped divide-and-conquer scheme and k- CLBCS algorithm, we propose a practical
protocol. A sink and n sensors are assumed in the rectangle belt, at the beginning, all sensors are active. The
main idea of k-SBCCS Protocol (Protocol of Strong k-Barrier Coverage with Coordinated Sensors) is described
as follows:
step1: Sink divide the belt region into v equal-width sub-regions, and broadcast the value of (width of each sub
region),(width of overlapped strip)and v(equal width sub-regions).
step2: Every node calculates which sub-region it belongs to, judge if it is located in the overlapped strip, and
reports its information to the sensor which have highest energy.
step3:In each sub-region, the sensor who has the highest energy runs k- CLBCS algorithm .If k disjoint barriers
are found, it activates these sensors, otherwise, it reports the failure information to sink.
step4: The activated sensor who has the highest energy in every overlapped strip checks if the overlapped strip
is strong k-barrier covered or not. If it found the overlapped strip not strong k-barrier covered, some other nodes
will be activated to form strong k-barrier coverage in the overlapped strips. If all live sensors in the overlapped
strip can’t form strong k-barrier, the above sensor reports the failure information to sink.
step5: Repeat step3 and step4 until all sensors die.
III. RESULTS:
The advantage of this divide-and-conquer over centralized approach is:
 Lower communication overhead and computation costs. By dividing the large network area into small
segments, the message delay, communication overhead, and computation cost can be significantly reduced.
The location and sensing area information of a sensor node only need to be broadcast within the strip
segment (or within the thin vertical strip) where the node is located, resulting in a smaller delay and
communication overhead compared to the whole network broadcasting.
 Improved robustness of the barrier coverage. In a centralized approach which constructs global
horizontal barriers for the whole strip, a horizontal sensor barrier could be broken if some nodes on the
barrier fail, or become compromised or displaced by adversaries. In our divide-and-conquer approach, the
original strip is divided into segments by interleaving vertical barriers. In case of node failure, these vertical
barriers act as firewalls" that prevent intruders from moving from its current segment to adjacent segments.
This limits the barrier damages within the local segment and hence improving the robustness of the barrier
coverage .improving the robustness of the barrier coverage.
 Strengthened local barrier coverage. By dividing the original strip into small segments and computing
barriers in each segment, a larger number of local horizontal barriers will be found in each segment than for
the whole strip. These local barriers are not necessarily part of the global barriers for the whole strip, whose
number remains unchanged. Since adjacent segments are blocked by interleaving vertical barriers, a larger
number of local barriers results in strengthened local barrier coverage for each segment.
IV. CONCLUSION
In this paper, we introduce a k-barrier coverage protocol, called k-SBCCS, for prolonging the network
lifetime. The proposed protocol tries to prolong the network lifetime by establishing a balance in using nodes
energies. The proposed protocol maximum lifetime scheduling for strong k- barrier coverage based on detection
coverage model, which is more appropriate for intrusion detection scenarios. we transfer maximal barrier
coverage lifetime to a multi objective optimization problem, and model the evaluation function as the capacity
of coverage graph.Moreover, based on the enhanced coverage graph, we propose k- CLBCS algorithm of
maximum network lifetime. Theoretical proof shows that the activated nodes by in every overlapped strip can
form k-barrier. At last, we design a new Divide-and-Conquer scheme and k- SBCCS protocol for strong k-
barrier with coordinated sensors.
REFERENCES:
[1] T. H. Lai, and A. Arora, “Barrier coverage with wireless sensors, ”Proc. ACM International Conference on Mobile Computing
and Networking(Mobicom 05), ACM,Aug.2005,pp.284
[2] A.Chen,S. Kumar, and T. H. Lai, “Local barrier coverage in wireless sensor networks”. IEEE Transactions on Mobile
Computing. vol.9, pp.491-504, April 2010
[3] B. Liu, O. Dousse, J. Wang, and A. Saipulla, “Strong barrier coverage of wireless sensor networks,” Proc. ACM International
Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 08), ACM, May.2008, pp.411-420
[4] A.Saipulla, B.Liu, G.Xing, X.Fu, and J.Wang, “Barrier coverage with sensors of limited mobility” Proc. ACM International
Symposium on Mobile Ad Hoc Networking and computing (MobiHoc10), ACM, Sep.2010, pp.201-210
Local Maximum Lifetime Algorithms…
www.ijceronline.com ||June ||2013|| Page 14
[5] N.Ahmed, S.S.Kanhere, and S.Jha, "Probabilistic coverage in wireless sensor networks". Proc.IEEE Conference on Local
Computer Networks (LCN 05), IEEE Press, Nov.2005,pp. 672–681
[6] M.Hefeeda, H.Ahmadi," A probabilistic coverage protocol for wireless sensor networks". Proc. IEEE International Conference
on Network Protocols (ICNP 07), IEEE Press, Oct. 2007, pp. 1–10
[7] B.Wang, K.C.Chua, V.Srinivasan, and W.Wang," Information coverage in randomly deployed wireless sensor networks". IEEE
Transactions on Wireless Communications, vol.6,pp.2994–3004,August 2007
[8] G.Yang, G.Qiao, "Barrier information coverage with wireless sensors" Proc.IEEE Conference on Computer Communications
(Infocom 09), IEEE Press,Apr.2009, pp. 918-926
[9] J.He, H.Shi, “Finding barriers with minimum number of sensors in wireless sensor networks” Proc. IEEE International
Conference on Communications(ICC 10), IEEE Press,May.2010,pp. 1-5
[10] W.Choi, S.K.Das. “Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor
networks” Computer Communications. Vol. 29, pp.3476–3482, November 2006
[11] G.Xing, X.Wang, and Y.Zhang,“Integrated coverage and connectivity configuration for energy conservation in sensor networks”.
ACM Transactions on Sensor Networks, vol.1,pp. 36 – 72, August 2005

Mais conteúdo relacionado

Mais procurados

Energy Efficient Modeling of Wireless Sensor Networks using Random Graph Theory
Energy Efficient Modeling of Wireless Sensor Networks using Random Graph TheoryEnergy Efficient Modeling of Wireless Sensor Networks using Random Graph Theory
Energy Efficient Modeling of Wireless Sensor Networks using Random Graph Theoryidescitation
 
ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...
ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...
ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...IJCNCJournal
 
Greedy – based Heuristic for OSC problems in Wireless Sensor Networks
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksGreedy – based Heuristic for OSC problems in Wireless Sensor Networks
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksIJMER
 
IRJET- Load Optimization with Coverage and Connectivity for Wireless Sensor N...
IRJET- Load Optimization with Coverage and Connectivity for Wireless Sensor N...IRJET- Load Optimization with Coverage and Connectivity for Wireless Sensor N...
IRJET- Load Optimization with Coverage and Connectivity for Wireless Sensor N...IRJET Journal
 
Energy Conservation in Wireless Sensor Networks Using Cluster-Based Approach
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachEnergy Conservation in Wireless Sensor Networks Using Cluster-Based Approach
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
 
Vol 8 No 1 - December 2013
Vol 8 No 1 - December 2013Vol 8 No 1 - December 2013
Vol 8 No 1 - December 2013ijcsbi
 
Distributed vertex cover
Distributed vertex coverDistributed vertex cover
Distributed vertex coverIJCNCJournal
 
Security based Clock Synchronization technique in Wireless Sensor Network for...
Security based Clock Synchronization technique in Wireless Sensor Network for...Security based Clock Synchronization technique in Wireless Sensor Network for...
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
 
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
 
On improvement of performance for transport protocol using sectoring sche
On improvement of performance for transport protocol using sectoring scheOn improvement of performance for transport protocol using sectoring sche
On improvement of performance for transport protocol using sectoring scheIAEME Publication
 
Energy efficient approach based on evolutionary algorithm for coverage contro...
Energy efficient approach based on evolutionary algorithm for coverage contro...Energy efficient approach based on evolutionary algorithm for coverage contro...
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
 
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
 
The shadowing propagation model
The shadowing propagation modelThe shadowing propagation model
The shadowing propagation modelijwmn
 
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
 

Mais procurados (16)

Energy Efficient Modeling of Wireless Sensor Networks using Random Graph Theory
Energy Efficient Modeling of Wireless Sensor Networks using Random Graph TheoryEnergy Efficient Modeling of Wireless Sensor Networks using Random Graph Theory
Energy Efficient Modeling of Wireless Sensor Networks using Random Graph Theory
 
ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...
ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...
ENHANCED PARTICLE SWARM OPTIMIZATION FOR EFFECTIVE RELAY NODES DEPLOYMENT IN ...
 
50120130406028 2
50120130406028 250120130406028 2
50120130406028 2
 
Greedy – based Heuristic for OSC problems in Wireless Sensor Networks
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksGreedy – based Heuristic for OSC problems in Wireless Sensor Networks
Greedy – based Heuristic for OSC problems in Wireless Sensor Networks
 
IRJET- Load Optimization with Coverage and Connectivity for Wireless Sensor N...
IRJET- Load Optimization with Coverage and Connectivity for Wireless Sensor N...IRJET- Load Optimization with Coverage and Connectivity for Wireless Sensor N...
IRJET- Load Optimization with Coverage and Connectivity for Wireless Sensor N...
 
Energy Conservation in Wireless Sensor Networks Using Cluster-Based Approach
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachEnergy Conservation in Wireless Sensor Networks Using Cluster-Based Approach
Energy Conservation in Wireless Sensor Networks Using Cluster-Based Approach
 
I04503075078
I04503075078I04503075078
I04503075078
 
Vol 8 No 1 - December 2013
Vol 8 No 1 - December 2013Vol 8 No 1 - December 2013
Vol 8 No 1 - December 2013
 
Distributed vertex cover
Distributed vertex coverDistributed vertex cover
Distributed vertex cover
 
Security based Clock Synchronization technique in Wireless Sensor Network for...
Security based Clock Synchronization technique in Wireless Sensor Network for...Security based Clock Synchronization technique in Wireless Sensor Network for...
Security based Clock Synchronization technique in Wireless Sensor Network for...
 
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
 
On improvement of performance for transport protocol using sectoring sche
On improvement of performance for transport protocol using sectoring scheOn improvement of performance for transport protocol using sectoring sche
On improvement of performance for transport protocol using sectoring sche
 
Energy efficient approach based on evolutionary algorithm for coverage contro...
Energy efficient approach based on evolutionary algorithm for coverage contro...Energy efficient approach based on evolutionary algorithm for coverage contro...
Energy efficient approach based on evolutionary algorithm for coverage contro...
 
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...
 
The shadowing propagation model
The shadowing propagation modelThe shadowing propagation model
The shadowing propagation model
 
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...
 

Destaque

Brochure brugakker 5516 te zeist
Brochure brugakker 5516 te zeistBrochure brugakker 5516 te zeist
Brochure brugakker 5516 te zeistWoningadviseurs
 
Especial astronomia
Especial astronomiaEspecial astronomia
Especial astronomiaISIDRAGUZMAN
 
Estudio de la ribera del río henares
Estudio de la ribera del río henaresEstudio de la ribera del río henares
Estudio de la ribera del río henaresISIDRAGUZMAN
 
Práctica separación de mezclas
Práctica separación de mezclasPráctica separación de mezclas
Práctica separación de mezclasISIDRAGUZMAN
 

Destaque (7)

LES-Singapore Presentation 11 11-09(f)
LES-Singapore Presentation 11 11-09(f)LES-Singapore Presentation 11 11-09(f)
LES-Singapore Presentation 11 11-09(f)
 
Prescottdigitrans
PrescottdigitransPrescottdigitrans
Prescottdigitrans
 
Brochure brugakker 5516 te zeist
Brochure brugakker 5516 te zeistBrochure brugakker 5516 te zeist
Brochure brugakker 5516 te zeist
 
Especial astronomia
Especial astronomiaEspecial astronomia
Especial astronomia
 
Estudio de la ribera del río henares
Estudio de la ribera del río henaresEstudio de la ribera del río henares
Estudio de la ribera del río henares
 
Práctica separación de mezclas
Práctica separación de mezclasPráctica separación de mezclas
Práctica separación de mezclas
 
Curso huerto
Curso huertoCurso huerto
Curso huerto
 

Semelhante a C0361011014

Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Editor IJARCET
 
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Editor IJARCET
 
Extending network lifetime of wireless sensor
Extending network lifetime of wireless sensorExtending network lifetime of wireless sensor
Extending network lifetime of wireless sensorIJCNCJournal
 
Estimating coverage holes and enhancing coverage in mixed sensor networks or
Estimating coverage holes and enhancing coverage in mixed sensor networks orEstimating coverage holes and enhancing coverage in mixed sensor networks or
Estimating coverage holes and enhancing coverage in mixed sensor networks ormarwaeng
 
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORK
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKAN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORK
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
 
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problem
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage ProblemHigh-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problem
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problemijasuc
 
Scenarios of Lifetime Extension Algorithms for Wireless Ad Hoc Networks
Scenarios of Lifetime Extension Algorithms for Wireless Ad Hoc NetworksScenarios of Lifetime Extension Algorithms for Wireless Ad Hoc Networks
Scenarios of Lifetime Extension Algorithms for Wireless Ad Hoc NetworksIJCNCJournal
 
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
 
Energy Consumption Minimization in WSN using BFO
 Energy Consumption Minimization in WSN using BFO Energy Consumption Minimization in WSN using BFO
Energy Consumption Minimization in WSN using BFOrahulmonikasharma
 
Wireless Sensor Network: Topology Issues
Wireless Sensor Network: Topology IssuesWireless Sensor Network: Topology Issues
Wireless Sensor Network: Topology Issuesijsrd.com
 
An optimal algorithm for coverage hole healing
An optimal algorithm for coverage hole healingAn optimal algorithm for coverage hole healing
An optimal algorithm for coverage hole healingmarwaeng
 
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...ijwmn
 
Adaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor Network
Adaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor NetworkAdaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor Network
Adaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor NetworkIJCNCJournal
 
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK IJCNCJournal
 
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkNode Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
 
Paper id 28201419
Paper id 28201419Paper id 28201419
Paper id 28201419IJRAT
 
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
 
Energy efficient routing algorithm in wireless sensor networks
Energy efficient routing algorithm in wireless sensor networksEnergy efficient routing algorithm in wireless sensor networks
Energy efficient routing algorithm in wireless sensor networksAlexander Decker
 

Semelhante a C0361011014 (20)

Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107
 
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107
 
Ac36167172
Ac36167172Ac36167172
Ac36167172
 
Extending network lifetime of wireless sensor
Extending network lifetime of wireless sensorExtending network lifetime of wireless sensor
Extending network lifetime of wireless sensor
 
Estimating coverage holes and enhancing coverage in mixed sensor networks or
Estimating coverage holes and enhancing coverage in mixed sensor networks orEstimating coverage holes and enhancing coverage in mixed sensor networks or
Estimating coverage holes and enhancing coverage in mixed sensor networks or
 
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORK
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKAN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORK
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORK
 
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problem
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage ProblemHigh-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problem
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problem
 
Scenarios of Lifetime Extension Algorithms for Wireless Ad Hoc Networks
Scenarios of Lifetime Extension Algorithms for Wireless Ad Hoc NetworksScenarios of Lifetime Extension Algorithms for Wireless Ad Hoc Networks
Scenarios of Lifetime Extension Algorithms for Wireless Ad Hoc Networks
 
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...
 
Energy Consumption Minimization in WSN using BFO
 Energy Consumption Minimization in WSN using BFO Energy Consumption Minimization in WSN using BFO
Energy Consumption Minimization in WSN using BFO
 
Wireless Sensor Network: Topology Issues
Wireless Sensor Network: Topology IssuesWireless Sensor Network: Topology Issues
Wireless Sensor Network: Topology Issues
 
An optimal algorithm for coverage hole healing
An optimal algorithm for coverage hole healingAn optimal algorithm for coverage hole healing
An optimal algorithm for coverage hole healing
 
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...
 
Adaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor Network
Adaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor NetworkAdaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor Network
Adaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor Network
 
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK
 
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkNode Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
 
Paper id 28201419
Paper id 28201419Paper id 28201419
Paper id 28201419
 
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
 
Energy efficient routing algorithm in wireless sensor networks
Energy efficient routing algorithm in wireless sensor networksEnergy efficient routing algorithm in wireless sensor networks
Energy efficient routing algorithm in wireless sensor networks
 
A Systematic Review of Congestion Control in Ad Hoc Network
A Systematic Review of Congestion Control in Ad Hoc NetworkA Systematic Review of Congestion Control in Ad Hoc Network
A Systematic Review of Congestion Control in Ad Hoc Network
 

Último

COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Websitedgelyza
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...Aggregage
 
VoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXVoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXTarek Kalaji
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationIES VE
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IES VE
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Will Schroeder
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
AI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarAI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarPrecisely
 
Machine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfMachine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfAijun Zhang
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAshyamraj55
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesMd Hossain Ali
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6DianaGray10
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfJamie (Taka) Wang
 
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsIgniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsSafe Software
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Brian Pichman
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfDaniel Santiago Silva Capera
 

Último (20)

COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Website
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
 
VoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXVoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBX
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
 
201610817 - edge part1
201610817 - edge part1201610817 - edge part1
201610817 - edge part1
 
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
IESVE Software for Florida Code Compliance Using ASHRAE 90.1-2019
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
AI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarAI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity Webinar
 
Machine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfMachine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdf
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
 
20150722 - AGV
20150722 - AGV20150722 - AGV
20150722 - AGV
 
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsIgniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
 

C0361011014

  • 1. International Journal of Computational Engineering Research||Vol, 03||Issue, 6|| www.ijceronline.com ||June ||2013|| Page 11 Local Maximum Lifetime Algorithms For Strong K-Barrier Darshan R V1 , Manjunath C R2 , Nagaraj G S3 , 1 M.Tech, School of Engineering and Technology, JAIN University 2 Asst Prof, School of Engineering and Technology, JAIN University 3 Assoc Prof, RVCE, VTU I. INTRODUCTION: The main applications of wireless sensors involves movement detection, such as when deploying sensors along international borders to become aware of illegal intrusion, around a chemical factory to identify the spread of lethal chemicals, on both sides of a gas pipeline to detect potential damages, etc. barrier coverage, which guarantees that every movement crossing a barrier of sensors will be detected, which is known to be an appropriate model of coverage for such applications [1]. Chen et al. [2] devised a centralized algorithm to find out whether a region is k-barrier covered, and resulting the critical conditions for weak barrier coverage in a randomly deployment sensor network. But the centralized algorithm could acquire high communication overhead and computation cost on large sensor networks, and conditions for strong barrier coverage remain an open problem. Liu et al[3]., first discussed the strong barrier coverage problem. They map the strong barrier coverage as a discrete bond percolation model and derive the conditions of having multiple disjoint sensor barriers. Figure 1: Weak coverage and Strong coverage. In Figure 1, it illustrates [3] the difference between strong barrier coverage and weak barrier coverage. In the top figure, the network has weak barrier coverage for all orthogonal crossing paths (dashed paths). However, there is an uncovered path (solid path) through the region. The bottom figure shows an example of strong barrier coverage where no intruders can cross the region undetected, no matter how they choose their crossing paths. The barrier is highlighted using shaded sensing areas. ABSTRACT Barrier coverage of wireless sensor networks are been studied intensively in recent years under the assumption that sensors are deployed uniformly at random in a large area. In this paper a new network construction method of sensor nodes for Border Security Systems is proposed. This Barrier coverage are known to be a appropriate model of coverage for sensor barriers to detect intruders moving along restricted crossing paths, which is achieved by barriers of sensors. A Border Security System watches intruders by using sensor nodes with communication function. The detection of some intruders and the use of a long-term operation system are required in this system. This paper suggests a new Divide-and-Conquer scheme. Based on it, a new local maximal lifetime algorithm can be designed and following protocol for strong k- barrier with coordinated sensors. By computer simulation, we try to show that the proposed barrier coverage network construction methods are suitable for Border Security Systems and reduce the power consumption of the whole network system by effective control of sensor nodes. KEYWORDS: barrier coverage, data fusion, local algorithm, security, wireless sensor network;
  • 2. Local Maximum Lifetime Algorithms… www.ijceronline.com ||June ||2013|| Page 12 In [3], they proposed a critical condition for weak barrier coverage. But conditions for strong barrier coverage remain an open problem. In [5-8], detection coverage models have been suggested based on different event scenarios and detection techniques. In [8], Yang and Qiao first induced the detection coverage model into barrier coverage and theoretically analyzed the constraints between data fusion algorithm and coverage regions. By considering the above reasons, this paper talks about the setbacks of constructing strong k- barrier based on detection coverage model. We consider neighboring sensors can cooperate in surveillance by data fusion. In particular, our contributions are as follows:  First work is the problem of constructing strong k- barrier based on detection coverage model and data fusion.  Second to formalize a coordinated detection coverage model, where the data fusion rule is described by a general function f(x).  Third is to analyze the influencing factors of barrier coverage lifetime, and transfer it to a multi-objective optimization problem.  And fourth to introduce a new Divide-and-Conquer scheme to design a new local maximal lifetime algorithm. II. EARLIER METHODOLOGY: The local barrier coverage algorithms that been introduced in [1, 2, 3, 4, 5, 6, 8] have introduced the centralized algorithms. One of algorithms for local barrier coverage, called RIS (Random independent sleeping algorithm). This algorithm is based on a power saving method, in which the sensor nodes are scheduled and switch between two modes, Active and Sleep. RIS provides weak barrier coverage with the high probability of intrusion detection, in such a way that each sensor, in certain periods, selects Active or Sleep mode, with a predetermined probability rate, P. The presented method will be based on the power saving method, used by RIS. However, the modes considered in sensor nodes have been changed to Active and Passive modes. It must be noticed that RIS does not guarantee the barrier coverage, deterministically. Initially global active scheduling algorithms are not achievable in a large scale sensor network. Second, [1] proved that one sensor cannot locally determines whether the surveillance field is k-barrier covered or not. 2.1.Traditional Activity of Scheduling Strategy One traditional method is to start the nodes with highest left energy [1,2,3,4], which can avoid the nodes with less left energy died too early and prolong the barrier coverage lifetime. Yet there usually exists the situation that the horizontal projection of above-mentioned nodes is relative small, i.e. the count of active nodes is not optimal. The other method is to activate the least nodes by greedy algorithms [8][9]. The nodes in suitable location can been activated frequently and died untimely, which affect the sensor network connectivity, and further shorten barrier coverage lifetime. 2.2. Proposed work: The main problem to be solved includes providing a k-barrier graph which creates and describes k- barrier coverage in a barrier area. As a result, all paths crossing through the barrier area are covered k-times, by the network sensors. The proposed method consists: 2.3.Modeling Maximum Barrier Coverage Lifetime An effective sensor activity scheduling should tradeoff the count of nodes in a cover set, their left energy and consumed energy in one cycle. As a result, maximum of barrier coverage lifetime essentially is a multi objective optimization problem. We can form the problem as three minimizing objectives and one maximization objective, i.e. minimizing the count of active nodes ,minimizing the total energy used in one cycle, minimizing the ratio of an active node’s consumed energy in one cycle and its left energy, the maximizing minimum ratio of an active node’s left energy and its initialized energy. The n nodes only can switch between active state and sleep state, and the active nodes whose count is less than n can make up not less than k-disjoint barrier, n and k are constraints. 2.4.k-CLBCS Algorithm In this paper, it suggests a global k-CLBCS algorithm for constructing Local k-Barrier with Coordinated Sensors, the main idea of k-CLBCS algorithm is described as follows: step1: Calculate every edge’s capacity, and construct the coverage graph G(N); step2: Search k disjoint paths from s to t in the G(N); step3: If the k disjoint paths are found, return the nodes ID that should be activated to form k-barrier, otherwise, return constructing failure.
  • 3. Local Maximum Lifetime Algorithms… www.ijceronline.com ||June ||2013|| Page 13 2.5.k-SBCCS Protocol Based on the overlapped divide-and-conquer scheme and k- CLBCS algorithm, we propose a practical protocol. A sink and n sensors are assumed in the rectangle belt, at the beginning, all sensors are active. The main idea of k-SBCCS Protocol (Protocol of Strong k-Barrier Coverage with Coordinated Sensors) is described as follows: step1: Sink divide the belt region into v equal-width sub-regions, and broadcast the value of (width of each sub region),(width of overlapped strip)and v(equal width sub-regions). step2: Every node calculates which sub-region it belongs to, judge if it is located in the overlapped strip, and reports its information to the sensor which have highest energy. step3:In each sub-region, the sensor who has the highest energy runs k- CLBCS algorithm .If k disjoint barriers are found, it activates these sensors, otherwise, it reports the failure information to sink. step4: The activated sensor who has the highest energy in every overlapped strip checks if the overlapped strip is strong k-barrier covered or not. If it found the overlapped strip not strong k-barrier covered, some other nodes will be activated to form strong k-barrier coverage in the overlapped strips. If all live sensors in the overlapped strip can’t form strong k-barrier, the above sensor reports the failure information to sink. step5: Repeat step3 and step4 until all sensors die. III. RESULTS: The advantage of this divide-and-conquer over centralized approach is:  Lower communication overhead and computation costs. By dividing the large network area into small segments, the message delay, communication overhead, and computation cost can be significantly reduced. The location and sensing area information of a sensor node only need to be broadcast within the strip segment (or within the thin vertical strip) where the node is located, resulting in a smaller delay and communication overhead compared to the whole network broadcasting.  Improved robustness of the barrier coverage. In a centralized approach which constructs global horizontal barriers for the whole strip, a horizontal sensor barrier could be broken if some nodes on the barrier fail, or become compromised or displaced by adversaries. In our divide-and-conquer approach, the original strip is divided into segments by interleaving vertical barriers. In case of node failure, these vertical barriers act as firewalls" that prevent intruders from moving from its current segment to adjacent segments. This limits the barrier damages within the local segment and hence improving the robustness of the barrier coverage .improving the robustness of the barrier coverage.  Strengthened local barrier coverage. By dividing the original strip into small segments and computing barriers in each segment, a larger number of local horizontal barriers will be found in each segment than for the whole strip. These local barriers are not necessarily part of the global barriers for the whole strip, whose number remains unchanged. Since adjacent segments are blocked by interleaving vertical barriers, a larger number of local barriers results in strengthened local barrier coverage for each segment. IV. CONCLUSION In this paper, we introduce a k-barrier coverage protocol, called k-SBCCS, for prolonging the network lifetime. The proposed protocol tries to prolong the network lifetime by establishing a balance in using nodes energies. The proposed protocol maximum lifetime scheduling for strong k- barrier coverage based on detection coverage model, which is more appropriate for intrusion detection scenarios. we transfer maximal barrier coverage lifetime to a multi objective optimization problem, and model the evaluation function as the capacity of coverage graph.Moreover, based on the enhanced coverage graph, we propose k- CLBCS algorithm of maximum network lifetime. Theoretical proof shows that the activated nodes by in every overlapped strip can form k-barrier. At last, we design a new Divide-and-Conquer scheme and k- SBCCS protocol for strong k- barrier with coordinated sensors. REFERENCES: [1] T. H. Lai, and A. Arora, “Barrier coverage with wireless sensors, ”Proc. ACM International Conference on Mobile Computing and Networking(Mobicom 05), ACM,Aug.2005,pp.284 [2] A.Chen,S. Kumar, and T. H. Lai, “Local barrier coverage in wireless sensor networks”. IEEE Transactions on Mobile Computing. vol.9, pp.491-504, April 2010 [3] B. Liu, O. Dousse, J. Wang, and A. Saipulla, “Strong barrier coverage of wireless sensor networks,” Proc. ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 08), ACM, May.2008, pp.411-420 [4] A.Saipulla, B.Liu, G.Xing, X.Fu, and J.Wang, “Barrier coverage with sensors of limited mobility” Proc. ACM International Symposium on Mobile Ad Hoc Networking and computing (MobiHoc10), ACM, Sep.2010, pp.201-210
  • 4. Local Maximum Lifetime Algorithms… www.ijceronline.com ||June ||2013|| Page 14 [5] N.Ahmed, S.S.Kanhere, and S.Jha, "Probabilistic coverage in wireless sensor networks". Proc.IEEE Conference on Local Computer Networks (LCN 05), IEEE Press, Nov.2005,pp. 672–681 [6] M.Hefeeda, H.Ahmadi," A probabilistic coverage protocol for wireless sensor networks". Proc. IEEE International Conference on Network Protocols (ICNP 07), IEEE Press, Oct. 2007, pp. 1–10 [7] B.Wang, K.C.Chua, V.Srinivasan, and W.Wang," Information coverage in randomly deployed wireless sensor networks". IEEE Transactions on Wireless Communications, vol.6,pp.2994–3004,August 2007 [8] G.Yang, G.Qiao, "Barrier information coverage with wireless sensors" Proc.IEEE Conference on Computer Communications (Infocom 09), IEEE Press,Apr.2009, pp. 918-926 [9] J.He, H.Shi, “Finding barriers with minimum number of sensors in wireless sensor networks” Proc. IEEE International Conference on Communications(ICC 10), IEEE Press,May.2010,pp. 1-5 [10] W.Choi, S.K.Das. “Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks” Computer Communications. Vol. 29, pp.3476–3482, November 2006 [11] G.Xing, X.Wang, and Y.Zhang,“Integrated coverage and connectivity configuration for energy conservation in sensor networks”. ACM Transactions on Sensor Networks, vol.1,pp. 36 – 72, August 2005