Iaetsd key reconstruction and clustering opponent nodes in minimum cost by Iaetsd Iaetsd

INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY

ISBN: 378 - 26 - 138420 - 5

Key Reconstruction and clustering opponent nodes in Minimum Cost Blocking Problems D.Sireesha ASCET M.Tech(CSE) Siri3835@gmail.com

Prof C.Rajendra srirajendra.c@gmail.com

ABSTRACT: This paper detects malicious activities on wireless mesh networks with wireless routing protocols. Upon the selection of route discovery malicious attacks are ahead to compromise the nodes such as network partitioning, node isolation activities .The cardinal covering in the routing protocols address the packets in the network. When attacks are take place by the opponent, negotiate the attacker node and choose another way to send the packet from source to destination .But it can’t be moved from the wireless network. Here proposing, looking into the Clustering protocols along with id-based key update protocols, which is very predicting in wireless networks. Cryptography techniques improvise the packet in an assured way from source to destination and it doesn’t render to secure the network/system. Keywords: Wirelessmeshnetworks, clustering, MSR protocol, adversary nodes, updating key. of a seamlessly connected world into reality.

1. INTORDUCTION: Wireless mesh networks (WMN’S)

Wireless mesh Networks includes mesh

issued as a bright conception to meet the

routers and mesh clients. Getting rid of the

disputes on succeeding generation wireless

wires from the wireless LAN’s, doubling the

networks. Providing flexibility, adaptability,

access point is known as mesh routers and it

reconfigurable the network upon the cost-

forms a backbone network. A mesh network

efficient solutions to service provider. It has

can be designed using a flooding technique

the possibility to wipe out many of these

or a routing technique.[3] When using a

disadvantages like low-cost, wireless broad

routing

band internet access for both wired and

propagated along a path, by hopping from

mobile nodes. Wireless mesh networks are

node to node until the destination is reached.

an emerging technology right now. The use of

To ensure all its paths' availability, a routing

mesh wireless networks may bring the dream

network

technique,

must

INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT

352

the

allow

message

for

continuous

www.iaetsd.in

INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY

connections

and

broken

blocked

reconfiguration paths,

around

ISBN: 378 - 26 - 138420 - 5

protocols for wireless mesh networks make it

using self-

particularly

hard

for

adversary

healing algorithms. A mesh network whose

effectively launch such attacks. Attempting to

nodes are all connected to each other is

model the theoretical hardness of attacks on

a fully connected network. Mesh networks

multi-path routing protocols for mobile nodes

can be seen as one type of. Mobile adhoc

and qualify it in mathematical terms. The

networks (MANETs) [1] and mesh networks

study will impact the areas of security and

are therefore closely related. The mesh

robustness of routing protocols of wireless

routers render a rich radio connectivity in

mesh networks. [3], threshold cryptography

which importantly brings down the direct

and network coding. In previously, every

deployment cost of the network. Mesh routers

node had a unique ID randomly, routing

are usually stationary and it doesnâ&#x20AC;&#x2122;t have

occurs through protocols such as greedy and

power constraint. Mesh clients are mobile

LP algorithms. Problems incorporated in last

nodes. Sometimes mesh routers can also act

investigations are if any opponent were

as gateways which are connected to the

hacked any of the nodes in the network, it

internet through a wired backbone.

can retrieve the packet before sending the

2. RELATED WORK:

destination. And one more consequence is about the topological information of the

Privacy and security plays a major role in the

network, through that it may miss send the

communication network for both wired and

packet without permissions of authenticated

wireless network. Security issues related to

nodes. To reduce these complications, here

the packet transmission from the source to

introducing the clustering concepts[4] were

the destination nodes. Securing the data from

incorporated i.e. , grouping the nodes in the

the opponent without changing the main

mesh

thing. Different technologies are introduced to secure

data

from

opponents

algorithms

the

group

the

nodes

using

MSR(multipath split routing) protocol. Again

techniques are included for protecting packet

from un-authorizers. It demonstrates the high

protect

data

from

adversary

nodes

introducing cryptographic key distributions

quality of multipath routing protocols above

techniques are integrated. Introducing the

traditional single path protocols in terms of

clustering algorithms to group the nodes in

resiliency under the attacks of blocking and

the mesh networks, giving different IDâ&#x20AC;&#x2122;s to the

node isolation types of attacks , particularly in domain.

identifying

node from the network again make clustering

network. Clustering [4] and cryptography

networks

after

misbehaving node move out the effected

using

clustering the different nodes in the mesh

wireless

networks

nodes. Grouping sensor nodes into clusters

Multi-path

has been widely investigated by researchers

INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT

353

www.iaetsd.in

INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY

ISBN: 378 - 26 - 138420 - 5

in order to achieve the network system's

behavior, section 4.2 presents the clustering

scalability and management objectives. Every

algorithm implementation details, section 4.3

cluster would have a leader sensor node,

discuss key updating process after clustering

often referred to as the cluster-head (CH),

adversary nodes section 5 concludes the

which

paper with the future discussion.

can

fixed

variable.

CHs

aggregate the data collected by the sensor nodes

its

cluster,

thus,

4. IMPLEMENTATION:

clustering

decreases the number of relayed packets. As

Wireless mesh networks integrating a key

the benefits of clustering, it conserves

technology for

communication

networks

bandwidth

and

avoids

showing

generation rapid

wireless

progress

and

redundant exchange of messages among

numerous applications. In a WMN, high

sensor nodes, because of limiting the inter-

speed routers integrated with each other in a

cluster

multi-hop fashion over wireless channels and

interactions.

Therefore,

clustering

prolongs the lifetime of WSNs [2][4].

form a broadband backhaul. In the previous analysis of the paper includes that in wireless

(A).How does a mesh network works?

mesh networks. Due to the delivery of packet

While traditional networks rely on a small

from source to destination it should be send

number of wired access points or wireless

through secure path by providing a key to the

hotspots to connect users, a wireless mesh network

spreads

network

packet. In WMN’s an adversary node involves

connection

in the network can know the details of

among dozens or even hundreds of wireless

topological information, obviously the routing

mesh nodes that "talk" to each other, sharing

details. In order to secure the packet from the

the network connection across a large area.

opponent we need to reduce the way of

Some think of the internet as being the

adversary

world's largest mesh network. When using

nodes

about

topological

information[6] and providing another key to

the internet, information travels by being

the packet. Here in this paper introducing the

bounced automatically from one router to the

clustering

next until it reaches its destination. The

and

cryptographic

key

regeneration. Analyzing the node behavior

internet has billions of potential paths across

whether it is acting in a normal way or not, it

which data can travel.

is possible by using finite state machine.

3. PAPER ORGANIZATION:

Behavior of each node is noted in the table,

The rest of this paper is organized as follows

clustering misbehaving nodes using a unique

section

implementation

id and authorized one with another id’s. Upon

process, section 4.1 introducing the finite

creating different id’s for misbehaving nodes

state machine to record the details of nodes

and authorized node packet details have to

discuss

the

INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT

354

www.iaetsd.in

INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY

ISBN: 378 - 26 - 138420 - 5

be modified. This is re-generating the key to

A. ROUTE DISCOVERY OF MSR:

protect

Here

Multipath split routing builds multi routes

introducing MSR protocol for generating the

using request/reply cycles. When source

maximal disjoint paths in the network, and

needs routes to the destination but no route

how the MSR is working upon the selection of

information is known, it overflows the route

routes in the network. To observer the

request message (RREQ) to the entire

behavior of the nodes incorporating finite

network. Due to the packet overflow, several

state machine model. Examine each and

replicate that spanned through different

every nodes behavior about the status of

routes

packet delivery and soon. The selfish node is

destination node selects multiple disjoint [5]

identified in the network based on data

routes and sends route reply (RREP) packets

collected by each node from its local

back to the source through the selected

message

routes.

data

from

unit

misbehaving

opponents.

(LMU).

nodes

Clustering

the

and

group

reach

the

destination.

The

authorized oneâ&#x20AC;&#x2122;s a group. Although grouping

4.2 THE FINITE STATE MACHINE MODEL:

opponents doesnâ&#x20AC;&#x2122;t made packet in a secured

In the proposed mechanism, the messages

way. Again providing a key is an important

corresponding to a RREQ flooding and the

task

re-generating

uni-cast RREP are referred to as a message

algorithms are introduced to provide a key at

unit. It is clear that no node in the network

the packet header.

can observe all the transmission in a

protect

data

i.e.

message unit. The subset of a message unit

4.1 MULTI-PATH SPLIT ROUTING:

that a node can observe is referred to as the

Multipath Split Routing (MSR) protocol that

local message unit (LMU). The LMU for a

builds maximally disjoints paths. Multiple

particular node consists of the messages

routes, of which one is the shortest delay

transmitted by the node and its neighbors,

path, are discovered on demand. Established

and the messages overheard by the node.

routes are not necessarily of equal length.

The selfish node detection is done based on

Data traffic is split into multiple routes to

data collected by each node from its

avoid congestion[5] and to use network

observed

resources efficiently. We believe providing

transmission in an LMU, a node maintains a

multiple routes are beneficial in network

record of its sender, and the receiver, and the

communications,

neighbor nodes that receive the RREQ

wireless

particularly

networks

where

mobile

routes

LMUs.

For

each

message

broadcast sent by the node itself.

are

disconnected frequently because of mobility

The finite state machine depicts various

and poor wireless link quality.

states

INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT

355

www.iaetsd.in

INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY

ISBN: 378 - 26 - 138420 - 5

1. Init – in intial phase no RREQ is

by the source-destination pair contained in a

observed.

RREQ message. At the start of a routing

2. Unexp RREP- receiving a RREP RREQ is

session, a monitored node is at the state 1 in

not observed.

its finite state machine. As the monitor

3. Recv RREQ- acknowledgment of RREQ

node(s)

is observed.

monitored node based on the LMUs, it

4. Frwd RREQ- distribute of a RREQ is

records transitions form its initial state 1 to

observed.

one of its possible final states -- 5, 7 and 8.

observes

the

behavior

the

5. Timeout RREQ – Timeout after receiving RREQ. 6. Recv

RREP-

Receipt

RREP

observed. 7. LMU complete- forwarding a valid RREP is observed. 8. Timeout RREP-Timeout after receipt of a RREP.

Fig 1 : Finite state machine of a monitored node

In which a node may exist for each LMU [12]. The final states are shaded. Each message

When a monitor node broadcasts a RREQ, it

sent by a node causes a transition in each of

assumes that the monitored node has

its neighbor’s finite state machine. The finite

received it. The monitor node, therefore,

state machine in one neighbor gives only a

records a state transition 1->3 for the

local view of the activities of that node. It

monitored node’s finite state machine. If a

does not in any way, reflects the overall

monitor node observes a monitored node to

behavior of the node. The collaboration of

broadcast a RREQ, then a state transition of

each neighbor node makes it possible to get

3->4 is recorded if the RREQ message was

an accurate picture about the monitored

previously sent by the monitor node to the

node’s behavior. In the rest of the paper, a

monitored node; otherwise a transition of 1->

node being monitored by its neighbors is

4 is recorded since in this case, the RREQ

referred to as a monitored node[8], and its

was received by the monitored node from

neighbors are referred to as a monitor node.

some other neighbor. The transition to a

In the protocol, each node plays the dual role

timeout state occurs when a monitor node

of a monitor node and a monitored node. A

finds no activity of the monitored node for the

local message unit (LMU).Each monitor node

LMU before the expiry of a timer. When a

observes a series of interleaved LMUs for a

monitor node observes a monitored node to

routing session. Each LMU can be identified

forward a RREP, it records a transition to the

INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT

356

www.iaetsd.in

INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY

ISBN: 378 - 26 - 138420 - 5

final state – LMU complete (State No 7). At

Table 1: The state transitions of the neighbor

this state, the monitored node becomes a

nodes of node N

candidate for inclusion on a routing path. 4.3 When the final state is reached, the state

4.3 CLUSTERING ALGORITHM:

machine terminates and the state transitions

For clustering mesh networks need to

are stored by each node for each neighbor.

perform two phases clustering setup and

After sufficient number of events is collected,

clustering maintenance .The first phase is

a statistical analysis is performed to detect

accomplished by choosing some nodes that

the presence of any selfish nodes.

act as coordinators of the clustering process (cluster heads). Then a cluster is formed by associating a cluster head with some of its neighbors that become the ordinary nodes of the cluster. Based on the ID’ s and the

Fig 2: An example local message unit (LMU) observed by node N

knowledge of the neighbor’s and the obtained clustering

Above fig: depicts an example of LMU

respect

observed by the node N during the discovery

clustering

destination node D indicated by bold lines.

one.

with

Introducing

set

and

maintenance.

Mobility-Adaptive

Clustering

following properties.

each of its three neighbor nodes X, Y and Z.

initial

properties

(DMAC, for short) algorithm we obtain the

N and the corresponding state transitions for

the

Distributed

Table 1 shows the events observed by node

Events

different

clustering algorithm suitable for both the

of a route from the source node S to the

Neighbor

has

 Nodes can move even in the clustering setup DMAC is adaptive it can changes in the

State

topology of the network, remove any node

changes

from the network.

X broadcasts RREQ.

1to 4

N broadcasts RREQ.

4to 4

N sends RREP to X.

4to 6

X sends RREP to S.

6to 7

Y broadcasts RREQ.

1to 4

N broadcasts RREQ.

4to 4

Timeout N broadcasts RREQ.

4to5 1to3

Z broadcasts RREQ.

3 to4

Z sends RREP to N

4to7

 DMAC

fully

distributed.

node

decides its own role (i.e., cluster head or ordinary node) solely knowing its current one hop neighbors.  Every ordinary node always has direct access to at least one cluster head. Thus, the nodes in the cluster are at most two hops apart. This guarantees fast

intra-cluster

communication

inter-cluster

and

fast

exchange of information between any pair of

INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT

357

www.iaetsd.in

INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY

ISBN: 378 - 26 - 138420 - 5

nodes.

(2) An existing mesh router leaves the

 DMAC uses a general mechanism for the

backbone network.

selection of the cluster heads. The choice is

(3) A cheater is detected in the network

now based on generic weights associated

before packets are sent by the source, if any

with the nodes.

attacker present in the network it shows an

 The number of cluster heads that are

indication about the opponent.

allowed to be neighbors is a parameter of the

To prevent a mobile attacker from breaking t

algorithm

key pieces, every key piece should be updated within a defined cycle T. Only after at

4.4

least t key pieces are obtained in the same

KEY UPDATING UPON

cycle, can the secret be reconstructed. Key

CLUSTERING CHEATER NODES: In

the

MCBP

(minimum

cost

update involves the following four steps:

blocking

problems) whether the nodes in the network

(1) The offline CA (Administrator center) is

were attacked by the opponent are identified.

aroused in the network.

Before packet is sending a node has been

(2).The CA constructs a new group key SK

checking whether the neighboring nodes

and selects new polynomial f (x) .The new

were attacked by the cheater. If any of the

key pieces (di, SKi) are calculated and

nodes in the network were attacked, then

delivered to n selected mesh routers. Then,

node must comprise and choose another

the CA disconnects itself from the network

path to send the packet.

and remains offline.

Even though compromising the node doesn’t

3) A mesh router requests (t-1) key pieces

changes the cheaters behavior, grasping the

from other mesh routers.

topological information, Packet details. So

(4).After t key pieces are collected; the mesh

here we are introducing the key update

router reconstructs the new group key SK ,

algorithms after clustering the misbehaving

d which cheater detection and identification

node[10] from the authorized ones in the

can be carried out as described.

wireless mesh networks. Here in the key update algorithms we are

5. CONCLUSION:

reconstructing the group key, including key

This paper concentrates on avoiding the

pieces algorithm.

opponent in the network, identifying the

misbehaving nodes within the mesh networks

Key Update:

Following are several conditions in which the

clustering the misbehaving nodes and the

group key needs to be updated.

authenticated persons separately. By finite

(1) A new mesh router connects to the

state machine observing the states of the

backbone network.

adversary nodes in the network, due to these

INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT

358

www.iaetsd.in

INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY

ISBN: 378 - 26 - 138420 - 5

observation defines how it is behaving and

[6].“A length-flexible threshold cryptosystem

comparing both the authorized and opponent.

with applications,” in Proceedings of the 8th

While delivering packet from the source to the

Australasian

destination we need to secure the packet by

security and privacy, ser. ACISP’03. Berlin,

using some cryptographic techniques by

Heidelberg: Springer-Verlag, 2003, pp. 350–

providing key to the packet. Introducing the

364.

group key reconstruction algorithms gives

Wireless Networks, Communications and

wireless mesh networks. Further we can on

these

group

Mobile

key

and

additional

Computing,

2005

International

Conference on, vol. 1, June 2005, pp. 69 –

reconstruction algorithms and the earlier algorithms

Information

hoc networks and threshold cryptography,” in

clustering the adversary node from the simulations

[7]. L. Ertaul and N. Chavan, “Security of ad

betterment in the delivery of packet before

make

conference

clustering

techniques may be introduces.

[8]. M. A. Moustafa, M. A. Youssef, and M. N.

6. REFERENCES:

El-Derini, “MSR: A multipath secure reliable

[1].S. Mueller, R. Tsang, and D. Ghosal,

routing protocol for WSNs,” in Computer

“Multipath routing in mo-bile ad hoc networks:

Systems and Applications (AICCSA), 2011

Issues and challenges,” in In Performance

9th IEEE/ACS Interna-tional Conference on,

Tools

December 2011, pp. 54 –59.

and

Applications

Networked

Systems, volume 2965 of LNCS. Springer-

[9]. D. Ganesan, R. Govindan, S. Shenker,

Verlag, 2004, pp. 209–234. [2].Pavan

kumar

Ramesh

Babu

and

networks,”

based routing protocol for cognitive radio

wireless

energy-

SIGMOBILE

Mob.

Comput.

2001.

[3].Ann lee and Paul A.S Ward “A study of in

“Highly-resilient,

Commun. Rev., vol. 5, pp. 11–25, October

wireless mesh networks”. algorithms

Estrin,

efficient multipath routing in wireless sensor

Rajasekhar rao K, Dinesh Gopalni “cluster

routing

mesh

[10]. J. R. Douceur, “The Sybil attack,” in

networks”.

Peer-to-Peer Systems, First International

[4]. Nikos Dimokas, Dimitrios Katsaris, Yannis

Workshop, IPTPS 2002, Cambridge, MA,

Manolopoulos.”Node clustering in wireless

USA, March 7-8, 2002, Revised Papers.

sensor networks by considering structural

Springer, 2002, pp. 251–260.

characteristics of the network graph”. [5].Jaydip Sen. Innovation labs “Security and privacy issues in wireless mesh networks”.

INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT

359