Research Article Resilient Multipath Routing Mechanism...

Hindawi Publishing CorporationInternational Journal of Distributed Sensor NetworksVolume 2013 Article ID 352062 10 pageshttpdxdoiorg1011552013352062

Research ArticleResilient Multipath Routing Mechanism Based onClustering with Intrusion Tolerance

Shukui Zhang12 Hongyan Zuo1 Jianxi Fan1 and Juncheng Jia1

1 School of of Computer Science and Technology Soochow University Suzhou 215006 China2 State Key Laboratory for Novel Software Technology Nanjing University Nanjin 210093 China

Correspondence should be addressed to Shukui Zhang zhangsk2000163com

Received 12 July 2013 Accepted 11 September 2013

Academic Editor Chongsheng Zhang

Copyright copy 2013 Shukui Zhang et al This is an open access article distributed under the Creative Commons Attribution Licensewhich permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited

Wireless sensor networks (WSNs) integrate sensor technology communication technology and information processing technologyit is a synthetic discipline WSNs have been applied into almost all walks of life However in many special fields network securityis a basic and important factor which we must concern for This paper introduces the key management scheme after analyzing thesecurity threats of LEACH protocol At the same time we adopt several related mechanisms to protect the communication amongthe sensor nodes and the confidentiality of the data transmission Also we use the mixed multipath mechanism among the clustersto improve the security of the network and strengthen the intrusion tolerance

1 Introduction

The single path in WSNs just created the optimal path whichis from the source node to the convergent node to respondtimely to the specific mission requirements which can savespace for storage resources reduce each communication traf-fic and simplify algorithm but the limited bandwidth willlead to the fact that network reliability is poor and fault toler-ance is weak and a node failure could lead to the fact that thewhole link is not available so designing reliable routing pro-tocol is needed to improve the reliability of data transmission[1] Multi-path routing is that among the source node and thedestination nodemultiple paths are establishedwhich use theprimary path for data transmission if the primary path failssuboptimal path continuing for delivery will be selected fromthe backup paths Disjoint multi-path is the establishmentof a number of no convergent node paths among sourcenode and convergent node while if the primary path of theway of a node failses it will cause the entire link paralysisIn order to solve the problems that winding path introducedthismechanismallowsmultiple intersecting nodes among thebackup paths and the winding path Each of the nodes onthe primary path has a winding path multiple winding pathas an alternate path to constitute the primary path winding

multipath If a node is not available on the primary path therouting protocol will select automatically the winding paththat bypasses the fault nodes to transmit data to the nodeso through the multi-path mode the reliability of the datatransmission can be improved [2]

Routing protocol influences the performance of the net-work importantly which can be divided into flat routing pro-tocol and cluster routing protocol in the network topologyview In flat routing each sensor nodersquos status is equal and hasthe same routing function which can transmit data throughother nodes in the middle so such structure is simple andeasy to maintain and has good robustness But when thenumber of nodes is large and the network scale is huge themanagement andmaintenance of routing will consumemoreenergy scalability relatively will be poor as a transit nodewhich will transmit data more times and energy consump-tion will be faster so the structure is only suitable for smalland medium-sized network [3]

Directed diffusion protocol [4] is a query-based flat rout-ing protocol and routing takes periodic updates and mainte-nance to adapt to changes in network topology Convergentnode sends query tasks using the flooding way to spread theinterestedmessage to all sensor nodes in themonitoring areaIn the process of information dissemination protocol creates

2 International Journal of Distributed Sensor Networks

a gradient which reversely transfers data from the sourcenode to the convergent nodeThen the convergent node findsthe strengthening path which is the earliest path from thesource node to the convergent node path and informs thesource node Eventually the source node transfers the datacollected to the convergent node by this routeThe algorithmhas good scalability but both the energy consumption androuting overheads are larger

The sensor node itself has a small size it is easy to replacethe battery and so on so that we must first consider isthe energy consumption problem Now clustering topologiescontrolling the network are commonly used In order tobalance the network node energy consumption periodicallycluster head selection is usually carried out Clusteringrouting is suitable for networks which deploy numbers ofnodes and have a large scale LEACH (Low Energy AdaptiveClustering Hierarchy) protocol [5] is an adaptive clusteringtopologymechanism which uses periodic execution processrandomly elects cyclic cluster head and balances energy dis-tribution networks to each sensor nodeThe agreement intro-duces a ldquoroundrdquo concept which stages in the establishmentof the cluster head The node generates a random numberbetween 0 and 1 and if this number is less than119879(119899) the nodewill become a cluster head and the elected node will messageto inform other nodes that it is a cluster head Other nodesare usually based on their received signal strength to select amember of clusters and send the message notification to addthe cluster head in the cluster After cluster head receives therequest which all nodes join it the cluster head gives them thecommunication slot allocation In stable transmission phasemember nodes of the cluster head node receive the broadcastquery request which ismonitored area of data collection andthen send data at one hop to the corresponding slot clusterhead After a period of time cluster head collects data ofwhich all member nodes were the data sent and fusion finallysends the result to the base station As in formula (1) randomnumber119879(119899) is expressed as follows where119901 is the head nodeof all the nodes in the cluster percentage 119903 is the currentround number 119903 mod (1119901) represent elected cluster headsthe G is nonelected cluster heads

119879 (119899) =

119901

1 minus 119901 (119903 mod (1119901)) 119899 isin 119866

0 other(1)

However clustering mechanism will have problems suchas the uneven distribution of cluster heads heavy tasks orfast energy consumption issue thatmakes them stop workingsoon affecting the data transmission or even the entirenetwork topology To solve this problem a lot of articles useddouble cluster head algorithm [6] and join assistant clusterhead clustering algorithm [7] to a certain extent reducing theburden of cluster heads and the total energy consumption ofthe node This paper summarizes some of the existing clus-tering algorithms we propose a new mechanism to enhancethe network fault tolerance

However WSNs and the rapid development of relatedtechnologies have strong practicality which makes networksecurity vital and relates people to the hot issue The network

is generally used to collect and process the data which is diffi-cult to reach in harsh environmentsMost of the sensor nodesare not tamper-resistant or anticapturing ability once a nodeis captured an attacker can get through information fromthis node to other nodes in the network It makes the attacknodes send some error message or do not communicate withother nodes which even leads to communication link failureresulting in great loss of data Sensor network security risksare often precise because of the bad node deployment area orthe communication methods used Therefore it should solvethe transmission of information confidentiality integrityauthenticity and intrusion detection problem or even if thenetwork is attacked by malicious ones and how to maintaintheir basic communication function is very important [8]In this paper we proposed a new scheme which is aimedat analyzing security issues which LEACH protocol securitycauses and then we combines the inherent characteristics ofthe network whose purpose is to reduce the chance in whichthe data transmission process information is stolen nodesare posing or malicious nodes tamper with the informationthis makes the node in the process of transmitting dataeven if the encountered attack will also be able to normalizecollaboration work to complete basic tasks

2 Description of the Problem

Cluster head bears most of the LEACH protocol tasks suchas data fusion forwarding and communication with the basestation Cluster head task is heavy whichmakes of fast energyconsumption but also in the data transfer process it is morevulnerable to malicious attacks and exposure the transmittedinformation It leads to poor network security and thus thenode does not complete the task Here is a summary ofLEACH vulnerable to attack in the following three items [9]

(1) Sybil attack it refers to a single node emergingwith multiple identity In the cluster head electionphase attackerrsquos multiple identities will lead to manynodes are easy to selects as the cluster heads Electedmalicious node controls most of the data node andfurther damages of the network

(2) Hello flooding attacks according to the means whichcluster head send the signal strength member nodeschoose to join a cluster If a malicious attacker hasmore energy flooding the entire network broadcast amanner notice strength many nodes will choose tojoin this cluster where the malicious node exits thenthe network will be vulnerable to the impact of thesemalicious nodes which even will cause the networkto be unavailable

(3) Selective forwarding attack such attacks mean thatif a malicious node receives a packet it will not beforwarded directly to the data integrity but part of itwill be lost or tampered before sending so that thedata cannot be accurately inevitably lead to reach thedestination and this is the loss of capture authenticityand integrity of the data

The trust evaluation mechanism [10] can discover unco-operative nodes in the network which can be used to reduce

International Journal of Distributed Sensor Networks 3

the probability of being attacked thus improving dataintegrity security and confidentiality If the node trust valueis introduced it will be removed from the network afterbeing determined in some way after which we can improvethe probability of internal network attacks But often thereare many external malicious network attacks such as thefttampering and spoofing How to take measures to simulta-neously solve both internal and external attacks is a problemworthy of study The literature [9] combines cryptographyand proposes a secret sharing technology with intrusion tol-erance capabilities clustering routing scheme to improve thedata transmission network intrusion tolerance capabilitiesIn order to reduce energy consumption and improve theroute network security the literature [11] introduced a secureboot program and node two-way mechanism evaluation todetect malicious node is directly removed from the networkto enhance the security of the entire network

In order to reduce the burden of cluster head and theenergy consumption of nodes this paper presents a specialfeature called ldquoDaemon Node (DN)rdquo whose job is head nodeselection path creation and so on This node can also becalled a ldquobackstage noderdquo or ldquoservice noderdquo because even ifother nodes are in sleep they have been inworking conditionunless their energy is depleted or there is collapse of theentire network and the nodewill be extinctThenwe adoptedand improved the literature [9 11] studied the program andproposed an Intrusion tolerance based on clustering multi-path routing mechanism (ICRM) which uses secret sharingbetween the nodes in some way the key is split and assignedto the sensor nodes in the network and cipher text recoverymust be carried out with a threshold common trusted nodecollaboration Among neighbors daemon nodes and clusterhead is established the pairs of random key introducedevaluation mechanisms Data transmission between clusterswill use hybrid multi-path mode hoping to improve the dataon the network communication traffic and reduce the proba-bility of the node to be captured thus reducing the possibilityof attacks on the entire network

3 Network Model

119899 sensor nodes are randomly deployed in a square of sidelength 119871 of the monitor area 119860 Intercluster communicationdistance at least is greater than the distance between the twocluster heads and the network collected by cluster head set isconnected

Assume that the daemon node has the following proper-ties (1) not for data acquisition and integration but to receivethe base station it sends query request tasks and broadcast tothe member nodes (2) it maintains the energy of each nodelocation and other information and real-time update nodestatus information (3) it makes dynamic perception node inother cases such as the newnode adding or failure of the nodeexit (4) among the cluster nodes and other daemon nodesvirtual path in established for data transmissionmaintenanceestablished routes (5) it is used for controlling cluster headwork such as cluster head direction of data transfer WSNsmodel [12] is as follows

(1) Each sensor node for data transmission contains thesame initial energy and each of which has a unique IDnumber

(2) After the deployment of sensor nodes which cannotmove freely the base station position is fixed in oneplace outside of the monitoring area the daemonnodes and the selected cluster heads position is con-nected and unified tag

(3) According to the received signal strength to nodespositioned approximate distance to base station butwhich do not know the specific location or there isno GPS function to obtain accurate position informa-tion

In clustering algorithm the cluster size is a factor to beconsidered for ICRM algorithm which is described as fol-lows

(1) Taking into account the time required to select acluster head consumption problem here is the introductionof the cluster head energy factor and in certain conditionsrandomly selected119879CH whose value is less than the threshold119879CH reference LEACH protocol definition is

119879CH =

119901

1 minus 119901 (119903 mod (1119901))

1

radic119864init119864current 119899 isin 119866

0 other(2)

where 119864init is the initial energy which the remaining nodes inaddition to the daemon node have and 119864current is the nodersquoscurrent energy

(2) The area covered by each cluster radius is fix (119877)which is the same size of each cluster According to literature[13] 119877 derived optimum radius of the cluster is defined asfollows

119877 = 2 4radic2120587 times 119878 times 119864DA27 times 119899 times 120576pa

(3)

where 119878 is the total area of the monitoring area 119864DA is theintegration of energy consumption data 1 bit and 120576pa is theenergy for power amplification

(3) For a more balanced distribution the distancebetween adjacent randomly selected nodes requires morethan 119863 119863 is defined as

119863 = 2119877 +119902

radic119871119896120587

(4)

where 119902 is a constant aimed at area119860which can be adequatelycovered and is almost uniformly distributed

(4) In order to ensure inter-cluster does not cover andall nodes must belong to a cluster each cluster daemonnode using radius fix (119877) sends a message the node whichreceived information is added to the cluster where thedaemon nodes is If a node receives many messages selectthe first notification to join and become a member of thecluster nodes where eachmember node is only one hop fromthe cluster head node and then the daemon node sends a


confirmation message to indicate that the node can join thecluster

(5) The daemon node obtains the information or eachnode in the cluster denoted as 119864res for the cluster headresidual energy as 119864avg for the energy average of all the nodesin the cluster After the nodeworks for some time if119864res is lessthan 119864avg daemon node will reselect again the cluster headwhich dynamically updated the nodewithmaximum residualenergy

(6) In this paper the literature [5] uses the same first-order model of wireless communication

The sender sends 119897 bit data to the distance 119889 of the energyconsumption of the receiver which is

119864119905119909

(119897 119889) = 119897 times 119864elec + 119897 times 120576mp times 119889

4 119889 ge 119889

0

119897 times 119864elec + 119897 times 120576fs times 1198892 119889 lt 119889

0

(5)

119871 bit data received energy consumed is

119864119903119909

(119897) = 119897 times 119864elec (6)

where 119864elec is the sending or receiving circuit that consumesenergy 119889

0is the distance threshold value

1198890

=radic120576fs

radic120576mp (7)

where 120576mp is a multichannel attenuation model power ampli-fication factor when sending the distance is greater than orequal to 119889

0 multiple attenuation model will be used 120576fs is the

power amplification coefficient in the free spacemodel whenthe transmission distance is less than 119889

0 the free-spacemodel

will be used

4 ICRM Working Process

Daemon node contains the encryption key 119870 and the hashfunction 119865() by which the data processing function is verydifficult to launch a value Outside the area the base stationis in the monitoring of a security zone all the nodes of thenetwork ID and the key pool are loaded onto the base stationbut also each daemon node of the cluster storing the keyinformation which nodes in the cluster and nodes in othercluster nodes and maintaining a key ring which this articleassumes that daemon node has more energy and ability

41 Authentication Each daemon node is managed andmaintained in its cluster real-time monitors of each clusternode in which the sole is representative of the cluster wherethe nodes is so need to be authenticated to the base stationHere BS is the base station DN is the daemon node DN

119894is

the 119894th (119894 = 1 2 119898) node A rarr BC means that A sendsthe message C to B and ACK is the identification

This phase is as detailed below

(1) DN119894sends status request message REQ to BS

DN119894997888rarr BS 119894REQ (8)

(2) after BS received find DN119894corresponding ID

119894(dae-

mon node identifier) which is calculated 119865(ID119894) by

119865() then calculate 119881119894

= 119877119894

+ 119865(ID119894) which 119877

119894is

selected random value according to different dae-mon node Then it is cryptographically certifiedMAC

119877119894

(ACK) by 119877119894 finally BS sends a message to

DN119894

BS 997888rarr DN119894119881119894MAC

119877119894(ACK) (9)

(3) after DN119894 receipt of the message calculate 119865(ID

119894) by

119865() draw119877119894= 119881119894minus119865(ID

119894) and decryptMAC

119877119894

(ACK)

by 119877119894to get ACK Then DN

119894is also a randomly gen-

erated number 119877lowast

119894 calculated as 119881

lowast

119894= 119877lowast

119894+ 119865(ID

119894)

send a message to BS

DN119894997888rarr BS 119881

lowast

119894MAC

119877lowast

119894

(ACK) (10)

(4) after BS receipt calculate 119877lowast

119894= 119881lowast

119894minus 119865(ID

119894) then

decrypt whether the ACK by 119877lowast

119894 and if so DN

119894

authentication is successful or need to use retrans-mission mechanism

42 The Key Distribution and Establishment Daemon nodescommunicate with the base station to inform the numberand location of the cluster head Each cluster head CH

119894(119894 =

1 2 119898) stores allocation key share Key segmentationprocess [9] summarized as follows The base station firstuse of encryption function ENC and 119864 will be encryptedsecret 119878 119864 = ENC

119896(119878) Reuse some decomposition algorithm

divide 119864 into 119898 obtaining 1198641 1198642 119864

119898 and assign to

each cluster head Then divide the entire key 119870 into 119898

obtaining 1198701 1198702 119870

119898 Finally put two tuples (119864

119894 119870119894) (119894 =

1 2 119898) as key shadow 119878119894and send to the cluster headCH

119894

To implement a secure connection between the nodesthis requires the establishment the key because of it includesdifferent types of nodes in order to reduce the degree ofinteraction between them this section of different nodesuses different keys This reference literature [14] is the keydistribution of thoughts to solve the clustering model withdaemon nodes that is the setup of all kinds of key nodesDaemonnode and base station are stored as preloadedmasterkey whose mainfunction is to prevent the network attackduring initialization which causes information to be stolenand 119870

119898generate the key pair which will be automatically

deleted This phase is divided into three parts as follows

The Establishment of a Key among Nodes and Base StationsBase station and each daemon node according to119870

119898generate

a session key is as followsPK (119903) = 119864 (119870

119898 119877) (11)

where 119877 is random number for a base with the daemonnodersquos private key 119870

119894(119894 = 1 2 119898) encrypted obtaining

119877119870119894

and sent to each daemon node Communication betweendaemon nodes and base station in order to guarantee theauthentication should be deposited in the key

The Key Establishment between Daemon Nodes and MemberNodes Member nodes distribute key share with reference


to the above process of cluster heads share the numberfor 119899 minus 2119898 (where 119899 is all the nodes numbers 2119898 is thetotal number of the cluster heads and daemon nodes) andeventually every member node gets a key from the basestation and then directly sends its ID and key to daemonnode The daemon nodes after receiving information querytheir own key ring to find if there is information matching ifso they will send a confirmation the members of the clusterhead ID and control the establishment of the connectionamong the member nodes Use the encryption key pair 119870DN119894daemon nodes and the communication link between the 119894th(119894 = 1 2 119899 minus 2119898) member nodes cluster heads andmember nodes communication link between key encryptionsfor 119870CH119894

The Key Establishment among the Daemon Nodes Accordingto 119870119898and 119865() generate a unique key and key pair such as

daemon node 119886 ID for 119886 identifier and 119871119886as its position

information [15] based on the two having the only key 119870119886

as follows

119870119886

= 119865119870119898

(ID119886 119871119886) (12)

Then each daemonnode builds key pairwith the neighbordaemon nodes in the cluster Daemonnodes 119886 and 119887 in neigh-bor cluster for example 119886 broadcasts its ID to its neighborcluster after receipt of 119887 and compares its stored informationin the key ring if there is corresponding information toestablish a connection between two nodes [14] They set upthe shared secret pair 119870

119886119887as follows

119870119886119887

= 119865119870119898

(ID119886 119871119886 ID119887 119871119887) (13)

If 119887 did not correspond to 119886 key each of themwill respec-tively send the message which is the request to establish ashared secret pair to the base station including their IDWith the receipt of base station assigne key for them andreply from the key pool after 119886 and 119887 are received usingthe decryption key 119870 and gain 119870

119886119887 finally to establish

a connectionShared key to establish the schematic is shown in Figure 1

43 Measurement of the Node In order to improve thelegitimacy of node identity in communication we also needto test the credibility of cluster heads and member nodesin this section by reference to the literature [11] the ideasof nodes for assessment when their trust value reachesa certain threshold are allowed to participate in data transferotherwise it is considered entrusted node and deleted fromthe web directly This phase is divided into two parts asfollows

Cluster Heads to Member Nodes Each cluster head is set to avalue of moderate threshold 119879 (0 lt 119879 lt 1) using formula(14) calculated member nodes reputation value Cread

119894(119894 =

1 2 119899 minus 2119898)

Cread119894=

1205821119862 + 120582

2119861

(1 minus 1205821

minus 1205822) 119878

(14)

Cluster head Daemon node Member node The shared key path

Figure 1 The establishment of a shared secret key

where119862 is a member node sending data current 119861 is the sumof themember nodes to senddata before 119878 is the total numberwhich the member nodes send 120582

1and 120582

2(0 lt 120582

1 1205822

lt 1)being both the corresponding weights

If Cread119894

ge 119879 members of the node are credible ifCread

119894lt 119879 mark them as malicious nodes

If member nodes aremalicious nodes after daemon nodereceives cluster head signal board case delete the messagemesdel Daemon nodes will store their ID but delete theircarrying keyThe evaluation mechanism shown in (15) by theway has already been leaked keys can be deleted from thenetwork which increase the security of network

Cluster Head in Member Nodes of the Assessment Consider

CM119894997888rarr CH IDCM

119894

IDCH 119864 119870CH119894Random119894mes

CH 997888rarr CM119894IDCM

119894

IDCH 119864 119870CH119894Random119894mesdel

(15)

where CM119894is the 119894thmember nodes CH is cluster head IDCH

is the cluster identifier119864119870 is encryption using the secret key119870 Random

119894is the 119894th nodewhich generated randomnumber

and mes is sending information for members of the clusterhead

Member Nodes to Cluster Heads Evaluation of the above (1)can prevent malicious nodes into the network but in order tobring more security it also needs member nodes evaluatingcluster head to determine the current cluster heads which canbe trusted This mechanism is shown in the following

Member Nodes in Cluster Head of the Assessment Consider

CM119894997888rarr DN IDCM

119894

DN 119864 119870DN119894Random119894mes

DN 997888rarr CM119894IDCM

119894

DN 119864 119870DN119894Random119894mesdel

(16)


What is mentioned above only represents single membernodes in cluster head of assessment in order to improve thereliability of the results all the member nodes are involvedin the mechanism and then send the result to directly placedaemon node in cluster after daemon nodes received allmember nodes in this cluster node test information and thencluster head judges the credibility

44 Multipath Routing The literature [16] proposes animproved bulk density of the intrusion-tolerance ability of therouting protocol to reduce the influence degree of the failurenodes on the network the experiments show that the newrouting protocol can effectively achieve data branching andimproving the network capacity intrusion-tolerance abilityBut in the literature a common node in routing is just estab-lished and this section will use the combination of disjointpath and winding path to the multi-path routing establishedbetween cluster heads This phase is in the following threeprocesses

Build Paths Because of the time of authentication and keyestablishing base station already known as daemon nodelocation and distance information daemon nodes need tosend PATHREQ messages (including their own ID) in orderto show how to begin the establishment of path The basestation feedbacks the PATHREV information to the daemonnodes after it receives the message and according to the pre-viously stored information we calculate the distance betweenthem finally each guard node maintains a routing table

The Route Choice First using Floyd algorithm we calculatethe shortest path from source daemon node to the basestation and record every daemon node of the path Thenwe build short path again but no longer using the daemonnode which is the primary path from source daemon node tobase station which it passes by for example daemon nodeA midway through the B and C to base station when thesecond shortest path is built in other daemon nodewe expectthe two nodes again using Floyd algorithm and calculate thesecond shortest path from A to the base station as A backuppath and then press the same way to build A next secondshortest path to the base station as the second backup pathsand so on which constructs the backup paths [17] Finallyusing winding path algorithm we construct the primaryand second shortest path winding paths of each daemonnode which makes every daemon node in at least one pathBuilding themulti-path routing diagram is shown in Figure 2

But this only establishes virtual path among daemonnodes the daemon node should command and controlcluster head communication if daemon nodes and clusterheads position is once established it will not be changed evenchanges in the cluster heads are just changes of the locationof the original cluster head and new cluster head After thesuccess which among cluster heads is the primary path thesecond shortest path and winding path are set up and finallystep into the stage of data transmission

Source cluster The base

station

A BC

Cluster headDaemon node Member node

The shortest path The second shortest path Winding path

Communication in the cluster

Figure 2 A mix of multi-path

The Data Transmission Phase Daemon node preserves thebackup in which it and cluster heads have merged dataThis section established the shortest path and the secondshortest path member nodes sent the collected informationto the cluster heads primary cluster fusion data and groupedpackaging [18ndash20] a set of data using the shortest path trans-mission and another group using the second shortest pathtransmission The two paths of the next cluster head receivedata and fusion of informationwhich it presses and continuesto transfer until reaching the base station base station receivetwo grouping of the data in the data reorganization and alsoneeds to get the key information First we have to collect 119898119878

119894

of cluster head CH119894(119894 = 1 2 119898) on two links with secret

sharing scheme 119864 and the secret key 119870 to recover finallyby using the key 119870 and the DEC decryption 119864 obtaining 119878119878 = DEC

119870(119864)

Through the data packet assigned to multiple pathseven if a cluster head is captured within the network thiswill not leak the complete information of data And eachcluster head is established by winding path on the primarypath even cluster is attacked and the data transmission willautomatically bypass the failure nodes and cluster headswill continue information transmission to the base stationthrough the winding path which can effectively enhance thenetwork capacity invasion ability and improve the efficiencyof data transmission

5 Exception Handling

51 The Node Processing Node failure may be because ofits own characteristics or captured which leads to networktopology changes Daemon nodes have real-timely monitoryother nodes when they find abnormal situation which willdiagnose and do the corresponding processing and storeenergy of each node information and trust degree after aperiod of time if the cluster head energy value is lowerthan the preset threshold according to the maintenance ofinformation table selected residually more energy and high


trust value node for the next round of cluster head clusterhead message to broadcast again

If cluster head is assessed as not credible the daemonnodeswill broadcast cluster head failuremessage to themem-ber nodes After themember node is received it stops sendingthe collected data to cluster head in the cluster and daemonnodes will delete the invalid cluster heads and reassign themIf a member node is not credible daemon node will directlydelete that node

If a new node applies for joining a cluster it will first sendits key to daemon node in the cluster After daemon nodesreceipt we need to checkwhen a new node is key informationand maintain consistent daemon node the daemon node toperform this node to join operations but we also need tosee cluster head in the evaluation after assessment can beinvolved in data collection transmission and so forth

52 Routing Maintenance Multiple paths are to worktogether which may be because of a certain path to thecluster head that is attacked or lacks energy which causes thispath fails that then continues and to transmit data through awinding path the failure path routing maintenance mecha-nism is adopted to repair in time elaborated in two differentconditions as follows

(1) If a cluster head in the path fails daemon nodes auto-matically sense and from the maintenance of infor-mation in the table select the most appropriatemember nodes as the cluster head of in the clusterthe source cluster head and the new cluster headexchanged the new cluster head immediately receivesdaemonnode in the fusion of data backup establishedunder the control of the daemon nodes into trans-mission path in waiting for the next round of datatransfer

(2) If this is not suitable for cluster head the routing fail-ures also show that the cluster heads are unavailableand low energy nodes directly close the communi-cation module of dormancy Daemon nodes informbase station node the automatic cluster scatter thedaemon node leaving virtual path another daemonnode is automatically connected to modify mainte-nance information again

Using multi-path routing maintenance mechanism if thepath or the cluster heads appear to be problem they can berestored or replaced in time If there is not the cluster headwhich did not meet the conditions failure of clusterrsquos pathdirectly removed makes some nodes into a dormant statewhich can save energy and prolong the service life of them

6 Performance Evaluation

It puts forward a scheme that is still on the basis of LEACHprotocol The main purpose is to enhance the security ofdata transmission and improve the reliability of the networkthe following is performance of the detailed analysis of themechanism

61 ProcessDescription Thispaper built different keys amongthe various nodes and between the two nodes is only keypair First the nodersquos join needs verificationThe nodes whosevalidation is not adopted are difficult to enter the networkthe node which is successful to join but if the trust value isthe lower it will not be able to participate in the transmissionof the data Before communication each kind of nodesalso needs node-to-node authentication if this succeededdata transmission can be carried out Even if a node in thenetwork running process is internal attack leak is associatedwith being the attacked node itself and the content of theother nodes can still work normally Second due to theintroduction of node evaluation mechanism cluster headin member node of the assessment can filter out certainmalicious nodes and member nodes of cluster head nodesreview will also become a cluster head which has beendropped as a malicious node network which can be at easeusing cluster heads for data fusion and forwarding thereforeto some extent this mechanism can be resisted Section 2summarizes the three kinds of attack

The establishment of random key pair needs to broadcasteach node number so that we can save the communica-tion traffic Between source cluster heads and base stationthe hybrid multi-path mechanism is adopted concurrenttransmission data can be in the path so that each pathwill reduce the quantities of data so as to reduce the pathof a single load which is resolved in a single path on acluster head energy consumption which is too fast and easilybecomes death problem and further can reduce the topologychange of path reconstruction or network reconfigurationoverhead In addition even if building the shortest path thesecond shortest path is even more than a certain numberof cluster heads as the standby path being attacked whichcan also be adopted as timely winding path to transmit dataof each cluster head daemon node using route maintenancemechanism and the successful replacement of cluster headsto participate in the next round of data transmission toimprove network communication traffic as a whole

62 Evaluation Indicators This paper compares the ICRMand LEACH DD agreement analysis of performance indi-cators [18] are defined as follows

Load balancing factor is

119887119891

=1

119899 minus 119898119873low (17)

This value is used to measure the balance degree of clusterswhere 119873low is the number of energy which is lower thanthe average of the total number nodes in network 119898 is thenumber of daemon nodes 119899 is the total number of nodes119899 minus 119898 is the number of participating nodes in the datatransmission

The average end-to-end delay is

119879119889

=1

119899 minus 119898sum

119905isin119879119904

119905119889 (18)

It is the average of the sum of the time delays which istransmitted packets from the source cluster heads to the


destination in 119879119904time where is the 119905

119889for each participating

data transmission delay of cluster headsNetwork throughput is

119879119901

= (119899 minus 119898)119875send119879119904

(19)

It is the number of data packets of successful transmissionin 119879119904time 119875send is each cluster head that sends the packet

numberThe routing control overhead is

119864119888

= 119863119888

+ 119879119888 (20)

where 119863 is the pay expenses which are daemon node con-trolling according to the built path transmission cluster headsneed 119879 is multiple paths in need of the overhead of datatransmission

63 Experimental Verification Performance in order to ver-ify the proposed algorithm uses c++ programming andcorresponding analysis in this section the ICRMand LEACHand DD protocol defined in the previous section on theevaluation index of were compared and the running timeis a measured parameter 100 sensor nodes are randomlyplaced within 100m times 100m square area because nodes arerandomly deployed location is not fixed and there will bemultiple nodes which are stacked in a place where nodesdistribution is not uniform causing no spread to some regionthe randomnode distribution is shown in Figure 3With basestation coordinates of (120 120) a sensor node range of (0 0)to (100 100) area and node for the initial energy of 1 J nodedeath occurred when energy is 0 an experiment of assumingno daemon node death

Figure 4 shows that clustering protocol LEACH in net-work load balance factor is better than that of flat DD routingprotocol which shows flat routing network load to be betterthan than clustering routing protocol ICRM due to daemonnode is introduced in the work in the process of establishingvirtual path cluster head and member nodes dormancy inorder to reduce energy consumption In data transmissionthe cluster heads packaged data packet transmission inmultiple paths which obviously decrease viral pathways oncluster head load and energy consumption By comprehen-sive comparison this paper presents the mechanism of theminimum balance network load factor and stability

Figure 5 shows that the flat structure of multi-pathrouting protocols is used with the DD compared withLEACH and ICRM clustering mechanism which is signif-icantly smaller average end-to-end delay which explainsclustering structure division of each node clearly and is ableto better coordinate the entire network ICRM generated isthemultipath among daemon nodes cluster heads need to becontrolled for data transmissionwhich is faster than flat rout-ing path of each node speed whose LEACH from the basestation in the remote node increases path establishment anddata transmission delay so the ICRM is average minimumdelay here

Comparison on throughput is shown in Figure 6 becausethe ICRM introduced invasion mechanism and it can effec-tively resist malicious nodes to participate in the network

0 20 40 60 80 1000

10

20

30

40

50

60

70

80

90

100

x (m)

y(m

)

Figure 3 Nodes random distribution

0

2

4

6

8

10

0 400 800Time

1200

ICRMDDLEACH

Load

bal

ance

fact

or

Figure 4 Load balance

network packets loss rate is smaller and the cluster head setupbetween multi-paths makes data transmission more reliableeven if a certain path fails route maintenance mechanismto take timely measures to make the data transmission isalmost unaffected and routing robustness is better Withdaemon nodes splitting the tasks of the cluster head nodeswhich can reduce the energy consumption of nodes eachcluster head works longer with more quantities of data as awhole While in DD agreement most of the nodes energyconsumption quickly easy to death makes the minimumquantities of data protocol LEACH protocol cluster headbear there are the mission of the heavier but member nodesenergy consumption less better than the DD agreement butuneven distribution of cluster heads which lead some clusterheads to premature deathwhich affects the data transmission


0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time

Figure 5 Average end-to-end delay

0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time

Figure 6 Network throughout

In Figure 7 because the DD agreement path generationtime is long and often interrupted routing maintenancespends more cost so the routing control overhead is thelargest Cluster head easy to die in the LEACH protocol andoften to be cluster head selection again every time refactoringand controlling the routing overhead are large ICRM andcluster heads are controlled by daemon node work andcluster heads are less susceptible to attack and daemon nodereal-time monitoring work and timely replacement of eachfailure cluster heads or removal of low trust value of nodes ineach path on the energy balance almost can be seen from thediagram the routingmechanism overhead is relatively stablesignificantly lower than the other two protocols

Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200

Figure 7 Routing overhead

7 Conclusion

This paper to solve the problemwasmade in the course of theLEACHprotocol in data transmission security hidden dangerwhich introduced a simple key management mechanism thesecret sharing technology and random key to the model ofa bunch of key management information into more pieceswhich were assigned to each sensor node among daemonnodes cluster heads andmember nodes which need to be thekey of authentication in a certainmoment even network oneor several nodes attack also will not leak the key informationIn order to increase the credibility of the working node wealso introduced the node evaluation mechanism and lowtrust value node has been dropped as a network cannotbe directly involved in data transmission and effectivelyimprove the performance of network security Data trans-mission among clusters enhanced multi-path mechanismwhich further improves the reliability of data transmissionand implements network load balancing

Acknowledgments

This work is supported by National Natural Science Founda-tion of China under Grants nos 61070169 61201212 NaturalScience Foundation of Jiangsu Province under Grant noBK2011376 SpecializedResearch Foundation for theDoctoralProgram of Higher Education of China no 20103201110018and Application Foundation Research of Suzhou of Chinanos SYG201118 and SYG201240

References

[1] I F Akyildiz W Su Y Sankarasubramaniam and E CayircildquoWireless sensor networks a surveyrdquo Computer Networks vol38 no 4 pp 393ndash422 2002

[2] Z Bidai H Haffaf and M Maimour ldquoNode disjoint multi-path routing for ZigBee cluster-tree wireless sensor networksrdquo


in Proceedings of the International Conference on MultimediaComputing and Systems (ICMCS rsquo11) pp 1ndash6 April 2011

[3] K Akkaya and M Younis ldquoA survey on routing protocols forwireless sensor networksrdquo Ad Hoc Networks vol 3 no 3 pp325ndash349 2005

[4] C Intanagonwiwat R Govindan and D Estrin ldquoDirected dif-fusion a scalable and robust communication paradigm forsensor networksrdquo in Proceedings of the 6th Annual InternationalConference on Mobile Computing and Networking (MOBICOMrsquo00) pp 174ndash185 1999

[5] W B Heinzelman A P Chandrakasan and H Balakrish-nan ldquoAn application-specific protocol architecture for wirelessmicrosensor networksrdquo IEEE Transactions onWireless Commu-nications vol 1 no 4 pp 660ndash670 2002

[6] B V Nadimpalli P Mulukutla R Garimella and M BSrinivas ldquoEnergy-aware routing in sensor networks using dualmembership clusters and data highwaysrdquo in Proceedings of theIEEE Region 10th Conference Analog and Digital Techniques inElectrical Engineering (TENCON rsquo04) pp C184ndashC187 Novem-ber 2004

[7] J Z Long Y T Chen D M Deng et al ldquoAssistant cluster headclustering algorithm based on LEACH protocolrdquo ComputerEngineering vol 37 no 7 pp 103ndash105 2011

[8] H Nabizadeh and M Abbaspour ldquoIFRP an intrusionfaulttolerant routing protocol for increasing resiliency and reliabilityin wireless sensor networksrdquo in Proceedings of the InternationalConference on Selected Topics inMobile andWireless Networking(iCOST rsquo11) pp 24ndash29 October 2011

[9] H Yu J He T Zhang and P Xiao ldquoA group key distributionscheme for wireless sensor networks in the Internet of thingsscenariordquo International Journal of Distributed Sensor Networksvol 2012 Article ID 813594 12 pages 2012

[10] N A Alrajeh S Khan and B Shams ldquoIntrusion detection sys-tems in wireless sensor networks a reviewrdquo InternationalJournal of Distributed Sensor Networks vol 2013 Article ID167575 7 pages 2013

[11] J Lopez R Roman I Agudo and C Fernandez-Gago ldquoTrustmanagement systems for wireless sensor networks best prac-ticesrdquo Computer Communications vol 33 no 9 pp 1086ndash10932010

[12] T Zhang L Li and C Yan ldquoA secure cluster-based routerprotocol for WSNsrdquo Chinese Journal of Sensors and Actuatorsvol 22 no 11 pp 1612ndash1616 2009

[13] P C Yu H Z Zhang and Z J Liu ldquoResearch of cluster-basedmulti-hop routing protocolrdquo Journey of Computer Applicationsvol 27 no 2 pp 351ndash354 2007

[14] M Liu J-N Cao G-H Chen L-J Chen X-MWang and H-G Gong ldquoEADEEG an energy-aware data gathering protocolfor wireless sensor networksrdquo Journal of Software vol 18 no 5pp 1092ndash1109 2007

[15] P C Zhao Y Xu and M Nan ldquoA hybrid key managementscheme based on clustered wireless sensor networksrdquo in Pro-ceedings of the IEEE 2nd International Conference on Computerand Management pp 1394ndash1397 2012

[16] X Sun and E J Coyle ldquoThe effects of motion on distributeddetection in mobile ad hoc sensor networksrdquo InternationalJournal of Distributed Sensor Networks vol 2012 Article ID460924 14 pages 2012

[17] R Lu X Lin H Zhu X Liang and X Shen ldquoBECAN abandwidth-efficient cooperative authentication scheme for fil-tering injected false data in wireless sensor networksrdquo IEEE

Transactions on Parallel and Distributed Systems vol 23 no 1pp 32ndash43 2012

[18] A Modirkhazeni N Ithnin and O Ibrahim ldquoSecure multipathrouting protocols in wireless sensor networks a security surveyanalysisrdquo in Proceedings of the 2nd International Conference onNetwork Applications Protocols and Services (NETAPPS rsquo10) pp228ndash233 September 2010

[19] E Kohno T Okazaki M Takeuchi T Ohta Y Kakuda and MAida ldquoImprovement of assurance including security forwirelesssensor networks using dispersed data transmissionrdquo Journal ofComputer and System Sciences vol 78 no 6 pp 1703ndash1715 2012

[20] C Chen W Wu and Z Li ldquoMultipath routing modeling in adhoc networksrdquo in Proceedings of the IEEE International Confer-ence on Communications (ICC rsquo05) pp 2974ndash2978 May 2005

International Journal of

AerospaceEngineeringHindawi Publishing Corporationhttpwwwhindawicom Volume 2014

RoboticsJournal of

Hindawi Publishing Corporationhttpwwwhindawicom Volume 2014


Active and Passive Electronic Components

Control Scienceand Engineering

Journal of



RotatingMachinery


Hindawi Publishing Corporation httpwwwhindawicom

Journal ofEngineeringVolume 2014

Submit your manuscripts athttpwwwhindawicom

VLSI Design



Shock and Vibration


Civil EngineeringAdvances in

Acoustics and VibrationAdvances in



Electrical and Computer Engineering

Journal of

Advances inOptoElectronics


Volume 2014

The Scientific World JournalHindawi Publishing Corporation httpwwwhindawicom Volume 2014

SensorsJournal of


Modelling amp Simulation in EngineeringHindawi Publishing Corporation httpwwwhindawicom Volume 2014


Chemical EngineeringInternational Journal of Antennas and

Propagation




Navigation and Observation



DistributedSensor Networks



a gradient which reversely transfers data from the sourcenode to the convergent nodeThen the convergent node findsthe strengthening path which is the earliest path from thesource node to the convergent node path and informs thesource node Eventually the source node transfers the datacollected to the convergent node by this routeThe algorithmhas good scalability but both the energy consumption androuting overheads are larger

The sensor node itself has a small size it is easy to replacethe battery and so on so that we must first consider isthe energy consumption problem Now clustering topologiescontrolling the network are commonly used In order tobalance the network node energy consumption periodicallycluster head selection is usually carried out Clusteringrouting is suitable for networks which deploy numbers ofnodes and have a large scale LEACH (Low Energy AdaptiveClustering Hierarchy) protocol [5] is an adaptive clusteringtopologymechanism which uses periodic execution processrandomly elects cyclic cluster head and balances energy dis-tribution networks to each sensor nodeThe agreement intro-duces a ldquoroundrdquo concept which stages in the establishmentof the cluster head The node generates a random numberbetween 0 and 1 and if this number is less than119879(119899) the nodewill become a cluster head and the elected node will messageto inform other nodes that it is a cluster head Other nodesare usually based on their received signal strength to select amember of clusters and send the message notification to addthe cluster head in the cluster After cluster head receives therequest which all nodes join it the cluster head gives them thecommunication slot allocation In stable transmission phasemember nodes of the cluster head node receive the broadcastquery request which ismonitored area of data collection andthen send data at one hop to the corresponding slot clusterhead After a period of time cluster head collects data ofwhich all member nodes were the data sent and fusion finallysends the result to the base station As in formula (1) randomnumber119879(119899) is expressed as follows where119901 is the head nodeof all the nodes in the cluster percentage 119903 is the currentround number 119903 mod (1119901) represent elected cluster headsthe G is nonelected cluster heads

119879 (119899) =

119901

1 minus 119901 (119903 mod (1119901)) 119899 isin 119866

0 other(1)

However clustering mechanism will have problems suchas the uneven distribution of cluster heads heavy tasks orfast energy consumption issue thatmakes them stop workingsoon affecting the data transmission or even the entirenetwork topology To solve this problem a lot of articles useddouble cluster head algorithm [6] and join assistant clusterhead clustering algorithm [7] to a certain extent reducing theburden of cluster heads and the total energy consumption ofthe node This paper summarizes some of the existing clus-tering algorithms we propose a new mechanism to enhancethe network fault tolerance

However WSNs and the rapid development of relatedtechnologies have strong practicality which makes networksecurity vital and relates people to the hot issue The network

is generally used to collect and process the data which is diffi-cult to reach in harsh environmentsMost of the sensor nodesare not tamper-resistant or anticapturing ability once a nodeis captured an attacker can get through information fromthis node to other nodes in the network It makes the attacknodes send some error message or do not communicate withother nodes which even leads to communication link failureresulting in great loss of data Sensor network security risksare often precise because of the bad node deployment area orthe communication methods used Therefore it should solvethe transmission of information confidentiality integrityauthenticity and intrusion detection problem or even if thenetwork is attacked by malicious ones and how to maintaintheir basic communication function is very important [8]In this paper we proposed a new scheme which is aimedat analyzing security issues which LEACH protocol securitycauses and then we combines the inherent characteristics ofthe network whose purpose is to reduce the chance in whichthe data transmission process information is stolen nodesare posing or malicious nodes tamper with the informationthis makes the node in the process of transmitting dataeven if the encountered attack will also be able to normalizecollaboration work to complete basic tasks

2 Description of the Problem

Cluster head bears most of the LEACH protocol tasks suchas data fusion forwarding and communication with the basestation Cluster head task is heavy whichmakes of fast energyconsumption but also in the data transfer process it is morevulnerable to malicious attacks and exposure the transmittedinformation It leads to poor network security and thus thenode does not complete the task Here is a summary ofLEACH vulnerable to attack in the following three items [9]

(1) Sybil attack it refers to a single node emergingwith multiple identity In the cluster head electionphase attackerrsquos multiple identities will lead to manynodes are easy to selects as the cluster heads Electedmalicious node controls most of the data node andfurther damages of the network

(2) Hello flooding attacks according to the means whichcluster head send the signal strength member nodeschoose to join a cluster If a malicious attacker hasmore energy flooding the entire network broadcast amanner notice strength many nodes will choose tojoin this cluster where the malicious node exits thenthe network will be vulnerable to the impact of thesemalicious nodes which even will cause the networkto be unavailable

(3) Selective forwarding attack such attacks mean thatif a malicious node receives a packet it will not beforwarded directly to the data integrity but part of itwill be lost or tampered before sending so that thedata cannot be accurately inevitably lead to reach thedestination and this is the loss of capture authenticityand integrity of the data

The trust evaluation mechanism [10] can discover unco-operative nodes in the network which can be used to reduce




3 Network Model








119879CH =

119901

1 minus 119901 (119903 mod (1119901))

1


0 other(2)




(3)



119863 = 2119877 +119902

radic119871119896120587

(4)








119864119905119909


4 119889 ge 119889

0


0

(5)


119864119903119909

(119897) = 119897 times 119864elec (6)



1198890

=radic120576fs

radic120576mp (7)





will be used




119894is




DN119894997888rarr BS 119894REQ (8)


119894(dae-


119865() then calculate 119881119894

= 119877119894

+ 119865(ID119894) which 119877

119894is


119877119894


DN119894

BS 997888rarr DN119894119881119894MAC

119877119894(ACK) (9)


119894) by

119865() draw119877119894= 119881119894minus119865(ID


119877119894

(ACK)





lowast

119894= 119877lowast

119894+ 119865(ID

119894)


DN119894997888rarr BS 119881

lowast

119894MAC

119877lowast

119894

(ACK) (10)


119894= 119881lowast

119894minus 119865(ID

119894) then


119894 and if so DN

119894



119894(119894 =






obtaining 1198701 1198702 119870


119894 119870119894) (119894 =


119894





119898generate


119898 119877) (11)



119877119870119894








as follows

119870119886

= 119865119870119898

(ID119886 119871119886) (12)



119870119886119887

= 119865119870119898

(ID119886 119871119886 ID119887 119871119887) (13)






119894(119894 =

1 2 119899 minus 2119898)

Cread119894=

1205821119862 + 120582

2119861

(1 minus 1205821

minus 1205822) 119878

(14)




1and 120582

2(0 lt 120582

1 1205822


If Cread119894






119894



119894


(15)








119894

DN 119864 119870DN119894Random119894mes


119894


(16)








station

A BC






119894



119870(119864)


















119887119891

=1

119899 minus 119898119873low (17)



119879119889

=1

119899 minus 119898sum

119905isin119879119904

119905119889 (18)






119879119901

= (119899 minus 119898)119875send119879119904

(19)



119864119888

= 119863119888

+ 119879119888 (20)






0 20 40 60 80 1000

10

20

30

40

50

60

70

80

90

100

x (m)

y(m

)


0

2

4

6

8

10

0 400 800Time

1200

ICRMDDLEACH

Load

bal

ance

fact

or




0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time


0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time



Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200


7 Conclusion


Acknowledgments


References


























RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation












3 Network Model








119879CH =

119901

1 minus 119901 (119903 mod (1119901))

1


0 other(2)




(3)



119863 = 2119877 +119902

radic119871119896120587

(4)








119864119905119909


4 119889 ge 119889

0


0

(5)


119864119903119909

(119897) = 119897 times 119864elec (6)



1198890

=radic120576fs

radic120576mp (7)





will be used




119894is




DN119894997888rarr BS 119894REQ (8)


119894(dae-


119865() then calculate 119881119894

= 119877119894

+ 119865(ID119894) which 119877

119894is


119877119894


DN119894

BS 997888rarr DN119894119881119894MAC

119877119894(ACK) (9)


119894) by

119865() draw119877119894= 119881119894minus119865(ID


119877119894

(ACK)





lowast

119894= 119877lowast

119894+ 119865(ID

119894)


DN119894997888rarr BS 119881

lowast

119894MAC

119877lowast

119894

(ACK) (10)


119894= 119881lowast

119894minus 119865(ID

119894) then


119894 and if so DN

119894



119894(119894 =






obtaining 1198701 1198702 119870


119894 119870119894) (119894 =


119894





119898generate


119898 119877) (11)



119877119870119894








as follows

119870119886

= 119865119870119898

(ID119886 119871119886) (12)



119870119886119887

= 119865119870119898

(ID119886 119871119886 ID119887 119871119887) (13)






119894(119894 =

1 2 119899 minus 2119898)

Cread119894=

1205821119862 + 120582

2119861

(1 minus 1205821

minus 1205822) 119878

(14)




1and 120582

2(0 lt 120582

1 1205822


If Cread119894






119894



119894


(15)








119894

DN 119864 119870DN119894Random119894mes


119894


(16)








station

A BC






119894



119870(119864)


















119887119891

=1

119899 minus 119898119873low (17)



119879119889

=1

119899 minus 119898sum

119905isin119879119904

119905119889 (18)






119879119901

= (119899 minus 119898)119875send119879119904

(19)



119864119888

= 119863119888

+ 119879119888 (20)






0 20 40 60 80 1000

10

20

30

40

50

60

70

80

90

100

x (m)

y(m

)


0

2

4

6

8

10

0 400 800Time

1200

ICRMDDLEACH

Load

bal

ance

fact

or




0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time


0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time



Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200


7 Conclusion


Acknowledgments


References


























RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation














119864119905119909


4 119889 ge 119889

0


0

(5)


119864119903119909

(119897) = 119897 times 119864elec (6)



1198890

=radic120576fs

radic120576mp (7)





will be used




119894is




DN119894997888rarr BS 119894REQ (8)


119894(dae-


119865() then calculate 119881119894

= 119877119894

+ 119865(ID119894) which 119877

119894is


119877119894


DN119894

BS 997888rarr DN119894119881119894MAC

119877119894(ACK) (9)


119894) by

119865() draw119877119894= 119881119894minus119865(ID


119877119894

(ACK)





lowast

119894= 119877lowast

119894+ 119865(ID

119894)


DN119894997888rarr BS 119881

lowast

119894MAC

119877lowast

119894

(ACK) (10)


119894= 119881lowast

119894minus 119865(ID

119894) then


119894 and if so DN

119894



119894(119894 =






obtaining 1198701 1198702 119870


119894 119870119894) (119894 =


119894





119898generate


119898 119877) (11)



119877119870119894








as follows

119870119886

= 119865119870119898

(ID119886 119871119886) (12)



119870119886119887

= 119865119870119898

(ID119886 119871119886 ID119887 119871119887) (13)






119894(119894 =

1 2 119899 minus 2119898)

Cread119894=

1205821119862 + 120582

2119861

(1 minus 1205821

minus 1205822) 119878

(14)




1and 120582

2(0 lt 120582

1 1205822


If Cread119894






119894



119894


(15)








119894

DN 119864 119870DN119894Random119894mes


119894


(16)








station

A BC






119894



119870(119864)


















119887119891

=1

119899 minus 119898119873low (17)



119879119889

=1

119899 minus 119898sum

119905isin119879119904

119905119889 (18)






119879119901

= (119899 minus 119898)119875send119879119904

(19)



119864119888

= 119863119888

+ 119879119888 (20)






0 20 40 60 80 1000

10

20

30

40

50

60

70

80

90

100

x (m)

y(m

)


0

2

4

6

8

10

0 400 800Time

1200

ICRMDDLEACH

Load

bal

ance

fact

or




0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time


0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time



Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200


7 Conclusion


Acknowledgments


References


























RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation














as follows

119870119886

= 119865119870119898

(ID119886 119871119886) (12)



119870119886119887

= 119865119870119898

(ID119886 119871119886 ID119887 119871119887) (13)






119894(119894 =

1 2 119899 minus 2119898)

Cread119894=

1205821119862 + 120582

2119861

(1 minus 1205821

minus 1205822) 119878

(14)




1and 120582

2(0 lt 120582

1 1205822


If Cread119894






119894



119894


(15)








119894

DN 119864 119870DN119894Random119894mes


119894


(16)








station

A BC






119894



119870(119864)


















119887119891

=1

119899 minus 119898119873low (17)



119879119889

=1

119899 minus 119898sum

119905isin119879119904

119905119889 (18)






119879119901

= (119899 minus 119898)119875send119879119904

(19)



119864119888

= 119863119888

+ 119879119888 (20)






0 20 40 60 80 1000

10

20

30

40

50

60

70

80

90

100

x (m)

y(m

)


0

2

4

6

8

10

0 400 800Time

1200

ICRMDDLEACH

Load

bal

ance

fact

or




0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time


0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time



Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200


7 Conclusion


Acknowledgments


References


























RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation
















station

A BC






119894



119870(119864)


















119887119891

=1

119899 minus 119898119873low (17)



119879119889

=1

119899 minus 119898sum

119905isin119879119904

119905119889 (18)






119879119901

= (119899 minus 119898)119875send119879119904

(19)



119864119888

= 119863119888

+ 119879119888 (20)






0 20 40 60 80 1000

10

20

30

40

50

60

70

80

90

100

x (m)

y(m

)


0

2

4

6

8

10

0 400 800Time

1200

ICRMDDLEACH

Load

bal

ance

fact

or




0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time


0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time



Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200


7 Conclusion


Acknowledgments


References


























RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation























119887119891

=1

119899 minus 119898119873low (17)



119879119889

=1

119899 minus 119898sum

119905isin119879119904

119905119889 (18)






119879119901

= (119899 minus 119898)119875send119879119904

(19)



119864119888

= 119863119888

+ 119879119888 (20)






0 20 40 60 80 1000

10

20

30

40

50

60

70

80

90

100

x (m)

y(m

)


0

2

4

6

8

10

0 400 800Time

1200

ICRMDDLEACH

Load

bal

ance

fact

or




0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time


0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time



Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200


7 Conclusion


Acknowledgments


References


























RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation













119879119901

= (119899 minus 119898)119875send119879119904

(19)



119864119888

= 119863119888

+ 119879119888 (20)






0 20 40 60 80 1000

10

20

30

40

50

60

70

80

90

100

x (m)

y(m

)


0

2

4

6

8

10

0 400 800Time

1200

ICRMDDLEACH

Load

bal

ance

fact

or




0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time


0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time



Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200


7 Conclusion


Acknowledgments


References


























RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation










0

20

40

60

80

100

120

140

0 400 800 1200

ICRMDDLEACH

Aver

age e

nd-to

-end

del

ay

Time


0

5000

10000

15000

20000

25000

30000

200 600 1000 1400

ICRMDDLEACH

Net

wor

k th

roug

hput

Time



Rou

ting

over

head

Time

ICRMDDLEACH

140

120

100

80

60

40

20

00 400 800 1200


7 Conclusion


Acknowledgments


References


























RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation
































RoboticsJournal of





Journal of



RotatingMachinery





VLSI Design



Shock and Vibration







Journal of



Volume 2014


SensorsJournal of





Propagation









Research Article Resilient Multipath Routing Mechanism...

Documents

Transcript of Research Article Resilient Multipath Routing Mechanism...