Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.

com Volume 2, Issue 3, May June 2013 ISSN 2278-6856

Increasing Network Lifetime using Traffic Balancing in Link State Routing Protocol for WSN
D.V.Kamble1, S.V.Sankpal2,
1&2

Electronics & Telecommunication Department, D.Y.Patil coe Kolhapur

Abstract: In wireless sensor networks where nodes operate

on limited battery energy, the efficient utilization of the energy is very important. Operating on limited battery capacity causes the use of energy-efficient routing protocols. The objective of such protocols is to minimize the total amount of energy consumed by the network in forwarding a packet between any pair of nodes. Routing packet on the same path for multihop WSN causes reduction of energy of the sensor nodes which are present in that path. To solve this problem load balanced routing is proposed. In this scheme packets are forwarded on different paths instead of using same path. Considering load balanced routing we derived optimal routing configuration that maximizes network lifetime. The selection of routes is depends on the quality of links that joins two nodes. Therefore, the weightage of links i.e. proportion of utilization is considered. It takes into account the wasted energy due to idle listening, overhearing, and retransmissions. This scheme causes significant improvement in network lifetime. In future we can use this routing scheme for event driven or on demand applications.[5] Index TermsEnergy conservation, load balancing, performance analysis, routing, wireless sensor networks (WSNs).

destination. Therefore, message routing is an important topic. Routing in WSNs can be divided into flat-based routing, hierarchical-based routing, and location-based routing depending on the network structure. Furthermore, these protocols can be classified into multipath-based, querybased, negotiation-based, QoS-based, or coherent-based routing techniques depending on the protocol operation. In addition to the above, routing protocols can be classified into three categories namely, proactive, reactive and hybrid protocols depending on how the source finds a route to the destination. In proactive protocols, all routes are computed before they are really needed, while in reactive protocols, routes are computed on demand. Hybrid protocols use a combination of these two ideas[7]

2. PRESENT THEORY & PRACTICES:

To minimize the energy consumption in WSNs, several energy-efficient Medium Access Control (MAC) protocols and energy efficient routing protocols have been proposed. These schemes aim at decreasing the energy consumption by using sleep schedules. The key idea behind this concept is completely turning off some parts of the sensor circuitry (e.g., microprocessor, memory, and radio) when it does not receive or transmit data, instead of keeping the sensor node in the idle mode. This scheme simply attempts to reduce wasted energy due to idle listening, i.e., lost energy while listening to receive possible traffic that is not sent. To do so, wake-up scheduling schemes at the MAC layer to activate sleeping nodes when needed. Event-to-sink reliable transport for wireless sensor networks gives the solution for reducing energy consumption based on congestion control. These mechanisms aim at achieving further energy conservation by reducing the energy wastage resulting from the frequently occurring collisions in WSNs. Although there is significant energy savings achieved by such schemes based on the sleep schedules, the WSN keeps sending redundant data. Typically, WSNs rely on the cooperative effort of the densely deployed sensor nodes to report detected events. As a result, multiple sensor nodes may report the same event. To further decrease energy consumption, a MAC scheme is proposed that eliminates the transmission of useless redundant information by profiting from the spatial correlation between nodes. [8] Page 95

1. INTRODUCTION:
WIRELESS SENSOR NETWORKS The wireless sensor networks have been studied extensively in the recent years. There are many different applications for such networks including military, environment monitoring, agriculture, transportation control, disaster, fire fighting and protection, and home applications. The sensors can communicate to each other through wireless links, and most of the times they use radio frequency channels for the purpose of communication. Since the sensors operate on the battery power, it is very important to make efficient use of energy of sensors to increase the lifetime of the network. The network lifetime is the time for the first node in the Wireless Sensor Network (WSN) to fail. Various coding techniques and routing techniques has been developed for minimizing the energy consumption at nodes. A distributed network has multiple nodes and services many messages, and each node is a shared resource, many decisions must be made. There may be multiple paths from the source to the Volume 2, Issue 3 May June 2013

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
The Host Spanning Trees(HST) protocol uses flooding to select the shortest path in terms of the hop count. This technique may lead to the use of slow and unreliable links. The Expected Transmission Count (ETX) protocol alleviates this issue since it takes into account the quality of the wireless links in the routing operation. Typically, each link in the network is assigned an ETX cost metric to indicate its quality. The energy efficiency of these protocols can considerably be affected if the traffic is far from being uniformly distributed in the network. Typically, these protocols aim at minimizing the energy consumed by each sensor node subject to a given traffic load for handling. However, there has been little focus on how traffic is balanced throughout multihop WSNs and how it impacts the network lifetime. Using the minimum total energy (MTE) routing, i.e., always routing through the path with the minimum energy consumption, will quickly deplete the energy of the sensor nodes contained therein. To address this problem, energy consumption is balanced by routing packets among multiple paths[1] The limited energy resources in WSN influence how communication must be performed. To improve the life time of the network there are variety of methods. In this dissertation it is proposed to design a protocol to balance the traffic in WSN to enhance the network life-time. This can be achieved by sending the traffic through multiple paths instead of single path. An analytical solution will be designed for total energy consumption by applying different weights to the path. A simulation model will be designed to verify the results.

0.012

0.01

0.008

0.006

0.004

0.002

5 6 Ring Nodes

Fig- Average energy consumption for each ring node.

Ring Topology 0.14 etx balance Routing 0.12

0.1

0.08

0.06

0.04

0.02

3. PERFORMANCE EVALUATION :
Building on these results, we provide the optimal routing configuration that maximizes the network lifetime using simple illustration networks. The results are derived by using both analytical & simulation approaches. In our study, we use the hop based spanning trees (HST) & expected transmission count(ETX) as baselines to which the balanced routing can be compared. Specially HST protocol uses flooding to select the shortest path in terms of the hop count. The ETX protocol uses for quality of the wireless links in the routing operations. The wireless model will be devised on following assumption.Number of nodes - 10 for ring topology. 1) Transmission Range 12m 2) Carrier sensing range 24m 3) Packet length 30 bytes

8 10 12 14 Traffic rate per node (A)

16

18

20

Fig- Comparison of the energy consumption between our balanced routing scheme and the basic schemes (ETX and HST) in the ring topology.
0.06

0.05

0.04

0.03

0.02

0.01

0 -0.2

0.2

4) IFQ length 65 packets 5) Initial energy per node 1J

0.4 0.6 Weight

0.8

1.2

Fig-Maximum sensor node consumption as a function of weight w.

4. RESULTS:
In our scheme, we can consider ring as well as bus topology. But here we have consider ring topology.. Actual ResultsVolume 2, Issue 3 May June 2013 Page 96

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
Star Topology 0.35 etx balance Routing

0.3

0.25

0.2

0.15

0.1

0.05

10 12 14 Traffic rate per node (A)

16

18

20

Fig- Comparison of the energy consumption between our balanced routing scheme and the basic schemes (ETX and HST) in the bus/star topology.

5. MESHED NETWORK TOPOLOGYFig shows the results provided when using the basic routing schemes and the balanced routing scheme. We can observe that the routes used in balanced routing are more spread out than those used in basic routing. The balanced routing benefits from the total available energy resource in the network, whereas the basic schemes use only a small subset of the sensor nodes energies. The network lifetime obtained by our scheme is 3193 s, which is more than twice as long as that of the basic schemes, which is 1551 s. This is a typical example of the gain introduced by the balanced routing, which avoids energy wastage due to useless nodes, i.e., sensor nodes that are not completely used before the network death, even if they still have available energy in their batteries

[C]

6. CONCLUSIONOperated on limited battery capacity imposes the use of energy-efficient protocols. Such protocols minimize the total amount of energy consumed by the network in forwarding a packet between any pair of nodes. To achieve this, we have proposed a load-balanced routing scheme which better fits in WSN,compared with on the fly routing scheme of continuous monitoring applications. Future research directions will be the adaption of our preconfigured routing scheme to handle event-driven or on-demand reporting applications.

REFERENCE :
[1] Fatma Bouabdallah, Nizar Bouabdallah, and Raouf BoutabaOn Balancing Energy Consumption in Wireless Sensor Networks IEEE Trans. On vehicular Technology, Vol. 58, No. 6, July 2009 [2] O.B.Akan and I.F.Akyildiz, Event-to-sink reliable transport for wireless Sensor networks, IEEE/ACM Trans. Netw., vol. 13, no. 5, pp10031016, Oct. 2005. [3] F. Bouabdallah, N. Bouabdallah, and R. Boutaba, Towards reliable and efficient reporting in wireless sensor networks, IEEE Trans. MobileComput., vol. 7, no.8, pp. 978994, Aug. 2008. [4] H. Kwon, T. H. Kim, S. Choi, and B. G. Lee, A cross-layer strategy for Energy efficient reliable delivery in wireless sensor networks, IEEETrans. Wireless Commun., vol. 5, no. 12, pp. 36893699, Dec. 2006. [5] C. K. Toh, Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks, IEEE Commun. Mag., vol. 39,no. 6, pp. 138147, Jun. [6] W. Ye, J. Heidemann, and D. Estrin, Medium access control with coordinated adaptive sleeping for Page 97

[A]

[B]

Volume 2, Issue 3 May June 2013

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
wireless sensor networks, IEEE/ACM Trans. Netw., vol. 12, no. 3, pp. 493506, Jun. 2004. [7] G.Bianchi, Performance analysis of the IEEE 802.11 distributed coordina function,IEEE J sel Areas Commun .vol 18,no.3,pp.535-547, Mar2000 . [8] X. Shi and G. Stromberg, SyncWUF: An ultra lowpower MAC protocol for wireless sensor networks, IEEE Trans. Mobile Comput., vol. 6, no. 1,pp.115 125,Jan. 2007. [9] S. Singh and C. S. Raghavendra, PAMASPower aware multi-access protocol with signaling for ad hoc networks, ACM Comput. Commun. Rev., vol. 28, no. 3, pp. 526, Jul. 1998. [10] R. C. Shah and H. M. Rabaey, Energy aware routing for low energy ad hoc sensor networks, in Proc. IEEE WCNC. Orlando, FL, Mar. 2002,pp. 350355. [11] J. Chang and L. Tassiulas, Maximum lifetime routing in wireless sensor networks, IEEE/ACM Trans. Netw., vol. 12, no. 4, pp. 609619, Aug. 15, 2004. [12] C. F. Chiasserini andM. Garetto, An analytical model for wireless sensor networks with sleeping nodes, IEEE Trans. Mobile Comput., vol. 5, no. 12, pp. 17061718, Dec. 2006. [13] C. E. Perkins and E. M. Royer, Ad-hoc on demand distance vector routing, in Proc. WMCSA, 1999, pp. 90100.

Volume 2, Issue 3 May June 2013

Page 98