Survivability Evaluation in Wireless Sensor Network

Similar documents
A New Virtual Backbone forwireless Ad-Hoc Sensor Networks with Connected Dominating Set

ViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing

The Impact of Clustering on the Average Path Length in Wireless Sensor Networks

Wireless Sensor Networks applications and Protocols- A Review

A REVIEW ON LEACH-BASED HIERARCHICAL ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORK

Geographical Routing Algorithms In Asynchronous Wireless Sensor Network

Optimized Coverage and Efficient Load Balancing Algorithm for WSNs-A Survey P.Gowtham 1, P.Vivek Karthick 2

An Energy-Efficient Hierarchical Routing for Wireless Sensor Networks

Z-SEP: Zonal-Stable Election Protocol for Wireless Sensor Networks

AN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS

Analysis of Cluster-Based Energy-Dynamic Routing Protocols in WSN

An Energy Efficient Intrusion Detection System in MANET.

Study on Wireless Sensor Networks Challenges and Routing Protocols

Dynamic Cooperative Routing (DCR) in Wireless Sensor Networks

DETECTING, DETERMINING AND LOCALIZING MULTIPLE ATTACKS IN WIRELESS SENSOR NETWORK - MALICIOUS NODE DETECTION AND FAULT NODE RECOVERY SYSTEM

Data Gathering for Wireless Sensor Network using PEGASIS Protocol

AN ANTENNA SELECTION FOR MANET NODES AND CLUSTER HEAD GATEWAY IN INTEGRATED MOBILE ADHOC NETWORK

Balanced Load Sharing Protocol for Wireless Sensor Networks

A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks

New Active Caching Method to Guarantee Desired Communication Reliability in Wireless Sensor Networks

Impact of Black Hole and Sink Hole Attacks on Routing Protocols for WSN

Comparison of Energy-Efficient Data Acquisition Techniques in WSN through Spatial Correlation

Novel Cluster Based Routing Protocol in Wireless Sensor Networks

Location Based Energy-Efficient Reliable Routing Protocol for Wireless Sensor Networks

An Energy Efficient Clustering in Wireless Sensor Networks

Research Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless Sensor Networks

A Review on Improving Packet Analysis in Wireless Sensor Network using Bit Rate Classifier

There into, Ei : Residual energy of each node in I round; Er : average energy of rest nodes in I round;

A Non_Ack Routing Protocol in Ad-hoc Wireless Sensor Networks

A METHOD FOR DETECTING FALSE POSITIVE AND FALSE NEGATIVE ATTACKS USING SIMULATION MODELS IN STATISTICAL EN- ROUTE FILTERING BASED WSNS

References. The vision of ambient intelligence. The missing component...

Wireless Sensor Networks: Clustering, Routing, Localization, Time Synchronization

Delay Performance of Multi-hop Wireless Sensor Networks With Mobile Sinks

IJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 2, April-May, 2013 ISSN:

Review on Packet Forwarding using AOMDV and LEACH Algorithm for Wireless Networks

Hierarchical Routing Algorithm to Improve the Performance of Wireless Sensor Network

Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network

Redundancy Effect on Fault Tolerancein Wireless Sensor Networks

CSMA based Medium Access Control for Wireless Sensor Network

Network Survivability Performance Evaluation with Applications in WDM Networks with Wavelength Conversion

An Adaptive Self-Organization Protocol for Wireless Sensor Networks

Comparison of TDMA based Routing Protocols for Wireless Sensor Networks-A Survey

A ROUTING OPTIMIZATION AND DATA AGGREGATION SCHEME BASED ON RF TARANG MODULE IN WSN

IMPROVING WIRELESS SENSOR NETWORK LIFESPAN THROUGH ENERGY EFFICIENT ALGORITHMS

Part I. Wireless Communication

Survey on Reliability Control Using CLR Method with Tour Planning Mechanism in WSN

A deployment procedure for wireless sensor networks

SUMMERY, CONCLUSIONS AND FUTURE WORK

Minimum Overlapping Layers and Its Variant for Prolonging Network Lifetime in PMRC-based Wireless Sensor Networks

Energy Efficient Clustering Protocol for Wireless Sensor Network

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

A Review on Routing Protocols For Wireless Sensor Network

Heterogeneous LEACH Protocol for Wireless Sensor Networks

Mobile Agent Driven Time Synchronized Energy Efficient WSN

Lecture 8 Wireless Sensor Networks: Overview

WIRELESS Multimedia Sensor Networks (WMSNs) is a

Tree Based Energy and Congestion Aware Routing Protocol for Wireless Sensor Networks

Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees

MultiHop Routing for Delay Minimization in WSN

A New Approach for Interference Aware Cost Effective Routing Algorithm in Wireless Sensor Network

genetic algorithm is proposed for optimizing coverage and network lifetime. Another powerful heuristics is Particle Swarm Optimization (PSO). Both GA

CASER Protocol Using DCFN Mechanism in Wireless Sensor Network

Wireless Sensor Networks CS742

FUZZY LOGIC APPROACH TO IMPROVING STABLE ELECTION PROTOCOL FOR CLUSTERED HETEROGENEOUS WIRELESS SENSOR NETWORKS

A Mobile-Sink Based Distributed Energy-Efficient Clustering Algorithm for WSNs

A Fault Tolerant Approach for WSN Chain Based Routing Protocols

International Journal of Innovative Research in Advanced Engineering (IJIRAE) ISSN: Issue 2, Volume 2 (February 2015)

SCH-BASED LEACH ALGORITHM TO ENHANCE THE NETWORK LIFE TIME IN WIRELESS SENSOR NETWORK (WSN)

Defending Against Resource Depletion Attacks in Wireless Sensor Networks

Energy Aware Node Placement Algorithm for Wireless Sensor Network

WSN Routing Protocols

Developing Energy-Efficient Topologies and Routing for Wireless Sensor Networks

End-To-End Delay Optimization in Wireless Sensor Network (WSN)

ESAR: An Energy Saving Ad Hoc Routing Algorithm for MANET

QoS and System Capacity Optimization in WiMAX Multi-hop Relay Using Flexible Tiered Control Technique

Energy Efficient Routing Using Sleep Scheduling and Clustering Approach for Wireless Sensor Network

Reservation Packet Medium Access Control for Wireless Sensor Networks

Link Lifetime Prediction in Mobile Ad-Hoc Network Using Curve Fitting Method

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET

An Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol

Relay Nodes in Wireless Sensor Networks: A Survey. Ataul Bari

Introduction to Mobile Ad hoc Networks (MANETs)

Modulation-Aware Energy Balancing in Hierarchical Wireless Sensor Networks 1

COMPARISON OF ENERGY EFFICIENT DATA TRANSMISSION APPROACHES FOR FLAT WIRELESS SENSOR NETWORKS

Presenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks

AN ENERGY EFFICIENT AND RELIABLE TWO TIER ROUTING PROTOCOL FOR TOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS

A Delay Aware Routing Protocol for Wireless Sensor Networks

CROSS LAYER PROTOCOL (APTEEN) USING WSN FOR REAL TIME APPLICATION

Ad hoc and Sensor Networks Chapter 1: Motivation & Applications. Holger Karl

Time Synchronization in Wireless Sensor Networks: CCTS

A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks

Multi-metrics based Congestion Control protocol in Wireless Sensor Network

Impact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks

An Industrial Employee Development Application Protocol Using Wireless Sensor Networks

ALL ABOUT DATA AGGREGATION IN WIRELESS SENSOR NETWORKS

II. CLASSIFICATION OF ROUTING PROTOCOLS MANET routing protocols are classified into three major categories: proactive, reactive and hybrid.

An Efficient Data-Centric Routing Approach for Wireless Sensor Networks using Edrina

Energy Efficient Data Gathering For Throughput Maximization with Multicast Protocol In Wireless Sensor Networks

IMPACT OF PACKET SIZE ON THE PERFORMANCE OF IEEE FOR WIRELESS SENSOR NETWORK

and coverage as the nodes can act both as clients and routers. In this paper, the clients are distributed using four different

Transcription:

2011 3rd International Conference on Advanced Management Science IPEDR vol.19 (2011) (2011) IACSIT Press, Singapore Survivability Evaluation in Wireless Sensor Network Vahid Mavaji 1, Bahareh Abbasi 2 Department Of Computer Engineering, Sharif University of Technology, Tehran, Iran 1 mavaji@alum.sharif.edu 2 b_abbasi@alum.sharif.edu Abstract. Wireless Sensor Network (WSN) has the potential to gather information and send it to a base station. These networks are unattended and have the ability to work in military and civil applications. Wireless sensor nodes are combining the wireless communication infrastructure with the sensing technology. Instead of transmitting the perceived data to the control center through wired links, ad hoc communication methods are utilized, and data packets are transmitted using multi-hop connections. The survivability performance of WSN networks is an important issue. Network survivability is defined as the ability of a network to maintain or restore an acceptable level of performance in the event of deterministic or random failures. We perceive that packet loss, packet delay and network lifetime are integral components of WSN survivability. Therefore, we propose a composite model for survivability performance evaluation of WSN that consists of these parameters. Simulation results are used to validate the proposed model. The simulation results agree very well with the model. Keywords: Wireless Sensor Network, Network lifetime, Survivability. 1. Introduction Information gathering is a fast growing and challenging field in today s world of computing. Sensors provide a cheap and easy solution to these applications especially in the inhospitable and low-maintenance areas where conventional approaches prove to be very costly. Sensors are tiny devices that are capable of gathering physical information like heat, light or motion of an object or environment. Sensors are deployed in an ad-hoc manner in the area of interest to monitor events and gather data about the environment. Networking of these unattended sensors is expected to have significant impact on the efficiency of many military and civil applications, such as combat field surveillance, security and disaster management. Sensors in such systems are typically disposable and expected to last until their energy drains. The selforganization feature of sensors makes it feasible to deploy them randomly over the region being observed. Without needing a previous exploration, sensors might be installed to the environment in a random way, like dropping them from an aircraft. In this manner, a large number of sensor nodes are spread over the environment without having a prior knowledge of where each sensor is being placed individually. Therefore, energy is a very scarce resource for such sensor systems and has to be managed wisely in order to extend the life of the sensors for the duration of a particular mission. How long the system can survive, and how much quality of service it can offer in presence of failure are major concerns in high performance dependable communication and information systems. Because of the critical and important applications of wireless sensor network, it is necessary to know how long the network can fulfill its missions and the survivability performance of the networks is an important issue. Network survivability is defined as the ability of a network to maintain or restore an acceptable level of performance in the event of deterministic or random failures [9]. Sensor nodes have a short transmission range due to their limited radio capabilities. Therefore, the data must be relayed using intermediate nodes towards the sink. In addition, it may be more advantageous to use a multi-hop path to the 212

sink node consisting of shorter links rather than using a single long connection. There are some questions like: how long the network perform tasks? How can the network deal with the nodes failure? And what is the effect of loss and delay to overall network performance. These questions can be answered using the proposed WSN survivability model in this paper. The main focus of this work is to propose a composite model to evaluate wireless sensor network survivability in the presence of different failures scenarios. We consider link failure, node failure and power failure and evaluate the network survivability in the presence of these failure scenarios. In our proposed model, we consider the effect of packet loss, packet delay and network lifetime on the survivability of the network. Simulation results are used to validate the proposed model. The results from simulation agree very well with the model. The model can be used during the design stages of a network to ensure that the network is capable of handling the user traffic in the presence of certain failures. In the next section, we explain different failure scenarios in WSN. In section 3, we present our proposed composite survivability performance evaluation model. Description of the simulation environment and analysis of the experimental results can be found in section 5. Finally section 6 concludes the paper and discusses our future research plan. 2. Failure scenarios in WSN Information system survivability is defined as the capability of a system to fulfill its mission, in a timely manner, in the presence of attacks, failures, or accidents [2]. Network survivability is defined as the ability of a network to maintain or restore an acceptable level of performance in the event of deterministic or random failures [9]. Survivability is a property of a system, subsystem, equipment, process, or procedure that provides a defined degree of assurance that the named entity will continue to function during and after a natural or man-made disturbances. A survivable sensor network must deliver its data in a timely manner in the presence of failures. If there is a node or link failure, data will be routed using alternative routes to minimize data loss. Consider a simple wireless sensor network shown in Fig. 1, which consists of two cells, cell A and cell B. We use A1 and A2 to represent the mobile terminals in cell A but not in cell B, B1 and B2 to represent the mobile terminals in cell B but not in cell A, and we use C1, C2 and C3 to represent the mobile terminals that are in the intersection area of cells A and B. It is worthwhile to point out that the notion of a cell is used in the sense that the mobile terminals in each cell are able to communicate with each other, while mobiles in different cells cannot directly communicate with each other due to either transmission range limits or physical obstacles between the cells. In this case, C1, C2 and C3 may act as routers for A1. There are different failure scenarios that should be considered in the model: Node, link and power failures. [5]: Fig. 1: A simple sensor network with two cells Node failures: The failures in an end-to-end connection may be caused by the unavailability of the routers, due to the mobility of terminals in the intersection region of the cells A and B. In Fig. 1, if mobile station C1 moves out of the intersection region, a router failure occurs on the path between A1 and B1. When this happens, the routing task between these two terminals may be switched to another mobile in the intersection region (C2 or C3 in our case). When no router is available, the connection between A1 and B1 fails. 213

Power failures: Power failures are caused by the limited battery life in mobile stations. A router may be incapable of performing the routing task either due to insufficient power, or due to its desire to reserve energy for later use. In such cases, the terminals in A and B will need to switch to another router. Link failures: Link failures are introduced by either obstacle between nodes, known as the slow fading effect, or by excessive noise in the wireless link. Under the occurrence of a link failure, the communication between terminals in cells A and B may either be routed through another node, or interrupted for a while until the link recovers, depending on the nature of the failure and the service requirement of the communication task. From the failure domain viewpoint, failures can be classified as value failures, where the value of the delivered service does not comply with the specification, and timing failures, where the timing of the service delivery does not comply with the specification [6, 8]. For the ad hoc network, a failure in the communication link may lead to both packet losses, which is value failure, and excessive end-to-end delay, which is a timing failure. 3. Network Survivability Evaluation Model As discussed in section 2, three failure scenarios should be considered in wireless sensor networks. As a result of these failures, we could have packet loss and packet delay in the network. We want to measure the impact of these parameters on the overall network performance and survivability. We define two parameters for loss. Packet Loss Due To Failure (PLDF) and Packet Loss Due To Delay (PLDD). We define the total loss in the network as the summation of these two losses: Total Loss = LDF+LDD (1) As the failure rate in the network increases, the loss and the network delay will increase and the network survivability will decrease. In addition to the two loss parameters that are important in wireless networks, the network lifetime is also a vital parameter in sensor network. Network Lifetime is a function of both remaining energy and failure rate in the networks. The network lifetime is defined as the time when the first node dies or runs out of energy [3]. Network lifetime can be defined as a function of energy and network failure rate; the energy is also very dependent on nodes and the remained energy of individual batteries. We show the relationship between network lifetime with network energy and network failure rate as follows: Network Lifetime=f (Energy, Network failure rate) (2) Therefore, we can increase the nodes and network lifetime by increasing the network remaining energy or decreasing the energy consumption in the network and network failure impacts. An efficient and energy aware routing algorithm can improve the energy consumption of the network [2]. In our proposed WSN survivability model, we consider network lifetime (NL), network delay (ND) and packet drop probability as a composite parameter. Using the above definitions, we find the sensor network survivability as follows: = f ( NL, ND, PDP) and 1 1 (3) α NL, α, α. ND PDP Network survivability is a function of time and has direct proportion with network lifetime and reverse proportion with network delay and packet drop probability. If we represent the total percent of network loss in the network as L, which is a fraction between zero and one, and the averaged value of packets delay over time as D, then survivability of the network is: NetworkLifetime (4) We define β as: S = ( 1 L) Nomi nal networklifetime β = ( 1 L) And α as: Network Lifetime α = (5) NoΜinal Network Lifetime We call α as network lifetime index. Nominal network lifetime is determined with no limitation on nodes failure and it means that when calculating the NNL we suppose that all nodes are ok and no failure has occurred. Network lifetime is a practical lifetime that is influenced by nodes failure and losses in turn. That 214

can cause some nodes become failed and loss in network will increase. Now we can summarize the survivability formula as: S = β *α It is easy to understand that network lifetime is smaller than nominal network lifetime and α is smaller than 1. We supposed earlier that L is also a number between zero and one and the inverse of D is also a number smaller that one. Therefore the multiplication of α and β is a number between zero and one i.e. 0 < S < 1. So with calculating this parameter in any given sensor network, we can find the survivability of the network. We use simulations to validate our proposed model and the results agree very well with the model. 4. Simulations Our simulations go step by step with simulating the effect of nodes failures and network delay on network lifetime and then on the survivability of network. For this purpose we used WSNsim.2 [6] which is an object oriented event driven simulator specially designed for wireless sensor network simulations. We compare network survivability of two routing protocols using simulation; both are used in wireless sensor network infrastructure. Connected Dominating Set is designed in [7] and BT a virtual infrastructure for wireless sensor network with multi hop clustering and balanced traffic [2]. Network Lifetime with 5% failure time 400 250 100 0 50 100 150 200 250 300 number of nodes Fig. 2: Impact of node failure on network lifetime As shown in Fig. 2 as the number of dead node increases, the network lifetime decreases. Network Loss Due to 10% Node Failure (PLDF) 1 0.6 0.4 0.2 0 0 50 100 150 200 250 number of nodes Fig.3: Effect of node failure rate on packet loss As the failure rate increases in the network, a large number of nodes stop working and several routes are no more available for routing from source to destination. As a result, longer routes are selected and network loss increases. Average Network Lifetime 450 400 350 300 250 200 0 0.02 0.04 0.06 P k t L P b bilit Fig. 4: Packet loss rate or packet drop probability impact on average network lifetime Increasing packet loss in the network will cause lower rate of data that traverse across the network. Therefore, small numbers of nodes are working and overall network lifetime increases. However this doesn't yield good effect on survivability, because survivability of the network decreases when data loss increases. 215

We can conclude that we must separate losses-due-to-failure and losses-due-to-low-lifetime as is shown in Fig. 4. S urv iva bi l it y 1 0.9 0.7 surviva bilit y 0.6 0.5 0.4 0.3 0.2 0.1 0 0.1 0.2 0.3 0.4 0.5 0.6 a=nl /ENL 0.7 0.9 0.9 1 10.1 0.2 0. 3 0.4 0. 5 0.6 0. 7 b= 1-los s Fig. 5: Network survivability formula simulations with network lifetime index and network total loss. As shown in Fig. 5, network survivability is increased with increasing network lifetime index and decreased when the network loss increases. 5. Conclusion and future works In Wireless Sensor Networks, the lifetime, packet loss and packet delay are important factors that should be considered in a composite manner. We proposed a model to evaluate the system survivability performance of WSN. 6. References [1] I. Akyldiz, W. Su, Y. Sankarasubramaniam, and E. Cayiroici. A survey on Sensor Network. IEEE Communications Magazine. 2002, 40(8): 102-114. [2] R. Azarderakhsh, A.H. Jahangir. A virtaual Infrastructure for Wireless Sensor Network. Proc. of 13 th ICEE2005 Conference on Iranian Electrical Engineering. 2005. [3] K. Arisha, M. Youssef, M. Younis. Energy-Aware TDMA-Based MAC for Sensor Networks. IEEE Workshop on Integrated Management of Power Aware Communications, Computing and Networking (IMPACCT 2002). 2002. [4] M. Keshtgary, A. Al-Zahrani, P. Jayasumana and A.H. Jahangir. Network Survivability Performance Evaluation with Applications in WDM Networks with Wavelength Conversion. Proc. of 29th IEEE Conffrtnrce on local computer networks. tampafl, 2004, pp. 344-355. [5] Keshtgary, M. and A. H. Jahangir. Survivable Network Systems: An overview. Fourth IEEE Information Survivability Workshops (ISW 2001/2002). Vancouver, Canada. 2002 [6] M. Younis, M. Youssef, K. Arisha. Energy-Aware Routing in Cluster-Based Sensor Networks. Proc. of 10 th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS2002). 2002. [7] J. Wu and H. Li. On calculating connected dominating sets for efficient routing ad hoc wireless networks. Proc. of DialM 99. 1999, pp. 7 14. [8] W. Du, et al. A Key Management Scheme for Wireless Sensor Networks Using Deployment Knowledge. Proc. of IEEE INFOCOM. 2004. [9] Shi, J. and Foneska, J. P. Traffic-Based Survivability Analysisof Telecommunications Networks. Proc. of IEEE Globecom 95. 1995, pp. 936-940. 216