IAETSD

1. 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.
1. INTORDUCTION:
Wireless mesh networks (WMN’S)
issued as a bright conception to meet the
disputes on succeeding generation wireless
networks. Providing flexibility, adaptability,
reconfigurable the network upon the cost-
efficient solutions to service provider. It has
the possibility to wipe out many of these
disadvantages like low-cost, wireless broad
band internet access for both wired and
mobile nodes. Wireless mesh networks are
an emerging technology right now. The use of
mesh wireless networks may bring the dream
of a seamlessly connected world into reality.
Wireless mesh Networks includes mesh
routers and mesh clients. Getting rid of the
wires from the wireless LAN’s, doubling the
access point is known as mesh routers and it
forms a backbone network. A mesh network
can be designed using a flooding technique
or a routing technique.[3] When using a
routing technique, the message is
propagated along a path, by hopping from
node to node until the destination is reached.
To ensure all its paths' availability, a routing
network must allow for continuous
352
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in

2. connections and reconfiguration around
broken or blocked paths, using self-
healing algorithms. A mesh network whose
nodes are all connected to each other is
a fully connected network. Mesh networks
can be seen as one type of. Mobile adhoc
networks (MANETs) [1] and mesh networks
are therefore closely related. The mesh
routers render a rich radio connectivity in
which importantly brings down the direct
deployment cost of the network. Mesh routers
are usually stationary and it doesn’t have
power constraint. Mesh clients are mobile
nodes. Sometimes mesh routers can also act
as gateways which are connected to the
internet through a wired backbone.
2. RELATED WORK:
Privacy and security plays a major role in the
communication network for both wired and
wireless network. Security issues related to
the packet transmission from the source to
the destination nodes. Securing the data from
the opponent without changing the main
thing. Different technologies are introduced to
secure data from opponents by using
clustering the different nodes in the mesh
network. Clustering [4] and cryptography
techniques are included for protecting packet
from un-authorizers. It demonstrates the high
quality of multipath routing protocols above
traditional single path protocols in terms of
resiliency under the attacks of blocking and
node isolation types of attacks , particularly in
wireless networks domain. Multi-path
protocols for wireless mesh networks make it
particularly hard for an adversary to
effectively launch such attacks. Attempting to
model the theoretical hardness of attacks on
multi-path routing protocols for mobile nodes
and qualify it in mathematical terms. The
study will impact the areas of security and
robustness of routing protocols of wireless
mesh networks. [3], threshold cryptography
and network coding. In previously, every
node had a unique ID randomly, routing
occurs through protocols such as greedy and
LP algorithms. Problems incorporated in last
investigations are if any opponent were
hacked any of the nodes in the network, it
can retrieve the packet before sending the
destination. And one more consequence is
about the topological information of the
network, through that it may miss send the
packet without permissions of authenticated
nodes. To reduce these complications, here
introducing the clustering concepts[4] were
incorporated i.e. , grouping the nodes in the
mesh networks after identifying the
misbehaving node move out the effected
node from the network again make clustering
algorithms to group the nodes using
MSR(multipath split routing) protocol. Again
to protect data from adversary nodes
introducing cryptographic key distributions
techniques are integrated. Introducing the
clustering algorithms to group the nodes in
the mesh networks, giving different ID’s to the
nodes. Grouping sensor nodes into clusters
has been widely investigated by researchers
353
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in

3. in order to achieve the network system's
scalability and management objectives. Every
cluster would have a leader sensor node,
often referred to as the cluster-head (CH),
which can be fixed or variable. CHs
aggregate the data collected by the sensor
nodes in its cluster, thus, clustering
decreases the number of relayed packets. As
the benefits of clustering, it conserves
communication bandwidth and avoids
redundant exchange of messages among
sensor nodes, because of limiting the inter-
cluster interactions. Therefore, clustering
prolongs the lifetime of WSNs [2][4].
(A).How does a mesh network works?
While traditional networks rely on a small
number of wired access points or wireless
hotspots to connect users, a wireless mesh
network spreads a network connection
among dozens or even hundreds of wireless
mesh nodes that "talk" to each other, sharing
the network connection across a large area.
Some think of the internet as being the
world's largest mesh network. When using
the internet, information travels by being
bounced automatically from one router to the
next until it reaches its destination. The
internet has billions of potential paths across
which data can travel.
3. PAPER ORGANIZATION:
The rest of this paper is organized as follows
section 4 discuss the implementation
process, section 4.1 introducing the finite
state machine to record the details of nodes
behavior, section 4.2 presents the clustering
algorithm implementation details, section 4.3
discuss key updating process after clustering
adversary nodes section 5 concludes the
paper with the future discussion.
4. IMPLEMENTATION:
Wireless mesh networks integrating a key
technology for next generation wireless
networks showing rapid progress and
numerous applications. In a WMN, high
speed routers integrated with each other in a
multi-hop fashion over wireless channels and
form a broadband backhaul. In the previous
analysis of the paper includes that in wireless
mesh networks. Due to the delivery of packet
from source to destination it should be send
through secure path by providing a key to the
packet. In WMN’s an adversary node involves
in the network can know the details of
topological information, obviously the routing
details. In order to secure the packet from the
opponent we need to reduce the way of
adversary nodes about topological
information[6] and providing another key to
the packet. Here in this paper introducing the
clustering and cryptographic key
regeneration. Analyzing the node behavior
whether it is acting in a normal way or not, it
is possible by using finite state machine.
Behavior of each node is noted in the table,
clustering misbehaving nodes using a unique
id and authorized one with another id’s. Upon
creating different id’s for misbehaving nodes
and authorized node packet details have to
354
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in

4. be modified. This is re-generating the key to
protect data from opponents. Here
introducing MSR protocol for generating the
maximal disjoint paths in the network, and
how the MSR is working upon the selection of
routes in the network. To observer the
behavior of the nodes incorporating finite
state machine model. Examine each and
every nodes behavior about the status of
packet delivery and soon. The selfish node is
identified in the network based on data
collected by each node from its local
message unit (LMU). Clustering the
misbehaving nodes as a group and
authorized one’s a group. Although grouping
opponents doesn’t made packet in a secured
way. Again providing a key is an important
task to protect data i.e. re-generating
algorithms are introduced to provide a key at
the packet header.
4.1 MULTI-PATH SPLIT ROUTING:
Multipath Split Routing (MSR) protocol that
builds maximally disjoints paths. Multiple
routes, of which one is the shortest delay
path, are discovered on demand. Established
routes are not necessarily of equal length.
Data traffic is split into multiple routes to
avoid congestion[5] and to use network
resources efficiently. We believe providing
multiple routes are beneficial in network
communications, particularly in mobile
wireless networks where routes are
disconnected frequently because of mobility
and poor wireless link quality.
A. ROUTE DISCOVERY OF MSR:
Multipath split routing builds multi routes
using request/reply cycles. When source
needs routes to the destination but no route
information is known, it overflows the route
request message (RREQ) to the entire
network. Due to the packet overflow, several
replicate that spanned through different
routes to reach the destination. The
destination node selects multiple disjoint [5]
routes and sends route reply (RREP) packets
back to the source through the selected
routes.
4.2 THE FINITE STATE MACHINE MODEL:
In the proposed mechanism, the messages
corresponding to a RREQ flooding and the
uni-cast RREP are referred to as a message
unit. It is clear that no node in the network
can observe all the transmission in a
message unit. The subset of a message unit
that a node can observe is referred to as the
local message unit (LMU). The LMU for a
particular node consists of the messages
transmitted by the node and its neighbors,
and the messages overheard by the node.
The selfish node detection is done based on
data collected by each node from its
observed LMUs. For each message
transmission in an LMU, a node maintains a
record of its sender, and the receiver, and the
neighbor nodes that receive the RREQ
broadcast sent by the node itself.
The finite state machine depicts various
states
355
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in

5. 1. Init – in intial phase no RREQ is
observed.
2. Unexp RREP- receiving a RREP RREQ is
not observed.
3. Recv RREQ- acknowledgment of RREQ
is observed.
4. Frwd RREQ- distribute of a RREQ is
observed.
5. Timeout RREQ – Timeout after receiving
RREQ.
6. Recv RREP- Receipt of RREP is
observed.
7. LMU complete- forwarding a valid RREP
is observed.
8. Timeout RREP-Timeout after receipt of a
RREP.
In which a node may exist for each LMU [12].
The final states are shaded. Each message
sent by a node causes a transition in each of
its neighbor’s finite state machine. The finite
state machine in one neighbor gives only a
local view of the activities of that node. It
does not in any way, reflects the overall
behavior of the node. The collaboration of
each neighbor node makes it possible to get
an accurate picture about the monitored
node’s behavior. In the rest of the paper, a
node being monitored by its neighbors is
referred to as a monitored node[8], and its
neighbors are referred to as a monitor node.
In the protocol, each node plays the dual role
of a monitor node and a monitored node. A
local message unit (LMU).Each monitor node
observes a series of interleaved LMUs for a
routing session. Each LMU can be identified
by the source-destination pair contained in a
RREQ message. At the start of a routing
session, a monitored node is at the state 1 in
its finite state machine. As the monitor
node(s) observes the behavior of the
monitored node based on the LMUs, it
records transitions form its initial state 1 to
one of its possible final states -- 5, 7 and 8.
When a monitor node broadcasts a RREQ, it
assumes that the monitored node has
received it. The monitor node, therefore,
records a state transition 1->3 for the
monitored node’s finite state machine. If a
monitor node observes a monitored node to
broadcast a RREQ, then a state transition of
3->4 is recorded if the RREQ message was
previously sent by the monitor node to the
monitored node; otherwise a transition of 1->
4 is recorded since in this case, the RREQ
was received by the monitored node from
some other neighbor. The transition to a
timeout state occurs when a monitor node
finds no activity of the monitored node for the
LMU before the expiry of a timer. When a
monitor node observes a monitored node to
forward a RREP, it records a transition to the
Fig 1 : Finite state machine of a monitored node
356
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in

6. final state – LMU complete (State No 7). At
this state, the monitored node becomes a
candidate for inclusion on a routing path.
When the final state is reached, the state
machine terminates and the state transitions
are stored by each node for each neighbor.
After sufficient number of events is collected,
a statistical analysis is performed to detect
the presence of any selfish nodes.
Above fig: depicts an example of LMU
observed by the node N during the discovery
of a route from the source node S to the
destination node D indicated by bold lines.
Table 1 shows the events observed by node
N and the corresponding state transitions for
each of its three neighbor nodes X, Y and Z.
Neighbor Events
State
changes
X
X broadcasts RREQ.
N broadcasts RREQ.
N sends RREP to X.
X sends RREP to S.
1to 4
4to 4
4to 6
6to 7
Y
Y broadcasts RREQ.
N broadcasts RREQ.
Timeout
1to 4
4to 4
4to5
Z
N broadcasts RREQ.
Z broadcasts RREQ.
Z sends RREP to N
1to3
3 to4
4to7
Table 1: The state transitions of the neighbor
nodes of node N
4.3 4.3 CLUSTERING ALGORITHM:
For clustering mesh networks need to
perform two phases clustering setup and
clustering maintenance .The first phase is
accomplished by choosing some nodes that
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
knowledge of the neighbor’s and the obtained
clustering has different properties with
respect to the initial one. Introducing
clustering algorithm suitable for both the
clustering set up and maintenance.
Distributed Mobility-Adaptive Clustering
(DMAC, for short) algorithm we obtain the
following properties.
 Nodes can move even in the clustering
setup DMAC is adaptive it can changes in the
topology of the network, remove any node
from the network.
 DMAC is fully distributed. A 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 and fast inter-cluster
exchange of information between any pair of
Fig 2: An example local message unit
(LMU) observed by node N
357
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in

7. nodes.
 DMAC uses a general mechanism for the
selection of the cluster heads. The choice is
now based on generic weights associated
with the nodes.
 The number of cluster heads that are
allowed to be neighbors is a parameter of the
algorithm
4.4 KEY UPDATING UPON
CLUSTERING CHEATER NODES:
In the MCBP (minimum cost blocking
problems) whether the nodes in the network
were attacked by the opponent are identified.
Before packet is sending a node has been
checking whether the neighboring nodes
were attacked by the cheater. If any of the
nodes in the network were attacked, then
node must comprise and choose another
path to send the packet.
Even though compromising the node doesn’t
changes the cheaters behavior, grasping the
topological information, Packet details. So
here we are introducing the key update
algorithms after clustering the misbehaving
node[10] from the authorized ones in the
wireless mesh networks.
Here in the key update algorithms we are
reconstructing the group key, including key
pieces algorithm.
i. Key Update:
Following are several conditions in which the
group key needs to be updated.
(1) A new mesh router connects to the
backbone network.
(2) An existing mesh router leaves the
backbone network.
(3) A cheater is detected in the network
before packets are sent by the source, if any
attacker present in the network it shows an
indication about the opponent.
To prevent a mobile attacker from breaking t
key pieces, every key piece should be
updated within a defined cycle T. Only after at
least t key pieces are obtained in the same
cycle, can the secret be reconstructed. Key
update involves the following four steps:
(1) The offline CA (Administrator center) is
aroused in the network.
(2).The CA constructs a new group key SK
and selects new polynomial f (x) .The new
key pieces (di, SKi) are calculated and
delivered to n selected mesh routers. Then,
the CA disconnects itself from the network
and remains offline.
3) A mesh router requests (t-1) key pieces
from other mesh routers.
(4).After t key pieces are collected; the mesh
router reconstructs the new group key SK ,
d which cheater detection and identification
can be carried out as described.
5. CONCLUSION:
This paper concentrates on avoiding the
opponent in the network, identifying the
misbehaving nodes within the mesh networks
clustering the misbehaving nodes and the
authenticated persons separately. By finite
state machine observing the states of the
adversary nodes in the network, due to these
358
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in

8. observation defines how it is behaving and
comparing both the authorized and opponent.
While delivering packet from the source to the
destination we need to secure the packet by
using some cryptographic techniques by
providing key to the packet. Introducing the
group key reconstruction algorithms gives
betterment in the delivery of packet before
clustering the adversary node from the
wireless mesh networks. Further we can
make simulations on these group key
reconstruction algorithms and the earlier
algorithms and additional clustering
techniques may be introduces.
6. REFERENCES:
[1].S. Mueller, R. Tsang, and D. Ghosal,
“Multipath routing in mo-bile ad hoc networks:
Issues and challenges,” in In Performance
Tools and Applications to Networked
Systems, volume 2965 of LNCS. Springer-
Verlag, 2004, pp. 209–234.
[2].Pavan kumar T, Ramesh Babu B,
Rajasekhar rao K, Dinesh Gopalni “cluster
based routing protocol for cognitive radio
wireless mesh networks”.
[3].Ann lee and Paul A.S Ward “A study of
routing algorithms in wireless mesh
networks”.
[4]. Nikos Dimokas, Dimitrios Katsaris, Yannis
Manolopoulos.”Node clustering in wireless
sensor networks by considering structural
characteristics of the network graph”.
[5].Jaydip Sen. Innovation labs “Security and
privacy issues in wireless mesh networks”.
[6].“A length-flexible threshold cryptosystem
with applications,” in Proceedings of the 8th
Australasian conference on Information
security and privacy, ser. ACISP’03. Berlin,
Heidelberg: Springer-Verlag, 2003, pp. 350–
364.
[7]. L. Ertaul and N. Chavan, “Security of ad
hoc networks and threshold cryptography,” in
Wireless Networks, Communications and
Mobile Computing, 2005 International
Conference on, vol. 1, June 2005, pp. 69 –
74
[8]. M. A. Moustafa, M. A. Youssef, and M. N.
El-Derini, “MSR: A multipath secure reliable
routing protocol for WSNs,” in Computer
Systems and Applications (AICCSA), 2011
9th IEEE/ACS Interna-tional Conference on,
December 2011, pp. 54 –59.
[9]. D. Ganesan, R. Govindan, S. Shenker,
and D. Estrin, “Highly-resilient, energy-
efficient multipath routing in wireless sensor
networks,” SIGMOBILE Mob. Comput.
Commun. Rev., vol. 5, pp. 11–25, October
2001.
[10]. J. R. Douceur, “The Sybil attack,” in
Peer-to-Peer Systems, First International
Workshop, IPTPS 2002, Cambridge, MA,
USA, March 7-8, 2002, Revised Papers.
Springer, 2002, pp. 251–260.
359
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in