Routing Protocol Based on Link Reliability for WSN - Core

Available online at www.sciencedirect.com

Physics Procedia 33 (2012) 410 – 416

Routing protocol based on Link Reliability for WSN Jing Weipeng, Liu Yaqiu College of Information and Computer Engineering Northeast Forestry University Harbin, China e-mail: [email protected]

Abstract In this paper, defining link reliability strategy constructed by remain energy, and communication cost of nodes as topology weight to synthetically reflect the energy efficiency of dominator, an Energy-radio and communication cost route (ECCR) is proposed to solve the problem that the average energy consumption in cluster and minimum communication cost. We take node residual energy and distance between sink and node to compete cluster head, at the same time, in order to reduce the cluster head energy costs, link reliability and hop is used to establish topology. The experimental results show that the algorithm not only has the energy saved characters, but also ensures the reliability of topology links and extends the network life-cycle efficiently. ©©2012 by Elsevier B.V. Selection and/or peer review under responsibility of ICMPBE International 2011Published Published by Elsevier Ltd. Selection and/or peer-review under responsibility of [name Committee. organizer] Open access under CC BY-NC-ND license. Keywords:Wireless sensor network; Energy cost; communication cost; link reliability

1.

Introduce

As a kind of access to new information and processing mode, wireless sensor network through a large number of deployed in areas of the monitoring sensor node, collect the network coverage of the area of perception object information, through many jump routing communication mode, will collect, process after the information to the end user [1]. WSN in a wide range of applications scene, can be used in the space shuttle coordination control, airport environmental monitoring, intelligent traffic and medical aid field [2]. From WSN routing protocol performance view, the energy limited WSN characteristic and so routing length, low energy consumption, prolong the network lifetime and high reliability become WSN routing protocol for the optimization of the important factor. Some fault-tolerant routing algorithms have been mentioned to save energy consumption in order to improve the network reliability . In [3] the method of clustering is used to construct WSN which Each node take turns as head of the realization of WSN fault tolerance. Through the shake hands in the ensemble to surveillance mechanism of cluster nodes and the head of the head node respectively, the cluster head with the cluster head node using different failure strategy, and improve the system reliability[4].

1875-3892 © 2012 Published by Elsevier B.V. Selection and/or peer review under responsibility of ICMPBE International Committee. Open access under CC BY-NC-ND license. doi:10.1016/j.phpro.2012.05.082

411

Jing Weipeng and Liu Yaqiu / Physics Procedia 33 (2012) 410 – 416

In order to improve reliability, some multipath routing technology have been mentioned. The k heavier path is used between the source node and purpose and the packet is divide into different packet to

E

transmiate[5-6]. By setting parameters k to determine the path of heavy priority, thus completing packet split and packaging. In literature [8], through the network in WSN nodes method of increasing relay, tectonic 2-connected network, making the backbone network has a certain tolerance. But few of the link literature researches on reliability. In literature [9, 10], they take to adjacent cluster head number as a topological construction weights, looking forward to a constant approximate rate based minimum network connected dominating sets, but this method does not consider cluster head of network node energy influence on the performance of the whole, so that there is not high, the energy is not strong reliability of cluster head of communication between head complete function, influence network comprehensive utilization of energy. According to the size of the nodes energy to network between the influence of choice, the literature [11, 12] at the nodes the surplus energy as weights, ensure constant approximation rate at the same time as a priority high-energy node cluster of communication between nodes, and, to some extent, improve the network energy efficiency, but both are ignoring the routing communication costs between clusters, existence of high communication costs of premature failure of the head node limitations In this paper we puts forward Energy-surplus and Communication Cost Clustering router (ECCR) , according to the surplus Energy node and distance of the distance and sink node position to competition cluster head, in between the routing of the reliability of the link establishment rely on cluster method of Communication between party. In energy consumption is not big, improve the reliability of the link communication. 2.

ECCR

2.1 Cluster head In ECCR, we improve cluster head which added positioning device (such as GPS), so the node identifier node _ id is introduced to the WSN. Sink node in the network before the formal work according to the strength of the positioning device get signal established distance identifier node _ length Thus each node can know the distance between itself and sink node. The whole network can be divided into N regions based on node _ length , each sub-area’s identifier is specified as area _ id . The first order of wireless sensor is wireless communication system model depend on [13], calculate the energy consumption of routing protocol, the model is consisted of transmission circuit, power amplifier and receiver circuit. The energy consumption of m bit is: (1) ETx ( m , d ) m E elec m d2 d is the distance between node and cluster, k Eelec is the energy consumption for transmission is the amplifier parameters of amplifier power. circuit or reception circuit The consumption of receiving m bit is: (2) E Rx ( m , d ) m E elec

The residual energy of node i is i Ecurrent

i Ecurrent ETx (m, d ) ERx (m, d )

(3)

412


Suppose the set of N x regional nodes is represented as G x , Gneighber is the set of node i ’s neighbor nodes

i is the current energy of node i Ecurrent

j is remaining energy of any neighbor nodes j Ecurrent

G neighber

Gx

{i}

i Gx

(4)

E aver is average energy among the node i ’s neighbor nodes in region N x m j E current j 1

E aver

m

j

G neighber

(5)

Therefore, the time Head _ Msg for send cluster head stated message of node i is

t

k T

E aver i E current

(6)

Here, k is the value of random distribution, the range is [0,1], T is the specified duration of cluster head selection algorithm. In order to better solve the energy isomerism problem ECCR use the ratio of E current / E aver as the main parameters of nodes compete for cluster head node select the maximum one as its current cluster head. In the ECCR protocol, if a node did not receive any Head _ Msg message from its neighbors before the moment of t , then the node broadcasts Head _ Msg message to neighbors. If a node receive Head _ Msg message from its neighbors before the moment of t , then give up the competition for cluster t, t t ) there may be head. If a neighbor node broadcasts Head _ Msg during the period of (t many nodes compete for cluster head in the same cluster, under the same conditions, according to the formula (8) to select the optimal node as cluster head in this round, the other cluster heads as backup ones. It can be seen from the above description, only a small amount of nodes send Head _ Msg during the process of competing for cluster head. The cost of ECCR protocol’s control message is very small. The aim is to minimize energy consumption in the cluster head selection process. In ECCR protocol, all nodes broadcast per count cycles, the value of count is related with network node failure rate. 2.2 Reliable inter-cluster routing In order to achieve better reliable data transmission in WSN, this paper presents a wireless sensor network inter-cluster routing protocol ECCR based on reliability link. From the perspective of a single node, select the remaining energy, communication cost is small, high reliability as a cluster head node for inter-cluster topology forwarding, it can effectively use the energy resources of each node, which can greatly extend the network topology of the reconstruction time, then it will help to maximize the network life cycle; from the perspective of the entire network, select the link is less costly, high reliability cluster head communication, minimize the number of nodes in a working state, help to reduce the total network energy consumption, easy to extend the network life cycle. Therefore, it is of great significance to improve network life by considering the node residual energy, communications costs and reliability. For the cluster head a and b which can communication directly, Cost (a, b) is used for represent the cost between a, b in cluster node link.

Cost (a, b)

b Einital W b LK (a, b) Ecurrent

(7)

413


Which W is the data power for sending 1 bit by node a; LK ( a, b) is the link quality between a and b. We can obtained the three criteria to measure link quality from reference [14], as the increasing of received signal strength RSSI , the packet received rate is increasing exponentially, and when RSSI at a certain value of RSSI max , Received packet rate reached peak. Therefore, this paper uses RSSI to measure link communication quality. It is RSSI ( a, b) LK ( a, b) . The establishment process of inter-cluster routing path as follows: (1) the target node broadcasts a message to neighbors, start the process of building the path. Information including: source address, destination address, price, number of hops. Cost represents the evaluation and communication cost from the sending node to destination node, initially set to 0; hops represent the average hops from message node to destination node. (2) After receiving the request, the receiving node b computes the link cost between itself and the last hop a on the path to establish the link, and add to the cost of the path setup message. (3) Node a calculates forward probability Pa ,b for each of the next hop node b shown in Equation 8. And add to the forwarding table. It is inversely proportional to the forwarding probability and the energy, here D(a) is represent as the set of next hop neighbor cluster head nodes of node a :

1/ Cost (a, b) 1/ Cost (a, w)

Pa ,b

(8)

w D(a)

(4) If the transmit probability of b and c are close. and be filled

Pa ,b

Pa ,c

min{Pa ,b , Pa.c }

(9) And if the number of hop are different, then the probability of b is reapportioned, instead of the old value in the transmit table. Generally, the number of hop is fewer, the reliability of path is higher, its ability to switch a relay node is stronger. destination node separately.

hb And hc represent the number of hop from b and c to the Panew ,b

hb ( Pa ,b hb hc

Pa ,c ) (10)

Cost (a, D)

h

and the number of hops a from oneself to the Node calculate the new cost destination node by the transmit probability. Then broadcast to the other cluster and make message.

Cost (a, D )

Pa , wCosta , w

(11)

w D(a )

Pa , w hw 1

ha

(12)

w D(a)

After the path is completed, every route node of cluster head will set up a transmit table, which keep the cost and the number of hop from every next hop to D. The maintenance of path is keeping the activity of all paths by form purpose node to source node mostly. 3.

Simulations and Performance Analysis Simulator NS2, the paper use the simulation parameters of the literature [13] in the simulation test: this

414


network consists of 100 sensor nodes with GPS-enabled, the nodes distributed in the area 100m*100m randomly, the sink node is located (50, 75), the distance d< 75m form node to Sink, other parameters shown in table 1, the area of monitor is request coverage 100% Table 1. Simulation parameters parameters

values

parameters

Einital Eelec area _ id

2J

Packet size

50nJ/bit [1,10]

values 1000bit 10pJ/bit/m2

node _ id

[0,99]

The paper is research the performance of ECCR in reliability and consumption. As a result of the similar algorithm select the cluster head, which is compared ECCR and DECDC form three sides. 1

ECCR 0.9

DECDC

0.8

Reliability

0.7 0.6 0.5 0.4 0.3 0.2 0.1

0

0.05

0.1

0.15

0.2

0.25

0.3

0.35

0.4

0.45

0.5

Channel Failure Rate

Figure 1. Reliability of different channel failure 4 ECCR DECDC

3.5

Energy cost

3 2.5 2 1.5 1 0.5 0.5

0.55

Figure 2. Energy cost of cluster heads

0.6

0.65

0.7 0.75 Reliability

0.8

0.85

0.9

(1)Reliability Table 1 shows the actual reliability of DECDC and ECCR. In the case that the probability of failure increase gradually, the network reliability of ECCR is not decline, which due to ECCR using link costs as a reliable basis of inter-cluster route, therefore in case of channel failure, ECCR can get a better communication reliability, so ECCR has a better fault-tolerance. (2)the energy consumption inter-cluster it can control the distribution of cluster head by reason of the location as a basic condition for achieving sub-cluster head for cluster selection. While the selection of cluster head is based on the ratio of the average energy consumption of cluster head and node energy consumption, then can resolve the energy heterogeneity effectively, to achieve balanced energy consumption. And ECCR try to choose the path of low cost to transfer data, which reduced some energy consumption in a certain extent.


From table 2, it is lower in energy consumption in ECCR than DECDC. However, we found that DECDC has a better behavior in the case of the reliability less than 0.6, which is due to the DECDC algorithm has a low complexity use the minimum spanning tree algorithm to chose route path. (3)the ability of failure recovery it is assume that the node of cluster head which in inter-cluster routing lose efficacy in fifty work cycle, then the new work cycle begin, LEACH will not re-elect the new cluster head, and need to flood, build a new path and repair segmentation, while ECCR is also need to flood again in all network owing to using the shortest path tree to build the re-router between the clusters. After the reelection cluster head, ECCR begin to broadcast in local according as the current information. Form table 3, ECCR has a more strong recovery capacity. 1 ECCR DECDC

0.9 0.8

Reliability

0.7 0.6 0.5 0.4 0.3 0.2 0.1 0

1

2

3

4

5

6

7

8

9

10

Rounds

Figure 3. Reliability in suddenly fault occurs

4.

Conclusion

On the basic of analyzing cluster routing of WSN, mining the data relevance of geographical, this paper presents a reliable multi-path routing protocol ECCR, in order to reduce the energy cost of the cluster head node, cluster head build cluster heads topology based on reliability link and number of hops. The way of Multi-hop collects data and forwards to the sink node. Through simulation results show that ECCR protocol has well stability and scalability. In addition, the cluster node scheduling algorithm will be studied in depth of this article. Acknowledgements Supported by the 948 project (2012-4-21), the Ph.D. Programs Foundation of Ministry of Education of China (20100062120008), the Scientific Research Fund of Heilongjiang Provincial Education Department (11553022). References [1]

YAkyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E. A survey on sensor networks. IEEE Communications

Magazine, 2002, 40(8):102~114. [2]

Tilak S, Abughazalen NB, Heinzelman W. A Taxonomy of Wireless Micro sensor Network Models. Mobile

Computing and Communications Review, 2002, 6(2): 28~36. [3]

Zheng Zengwei, Wu Zhaohui, Lin-Huaizong et al. CRAM: an energy efficient routing algorithm for wireless

415

416


sensor network [J]. International Symposium on Computer and Information Science, Antalya, Turkey, 2004 [4]

networks. Journal of Chinese Computer Systems.2007 [5]

341~350.

Jiang He, Wu Zhikun, Zhang Xianchao. A Fault-tolerant Cluster-based Routing Protocol for Wireless Sensor 8(8):1362~1366 (Ch).

C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication

paradigm for sensor networks,” in Proc. Sixth Annual International Conference on Mobile Computing and Networks, 2000. [6]

Nasipuri, S. Das. On-Demand Multipath Routing for Mobile Ad Hoc Networks.//Proceedings of 8th Intl.

Conference on Computer Communications and Networks (IC3N 99), 1999. [7]

Stefan Dulman, Tim Nieberg, Jan Wu. Trade-off between traffic overhead and reliability in multipath routing for

wireless sensor networks. Wireless Communication and Networking, WCNC2003, 2003:1918~1922. [8]

Kashyap A, Khuller S, Shayman M. Relay placement for higher order connectivity in wireless sensor

networks//Proceedings of 25th IEEE International Conference on Computer Communications. Span, 2006:1~12. [9]

Ruan L, Du H W, and Jia X H, et al. A greedy approximation for minimum connected dominating sets [J].

Theoretical Computer Science, 2004, 329(1): 325~330. [10]

Qian J S and Sun Y J. Construction of distributed connected dominating sets in growth-bounded graphs. //

Proceedings of 3th IEEE Conference on Industrial Electronics and Applications, ICIEA 2008, Singapore, Singapore, Jun 3-5 2008: 1430~1434. [11]

Tang Y and Zhou M T. Maximal independent set based distributed algorithm for minimum connected dominating

set [J]. Acta Electronica Sinica, 2007, 35(5): 868~874. [12]

Khaled A, Li X Y, and Wang Y, et al. Geometric spanners for wireless ad hoc networks [J]. IEEE Transactions on

Parallel and Distributed Systems, 2003, 14(4): 408~421. [13] Intanagonwiwat C Govindan R, Estrin D. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking. 2000. 56~67. [14]

Marco Z and Bhaskar K. Analyzing the transitional region in low power wireless links. // Proceedings of 2004

First Annual IEEE Communications Society Conference on Sensor and Ad hoc Communications and Networks, IEEE SECON 2004. Santa Clara, CA, United States. Oct 4-7 2004: 517~526. [15]

Jing Weipeng, Liu Yaqiu. DECDC

An energy-aware route protocol for wireless sensor networks. // Proceedings

of 2nd international Symposium on Systems and Control in Aerospace and Astronautics, 2008.