IET-UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007), Dr. M.G.R.

University, Chennai, Tamil Nadu, India. Dec. 20-22, 2007. pp. 908-915.

Self-Healing Antchain for Increasing Lifespan in Wireless Sensor Networks

#

Suraiya Tarannum 1 , V. Anitha 1 , A. G. Priya 1 , Rajeshwari Adrakatti 1 , L. Nalini 1 , K. R. Venugopal 1 , L. M. Patnaik 2

Department of Computer Science and Engineering University Visvesvaraya College of Engineering Bangalore - 560 001 2 Microprocessor Applications Laboratory, Indian Institute of Science, Bangalore - 560 012 ssuraiya@gmail.com
1 1

Abstrast A Wireless Sensor Network (WSN) consists of a large number of randomly deployed sensor nodes. These sensor nodes organize themseleves into a cooperative network and perform the three basic functions of sensing, computations and communications.This paper proposes a at-routing technique for such a network consisting of homogenous nodes. It is an energy-efcient data gathering protocol where sensor nodes in the network form an Antchain. The role of Antchain head and Antchain tail for each data gathering process is scheduled by means of a Time Division Multiple Access technique which ensures uniform depletion of energy among sensor nodes. The real advantage comes to light in the event of the death of a node. The proposed algorithm heals the network in such a way that only one node communicates with the base station at the end of the data gathering process. Simulation results indicate that Self-Healing AntChain performs better than other AntChain systems in terms of network lifetime, average energy consumed and aggregated data delivery ratio, in addition to being a highly fault-tolerant, exible and adaptive system. KeywordsWireless Sensor Network, aggregated data delivery ratio, energy efciency, network lifetime, antchain.

cm in diameter and 1 cm in thickness) [1]. Of the three domains of sensing, computation and communications, a sensor node expends maximum energy in data communications, which involve both data transmission and reception. Hence it becomes important to minimize power consumption for communications in order to have improved performance and hence to increase the lifespan of the network. Sensor nodes are deployed by aerial scattering within the target sensing area. Their absolute position can be determined using a Global Positioning System. WSNs are now being applied to environmental applications like forest-re and ood detection, health applications with bio-sensors implanted in the human body, homeautomation and smart environments. The other applications include environmental control, military applications such as battleeld surveillance, nuclear, biological and chemical attack detection and reconnaissance, motion-monitoring which can be used to detect worn out parts in machines, motors, airplane wings and bridges. WSNs are subjected to resource contraints such as energy, bandwidth, memory and processing ability. Among them, energy is of prime concern since it is severely constrained at the sensor nodes and there is no way it can be replenished because of the sensors being usually deployed in hostile environments. The lifespan of the sensor nodes can be increased by saving the energy consumption of the network. Efcient routing techniques are employed to maximize the lifespan of the sensors by reducing the number of messages in transit and hence the total transmission cost. In the event of a dead node, the network is healed and the ow of messages is continued. The nodes close to the base station (BS) will be depleted of their energy at a faster rate than other sensors because the nearer the sensor is to the BS, the more information it will relay. This is referred to as unbalanced energy consumption problem. Designing algorithms to overcome this problem is a major challenge in WSN. In this paper, we present energy-efcient at-routing algorithms to improve the lifespan of the WSN. The

I. INTRODUCTION A Wireless Sensor Network consists of a large number of ramdomly deployed sensor nodes. Several hundreds to thousands of nodes within tens of feet of each other are deployed throughout the sensor eld. The node densities may be as high as 20 nodes/m3 . These battery powered tiny sensor nodes possess computing, sensing and communicating capabilities. The sensor node components need to t into a matchbox-sized module. The required size may be smaller than even a cubic-centimeter, which is light enough to remain suspended in the air . Sensor nodes are low cost, estimated to be less than a dollar, consume low power (0.5Ah, 1.2V) and operate unattended. The total energy of the sensor node is in the order of 1J. The total average supply currents of the system must be less than 30A to provide a long operating life. Sensor nodes are powered from Lithium coin cells (2.5

908

Self-Healing Antchain for Increasing Lifespan in Wireless Sensor Networks

algorithms are designed so as to increase the network lifetime, reduce energy consumption and build a fault-tolerant system by detecting all the dead nodes in the network, decreasing the number of messages in transit and hence the total transmission cost. The paper is organized as follows: Section II presents the related work while Section III describes the background. Section IV explains our proposed work and Section V describes the performance analysis. Finally, Section VI contains the conclusions. in [8]. Max-Min Ant System is one of the best performing algorithms as a basis of parallel implementation. An architecture to monitor WSN with different levels of details and focus on the design of computing network digests is proposed in [9]. Energy efciency is a key design criterion for these sensor networks. Moreover the communication overhead involved in this architecture is less. Marc et al. [10] have proposed the Quadratic Assignment Problem. This is an optimizing technique designed in order to minimize the sum of products between ows and distances. The Ant System uses ants in order to obtain a solution from a scratch. This uses a heuristic information on the potential quality of a local assignment. A solution is constructed by using both this heuristic information and information provided by previous ants using pheromones. An idea to save energy through extra relay nodes by eliminating geometric deciencies of the topology is proposed in [11]. Knowing the sensing locations, the optimal locations of the relay nodes together with the optimal energy, the network is kept alive during the desired lifetime with minimum energy expenditure. A distributed N-to-1 multipath discovery protocol which distinguishes itself from other multipath routing protocols is proposed in [12]. It is able to nd multiple node-disjoint paths from every sensor node to the base station, simultaneously in one route discovery process. Chin and Tuan [13], have formulated an algorithm called Lagrangian Relaxation Power and Rate Control which achieves relatively higher average system throughput, but with a lower power consumption. These advantages are achieved by lowering the data rates of users exposed to unfavourable channel conditions. Lin and Kwok [14], have proposed a Channel Adaptive Energy Management protocol, that exploits the time varying nature of the wireless link. Specically, it leverages on the synergistically cross-layer interaction between the physical and the MAC layers. Thus, each sensor node can intelligently access the wireless medium according to the current wireless link quality and the predicted trafc load, to realize an efcient utilization of the energy. Simulation results indicate that it can achieve as much as 40% reduction in energy dissipation compared to the traditional protocols without channel adaptation. Different coverage formulations have been proposed in [15], based on the subject to be covered and sensor deployment mechanism as well as on other wireless sensor network properties. In this article, they have presented a recent contribution addressing energy-efcient coverage problems in the context of static wireless sensor networks. Scheduling sensor nodes to alternate between sleep and active modes is an important method to conserve energy resources. Cheng et al. [16], have formulated a constrained multivariable non-linear programming problem to determine both the location of sensor nodes and the data transmission pattern. The two objectives studied are to maximize the network lifetime and to minimize the application-specic total cost, given a nite number of sensor/aggregation nodes

II. RELATED WORK San et al. [2], propose a novel population-based algorithm which was originally designed as an analytical tool. To prove the advantage of their work, they have demostrated the MAX-MIN Ant System as a function of time in two well-known travelling salesman problems. A power efcient algorithm for computing 1-D Fast Fourier Transform over single and multi-hop WSNs is proposed in [3]. This algorithm reduces the number of transmissions, eliminates typical redundant computations in a distributed environment and uniformly maps complex multiplications over all the sensor nodes by introducing an extra bit-complement permutation stage after the rst (log2 N )/2 iterations. The impact of overhearing transmissions on total energy costs data gathering and dissemination is investigated in [4]. An attempt is made to systematically minimize the total energy cost in the network. The minimum energy data gathering technique is modeled as a directed minimum energy spanning tree. Simulation results through augmented cost metric indicate a 10 times increase in energy efciency, without additional hardware and with minimal additional complexity. A routing protocol characterised as a Hybrid Routing Protocol is proposed in [5]. This works on the basis of a virtual cluster, consisting of a collection of only those nodes that are one-hop away. The key feature of this proposed scheme is that it draws one short packet transfer delay of Proactive Routing Protocol and the small control overheads performance of Reactive Routing Protocols. This protocol signicantly reduces the control overheads as well as the ooding time for collecting information of the network topology through route query packets. Prithwish et al. [6] have presented a power-efcient broadcast routing algorithm which effectively exploits the broadcast efciency. This is a heuristic algorithm possessing a property that adaptively assigns transmit energy to each node depending on how densely the nodes are distributed, and has the favourable ability of choosing multiple nodes at the same time. In [7], the radio range adjustment that saves energy considerably, when combined with a topology management scheme is formulated. A relationship deduced between optimal radio range and trafc demostrates that one half of the total power can be saved if the radio range is adjusted appropriately in a linear network. The impact of communications when Ant Colony Optimization algorithm is parallelized for Travelling Salesman Problem using message passing libraries is studied

909

IET-UK International Conference on Information and Communication Technology in Electrical Sciences

in a region with a certain coverage requirement. Their rst study was based on nding optimal placement strategies in a linear network. Through numerical results they have demostrated that the optimal node placement strategies provide a signicant benet over a commonly used uniform placement scheme. Simulation results show that the optimal node placement and data transmission pattern considerably improve the system performance. Son et al. [17], have proposed Geographic Energy Aware Routing algorithm for a sensor network consisting of nodes deployed in highly inaccessible areas. This strategy attempts to balance energy consumption, thereby increasing the network lifetime. The simulation results show that for uneven trafc distributions, it delivers 70 to 80% more packets. For uniform trafc pairs, it delivers 25-35% more packets. A hierarchical architecture for information dissemination is proposed in paper [18], which clusters the nodes according to their position approximations. In the proposed architecture, query messages are broadcast by the sink to every node in the network to eliminate the ooding cost. Data aggregated at the cluster-head are relayed to the sink by intermediate cluster-heads and gateways in a multi-hop fashion. This architecture partitions the WSN into clusters and only one cluster head is selected. Analysis and simulation results illustrate that such an architecture can prolong the network lifetime considerably and is energy efcient. Ding and Liu [19], have proposed the Unidirectional and Bidirectional AntChains. In the former, which is a chain structure, each node transmits data to its neighbour in the same direction during the data gathering process. The last node acts as the chain head and sends data directly to the base station. In the latter, which is an adaptive chain structure, the sensor nodes transmit data to their neighbours in either directions. In the rst round, the operation is similar to that of the uni-direction AntChain algorithm. In the following round, data gathering starts from the end of the chain, transmitting the data to its left-side node until it reaches the chain head which nally reaches the base station. Simulation results have shown that it performs better than many other protocols in terms of energy-efciency, data integrity and network life time, provided the base station is close to the sensor eld. A technique called Embedded Wireless Multicast Advantage is proposed in [20] to reduce the total transmit power of a broadcast routing tree. It is based on the property of a wireless medium employing omnidirectional antennas that exploits its broadcast nature, meaning that a unit of message sent to a receiver at the boundary of the transmission range reaches every node within the range for free. The algorithm using this advantage is called postsweeping. It checks if an incremental increase in transmission power of a node can result in removal of other transmitting nodes, leading to a net reduction of the total transmission power. It reduces the total transmit, receive and interference power and the number of hops, but at the cost of reducing the network lifetime. Chin and Bok [21], have proposed the Power Cost Calculate Balance Protocol. The basic idea is to utilize the local multicast mechanism and the energy-boundary to select the route. This optimizes power utilization and improves the transmitting ratio. It is a source-initiated, on-demand routing protocol. Compared with the minimum node energy in any other route, the minimum node energy in the minimum power limitation route has more energy. The value of that energy is the maximum of all minimum node energies, in all selectable routes. It decreases the average relaying load for each node and thus increases the lifetime of most nodes. At the same time, it updates the route using power-boundary as a metric, which can prevent nodes from being unwisely depleted of their enegies. This ensures that the time until the rst node powers down is extended considerably, thus increasing the operation time before the network is partitioned. Du [22] proposes an energy-efcient routing protocol for Mobile Ad-hoc Networks. As only a few nodes are involved in routing, routing overhead is reduced and so also the energy. Here the entire routing area is divided into several equal sized small square cells. The routing protocol selects the node with the maximum energy in one cell to forward the packet, which increases the lifetime of the whole network. Simulation results have shown that it exhibits better throughput and good scalability. Directed ooding which is a fault-tolerant and an energy efcient routing protocol for WSN, is proposed in paper [23]. The energy consumption is decreased and hence the level of fault-tolerance is increased. This is done by sending data in a specic aperture instead of broadcasting with wisely chosen virtual aperture size. It performs the routing task with an acceptable overhead, while consuming low amount of energy per node. Han et al. [24] propose Wireless Sensor Actor Networks which include resource-unconstrained nodes. The actors make decisions and deal with gusty events and are heterogenous in nature. Actors transform the common at achitecture into a layered one to decrease the overhead of the sensors close to the sink. The communication is transformed into two layers. Actors communicate with other actors and the sink directly. The sensors communicate with other sensors and with the actors. The actor is at the center of the network and sensors transmit information to the actor. Actors are movable and when an actor nds that the sensors around it has little energy, it can voluntarily move to a new place where its neighbour sensors have more energy. Li and Prasum [25] have designed a framework for evaluating the performance of topology control algorithms using overall network throughput, and total energy consumption per packet delivered, as the metrics. It is found that link layer retransmissions are essential with topology control to avoid throughput degradation due to increase in the number of hops in lightly loaded networks. In heavily loaded networks, the throughput can be improved by a factor upto k 2 , where k is the average factor of reduction, in the transmission range using topology control. Improvements of upto k 4 can be obtained using topology control. Prototype sensor networking platform and its associated development environment is described in [26]. The system

910

Self-Healing Antchain for Increasing Lifespan in Wireless Sensor Networks

consists of sensor hardware, the Contiki OS and a communication stack. The OS for sensor devices are TinyOS, Contiki which are based on event based concurrency model. Contiki provides pre-emptive multi-threading for applications that specically require it. It is designed to be portable across a wide range of different platforms. The communication stack includes an adaptive energy efcient MAC protocol and TCP/IP layer. Lin et al.[27] have presented a simple static multi-path routing, that is optimal in the large system limit. Possible approaches for a distributed computation of the optimal policy is outlined along with heuristics to build the set of pre-computed paths. The simulations verify that the static scheme outperforms leading dynamic routing algorithms and is close to optimal, when the energy claimed by each packet is relatively small compared to the battery capacity. The energy replenishment rate can vary from time to time even though overall process is stationary. The average energy replenishment rate depends on three factors. Firstly, nodes where heterogenous energy distribution is allowed across the network. Secondly, where different classes of packets can have different energy requirement for the nodes along the path. Lastly, path where it is assumed that the energy requirement can be different depending on a nodes neighbour. III. BACKGROUND AND MODEL Our energy model assumes that every node in the network is equipped with an omnidirectional antenna. The transmission power required to reach a node at a distance d is proportional to d where the proportionality constant is the path loss factor that satises 2 4 and is assumed to be 2 for free space. For simplicity of notation, we assume the receiver sensitivity threshold as 1 (0 dB). The metrics used for comparison are: N etwork lif etime: It is dened as the time taken for the rst node in the network to be completely depleted of its energy (dead node). Average Energy Consumption: It is the amount of energy consumed by the nodes in the network after a stipulated amount of time. Aggregated Data Delivery Ratio: It is dened as the number of messages delivered to the destination with respect to the sent data messages. Average N umber of M essages: It measures the average number of messages used to perform data gathering. Antchain Operation T ime: It is dened as the time taken for the last node in the network to be completely depleted of its energy. In our work, we assume an energy model where the radio dissipates Eelec = 50nJ/bit to run the transmitter or receiver circuitry and Eamp = 100 pJ/bit/m2 for the transmit amplier to achieve an acceptable Eb/N0 ratio. We also assume an r2 energy loss due to channel transmissions. The model is described by the following set of equations. ET x (k, d) = ET xelec (k) + ET xamp (k, d) ET x (k, d) = Eelec k + Eamp k d2 (1) (2) and to receive this message, the radio expends ERx (k) = ERxelec (k) ERx (k) = Eelec k (3) (4)

For these parameters, receiving a message is not a low cost operation; the protocols should thus try to minimize not only the transmit distances but also the number of transmit and receive operations for each message. The size of the network packet is assumed to be 336 kbits in all our computations. IV. PROBLEM DEFINITION We denote a wireless sensor network as a weighted directed graph GW SN = (N, A) with a set of N nodes and a set A of directed edges (links), A = (i, j). The sensor nodes are labeled with node IDs 1, 2, ...., |N |. The objectives of our algorithm is to: increase the network lifetime of the wireless sensor network. reduce the energy consumption in the sensor nodes. build a fault-tolerant system. increase the scalability of the sensor network. reduce unbalanced energy consumption problem in the network. A. Assumptions The following are the assumptions made for the WSN consisting of a large number of sensors : The sensors are uniformly placed and each of them are equidistant from the base station. The physical ID of sensors are consecutive. The nodes are static after deployment. The nodes have limited energy and the base station has unlimited energy. Base station is xed, farther from the place where the sensor nodes are deployed and not located in the sensor eld. Chain tail consumes more energy for transmission than other nodes in the network due to the bigger aggregated packet length transmitted. Each of the the nodes in the network, are equipped with a Global Positioning System. B. Algorithm Recursive-Bidirection is a at-routing algorithm consisting of n homogenous nodes equipped with the same amount of energy. In the rst iteration of operation, the data gathering process starts from the rst node (node 1) which acts as the chain head and sends its data to the next node (node 2). This process continues sequentially until the last node n is reached. The last node acts as the chain tail and sends the aggregated data to the base station directly. In the second iteration, node n acts as the chain head and node 1 acts as the chain tail, the data gathering process being similar to the rst iteration.

911

IET-UK International Conference on Information and Communication Technology in Electrical Sciences

BS

TABLE I R ECURSIVE -BI DIRECTION A NTCHAIN (RBI)

0 ........ 1 ........ p1 CH

p ..................... q1 DN

q ..................... n1 DN CT

CH Chain Head CT Chain Tail DN Dead Node BS Base Sation

Fig. 1. Recursive-BIdirection operation in the event of the occurrence of dead nodes.

In the event that only a few nodes in the network die, say p and q, several UniAntchains are formed as shown in Figure 1. (i) The rst UniAntchain is formed with node 1 as the chain head and node p 1 as the chain tail and sends the aggregated data to the base station. (ii) In a similar manner, several UniAntchains are formed between nodes p + 1 to q 1 and from q + 1 to n. This process continues until the last node in the network is completed depleted of its energy (dead node). Recursive-BIdirection Antchain (RBI) is represented by an edge-weighted graph given by Gwsn (N, E, BS) where N is the number of sensor nodes, E is the energy of the nodes and BS is the base station. The protocol steps are described in Table 1. Intially all the n nodes are furnished with equal amounts of energy Ei . There are two kinds of iterations for the transmission of the messages-Forward Direction (FD) and Reverse Direction (RD). In the FD, the chain head being node 1, receives a message M from the BS. The data gathering process starts from this node (i in each iteration) and the data is sent to the next node (i + 1) and this continues until the last node is reached. The aggregated message nally reaches the BS. Similar to FD, in RD the chain head being node n, receives a message from the BS. The data gathering process starts from this node (i in each iteration) and sends it to the next node. This continues till the last node, which nally sends the data to the BS. Self-Healing AntChain (SHANTCHAIN) is also a atrouting algorithm consisting of n homogeneous nodes, with all nodes equipped with equal amounts of energy.

RBI(Gwsn (N, E, BS)) begin n = N umof N odes; for (i = 1 to n) // Energy initialization begin Ei = E; end msgKind = F D; switch(msgKind) begin case FD : begin init = 1; send(M, init); //Send message to chain head for i = init to n begin AggregateData(M, i); send(M, i + 1); end msgKind = RD; // Reverse Direction send(M, BS); end case RD : begin init = n; send(M, init); //Send message to chain tail for i = n to 1 begin AggregateData(M, i); send(M, i - 1); end msgKind = F D; // Forward Direction send(M, BS); end end end

BS

1 .................... p1 CH

p ..................... q

q+1 .................. n1 ..... 0 CT

CH Chain Head CT Chain Tail BS Base Station

Fig. 2. SHANTCHAIN in rst iteration

In the rst iteration of operation, the data gathering process starts from the rst node (node 1) which acts as the chain head and sends its data to the next node (node

2). This process continues sequentially until the last node n is reached. The last node acts as the chain tail and sends the aggregated data to the base station directly as shown in Figure 2. In the second iteration, node n acts as the chain head and node 1 acts as the chain tail, the data gathering process being similar to the rst round as shown in Figure 3. In the third iteration, the data gathering process starts with node 2 as the chain head and ends with node 1 as the chain tail. In the fourth iteration, the data gathering process starts with node n 1 (chain head) and ends with node n 2 (chain tail). In the subsequent iterations of the data gathering process, the role of the chain head and chain tail are rotated among the nodes as: If node i was the chain head in the previous iteration, then node i + 1, now becomes the chain head with node i acting as the chain tail. In the event that a few nodes die, say p and q as shown in Figure 4, then a single UniAntchain is formed consisting of all the alive nodes with the chain head and chain tail chosen as explained in previous step.

912

Self-Healing Antchain for Increasing Lifespan in Wireless Sensor Networks

BS

TABLE II S ELF -H EALING A NTCHAIN (SHANTCHAIN)

n1 CT

1 .................. p1

p ..................... q

q+1 ...... n2 CH

CH Chain Head CT Chain Tail BS Base Station

Fig. 3. SHANTCHAIN in second iteration
BS

0 ..................... p CH DN

p+1 ................. q DN

q+1 ................ n1 CT

CH Chain Head CT Chain Tail DN Dead Node BS Base Station

Fig. 4.

Healing the network due to dead nodes in SHANTCHAIN

SHANTCHAIN is represented by an edge-weighted graph given by Gwsn (N, E, BS) where N is the number of sensor nodes, E is the energy of the nodes and BS is the base station. Intially all the nodes are equipped with an equal amount of energy Ei . There are two kinds of iterations for the transmission of the messages-init f orward and init reverse. In init f orward, the chain head is initialized to the node 1, and in init reverse, the chain head is node n. In each iteration of init f orward and init reverse, the role of the chain head is rotated as i+1 and i1 respectively. In the init f orward, the chain head being node 1, receives a message M from the BS. The data gathering process starts from this node (i in each iteration) and the data is sent to the next node (i + 1) and continues till the last node. In this way, the message nally reaches the BS. In the similar way, in init reverse, with the chain head as node n, receives a message from the BS. The data gathering process starts from this node (i in each iteration) and sends it to the next node. This continues till the last node is reached, which nally sends the data to the BS. V. PERFORMANCE ANALYSIS The effectiveness of RBI and SHANTCHAIN are validated through simulations. Our investigations are based on the simulations carried out by using OMNeT++. The sensor nodes were deployed on a 50mx50m area with the sensing radius of each node set to 1.5m. The initial energy of all the nodes was assumed equal, which was 8565mJ (milli Joules). The system performed according to specications as long as the BS did not crash and until the last node in the network was active and alive. The chain head had to receive a message to initiate the process in the network. Initially, the number of nodes selected were ve, which were scaled to a maximum of 200 nodes. Several simulation runs were carried out in order to

SHAN T CHAIN (Gwsn (N, E, BS)) begin n = N umof N odes; for (i = 1 to n) // Energy initialization begin Ei = E; end msgKind = F D; init f orward = 1; init reverse = n; switch(msgKind) begin case FD : begin send(M, init); //Send message to chain head for i = init f orward to n begin if(i + 1 n) then i = init f orward AggregateData(M, i); send(M, i + 1); end msgKind = RD; // Reverse Direction init f orward = init f orward + 1; send(M, BS); end case RD : begin send(M, init reverse); //Send message to chain tail for i = init reverse to 1 begin if(i 1 0) then i = init reverse AggregateData(M, i); send(M, i - 1); end msgKind = F D; // Forward Direction init reverse = init reverse 1; send(M, BS); end end end

arrive at consistent results. Under the given conditions, when the number of nodes was increased beyond 500, the response time was found to be very high. The network lifetime was found to be longest for SHANTCHAIN, decreasing steadily with other algorithms and lowest for UniAntchain. From Figure 5, it is clear that upto 50 nodes, the time taken for the energy depletion of rst node and is quite rapid and slows down as the number of nodes increase. This is due to the fact that in our algorithm, the role of antchain tail and its corresponding antchain head is rotated among the sensors in each iteration, wheras in UniAntchain, the same node acts as antchain tail in all iterations. In Bidirection, the two terminal nodes of Bidirection take the role of the antchain head and antchain tail alternatively, which also applies to Recursive-BIdirection. Average Remaining Energy is dened as the amount of energy dissipated on the nodes, given a stipulated time. From Figure 6, it is clear that both algorithms consume the same

913

IET-UK International Conference on Information and Communication Technology in Electrical Sciences

140 300

120

UniAntChain Self-Healing AntChain Recursive-Bidirection

250

Recursive-Bidirection Self-Healing AntChain

AntChain Operation Time in ms

0 50 100 150 200

100

Network Lifetime(in s)

200

80

150

60

100

40

20

50

50

100

150

200

Number of Nodes

Number of Nodes

Fig. 5.
9 8 7

Network Lifetime versus the Number of Nodes in the Network

Fig. 7. Antchain Operation Time versus the Number of Nodes in the Network
50

Recursive-BIdirection Self-Healing AntChain 40

Average Energy Remaining in J

Number od Nodes Alive

6 5 4 3 2 1 0

30

20

10

Recursive-Bidirection Self-Healing Antchain

10

20

30

40

50

60

70

Number of Iterations

10

12

14

Number of Iterations

Fig. 6.

Average Energy Remaining versus the Number of Iterations

Fig. 8.

Number of Nodes Alive versus the Number of Iterations

amount of energy until network lifetime. Compared to RBI, SHANTCHAIN consumes less energy, which is because it permits only one node in each iteration to communicate with the base station in the face of occurrence of the dead nodes, whearas in RBI several UniAntchains are formed depending on the number of dead nodes. Antchain Operation Time is dened as the time taken for the last node in the network to be completed depleted of its energy. This metric applies well to RBI and SHANTCHAIN algorithms. Simulation results indicate that for less than 50 nodes, this time is decreasing, which is illustrated in Figure 7. The operation time gradually decreases as the number of nodes increase from 50 to 200 nodes. In our algorithm the death of a node is postponed to the maximum extent possible due to the rotation of the roles, resulting in higher operation

time. Even if a node dies, the network is healed by detecting the dead node and eliminating it from the antchain so that the operation of the network goes on, undeterred. With the increase in the operation time of the sensor network, the number of dead nodes also increases. As seen from Figure 8, during the rst ten iterations, our algorithm has more number of alive nodes giving rise to a live network as compared to RBI. As the number of iterations increase, the number of alive nodes decreases greatly. In Recursive-Bidirection, as the number of dead nodes increase, the number of UniAntchains formed also increase proportionately. Due to this, the number of nodes communicating with the base station also increases as the base station is far away from the place where the sensor nodes are deployed. This ensures linear depletion of energy of the sensor nodes. In contrast, our algorithm forms only one UniAntchain consisting of only alive and active

914

Self-Healing Antchain for Increasing Lifespan in Wireless Sensor Networks

nodes. Therefore only one node communicates with the base station saving energy of many other nodes. Aggregated Data Delivery ratio is dened as the number of messages delivered to the destination with respect to the sent data messages. In UniAntchain, if the antchain tail is dead, the message containing the aggregated data is lost and no message reaches the base station. In Bidirection, when the number of dead nodes increases, the number of messages in transit also increases resulting in packet loss due to network congestion. The above two drawbacks are eliminated in our algorithm as one and only one message is in transit at any instant of time and which is the aggregated data from the alive nodes. Another metric of importance called the Average Number of Messages measures the average number of messages used to perform the data gathering process. In RBI, with the advancement of time, more number of nodes are dead leading to the formation of several UniAntchains, resulting in a large number of many messages in transit. This leads to network congestion, thereby increasing the delay and degrading the network performance. In Recursive-BIdirection, for instance if two nodes die, then two separate messages are sent to particular nodes. This is overcome to a large extent in our algorithm, where only one message is sent to chain head irrespective of the number of dead nodes. VI. CONCLUSIONS A Wireless Sensor Network consists of randomly deployed battery-constrained sensor nodes. A set of homogeneous nodes are deployed to gather critical data and monitor the system effectively. We have designed and developed an algorithm named SHANTCHAIN to increase the network lifetime by reducing greatly the energy consumption of the network. The algorithm detects the dead node, one at a time, eliminates it and heals the network to prolong the lifespan of the network. This healing process continues until all the dead nodes are eliminated from the sensor network and till the Antchain Operation Time is reached. This self-healing property results in a robust mechanism that tries to overcome the atrocities of the wireless communication medium in a better way and prevents loss of data. Our algorithm eliminates the unbalanced energy consumption problem and guarantees the general health of the network and at the same time ensures a fault-tolerant system. Simulation results demostrate that our algorithm consistently performs better than UniAntchain and RBI with respect to energy-based metrics, e.g. network lifetime and Antchain Operation Time. Our future work includes designing energy management algorithms for a distributed sensor system. R EFERENCES
[1] Ian F. Akylidiz, Weilian Su, Yogesh Sankarasubramaniam and Erdal Cayirci. Wireless Sensor Network: A Survey on Sensor Networks. IEEE Communications Magazine, 40(8); pp. 102114, August 2002. [2] Osvaldo G mez and Benjamn Bar n. Omicron ACO. A New Ant o a Colony Optimization Algorithm. CLEI Electron. J., 8(1), 2005. [3] Turkmen Canli, Ajay Gupta, and Ashfaq Khokhar. Power Efcient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks. Computer Systems and Applications, pp. 549-556, March 2006. [4] Pritwish Basu and Jason Redi. Effect of Overhearing Transmission on Energy Efciency in Densor Sensor Networks. IPSN04, April 2004. [5] Chang Wook Ahn, R S Ramakrishna and Chung Gu Kang. Efcient Clustering-based Routing Protocol in Mobile Adhoc Networks. Vehicular Technology Conference, 3; pp. 16471651, 2002. [6] Intae Kang and Radha Poovendran. A Novel Power-Efcient Broadcast Routing Algorithm Exploiting Broadcast Efciency. Vehicular Technology Conference, 5; pp. 29292930, October 2003. [7] Q. Gao, K J Blow, D J Holding, I W Marshall and X Peng. Routing Analysis and Energy Efciency in Wireless Sensor Networks. IEEE 6th Circuits and Systems Symposium, 2; pp. 533536, June 2004. [8] Max Manfrin, Mauro Birattari, Thomas Stutzle and Marco Dorigo. Parallel Multicolony ACO Algorithm with Exchange of Solutions. 18th Belgium Netherlands Conference on Articial Intelligence, pp. 409410, University of Namur, 2006. [9] Jerry Zhao, Ramesh Govindan and Deborah Estrin. Computing Aggregates for Monitoring Wireless Sensor Networks. Sensor Network Protocols and Applications, pp. 139148, 2003. [10] Marc A Schaub and Gregory Mehmoud. Ant Colony Optimization for Quadratic Assignment Problem. Fifth International Workshop on Ant Colony Optimization and Swarm Intelligence, September 2006. [11] Sinen Coleri Ergen adn Pravin Varaiya. Optimal Placement of Relay Nodes for Energy Efciency in Sensor Nodes. Communications, ICC06, 8; pp. 34733479, June 2006. [12] Wenjing Lou. An Efcient N-to-1 Multipath Routing Protocol in Wireless Sensor Networks. Mobile Adhoc and Sensor Systems Conference, November 2005. [13] Chin Choy Chai and Tuan Haw Bok. A Power Efcient Algorithm for Power/Rate Control in Wireless Transmissions. ICIS-PCM, pp. 1451 1455, Singapore, December 2003. [14] Xiao-Hui Lin and Yu-Kwong Kwok. On Channel Adaptive Energy Management in Wireless Sensor Networks. 2005 International Conference on Parallel Processing Workshops (ICPPW05), 2005. [15] Michaela Cardei and Jie Wu. Energy Efcient Coverage Problems in Wireless Adhoc Sensor Networks. Computer Communications, Special Issue on Sensor Networks, 2005. [16] Peng Cheng, Chen Nee Chuah and Xin Liu. Energy Aware Node Placement in Wireless Sensor Networks. Global Telecommunications Conference, pp. 32103214, 2004. [17] Dongjin Son, Ahmed Helmy and Bhaskar Krishnamachari. The Effect of MobilityInduced Location Errors on Geographic Routing in Mobile Adhoc and Sensor Networks: Analysis and Improvement Using Mobility Prediction. IEEE Transactions on Mobile Computing, July 2004. [18] Shi Gao Tao and Liao MingHong. A Hierarchical Architecture for Energy-Efcient Information Dissemination in Sensor Network. Second International Conference on Embedded Software and Systems (ICESS05), 2005. [19] Niannian Ding and Peter X Liu. A Centralized Approach to Energy Efcient Protocols for Wireless Sensor Network. IEEE International Conference on Mechatronics and Automation, pp. 16361641, Canada, July 2005. [20] Intae Kang and Radha Poovendran. A Comparison of Power-Efcient Broadcast Routing Algorithms. IEEE GLOBECOM, pp. 387392, 2003. [21] Jing Nie and Zheng Zhou. An Energy Based Power-Aware Routing Protocol in Adhoc Networks. International Symposium on Communications and Information Technologies, Sapporo, Japan, October 2004. [22] Xiajiang Du. A Simulation Study of an Energy Efcient Routing Protocol for Mobile Adhoc Networks. 37th Annual Simulation Symposium (ANSS04), 2004. [23] S S Miremadi, M Fazeli, A Patooghly, S G Miremadi. Performance Evaluation of a Routing Protocol for Wireless Sensor Networks. IFIP Wireless and Optical Communications Networks, pp. 1113, April 2006. [24] Han Peng, Wu Huafeng, Mao Dilin and Gao Chuanshan. ELRS: An Energy Efcient Layered Routing Scheme for Wireless Sensor and Actor Networks. 20th International Conference on Advanced Information Netwsorking and Applications (AINA06), 2006. [25] Li (Erran) Li and Prasun Sinha. Throughput and Energy Efciency in Topology-controlled Multihop Wireless Sensor Networks. 2nd ACM International Conference on Wireless Sensor Networks, pp. 132140, 2003. [26] Adam Dunkels, Laura Marie Feeney, Bjorn Gronvall and Thiemo Voigt. An Integrated Approach to Developing Sensor Network Solutions. Second International Workshop on Sensor and Actor Network Protocol and Applications, 2004. [27] Longbi Lin, Ness B Shroff and R Srikant. Energy Aware Routing in Sensor Network: A Large Systems Approach. Adhoc Networks, Special Issue on Recent Advances in Wireless Sensor Networks, 2006.

915