By,

Basavaraj. K. Madagouda

1SI09SCS003

Internal guide,Mr. A. H. Shanthakumara

Asst Professor, Dept of CSESIT Tumkur

Motivation Objectives Introduction Anycast forwarding and sleep-wake scheduling

policies Simulation and results Conclusion Future Work Research Work

The network lifetime depends on the energy of each node which are deployed in network.

Prolonging network lifetime through the efficient use of energy has been a key issue in the development of wireless sensor networks.

Minimizing delay of the network with anycast packet forwarding policy.

Maximizing lifetime of network with sleep-wake scheduling policy.

Sensor nodes are deployed in remote places. Each node have some fixed amount of energy. Nodes senses information from environment and sends to sink.

Many applications of WSN are Fire detection, Tsunami alarm, Environmental monitoring, military field etc.

Energy is main key in WSN to prolong network lifetime. The main source of energy consumption in WSN are

• For transmission & reception of control packet.• To keep sensor on.• For actual data transmission & reception.• To keep communication radio’s on.

The lifetime of an event-driven sensor networks as consisting of two phases:

1.Configuration phase: Each sensor node uses anycast forwarding policy with control parameters and also executes optimization algorithms.

2.Opertion phase:a. Sleeping sub-phase: Node follow sleep-wake pattern and

waiting for events.b. Event reporting sub-phase: Sub-phase starts when event

occurs. The anycast forwarding protocol is applied using control parameters chosen by configuration phase.

There are three control variables that affect the network lifetime and the end-to-end delay

• Wake-up rates: The sleep-wake schedule is determined by the wake-up rate λj of the Poisson process with which each node j wakes up. If λj increases, the expected one-hop delay will decrease, and the end-to-end delay.

• Forwarding Set: The forwarding set Fi is the set of candidate nodes chosen to forward a packet at node i. The forwarding set should contain nodes that can quickly deliver the packet to the sink.

A = [aij ; i = 1,.....N; j = 1,.....N] where aij = 1 if j is in node i's forwarding set, and aij =0 otherwise.

CONTD….

• Priority: Let bij denote the priority of node j from the viewpoint of node i. The priority assignment of node i, |bi| = (bi1,bi2,……,biN ), where each node j є Ci is assigned a unique number bij from 1,…|Cij| , and bij = 0 for nodes j ≠ Ci.

Anycast Objectives and Performance Metrics

End-to-End Delay

Network Lifetime

CONTD….

Step 1: Node i sorts delays πi of its neighboring nodes.

Step 2: Node i assigns different priorities b*i,j to the neighboring nodes of j1 and

j2 if bi,j1 > bi,j2 , then Dj1 < Dj2 .

Step 3: Let b(k) be the index of neighboring node with priority k, i.e., bi,b(k) = k.

Step 4: Sets k ← Ci , Compute local delay function f value using td, ti, delay of node and awake probability of node.

Step 4:If k > 1 and Delay(k-1) < f – td, then decrease k by one and go back to Step 4.

Step 5:Else algorithm terminates and returns local delay value and optimal forwarding set.

0

Step 1: At iteration h=1, sink node s sets Ds to 0 and other nodes are assigned to ∞.

Step 2: At iteration h, each node runs the Local-Opt algorithm with the input delay πi

(h-1).

Step 3: Using the output of local-Opt algorithm each node i updates the anycast forwarding policy and delay values.

Step 4: If h=N this algorithm terminates and returns each node forwarding set Fi and delay values Di.

Step 5: Else if h< N, h←h+1 then increase the iteration value and goes back to Step 2.

Step 1: Let k=1. Initially, sink s sets T(1) to a half of the maximum possible lifetime and sets T record= 0.

Step 2: Nodes run the Global-Opt algorithm.

Step 3: When Global-Opt algorithm terminates, each node i finds optimal anycast policy and optimal delay value Di. Only nodes j that are not in the other forwarding set other nodes, send feedback of their delay values to sink. And node i, sends feedback of their delay values to sink.

Step 4: Let Dmax is maximum feedback delay value arrived at sink• If Dmax > ξ, then sink s sets T(k+1) = T(k) – T(1)/2k. [Decrease Wake up rates]• If Dmax<ξ, then sink memorizes Trecord=T(k) and sets T(k+1)= T(k)+T(1)/2k.[Increase

Wake up rates]

Step 5: If k = kmax, returns Trecord as solution. Otherwise, increase k by one and go back to Step(2).

8

6

2

07

35

1

49

Node Init. Delay Value

1st Itrtn Delay values

Max Delay value

Forwarding Set

0 ∞ 0.583 1.666 7

1 ∞ 0.119 0.238 6,4

2 ∞ 0.370 1.529 7,8

3 ∞ 0.370 1.529 0

4 ∞ 0.119 0.238 6

5 ∞ 0.221 1.274 4,6

6 ∞ 0.036 0.036 9

7 ∞ 0.294 1.397 5

8 ∞ 0.489 1.690 0,2

9 ∞ 0.000 0.000 0

CONTD….

CONTD….

With the help of anycast packet forwarding scheme of each sensor node, we can minimize the event reporting delay of network from source to sink.

Using optimally controlling parameters of the sleep-wake scheduling policy, we can maximize the network lifetime .

In case with multiple sink nodes, the event reporting packet can be collected by any sink nodes using Global_Opt algorithm and anycast policy.

Title: Localization of sensor nodes with flooding in Wireless sensor network.

Novelty: Localization of sensor nodes with help of anchor nodes by broadcasting the query message. The node which localized is called Virtual anchor node and it helps to localize other sensor nodes in the network.

Paper published at “International Conference Communication, Computation and information technology (ObCom-2011)” in VIT University, Vellore, Tamil Nadu.

\Hyper link doc\313.pdf

[1] J. Kim, X. Lin, N. B. Shroff, and P. Sinha, .On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast,. in Proceedings of IEEE INFOCOM, (Pheonix, AZ), April 2008.

Hyper link doc\Minimizing Delay and Maximizing Lifetime for Wireless Sensor Networks With Any cast.pdf

[2] S. Jain and S. R. Das, .Exploiting Path Diversity in the Link Layer in Wireless Ad Hoc Networks,. in Proc. WoWMoM, pp. 22.30, June 2007.

[3] S. Liu, K.-W. Fan, and P. Sinha, .CMAC: An Energy Efficient MAC Layer Protocol Using Convergent Packet Forwarding for Wireless Sensor Networks,. in Proc. SECON, (San Diego, CA), June 2007.

[4] J. Kim, X. Lin, N. B. Shroff, and P. Sinha, .Minimizing Delay and Maximizing Lifetime for Wireless Sensor Networks with Anycast,. Technical Report, Purdue University, http://web.ics.purdue.edu/.kim309/Kim08tech2.pdf, 2008.

[5] J. Polastre, J. Hill, P. Levis, J. Zhao, D. Culler, and S. Shenker, .A Unifying Link Abstraction for Wireless Sensor Networks,. in Proc. SenSys, pp. 76.89, November 2005.

[6] D. P. Bertsekas, Dynamic Programming and Optimal Control vol. 2. Athena Scientic, 3 ed., 2007.[7] Y. T. Hou, Y. Shi, and H. D. Sherali, .Rate allocation in wireless sensor networks with network

lifetime requirement,. in Proceedings of IEEE/ACM MobiHoc, pp. 67 . 77, 2004.[8] M. Zorzi and R. R. Rao, .Geographic Random Forwarding (GeRaF) for Ad hoc and Sensor

Networks: Multihop Performance,. IEEE transactions on Mobile Computing, vol. 2, pp. 337.348, October 2003.

[9] J. Polastre, J. Hill, and D. Culler, .Versatile Low Power Media Access for Wireless Sensor Networks,. in Proc. SenSys, pp. 95.107, November 2004.

Thank You…