A Dynamic en-Route Filtering Scheme for Data

150 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 1, FEBRUARY 2010

A Dynamic En-route Filtering Scheme for DataReporting in Wireless Sensor Networks

Zhen Yu, Member, IEEE, and Yong Guan, Member, IEEE

Abstract—In wireless sensor networks, adversaries can injectfalse data reports via compromised nodes and launch DoS attacksagainst legitimate reports. Recently, a number of filtering schemesagainst false reports have been proposed. However, they eitherlack strong filtering capacity or cannot support highly dynamicsensor networks very well. Moreover, few of them can deal withDoS attacks simultaneously. In this paper, we propose a dynamicen-route filtering scheme that addresses both false report injectionand DoS attacks in wireless sensor networks. In our scheme, eachnode has a hash chain of authentication keys used to endorse re-ports; meanwhile, a legitimate report should be authenticated bya certain number of nodes. First, each node disseminates its key toforwarding nodes. Then, after sending reports, the sending nodesdisclose their keys, allowing the forwarding nodes to verify theirreports. We design the Hill Climbing key dissemination approachthat ensures the nodes closer to data sources have stronger filteringcapacity. Moreover, we exploit the broadcast property of wirelesscommunication to defeat DoS attacks and adopt multipath routingto deal with the topology changes of sensor networks. Simulationresults show that compared to existing solutions, our scheme candrop false reports earlier with a lower memory requirement,especially in highly dynamic sensor networks.

Index Terms—Data reporting, en-route filtering scheme, wirelesssensor networks.

I. INTRODUCTION

W IRELESS sensor networks consist of a large numberof small sensor nodes having limited computation ca-

pacity, restricted memory space, limited power resource, andshort-range radio communication device. In military applica-tions, sensor nodes may be deployed in hostile environmentssuch as battlefields to monitor the activities of enemy forces. Inthese scenarios, sensor networks may suffer different types ofmalicious attacks. One type is called false report injection at-tacks [24], in which adversaries inject into sensor networks thefalse data reports containing nonexistent events or faked read-ings from compromised nodes. These attacks not only causefalse alarms at the base station, but also drain out the limitedenergy of forwarding nodes. Also, the adversaries may launchDoS attacks against legitimate reports. In selective forwarding

Manuscript received December 13, 2006; revised December 19, 2007; ap-proved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor D. Towsley.First published October 16, 2009; current version published February 18, 2010.This work was supported in part by the NSF under Grants CNS-0644238, CNS-0626822, and CNS-0831470.

The authors are with the Department of Electrical and Computer Engineering,Iowa State University, Ames, IA 50011 USA (e-mail: [email protected];[email protected]).

Color versions of one or more of the figures in this paper are available onlineat http://ieeexplore.ieee.org.

Digital Object Identifier 10.1109/TNET.2009.2026901

attacks [15], they may selectively drop legitimate reports, whilein report disruption attacks [19], they can intentionally contami-nate the authentication information of legitimate reports to makethem filtered out by other nodes. Therefore, it is very importantto design a dynamic quarantine scheme to filter these attacks orat least mitigate their impact on wireless sensor networks.

Recently, several schemes such as SEF [20], IHA [24], CCEF[18], LBRS [19], and LEDS [15] have been proposed to ad-dress false report injection attacks and/or DoS attacks. However,they all have some limitations. SEF is independent of networktopology, but it has limited filtering capacity and cannot preventimpersonating attacks on legitimate nodes. IHA has a drawback,that is, it must periodically establish multihop pairwise keys be-tween nodes. Moreover, it asks for a fixed path between the basestation and each cluster-head to transmit messages in both direc-tions, which cannot be guaranteed due to the dynamic topologyof sensor networks or due to the use of some underlying routingprotocol such as GPSR [7]. CCEF also relies on the fixed pathsas IHA does and it is even built on top of expensive public-keyoperations. More severely, it does not support en-route filtering.LBRS and LEDS utilize location-based keys to filter false re-ports. They both assume that sensor nodes can determine theirlocations in a short period of time. However, this is not prac-tical, because many localization approaches [2], [5], [11] takequite long and are also vulnerable to malicious attacks [3], [8],[9]. In LBRS, report disruption attacks are simply discussed,but no concrete solution is proposed. LEDS tries to address se-lective forwarding attacks by allowing a whole cell of nodes toforward one report, however, this incurs high communicationoverhead.

In this paper, we propose a dynamic en-route filtering schemeto address both false report injection attacks and DoS attacksin wireless sensor networks. In our scheme, sensor nodes areorganized into clusters. Each legitimate report should be vali-dated by multiple message authentication codes (MACs), whichare produced by sensing nodes using their own authenticationkeys. The authentication keys of each node are created from ahash chain. Before sending reports, nodes disseminate their keysto forwarding nodes using Hill Climbing approach. Then, theysend reports in rounds. In each round, every sensing node en-dorses its reports using a new key and then discloses the key toforwarding nodes. Using the disseminated and disclosed keys,the forwarding nodes can validate the reports. In our scheme,each node can monitor its neighbors by overhearing their broad-cast, which prevents the compromised nodes from changing thereports. Report forwarding and key disclosure are repeatedly ex-ecuted by each forwarding node at every hop, until the reportsare dropped or delivered to the base station.

1063-6692/$26.00 © 2009 IEEE

Authorized licensed use limited to: Sudhakar Palanichamy. Downloaded on May 19,2010 at 05:06:48 UTC from IEEE Xplore. Restrictions apply.

YU AND GUAN: DYNAMIC EN-ROUTE FILTERING SCHEME FOR DATA REPORTING IN WIRELESS SENSOR NETWORKS 151

Our scheme has two advantages:• We design the Hill Climbing approach for key dissemina-

tion, which ensures that the nodes closer to clusters holdmore authentication keys than those closer to the base sta-tion do. This approach not only balances memory require-ment among nodes, but also makes false reports droppedas early as possible.

• Multipath routing is adopted when disseminating keys toforwarding nodes, which not only reduces the cost for up-dating keys in highly dynamic sensor networks, but alsomitigates the impact of selective forwarding attacks.

Simulation results show that, compared to existing ones, ourscheme can drop false reports earlier with a lower memory re-quirement, especially in the networks whose topologies changefrequently.

The rest of the paper is organized as follows. We introducethe related work in Section II and define system model and goalsin Section III. Then, we present our scheme in Section IV andevaluate its performance in Section V. Simulation results arediscussed in Section VI. Finally, we summarize the pros andcons of our scheme and point out future work in Section VII.

II. RELATED WORK

We first discuss existing filtering schemes, then introducesome routing protocols used in wireless sensor networks. Therouting strategies of these protocols affect the way that sensornodes can exchange and disseminate key information, so theyhave significant impact on filtering schemes.

A. Existing Schemes for Filtering False Reports

Ye et al. proposed a statistical en-route filtering (SEF) scheme[20] based on probabilistic key distribution. In SEF, a globalkey pool is divided into partitions, each containing keys.Every node randomly picks keys from one partition. Whensome event occurs, each sensing node (that detects this event)creates a MAC for its report using one of its random keys. Thecluster-head aggregates the reports from the sensing nodes andguarantees each aggregated report contains MACs that aregenerated using the keys from different partitions, whereis a predefined security parameter. Given that no more than

nodes can be compromised, each forwarding node candetect a false report with a probability proportional to . The fil-tering capacity of SEF is independent of the network topology,but constrained by the value of . To increase the filtering ca-pacity, we can reduce the value of ; however, this allows theadversaries to break all partitions more easily. In addition, sincethe keys are shared by multiple nodes, the compromised nodescan impersonate other nodes and report some forged events that“occur” in other clusters.

Zhu et al. proposed an interleaved hop-by-hop authentication(IHA) scheme [24]. In this scheme, the base station periodicallyinitiates an association process enabling each node to establishpairwise keys with other nodes that are hops away, where

is a security threshold. In IHA, each sensing node generatesa MAC using one of its multihop pairwise keys, and a legit-imate report should contain distinct MACs. Since eachmultihop pairwise key is distinct, IHA can tolerate up to com-promised nodes in each cluster instead of in the whole network

as SEF does. However, IHA requires the existence of a fixedpath for transmitting control messages between the base stationand every cluster-head, which cannot be guaranteed by somerouting protocols such as GPSR [7] and GEAR [21]. Moreover,the high communication overhead incurred by the associationprocess makes IHA unsuitable for the networks whose topolo-gies change frequently.

Yang et al. presented a commutative cipher based en-routefiltering (CCEF) scheme [20]. In CCEF, each node is preloadedwith a distinct authentication key. When a report is needed, thebase station sends a session key to the cluster-head and a wit-ness key to every forwarding node along the path from itself tothe cluster-head. The report is appended with multiple MACsgenerated by sensing nodes and the cluster-head. When the re-port is delivered to the base station along the same path, eachforwarding node can verify the cluster-head’s MAC using thewitness key. The MACs generated by sensing nodes can be veri-fied by the base station only. CCEF has several drawbacks. First,it relies on fixed paths as IHA does. Second, it needs expen-sive public-key operations to implement commutative ciphers.Third, it can only filter the false reports generated by a mali-cious node without the session key instead of those generatedby a compromised cluster-head or other sensing nodes.

Yang et al. further proposed a location-based resilient se-curity (LBRS) solution [19]. In LBRS, a sensing field is di-vided into square cells, and each cell is associated with somecell keys that are determined based on the cell’s location. Eachnode stores two types of cell keys. One type contains the keysbounded to their sensing cells to authenticate the reports fromthose cells. The other type contains the keys of some randomlychosen remote cells, which are very likely to forward their re-ports through the node’s residing cell. The authors introducedseveral types of report disruption attacks in which adversariescan intentionally attach invalid MACs to legitimate reports tomake them dropped by other nodes. However, they did not pro-vide a concrete solution. In addition, LBRS suffers a severedrawback: It assumes that all the nodes can determine their lo-cations and generate location-based keys in a short secure timeslot. However, to the best of our knowledge, most of the practicalsensor localization approaches [2], [5], [11] cannot be finishedin such a short time slot, and even the localization process itselfis vulnerable to various attacks [3], [8], [9].

Recently, Ren et al. proposed a location-aware end-to-enddata security (LEDS) scheme that can address false report in-jection and some DoS attacks. Like LBRS, LEDS assumes thatsensor nodes can generate the location-based keys bounded tocells within a secure short time slot. LEDS provides end-to-endsecurity by allowing sensing nodes to encrypt their messagesusing the cell keys. A legitimate report contains distinct sharesproduced from the encrypted message using nodes’ secret keys,where the base station can always recover the original messagefrom any valid shares. In LEDS, the reports are for-warded through cells along report-auth routes. Each node storesthe authentication keys shared between its cell and others in itsdownstream report-auth area and on the report-auth route. Eachreport contains MACs generated by sensing nodes usingthe authentication keys shared with the cells on the report-authroute, and each forwarding node updates the MACs in the re-



ports using its own authentication key. This process is similarto that of IHA. LEDS mitigates the impact of report disruptionattacks by allowing up to invalid MACs in each report. How-ever, this cannot prevent the adversaries from sending false re-ports with less than valid shares. In addition, LEDS addressesselective forwarding attacks by letting the whole cell of nodesto forward reports, which incurs high communication overhead.

B. Routing Protocols of Sensor Networks

Several distributed distance-vector based routing protocols[17] have been designed and implemented in TinyOS [16]. Inthese protocols, each node periodically broadcasts its routingcost to the sink, e.g., the base station, and builds a routing tableaccording to the information received from its neighbors. Routeis selected based on the routing metrics such as hop count orlink quality.

GPSR [7] and GEAR [21] are location-aware routing algo-rithms, which assume that each node is aware of its own loca-tion. Route is determined as the neighbor with the shortest dis-tance to the sink. If all neighbors are farther than a node itself,the node uses a right-hand rule to select the route. In GEAR, theenergy level of each neighbor is also taken into considerationin route selection. One observation from GPSR/GEAR is thatthe path between two nodes is not bidirectional, i.e., the reportsfrom node to may choose a different path from that chosenby the reports from node to .

Braginsky et al. proposed Rumor [1] routing protocol. InRumor, when a sensing node detects some event, it creates anagent that is actually a message containing the routing informa-tion about the event. The agent follows a straight path to leavefrom the sensing node and is associated with a maximum TTL.Each node passed by the agent learns the route to the event. Ifthe base station is interested in some event, it sends out a querymessage. The movement pattern of a query message is similarto that of an agent. When a query message is delivered to anode who knows the route to the event, a path between the basestation and the sensing node (the event) can be established.

Although we only discussed a few routing protocols, ourscheme can take advantage of any routing protocol that isdesigned for wireless sensor networks instead of only theprotocols we discussed.

III. PROBLEM STATEMENT

A. System Model

We model the communication region of wireless sensornodes as a circle area of radius , which is called the transmis-sion range. We only consider the bidirectional links betweenneighbor nodes and assume that sensor nodes simply discardor ignore those links that are not bidirectional. Based on theseassumptions, we say that two nodes must be the neighbor ofeach other and can always communicate with each other if thedistance between them is no more than .

Wireless sensor nodes may be deployed into some target fieldto detect the events occurring within the field. For example, in amilitary application, they may be deployed to a battlefield to de-tect the activities of enemy forces. We assume that sensor nodes

Fig. 1. Sensor nodes are organized into clusters. The big dashed circles outlinethe regions of clusters. �� and �� denote Cluster-Head and Base Station re-spectively.� � � are forwarding nodes, and � � � are sensing nodes (theycan also serve as forwarding nodes for other clusters). The black dots representthe compromised nodes, which are located either within the clusters or en-route.

form a number of clusters after deployment, each containing atleast nodes. In each cluster, one node is randomly selectedas the cluster-head. To balance energy consumption, all nodeswithin a cluster take turns to serve as the cluster-head. Thatmeans physically there is no difference between a cluster-headand a normal node because the cluster-head performs the samesensing job as the normal node.

Given that some event occurs, e.g., tank movement, we as-sume that at least nodes can detect it simultaneously, where

is a predefined system parameter. These nodes detecting theevent are called sensing nodes. They generate and broadcast thesensing reports to the cluster-head. The cluster-head is respon-sible for aggregating these sensing reports into the aggregatedreports and forwarding these aggregated reports to the base sta-tion through some forwarding nodes.

Fig. 1 illustrates the organization of sensing nodes in wirelesssensor networks. In the figure, and denote Cluster-Head and Base Station respectively. are forwardingnodes, and are sensing nodes (they can also serve as theforwarding nodes for other clusters). The black dots representthe compromised nodes, which are located either in the clustersor en-route.

In this paper, we regard data reporting as a task performed atthe application layer and ignore the impact of link quality on re-port delivery. We assume that the protocols at some low layerssuch as routing layer or MAC layer can handle the failures orcollisions in wireless communication by utilizing the mecha-nisms of acknowledgement and retransmission.

We assume that the topologies of wireless sensor networkschange frequently either because sensor nodes are prone to fail-ures or because they need to switch their states between Activeand Sleeping for saving energy. Thus, two messages generatedby the same cluster may be delivered along different paths tothe base station. Moreover, we assume the messages transmittedfrom a cluster-head to the base station and those from the basestation to the cluster-head do not necessarily follow the samepath because the underlying routing protocols such as GPSR[7], GEAR [21], or Rumor [1] cannot guarantee this.

B. Threat Model

Typically, sensor nodes are not tamper-resistant and can becompromised by adversaries. We assume that each cluster con-tains at most compromised nodes, which may collaborate



with each other to generate false reports by sharing their secretkey information.

In this paper, we consider the following attacks launched byadversaries from the compromised nodes:

• False report injection attacks: The compromised nodes cansend the false reports containing some forged or nonexis-tent events “occurring” in their clusters. Moreover, givensufficient secret information, they may even impersonatesome uncompromised nodes of other clusters and reportthe forged events “occurring” within those clusters. Thesefalse reports not only cause false alarm at the base station,but also drain out the limited energy of forwarding nodes.

• DoS attacks: The compromised nodes can prevent the le-gitimate reports from being delivered to the base station, byeither selectively dropping some reports, (which are calledthe selective forwarding attacks [15]) or intentionally in-serting invalid authentication information into the reportsto make them filtered by other forwarding nodes (whichare called the report disruption attacks [19]).

C. Goals

We require that each report be attached with MACs gen-erated by different sensing nodes using their own authentica-tion keys. A false report is defined as one that contains lessthan valid MACs. Here, selecting different values of givesus a tradeoff between security and overhead. To tolerate morecompromised nodes, we can increase the value of , which willincur higher communication overhead because the reports be-come longer.

As we discussed, adversaries can launch false report injectionattacks and DoS attacks. Our objective is to design a schemeto detect these attacks or mitigate their impact. Compared toexisting ones, our scheme is expected to achieve the followinggoals:

1) It can offer stronger filtering capacity and drop false reportsearlier with an acceptable memory requirement, where thefiltering capacity is defined as the average number of hopsthat a false report can travel.

2) It can address or mitigate the impact of DoS attacks such asreport disruption attacks and selective forwarding attacks.

3) It can accommodate highly dynamic sensor networks andshould not issue the process of path establishment or repa-ration frequently.

4) It should not rely on any fixed paths between the base sta-tion and cluster-heads to transmit messages.

5) It should prevent the uncompromised nodes from being im-personated. Therefore, when the compromised nodes aredetected, the infected clusters can be easily quarantined bythe base station.

IV. OUR SCHEME

A. Overview

When an event occurs within some cluster, the cluster-headcollects the sensing reports from sensing nodes and aggregatesthem into the aggregated reports. Then, it forwards the aggre-gated reports to the base station through forwarding nodes. In

Fig. 2. The relationship between three phases of our scheme. Key predistribu-tion is preformed only once. Key dissemination is executed by clusters periodi-cally. Report forwarding happens at each forwarding node in every round.

our scheme, each sensing report contains one MAC that is pro-duced by a sensing node using its authentication key (calledauth-key for short), while each aggregated report contains dis-tinct MACs, where is the maximum number of compromisednodes allowed in each cluster.

In our scheme, each node possesses a sequence of auth-keysthat form a hash chain. Before sending the reports, thecluster-head disseminates the first auth-keys of all nodes to theforwarding nodes that are located on multiple paths from thecluster-head to the base station. The reports are organized intorounds, each containing a fixed number of reports. In everyround, each sensing node chooses a new auth-key to authen-ticate its reports. To facilitate verification of the forwardingnodes, the sensing nodes disclose their auth-keys at the end ofeach round. Meanwhile, to prevent the forwarding nodes fromabusing the disclosed keys, a forwarding node can receive thedisclosed auth-keys, only after its upstream node overhears thatit has already broadcast the reports. Receiving the disclosedkeys, each forwarding node verifies the reports, and informsits next-hop node to forward or drop the reports based onthe verification result. If the reports are valid, it discloses thekeys to its next-hop node after overhearing. The processes ofverification, overhearing, and key disclosure are repeated bythe forwarding nodes at every hop until the reports are droppedor delivered to the base station.

Specifically, our scheme can be divided into three phases:key predistribution phase, key dissemination phase, and reportforwarding phase. In the key predistribution phase, each nodeis preloaded with a distinct seed key from which it can gen-erate a hash chain of its auth-keys. In the key disseminationphase, the cluster-head disseminates each node’s first auth-keyto the forwarding nodes, which will be able to filter false re-ports later. In the report forwarding phase, each forwardingnode verifies the reports using the disclosed auth-keys and dis-seminated ones. If the reports are valid, the forwarding nodediscloses the auth-keys to its next-hop node after overhearingthat node’s broadcast. Otherwise, it informs the next-hop nodeto drop the invalid reports. This process is repeated by everyforwarding node until the reports are dropped or delivered tothe base station.

Fig. 2 demonstrates the relationship between the three phasesof our scheme. Key predistribution is performed before thenodes are deployed, e.g., it can be done offline. Key dissemina-tion happens before the sensing nodes begin to send the reports.It may be executed periodically depending on how often thetopology is changed. Every time the latest (unused) auth-key ofsensing nodes will be disseminated. Report forwarding occursat each forwarding node in every round.



Fig. 3. The detailed procedure of three phases. In the key predistribution phase, each node is preloaded with �� secret keys � � � � � � � , and �, and can generatea hash chain of auth-keys � � � � � � � from the seed key � . In the key dissemination phase, the cluster-head disseminates the auth-keys of all nodes by message�� to � downstream neighbor nodes. Every downstream node decrypts some auth-keys from ��, and further forwards �� to � more downstream neighbornodes, which then repeat the same operation. In the report forwarding phase, each forwarding node en-route performs the following steps: 1) It receives the reportsfrom its upstream node. 2) If it receives confirmation message � , then forwards the reports to its next-hop node. Otherwise, it discards the reports. 3) It receivesthe disclosed auth-keys within message �� and verifies the reports by using the disclosed keys. 4) It informs its next-hop node the verification result.

B. Detailed Procedure

In the section, we discuss the procedure of each phase in de-tail.

1) Key Predistribution Phase: Key predistribution needs tobe performed only once. It consists of two steps.

Step1: Each node is preloaded with a distinct seed key.From the seed key, it can generate a sequence of auth-keysusing a common hash function . Thus, each node’s auth-keys form a hash chain. Let denote the length of hashchain. Given node as well as its seed key , its auth-keys can be calculated as follows:

...

(1)

where is the node’s index, and means hashingtwice. The first key of the chain is , which should

also be used the first; meanwhile, it is the last one gener-ated from the seed key. We assume that the base station isaware of each node’s seed key, so the adversaries cannotimpersonate the uncompromised nodes.Step2: Besides the seed key, each node is also equippedwith secret keys, where keys (called -keys) are ran-domly picked from a global key pool (called -key pool) ofsize , and the rest (called -key) is randomly chosen fromanother global key pool ( -key pool) of size . Among

nodes of a cluster, we assume that there are at least nodeseach having a distinct -key.

Fig. 3 shows the auth-keys and secret keys possessed bysensor nodes. For example, node ’s auth-keys are ,and its secret keys are and . If has sufficientmemory, it can store all of its auth-keys in memory. Otherwise,it only stores the seed key and generates an auth-key wheneverneeded.

2) Key Dissemination Phase: In our scheme, the cluster-headdiscloses the sensing nodes’ auth-keys after sending the reportsof each round. However, it is vulnerable to such an attack thata malicious node can pretend to be a cluster-head and inject ar-bitrary reports followed by falsified auth-keys. To prevent thisattack, we enforce key dissemination, that is, the cluster-headshould disseminate the first auth-keys of all nodes to the for-warding nodes before sending the reports in the first round. Byusing the disseminated keys, the forwarding nodes can verify theauthenticity of the disclosed auth-keys, which are in turn usedto check the validity and integrity of the reports.

Key dissemination should be performed periodically in casethat some forwarding nodes aware of the disseminated keys be-come failed, especially when the network topology is highlydynamic. In this case (of redissemination), the first unused, in-stead of the first, auth-keys will be disseminated. The first un-used auth-key of a node is called the current auth-key of thatnode. When none of a node’s auth-keys has ever been used, thecurrent auth-key is just the first auth-key of its hash chain.

The detailed procedure of key dissemination phase is as fol-lows:

Step1: Each node constructs an Auth message, which con-tains copies of its current auth-key, each encrypted



using a different one of its secret keys. For example, givennode , its Auth message is

(2)

where is the index of its current auth-key. Obviously,for the first dissemination. Here, denotes

the index of within the -key pool, and meansan encryption operation using key . In (2), the indexof a secret key is encrypted using the key itself in orderto make sure that the decryption is performed using thecorrect secret key.Step2: The cluster-head collects the Auth messages fromall nodes and aggregates them into message

(3)

where are the nodes of the cluster.Step3: The cluster-head chooses forwardingnodes from its neighbors and forwards them a message,

. These nodes can be selected based on differentmetrics such as the distance to the base station, the linkquality, the amount of energy available, the speed of energyconsumption, or a combination of all. How to select an ap-propriate metric is specific to applications and out of thescope of our paper. In a word, the purpose is to find thosenodes that can best forward the reports, so that when somedownstream neighbor node dies, the reports can be easilyswitched to another node without redisseminating .Step4: When a forwarding node receives , it performsthe following operations:1) It verifies to see if contains at least dis-

tinct indexes of -keys. If not, this is assumed tobe forged and should be dropped.

2) It checks the indexes of secret keys in to see if ithas any shared key. When a shared secret key is found,it decrypts the corresponding auth-key using that keyand stores the auth-key in its memory. Obviously, itmust assure that the decryption key is the correct oneby checking the index encrypted along with the auth-key. Otherwise, it discards .

3) does not need to be disseminated to the basestation. We define as the maximum numberof hops that should be disseminated. Eachforwarding node discards the that has alreadybeen disseminated hops. Otherwise, it forwards

to other downstream neighbor nodes, whichare selected using the same metric as the cluster-headuses.

Each node receiving repeats these operations, untilgets to the base station or has been disseminated

hops. Fig. 3 illustrates how a cluster-head dissemi-nates to its forwarding nodes.

We emphasize that -keys and -keys serve for differentpurposes, although both of them can be used by forwardingnodes to decrypt the auth-keys from . A -key is mainly

Fig. 4. Key predistribution for Hill Climbing. Each �-key is randomly selectedfrom a different hash chain of length � � , but the �-keys are still selectedfrom the global key pool.

used to control how many auth-keys a forwarding node canobtain. However, a -key is used by its owner to verify thevalidity of . Since each node has multiple -keys, thenumber of -keys shared by several compromised nodes caneasily overwhelm that of distinct -keys used to endorse eachreport. Hence, -keys cannot be used for verification.

When the sensing reports are generated continuously and thenetwork topology is highly dynamic, key dissemination shouldbe performed periodically in case that all of selected down-stream nodes die or fail. This period is determined based on thefrequency of topology changing. The more often the topologychanges, the more often the cluster-head should disseminate theauth-keys. However, we do not discuss how to determine the pe-riod because it is out of the scope of this paper.

3) Hill Climbing: We introduce two important observations.First, when multiple clusters disseminate keys at the same time,some forwarding nodes need to store the auth-keys of differentclusters. The nodes closer to the base station need to store moreauth-keys than others (typically those closer to clusters) do be-cause they are usually the hot spots and have to serve more clus-ters. For example, in Fig. 1, serves two clusters and servesonly one, so has to store more auth-keys. Second, the falsereports are mainly filtered by the nodes closer to clusters, whilemost nodes closer to the base station have no chance to usethe auth-keys they stored for filtering. If we could let the nodescloser to clusters hold more auth-keys, the false reports can bedropped earlier. Therefore, to balance the memory requirementof nodes and provide a higher filtering capacity, we propose HillClimbing approach, which achieves that the nodes closer to clus-ters hold more auth-keys than those closer to the base station do.

Hill Climbing involves two variations, one for the key predis-tribution phase and the other for the key dissemination phase.

The first variation is: In Step2 of the key predistributionphase, instead of picking -keys from a global key pool, eachnode selects each of its -keys randomly from an independenthash chain. Specifically, the original -key pool is partitionedinto equal-sized hash chains, each containing keys that aregenerated from a distinct seed key. As shown in Fig. 4, the firsthash chain contains keys , where and is theseed key. Similarly, belong to the last chain. Node

chooses each of its -keys from a correspondingchain, and so does node .

It is easy to know that a forwarding node holding a largerindex -key can always decrypt a sensing node’s auth-key



from as long as the sensing node’s -key has a smallerindex. Inspired by this, we propose the second variation. Thatis, in Step4 of the key dissemination phase, after a forwardingnode decrypts an auth-key from , it updates byencrypting the auth-key using its own -key and then forwardsthe updated to its downstream neighbor nodes. Forexample, if contains [as shown in(2)] and , substitutesfor and then forwards the new to

downstream neighbor nodes. By enforcing this substitutionat every forwarding node, the indexes of -keys contained in

will be increased gradually, just like climbing hill. Itbecomes harder and harder for the nodes closer to the basestation to decrypt the auth-keys from . Consequently, thenodes closer to clusters store more auth-keys, which makesthe false reports dropped earlier.

A simpler way to make downstream nodes obtain fewerauth-keys is to discard the auth-keys obtained by forwardingnodes by a gradually increased probability, when these keysapproach to the base station. However, Hill Climbing has twoadvantages: 1) It makes the upstream nodes get more auth-keysthan not only the downstream nodes but also other upstreamnodes at the same positions without using Hill Climbing. 2)It eliminates redundant decryptions and verifications becauseif an auth-key has been decrypted by an upstream node, anydownstream node no longer needs to decrypt the key (or useit to verify reports).

4) Report Forwarding Phase: In this phase, sensing nodesgenerate sensing reports in rounds. Each round contains a fixednumber of reports, e.g., 10 reports, where this number is pre-determined before nodes are deployed. In each round, everysensing node chooses a new auth-key, i.e., the node’s currentauth-key, to authenticate its reports.

Given node , its sensing report is

(4)

where denotes the event information, is the index of ’scurrent auth-key, and is the MAC generated from

using key .In each round, the cluster-head generates the aggregated

reports and forwards them to next hop, i.e., one of its se-lected downstream forwarding nodes. Then, it discloses thesensing nodes’ auth-keys after overhearing the broadcast fromthe next-hop node. The reports are forwarded hop-by-hop tothe base station. At every hop, a forwarding node verifies thevalidity of reports using the disclosed keys and informs its ownnext-hop node the verification result. The same procedure isrepeated at each forwarding node until the reports are droppedor delivered to the base station.

Fig. 3 depicts the detailed procedure, which consists of thefollowing steps.

Step1: In each round, the cluster-head collects the sensingreports from all sensing nodes and generates a number ofaggregated reports such as . It sends these ag-gregated reports and an message to next hop, . Eachaggregated report should contain MACs, each from asensing node that has a distinct -key. For example, an

aggregated report looks as follows:

(5)

where denote sensing nodes whose -keys aredifferent. Since every sensing node reports the same eventinformation , only one copy of is kept in the aggregatedreport .Step2: Receiving the aggregated reports and the mes-sage, forwards the aggregated reports to next hop, .The cluster-head overhears the broadcast of aggregated re-ports from .Step3: Overhearing the broadcast from , the cluster-headdiscloses the auth-keys to by message

(6)

contains the auth-keys of . It has the sameformat as , but only auth-keys.Step4: Receiving , first checks the authenticity ofthe disclosed keys using the disseminated ones that it de-crypted from before. Then, it verifies the integrityand validity of the reports by checking the MACs of re-ports using the disclosed keys. The verification process isas follows:1) To verify the validity of , checks if is

in correct format and contains distinct indexes of-keys. If not, it drops .

2) To verify the authenticity of the auth-keys in ,checks if each auth-key it stored can be generated

by hashing a corresponding key in in a certainnumber of times. For example, suppose has alreadystored node ’s auth-key , and discloses a newkey in . checks if and

. If not, is either replayed or forged, andshould be dropped. If is valid, stores ,

instead of , in its memory.3) To verify the integrity and validity of reports

, checks the MACs in these reportsusing the disclosed auth-keys that it decrypts from

.Step5: If the reports are valid, sends an message to

. Otherwise, it informs to drop invalid reports.(The negative message is not shown in Fig. 3.)Step6: Similar to Step2, forwards the reports to nexthop.Step7: Similar to Step3, after overhearing the broadcastfrom , discloses to .

Every forwarding node repeats Step4 to Step7 until the re-ports are dropped or delivered to the base station.

We exploit the broadcast nature of wireless communication.In our scheme, each node monitors its next-hop node to assureno message is forged or changed intentionally.

V. PERFORMANCE ANALYSIS

A. Filtering Capacity

Filtering capacity of our scheme is defined as the averagenumber of hops that a false report can travel. It is determined



by the probability that a false report can be detected by theforwarding node at every hop. For simplicity, we consider theworst case in which each false report contains exactly one forgedMAC. We define detecting probability as the probability thata forwarding node has the valid auth-key to detect the forgedMAC. Since a forwarding node should decrypt the auth-keyfrom or , the detecting probability is equivalent tothe probability that a forwarding node has at least one sharedsecret key to decrypt the auth-key.

Without using Hill Climbing in our scheme, each node ran-domly picks -key from a pool of size and one -key from apool of size . The probability that two nodes share at least one

common -key is and that of sharing the same -key

is . Therefore, the detecting probability is

(7)

when is much smaller than . For example, if

and , then . Meanwhile, we also knowthat a forwarding node can decrypt and store auth-keys foreach cluster in average.

When using Hill Climbing, each node picks -key fromdifferent hash chains. To decrypt an auth-key of some sensingnode, a forwarding node should have a shared -key or at leastone -key whose index is larger than that of the sensing node’s

-key. The probability of having a -key of larger index is .However, if the forwarding node is hops away from a cluster,to decrypt an auth-key of some sensing node, it should have a

-key whose index is greater than that of not only the sensingnode, but also other upstream forwarding nodes. This hap-pens with probability . Therefore, when usingHill Climbing, the detecting probability of a forwarding nodethat is hops away from the cluster is

(8)

when is small. Averagely, the forwarding node storesauth-keys for the cluster. If , and ,then , which is much larger than that withoutusing Hill Climbing.

Let denote the probability of filtering a false reportwithin hops, which is also the fraction of false reports that canbe filtered within hops. When using Hill Climbing, we have

(9)

Without using Hill Climbing, becauseis always equal to .

Let denote the average number of hops that a false re-port can travel. When using Hill Climbing, we derive that

(10)

where denotes the probability that a false reportis dropped at exactly the -th hop. Without using Hill Climbing,the forwarding node at every hop has the same detecting proba-bility . In this case, we have

(11)

It indicates that a false report can travel averagely hops.

B. Energy Savings

To compare energy savings of various schemes, we adopt thesame energy consumption model used in SEF [20]. Let de-note the length of a normal report without using any filteringscheme and denote the length of an authenticated report at-tached with MACs. The amount of legitimate reports and falsereports is 1 and . Assume each report travels hops withoutusing any filtering scheme and each node has a detecting prob-ability when using a filtering scheme. As shown in SEF, theenergy consumption for transmitting a normal report is

(12)

where a normal report is 24-byte long, that is

(13)

The energy consumption for transmitting an authenticated re-port is

(14)

In SEF, a key index is 10-bit long and the Bloom filter is 64-bitlong. So

(15)

In our scheme, each forwarding node forwards not only thereport , but also control messages , and . Wehave

(16)

where and are the length of aggregatedreports and that of the corresponding control messages. de-notes the ratio of the number of messages (or ) overthat of reports, and is the ratio for . Assume each sensingnode generates 10 reports in each round and key dissemination



is carried out every 10 rounds, then and . let usfurther assume that each MAC and secret key are 64-bit long,and message, node index and key index are 8-bit long. If

, , and , then bits,bits, bits, and bits.

Following (16), we get

(17)

We set when not using Hill Climbing.Let , for SEF and for our scheme.

From (12)–(17), we derive that

(18)

(19)

(20)

where and denote the energy consumption in ourscheme and SEF.

When compared with SEF, our scheme savesof energy when , and 40% when . As

compared with the case of not using any filtering scheme, ourscheme consumes more energy, about when

. It starts to save energy after 20 hops. However, 20 hopsmay seem to be too large for real sensor networks. To make ourfiltering scheme more practical, we turn to Hill Climbing, whichcan save more energy by dropping the false reports earlier.

When using Hill Climbing, the forwarding nodes have ahigher detecting probability. For example, the fist forwardingnode of a cluster has a detecting probability of 0.775, whichis much larger than 0.275 when not using Hill Climbing.Assume the average detecting probability at each hop is0.5. Then, the energy consumption of our scheme becomes

, which means that our scheme starts tosave energy after 10 hops and hence becomes more practical.In addition, this comparison is based on a static network. Whenthe network is highly dynamic, our scheme can drop the falsereports much earlier than other schemes do (see our simulationresults), which indicates that our scheme is more efficient andpractical for dynamic environments.

However, we also notice that this comparison is not quite fairfor other schemes, because our scheme involves extra overheadcaused by control message , which is four times longerthan an authenticated report and has to be disseminated at most

hops with nodes at each hop. Although we try to reducethe frequency for disseminating and choose a small valueof and (see our simulation results), this overhead may bestill high. In addition, has more than 2000 bits and needsto be transmitted in multiple messages (the payload of each mes-sage in TinyOS is 29 bytes.), which increases the overhead ofour scheme. We do not measure the extra overhead caused byextra control messages, but we do agree that it is a main draw-back of our scheme.

C. Filtering DoS Attacks

Except for false reports injection attacks, adversaries maylaunching DoS attacks such as report disruption attacks and

selective forwarding attacks to prevent legitimate reports frombeing delivered to the base station.

In report disruption attacks, compromised sensing nodes in-tentionally insert invalid MACs into the reports to make themdropped by others. Most existing schemes are vulnerable tothese attacks. LEDS [15] mitigates the impact of these attacksby allowing a few invalid MACs in the reports, but it does notsolve the problem completely. On the contrary, our scheme caneasily combat these attacks. In our scheme, each sensing nodediscloses its auth-key following the reports. Its neighbors canoverhear the node’s reports and disclosed auth-key, and verifythe validity of its MACs. Since the node is monitored by itsneighbors, it is deterred from launching the attacks.

In selective forwarding attacks, compromised forwardingnodes selectively drop the legitimate reports. These attacksare very hard to detect. In our scheme, each forwarding nodedisseminates to downstream neighbor nodes that areawarded the filtering capacity. To deal with the attacks, we canrequire the forwarding node send the reports to all of thesenodes. Unless all of them are compromised, the legitimate re-ports can always be delivered to the base station. However, thissolution incurs high communication overhead. An alternativeway is that in each round the forwarding node sends the reportsto a randomly chosen node out of those ones. Given that only

nodes are compromised, the impact of selective forwardingattacks will be mitigated into .

D. Filtering Other Attacks

Our scheme introduces new control messages and hence in-creases the complexity of its operations. It may suffer some at-tacks that are specific for itself. Here, we discuss how to dealwith these attacks.

1) Attack1: A Cluster-Head is Compromised: In our scheme,normal nodes take turns to act as the cluster-head, so there is nodifference between a cluster-head and a norma node. It meansthat a cluster-head may be easily compromised or any compro-mised node can claim to be a cluster-head.

A compromised cluster-head can disseminate a forgedand then inject false reports arbitrarily. Our scheme offers twocountermeasures to prevent this attack. First, any node includingthe compromised node is monitored by other nodes within thesame cluster. When any node overhears a forged , it caneasily detect that by checking its own auth-key that is containedin the . Thus, it knows that the cluster-head is compro-mised and can report this to the base station to revoke that node(how to revoke a node is out of the scope of our paper). Second,each must contain distinct -key. Since we assume thateach cluster has at most compromised nodes, there mustbe at least one invalid -key in the forged . The size ofglobal -key pool is , thus, each forwarding node can filterthe forged with a probability , or equivalently, theforged can travel hops following (11).

Similarly, when a compromised cluster-head generatesforged or false reports, these two countermeasures arestill useful. The forged message and reports not only aremonitored by other sensing nodes, but also can be filtered byforwarding nodes.



2) Attack2: Consecutive Compromised Nodes Collaborate:If two or more consecutive nodes are compromised and collab-orate with each other, they can share the auth-keys they decryptfrom to generate false reports without being monitored.

Assume consecutive nodes are compromised, where. They can decrypt auth-keys from a valid ,

where [as computed in (7)] is the probability that one candecrypt an auth-key from . Therefore, they can generatea false report containing only forge MACs. Sinceis also the probability that a forged MAC can be detected, thefalse report can be detected by an uncompromised node withthe probability and travel hops. Obviously, thisanalysis makes sense only when . Givenand , we have . It means when ,

consecutive compromised nodes cannot gain sufficientauth-keys to produce a false report without being filtered. Wecan achieve this by adjusting the values of , and . For ex-ample, when and , we can easily getfollowing (7).

3) Attack3: Compromised Forwarding Nodes AbusesMessage: The message can be abused in either negativeor positive ways. First, a compromised forwarding node can al-ways or selectively send negative messages to make the reportsdropped by its next-hop node. This is actually a selectively for-warding attack caused by the abuse of message. It can beaddressed with the solutions we discussed above. Second, using

message, a compromised forwarding node can cheat itsnext-hop node to forward false reports one more hop. Given thatthere are at most compromised nodes en-route, the worstcase is that every two compromised nodes are separated by auncompromised one. Therefore, in the worst case, thesecompromised nodes can make false reports forwarded at most

hops.4) Attack4: The Compromised Nodes use Invalid Node Index:

A false report containing unknown node indexes can escapefrom the detection of the forwarding nodes, which they thoughtthat they do not have the corresponding auth-keys for those un-known nodes.

It is not possible to make the forwarding nodes be aware of theindexes of all nodes in a cluster because nodes are randomly de-ployed. Our solution is to reassign each node a continuous indexfrom . One way is to let nodes do this by themselves. In theneighbor discovery phase, each node can overhear the indexesof others within the same cluster. Therefore, it can sort theseindexes in some order and reassign itself a new index. Anotherway is to let each forwarding node hash the nodes indexes into

. However, different indexes may be hashed into the samevalue, which causes false positive errors. We can deploy morethan nodes into each cluster and only allow one node to sendreports when hash collision happens among several nodes. Thebenefit is that we always have enough working nodes for eachcluster, even when some node dies.

5) Attack5: In Hill Climbing, A Large-Index -Key is Com-promised: In Hill Climbing, -keys of nodes are picked fromhash chains. When a node holding a large-index -key is com-promised, all the -keys of smaller indexes can be derived. Infact, compromising those -keys of smaller indexes is not an at-tack to our scheme. In Hill Climbing, -keys are only used by

forwarding nodes to decrypt auth-keys from . When an ad-versary compromises a large-index -key, he could not get moreauth-keys by deriving other -keys of smaller indexes within thesame hash chain.

However, when a forwarding node containing a large-index-key is compromised, other downstream nodes holding the-keys of smaller indexes can no longer decrypt the corre-

sponding auth-key, so they cannot detect a false report thathappens to contain a forged MAC using the correspondingauth-key. The filtering of this false report has to be delayeduntil it is received by another forwarding node who has a

-key of an even larger index. This is an attack caused bycompromising a large-index -key at some first hops, whichmay allow a false report to travel more hops. However, oursimulation results show that Hill Climbing is much better thanother schemes even under this type of attacks.

VI. SIMULATION EVALUATION

We study the performance of our scheme by simulation andcompare it with others such as SEF, IHA, and CCEF in terms offiltering capacity, fraction of false reports filtered, and memoryrequirement in different environments.

A. Simulation Setup

• nodes are randomly deployed into a msquare field with the base station located at the center. Thetransmission range of each node is m. These nodes aredivided into 100 clusters, where each cluster contains ex-actly nodes.

• Each node picks -keys and one -key, where thesize of -key pool and -key pool is .

• The size of memory used by each node is denoted as, and measured by the number of keys that each node

stores. Typically, . In our simulation, eachcluster-head disseminates auth-keys to forwarding nodes.One node may need to store the auth-keys from differentclusters. It divides its memory into equal-sized slots andassigns one slot to each cluster that it serves.

• Each node forwards to selected downstreamneighbor nodes, until reaches the base station or hasbeen forwarded hops. Typically, .

• Each aggregated report contains MACs, and thereare at most compromised nodes in each cluster.The compromised nodes from the same cluster collaboratewith each other to share the compromised secret keys.

• To simulate the dynamic topology, we apply a simpleON/OFF operation model, where each node switches itsstate between ON and OFF periodically. The duration ofON and OFF states satisfies an exponential distribution. Wedefine the percentage of OFF time as network churn rate,which indicates the extend of topology changing.

• The routing protocol adopted in our simulation is GPSR.However, IHA and CCEF are not suitable for GPSR be-cause they both require the existence of a fixed path be-tween each cluster-head and the base station for transmit-ting control messages in both directions. To make themwork on top of GPSR, we revise them accordingly and de-sign a revised IHA and a revised CCEF. Moreover, in the



Fig. 5. The fraction of false reports filtered as a function of the number of hopsthat they traveled (� � � for our scheme).

revised CCEF, we let each forwarding node always keepon forwarding the reports for which it has no witness key.This is different from the original CCEF in which those re-ports are always discarded.

B. Simulation Results

In summary, simulation results show that our scheme has thefollowing advantages when compared with others:

1) Our scheme drops false reports earlier even with a lowermemory requirement. In some scenario, it can drop falsereports in 6 hops with only 25 keys stored in each node, butanother scheme needs 12 hops even with 50 keys stored.

2) Our scheme can better deal with the dynamic topology ofsensor networks. It achieves a higher filtering capacity andfilters out more false reports than others in dynamic net-work.

3) Hill Climbing increases the filtering capacity of ourscheme greatly and balances the memory requirementamong sensor nodes.

1) Fraction of False Reports Filtered Versus Number of HopsThey Traveled: We first consider the case that compro-mised nodes are within the same cluster. We assume a staticenvironment in which all nodes are in ON state.

Fig. 5 illustrates how the fraction of false reports filtered in-creases as the number of hops that they traveled grows. In ourscheme, is disseminated within at most hopsand each node stores at most keys. In SEF, each nodepicks keys from one of partitions and each par-tition contains keys. Hence, our scheme and SEF aresubject to the same memory constraint. The simulation resultsin Fig. 5 show that our scheme can drop 90% of false reportswithin 5 hops (when using Hill Climbing) or 10 hops (withoutHill Climbing), while SEF needs about 25 hops to achieve thesame filtering result. The reason is that our scheme has a higherdetecting probability than SEF does. For example, without usingHill Climbing, our scheme can achieve , which ismuch larger than for SEF. When using Hill Climbingin our scheme, the detecting probability of the first forwardingnode is up to , about 15 times as great as that forSEF. This also demonstrates how Hill Climbing can improvethe filtering capacity of our scheme.

Fig. 6. The average number of hops traveled by false reports as a function ofthe memory size of sensor nodes. (� � � for our scheme).

We also plot the analytical results of our scheme in Fig. 5.We observe that the simulation result is a little worse than theanalytical one in the case of using Hill Climbing. This is dueto the limit of memory size ( ) that we set in thesimulation.

2) Filtering Capacity Versus Memory Size: Fig. 6 depictshow filtering capacity varies as memory size changes, where thefiltering capacity is measured as the average number of hops thata false report can travel. The smaller the number of hops, thehigher the filtering capacity. In SEF, when each node picks allof 100 keys from a partition, a false report can still travel morethan eight hops. On the contrary, in our scheme a false reportcan travel no more than six hops even when each node storesat most keys. Therefore, our scheme outperformsSEF even with a much lower memory requirement. Intuitively, alarger memory size can increase the filtering capacity. However,we do not observe too much improvement to our scheme when

, which implies that storing 25 keys in each node issufficient for our scheme.

3) Filtering Capacity Versus Maximum Number of Hops forKey Dissemination: Fig. 7 shows the impact of on the filtercapacity of our scheme. Typically, disseminating auth-keys far-ther makes more nodes capable of filtering false reports. At thesame time, the limited memory size forces each node to dis-card more auth-keys of each cluster in order to accommodatemore clusters. Hence, increasing the value of is not alwayshelpful. Fig. 7 indicates that the best value of is between5 to 10 because 90% of false reports have been dropped within10 hops, as shown in Fig. 5.

4) Filtering Capacity in Dynamic Environments: Sensornodes are prone to failures and may also turn off their radioand CPU to save energy, which makes the topology of sensornetworks highly dynamic. We simulate this by applying theON/OFF model and use network churn rate to measure the extendof the topology changing. We still assume compromisednodes are within the same cluster.

In Fig. 8, we compare the filtering capacities of differentschemes in dynamic environments that have different networkchurn rates. We distinguish the following two cases.

• The network churn rate is greater than 0.4: In this case,the deployed network is severely partitioned, and a lot of



Fig. 7. The average number of hops traveled by false reports as a function ofthe maximum number of hops for key dissemination. (� � � for our scheme).

Fig. 8. The average number of hops traveled by false reports as a function ofthe network churn rate. (� � �� and �� for our scheme).

repots are dropped due to path broken. Our experiments(not plotted in Fig. 8) show that around 10% of reports aredropped because of broken path when the network churnrate is 0.4, but more than 60% are dropped when the rate is0.9. It implies that when the rate is bigger than 0.4, moreand more false reports are dropped due to network parti-tion.

• The network churn rate is smaller than 0.4: In this case,partition is not a big problem, and the filtering capacity ismainly determined by the detecting probability of nodesand the length of paths from cluster-heads to the base sta-tion. When the network churn rate increases, the paths be-come longer and hence the false reports can travel morehops. We focus on this case in the following discussion.

Fig. 8 shows that our scheme has a higher filtering capacitythan most of others in dynamic environments. The only ex-ception is the original CCEF, which seems to outperform ourscheme. However, it has a severe drawback, that is, a lot of legiti-mate reports are dropped because forwarding nodes lack the cor-responding witness keys in dynamic environments. In addition,the original CCEF is not as good as our scheme in a static situa-tion, because it cannot filter the false reports generated by com-promised cluster-heads. Let us verify this with simple calcula-tion. When the network churn rate is zero, the average length ofa path is 27. Each cluster-head has a probability to

be compromised, in which case a false report can travel 27 hops.When the cluster-head is not compromised, a false report canadvance only one hop. Hence, the filtering capacity of CCEF is

hops. This calculated value isconsistent with our simulation result and it is much worse thanthat of our scheme.

In Fig. 8, we observe that the curves corresponding toSEF and our scheme are relatively flat, which means thesetwo schemes are more independent of the topology changesthan others. SEF achieves this by using probabilistic key pre-distribution, however, it has the tradeoff of a lower filteringcapacity. Our scheme achieves this by choosing downstreamneighbor nodes for each forwarding node in key dissemination.We studied the impact of different values of (from 1 to 6).Intuitively, a larger value of enables more nodes to receivethe key information necessary for filtering false reports, so it ismore suitable for dynamic networks. However, the limited sizeof memory forces sensor nodes to reduce their stored auth-keysand hence lowers the filtering capacity. Therefore, the valueof should be properly selected and cannot be too large orsmall. Our experiments show that the results for to 6 areclose to each other, although is slightly better than othervalues. Considering the high overhead incurred by a larger ,we select for our scheme. To make the figure clear, weonly plot the curves for and 2. Let us take our schemewith Hill Climbing as an example. In Fig. 8, we can see thatthe average number of hops traveled by false reports is 3.4618for and 2.9469 for when the network churn rate is0.1, and that number is 11.3745 for and 8.0412 forwhen the rate is 0.4. Therefore, choosing can improvethe filtering capacity by when the rate is 0.1,and when the rate is 0.4. This means thatour scheme is more adaptive to dynamic environments whenchoosing (e.g., ).

Fig. 9 depicts the fraction of false reports that reached thebase station as a function of the network churn rate. When thenetwork churn rate is greater than 0.4, the fraction goes downquickly because the network is severely partitioned. When thenetwork churn rate is smaller than 0.4, the fraction is mainly de-termined by the detecting probability of nodes. The simulationresults in Fig. 9 show that our scheme can drop more fractionsof false reports than others except for the original CCEF (be-cause CCEF even drops legitimate reports due to the lack of awitness key). When the network churn rate is increasing from 0to 0.4: 1) The fractions corresponding to our scheme and IHAgo up gradually because more false reports are forwarded bythe nodes without corresponding auth-keys. 2) The fractions forSEF and the revised CCEF decrease quickly because the paths tothe base station become longer and the false reports are checkedby more nodes and hence more likely to be filtered.

5) Filtering Capacity When Forwarding Nodes are Compro-mised: Besides sensing nodes, forwarding nodes can also becompromised. We assume that a forwarding node cannot collab-orate with the compromised sensing nodes by sharing their keysdirectly. However, they may collaborate indirectly. That is, aftera forwarding node is compromised, it stops filtering out false re-ports. Moreover, after detecting a forged MAC, it may even re-place the forged MAC with a correct one generated using its own



Fig. 9. The fraction of the false reports that reach the base station as a functionof the network churn rate. (� � ��, �� , and � � � for ourscheme).

TABLE IAVERAGE NUMBER OF HOPS TRAVELED BY FALSE REPORTS

key. In these simulations, we assume there are exactly com-promised nodes including one compromised cluster-head. Wefurther differentiate two scenarios: 1) The compromised nodesare randomly distributed over the whole network. 2) They arelocated right on the path from the compromised cluster-head tothe base station.

Table I shows the comparison results of filtering capacityamong various schemes in these two scenarios. We set

and in our scheme, and do not test CCEF be-cause it cannot filter the false reports generated by the compro-mised cluster-head. The results in Table I demonstrate that ourscheme outperforms others and can drop false reports earlierin both scenarios. The causes of these advantages are twofold:1) Our scheme offers each node a higher detecting probability.2) Our scheme allows each node to monitor its downstreamnodes, which prevents the compromised forwarding nodes fromcontaminating MACs.

VII. CONCLUSION

In this paper, we propose a dynamic en-route quarantinescheme for filtering false data injection attacks and DoS attacksin wireless sensor networks. In our scheme, each node usesits own auth-keys to authenticate their reports and a legitimatereport should be endorsed by nodes. The auth-keys of eachnode form a hash chain and are updated in each round. Thecluster-head disseminates the first auth-key of every nodeto forwarding nodes and then sends the reports followed bydisclosed auth-keys. The forwarding nodes verify the authen-ticity of the disclosed keys by hashing the disseminated keysand then check the integrity and validity of the reports usingthe disclosed keys. According to the verification results, they

inform the next-hop nodes to either drop or keep on forwardingthe reports. This process is repeated by each forwarding nodeat every hop.

Our scheme has several advantages: 1) Compared withothers, our scheme can drop false reports much earlier evenwith a smaller size of memory. 2) The uncompromised nodeswill not be impersonated because each node has its ownauth-keys. Therefore, once the compromised nodes are de-tected, the infected clusters can be easily quarantined. 3) OurHill Climbing key dissemination approach increases filteringcapacity greatly and balances the memory requirement amongnodes. 4) Each node has multiple downstream nodes that pos-sess the necessary key information and are capable of filteringfalse reports. This not only makes our scheme adaptive to highlydynamic networks, but also mitigates the impact of selectiveforwarding attacks. 5) Monitored by its upstream nodes andneighbors, the compromised nodes have no way to contaminatelegitimate reports or generate false control messages.

However, to achieve these advantages we have to makesome tradeoffs: 1) Our scheme is more complicated than SEFby introducing extra control messages such as ,and . The use of these control message not only increasesoperation complexity, but also incurs extra overhead, as wealready discussed in Section V-B. 2) Like any normal reports,the control messages can also be abused, i.e., they also sufferforgery and DoS attacks. Fortunately, we already proposedsome method to prevent the abuse of control messages. Asdiscussed in Section V-D, a forged can be filtered within

hops. 3) The introducing of extra control messages triplesthe delay of reports. 4) Our scheme requires each node tomonitor its downstream nodes and neighbors, which can beachieved by using only bidirectional links. Therefore, sensornodes have to discard all directed links. 5) In our scheme, eachnode uses the same auth-key to authenticate all of its reports inthe same round. Therefore, this auth-key can only be disclosedafter the forwarding nodes forward the reports to their next-hopnodes, which increases memory overhead of the forwardingnodes. 6) Our scheme can not be easily coordinated with otherenergy-efficient protocols, because in our scheme each nodehas to be awake until it overhears the broadcast of its next-hopnode.

VIII. FUTURE WORK

In future, we will study how to take advantage in our schemeof various energy-efficient data aggregation and disseminationprotocols for wireless sensor networks.

ACKNOWLEDGMENT

The authors appreciate anonymous reviewers for their valu-able suggestions and comments.

REFERENCES

[1] D. Braginsky and D. Estrin, “Rumor routing algorithm for sensor net-works,” in Proc. WSNA, 2002, pp. 22–31.

[2] N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less low cost outdoorlocalization for very small devices,” IEEE Personal Commun. Mag.,vol. 7, no. 5, pp. 28–34, Oct. 2000.



[3] S. Capkun and J. Hubaux, “Secure positioning of wireless devices withapplication to sensor networks,” in Proc. IEEE INFOCOM, 2005, vol.3, pp. 1917–1928.

[4] L. Eschenauer and V. Gligor, “A key-management scheme for dis-tributed sensor networks,” in Proc. ACM CCS, 2002, pp. 41–47.

[5] T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, “Range-free localization schemes in large scale sensor network,” in Proc. ACMMobiCom, 2003, pp. 81–95.

[6] C. karlof and D. Wagner, “Secure routing in wireless sensor networks:Attacks and countermeasures,” in Proc. 1st IEEE Int. Workshop SensorNetw. Protocols Appl., 2003, pp. 113–127.

[7] B. Karp and H. T. Kung, “GPSR: Greedy perimeter stateless routingfor wireless networks,” in Proc. ACM MobiCom, 2000, pp. 243–254.

[8] L. Lazos and R. Poovendran, “SeRLoc: Secure range-independent lo-calization forWireless sensor networks,” in Proc. ACM WiSe, 2004, pp.21–30.

[9] L. Lazos, R. Poovendran, and S. Capkun, “ROPE: Robust position esti-mation in wireless sensor networks,” in Proc. IPSN, 2005, pp. 324–331.

[10] D. Liu and P. Ning, “Establishing pairwise keys in distributed sensornetworks,” in Proc. ACM CCS, 2003, pp. 52–56.

[11] R. Nagpal, H. Shrobe, and J. Bachrach, “Organizing a global coordinatesystem from local information on an ad hoc sensor network,” in Proc.IPSN, 2003, LNCS 2634, pp. 333–348.

[12] D. Nicolescu and B. Nath, “Ad-hoc positioning systems (APS),” inProc. IEEE GLOBECOM, 2001, vol. 5, pp. 2926–2931.

[13] A. Perrig, R. Szewczyk, V. Wen, D. Culer, and J. Tygar, “SPINS: Se-curity protocols for sensor networks,” in Proc. ACM MobiCom, 2001,pp. 189–199.

[14] B. Przydatek, D. Song, and A. Perrig, “SIA: Secure information aggre-gation in sensor networks,” in Proc. ACM SenSys, 2003, pp. 255–265.

[15] K. Ren, W. Lou, and Y. Zhang, “LEDS: Providing location-awareend-to-end data security in wireless sensor networks,” in Proc. IEEEINFOCOM, 2006, pp. 1–12.

[16] “TinyOS community forum,” [Online]. Available: http://www.tinyos.net

[17] A. Woo, T. Tong, and D. Culler, “Taming the underlying challenges ofreliable multihop routing in sensor networks,” in Proc. ACM SenSys,2003, pp. 14–27.

[18] H. Yang and S. Lu, “Commutative cipher based en-route filteringin wireless sensor networks,” in Proc. IEEE VTC, 2004, vol. 2, pp.1223–1227.

[19] H. Yang, F. Ye, Y. Yuan, S. Lu, and W. Arbaugh, “Toward resilientsecurity in wireless sensor networks,” in Proc. ACM MobiHoc, 2005,pp. 34–45.

[20] F. Ye, H. Luo, S. Lu, and L. Zhang, “Statistical en-route detection andfiltering of injected false data in sensor networks,” in Proc. IEEE IN-FOCOM, 2004, vol. 4, pp. 2446–2457.

[21] Y. Yu, R. Govindan, and D. Estrin, “Geographical and energy awarerouting: A recursive data dissemination protocol for wireless sensornetworks,” Comput. Sci. Dept., Univ. California, Los Angeles,UCLA-CSD TR-01–0023, 2001.

[22] Z. Yu and Y. Guan, “A dynamic en-route scheme for filtering falsedata injection in wireless sensor networks,” in Proc. IEEE INFOCOM,2006, pp. 1–12.

[23] S. Zhu, S. Setia, and S. Jajodia, “LEAP: Efficient security mechanismsfor large-scale distributed sensor networks,” in Proc. ACM CCS, 2003,pp. 62–72.

[24] S. Zhu, S. Setia, S. Jajodia, and P. Ning, “An interleaved hop-by-Hopauthentication scheme for filtering of injected false data in sensor net-works,” in Proc. IEEE Symp. Security Privacy, 2004, pp. 259–271.

Zhen Yu (M’05) received the B.S. degree fromShanghai Jiao Tong University, Shanghai, China, in1995, and the M.S. degree from Iowa State Univer-sity, Ames, in 2003, both in electrical engineering.

He is currently a Ph.D. candidate in the Depart-ment of Electrical and Computer Engineering, IowaState University. His research interests cover securityissues in wireless networks and distributed systems.

Yong Guan (M’99) received the B.S. and M.S.degrees in computer science from Peking University,Beijing, China, in 1990 and 1996, respectively, andthe Ph.D. degree in computer science from TexasA&M University, College Station, in 2002.

He is an Associate Professor with the Departmentof Electrical and Computer Engineering, Iowa StateUniversity, Ames, and is affiliated with Iowa StateUniversity’s NSA-designated Information AssuranceCenter. Meanwhile, he is an Ames Lab Associate forthe Midwest Forensics Resource Center at the U.S.

DoE’s Ames Lab. Between 1990 and 1997, he worked as an Assistant Engineer(1990–1993) and Lecturer (1996–1997) with the Networking Research Groupof Computer Center, Peking University. In 2002, he joined Iowa State Univer-sity as a faculty member. His research interests focus on security and privacyissues, including computer and network forensics, wireless security, and pri-vacy-enhancing technologies for the Internet.

Dr. Guan served as the General Chair for 2008 IEEE Symposium on Secu-rity and Privacy (Oakland, CA), the Program Co-Vice-Chair for ICDCS 2008(Security and Privacy Area), the Co-Organizer for ARO Workshop on Dig-ital Forensics (2009), and on the Program Committees of a number of confer-ences and workshops (including ACM CCS, INFOCOM, ICDCS, IFIP-SEC,SecureComm, SADFE, DFRWS, ISC, etc.). He received the Best Paper Awardfrom the IEEE National Aerospace and Electronics Conference in 1998, secondplace in the graduate category of the International ACM student research contestin 2002, the NSF Career Award in 2007, the Iowa State University Award forEarly Achievement in Research in 2007, the Litton Industries Professorship in2007, and the Outstanding Community Service Award of IEEE Technical Com-mittee on Security and Privacy in 2008.


Documents

A Dynamic en-Route Filtering Scheme for Data