ESTABLISHING STABLE AND RELIABLE ROUTING (E-STAR)

PROTOCOL FOR HETEROGENEOUS MULTI-HOP WIRELESS

NETWORKS
MANASA C K
E&C Department, VTU, kumblagodu, Bangalore, Karnataka, India

SHARANABASAPPA
Asst. Professor, DBIT, kumblagodu, Bangalore, Karnataka, India

ABSTRACT: In this paper, we propose a protocol called E-STAR for establishing stable and
reliable routes in a heterogeneous wireless networks. E-STAR combines trust based and energy
aware routing protocol. The trust system determines the nodes competence and reliability of the
node in terms of multi-dimensional trust values. Here we use asymmetric encryption process to
encrypt the trust node. This is also called as public key cryptography. We develop two routing
protocols to minimize the probability of breaking of node. Hence by this way, E-STAR can not
only stimulate the node and relay packets, but also maintains the routes stability without any
breaking of the node. By processing the receipts the trust values are computed. This is because if
the trust values are imperfect then their will loss of earnings. From the analytical results it
demonstrates that E-STAR can secure trust system without any false accusations. Routes stability
is also improved by observing the simulation results.

KEYWORDS: Establishing stable and reliable routing protocol(E-STAR), trust systems, energy
aware routing protocol, public key cryptography, and secure routing protocols.

INTRODUCTION

In a multi-hop wireless networks, when the source node wants to communicate with the
destination node then it depends on the intermediate nodes to relay packets [1]. This transmission
can be widened to the network area using improved spectral efficiency and limited power. In
civilian applications the nodes have long relationship with the networks. The nodes mobility and
hardware energy resources vary in heterogeneous multi-hop wireless networks also called as
HMWN. HMWN are used in applications like data sharing, multimedia data transmission [2]. It
can also be used to establish a communication network for distributing files and sharing
information.

When the network is closed the nodes behavior is highly predictable. It also becomes difficult to
analyze when the node is controlled by one authority. Sum times due to various reasons also we
cannot predict the nodes behavior. This may be due to lack of hardware and energy capabilities, or
the node may belong to different authorities etc. The malfunctioned nodes frequently drop packets
and break the route and disrupt the data transmission.

Since the major source of energy consumption is radio transmission, and the mobile nodes are
battery driven, the malicious nodes or the selfish nodes does not want to lose their battery energy
while relaying on other users packets. The routes will be stronger, shorter, and the network
connectivity is more when the nodes are cooperative in relaying packets. The nodes are basically
composed with different hardware energy capabilities, the node with high energy capability will
perform packet relay more successfully than the others. For example, due to shortage of resources
the PDAs may not be able to relay packets. Sometimes due to scarcity of energy resources the
nodes may break the routes. Due to such behavior of the node, random selection of the
intermediate node will degrade the system performance and stability. It also affects the reliability
of data transmission and also degrades the system performance in terms of packet delivery ratio [3].
Small malicious node can break the route or only one intermediate node can also break the route.
The nodes have to rely on cycles of time out, when the route is broken. Multi-hop communication
will fail if there is a increase in packet delivery latency and may also cause network partitioning.
Hence it is essential to assess the nodes performance in relaying packets, in order to establish
stable routes.

E-STAR protocol establishes stable and reliable routing protocol for heterogeneous multi-hop
wireless networks. By integrating trust system and payment systems with trust based and energy
aware routing protocol, E-STAR protocol is been generated. The payment system charges the
nodes by using credits for those relay packets. An offline trusted party (TP) is used since the trust
system is not involved in the communication. The receipts compose of the nodes proof that relay
packets and sends the information to TP. The payment system can stimulates selfish nodes and can
also enforce fairness to nodes that relay more packets. However the payment systems cannot
enforce and ensure route stability. Trust systems are used in public key authentication, electronic
commerce, supporting decision making [4, 5, 6] etc and also in many more applications. For the
nodes competence, reliability, stability, trustworthiness trust management is essential. Generally
the nodes trust value is defined by the degree of belief about the nodes behavior, i.e., the
probability of how the nodes behave as expected. Single trust value is computed for most of the
existing system. To determine the nodes performance and trustworthiness single node behavior
may not be expressive. We propose a trust system that maintains a multi-dimensional trust value
for each node.

For the prediction of nodes behavior multi-dimensional trust values are more useful and also help
for routing decision better. In our trust system, low trust values are given to the node that
frequently drop the packets and break the route. Two routing protocols based on trust based and
energy aware routing protocols, called the shortest reliable route (SRR) and the best available
route (BAR) is been developed. The aim is to establish stable routes and to reduce the probability
of breaking the route due to lack of energy, nodes behavior, malicious nodes.

The rest of the paper is organized as follows. A brief overview of related work is offered in section
II, a detailed overview of proposed systems and its explanation in section III. Section IV provides
the results of proposed systems and conclusions are offered in section V.

RELATED WORKS

In this paper [1] An protocol, called MAPCP over mobile networks by Wei, C. Kuo, and K.
Naik, is proposed in this work. MANET anonymous communication protocol over point to point
application employs broadcasting data with probalistic based flooding control to establish multiple
paths between communication peers. Since MAPCP builds multiple paths to multiple peer without
using extra route it is more reliable in point to point application. The main advantages of this
protocol is, since it is for point- point communication it is more reliable that is there is no chances

49
of breaking of the routes and dropping of the packets but they are more resilient to attackers. And
misbehaving of nodes occurs due to multipath routing.

In this paper [2] An acknowledgement based approach for misbehaviour in MANETS by K. Liu,
J. Deng, and K. Balakrishnan To overcome the problem of MANET that is node misbehaviour due
to lack of resources and low trusted nodes we proposed 2ACK scheme. The main idea of 2ACK
scheme is to send two node acknowledgement packets in opposite direction of routing path. Due to
this scheme only fraction of received data packets are acknowledged in 2ACK scheme. The main
advantage of this paper is reducing overheads due to 2ACK scheme and the drawbacks are more
energy consumption with more cost.

In this paper [3] Mitigating routing misbehaviour and security for mobile ad hoc networks by S.
Marti, T. Giuli, K. Lai, and M. Baker it deals with the routing misbehaviour and security analysis.
In multi hop heterogeneous wireless networks, when a mobile node needs to communicate with
remote destination it relies on other node. Hence data storage, battery energy forms a pool of
resources that can be shared by a pool of resources and this in turn can be shared by all of them.
All the security aspects for multi hop wireless networks are studied in this paper. Securing the data
is based on well known cryptography properties. The advantages of ensuring security results in
improved efficiency, improved throughput and long life time. At the same time it is difficult to
detect honest node and selfish nodes and it is not energy efficient.

In this paper [4] DSR: The dynamic source routing protocol for multi-hop wireless ad hoc
networks by D. Johnson, D. Maltz, and J. Broach presents a protocol for routing in ad-hoc
networks that uses dynamic source routing DSR. When host movement is frequent it quickly
adapts to the changes made by the routing protocol. DSR is a routing technique in which sender of
a packet determines the complete sequence of the nodes to which the packet has to forwarded. It is
explicitly designed for the use in wireless networks. The advantages of this protocol is reduced
over heads because no periodic routing. Drawback is less stable since it enables low trusted nodes.

METHODOLOGY

The proposed architecture E-STAR has five modules namely Network Model, Neighbor discovery,
Energy aware routing, Trust aware routing, Credit value.

Network Model
The considered HMWN has nodes and offline trusted party (TP). The nodes have different
hardware and energy capabilities. The network is used for civilian applications, its lifetime is long,
and the nodes have long relation with the network. Thus, with every interaction, there is always an
expectation of future reaction. TP maintains the nodes credit accounts and trust values. Each node
contacts TP to submit the payment receipts and TP updates the involved nodes payment accounts
and trust values. This contact can occur via cellular networks or Internet.

Neighbor discovery
In wireless network, the communication is happen through multi-hop transmission. It is necessary
to establish the neighbor nodes under such networks. In this module, one hop neighbor of every
node is identified dynamically. The communication among the nodes is based on a tree topology
with the destination as the root. At the initial phase a tree is formed which is as soon below. The
sender node first broadcast a message with a hop counter were the hop is just the rough

50
measurement of the distance between the source and the destination. The message received by the
sender node will set the message sender as the parent node, it will increase the hop counter by one,
and broadcast it to their neighbor nodes. Data are transferred along the edges in this
communication tree.

Energy aware routing

The shortest Reliable Route (SRR) protocol is proposed to establish the shortest route that can
satisfy the requirements of the source node such as energy, trust, and route length. The source
node S broadcasts RREQ packet to the destination node D to establish a route and waits for RREP
packet. The source node puts on its requirements in the RREQ packet, and the nodes that can
satisfy these requirements broadcast the packet. The destination node establishes the shortest route
that can satisfy the source nodes requirements. The main aim of the SRR protocol is that the node
that satisfies the source nodes requirements is trusted enough to act as a relay and can establish
stable routes. The protocol is useful to establish a route that avoids the low-trusted nodes and high
energy consumption routes. Energy values of node are declared as numerical value such as
{1,2,3,4..etc}, threshold of energy is assigned as 2, thus the route is taken in such a way that, node
should have energy value of less than or equal to 2.

Trust aware routing

The trust requirements are the maximum needed for the intermediate node, e.g., trust value Tr=
[0,1], the zero value is considered to be malicious node and trust value equal to one is considered
to be normal node. For SRR protocol, node N to route a data packet to destination, N only needs to
decide to which neighbour it should forward the data packet considering both the trustworthiness
and energy. The node which acquires high trust value will be included in route.

Credit value
To charge the nodes the payment system uses credits that send packets and reward those relaying
packets. The combination of both the systems that is the payment and trust systems, they not only
used to stimulates the nodes to cooperate in relaying packets and to earn credits, but also
stimulates the good nodes and also to maintain good trust values. Since relaying packets
consumes energy and other resources, packet relaying is treated as a service which can be charged.
The nodes earn credits and update the value one if it undergoes a successful transmission for
relaying others packets and spend them to get their packets delivered or if not the successful
transmission then it does not updates anything.

E-STAR has three main phases namely data transmission phase, update credit-account and trust
values phases, route establishment phase.

Data transmission phase

If the source node wants to send message to the destination node it relies on the intermediate node.
Source node, destination node, and the intermediate node have the identities and be denoted as
(IDS, IDX, IDY, IDZ, IID). Hashing the data using the harsh function H() results in hash value
H(d). Here we are going to use asymmetric encryption process which is also called as public key
cryptography. To ensure the messages authenticity we perform source node signature. The
destination node generates one way hash function which is called as hash chain. The destination
node sends ACK packet contains hash chain function to the source node. When TP is connected
each node in the route composes a receipt and submits. If the route is participating in sending and
relaying, receiving the message then this makes a proof for the receipts to update its trust values.

51
Update credit account and trust values phase
When the receipt is sent to TP, it checks first weather the receipt is been processed properly. Then
it is preceded by computing the nodes signature functions and hashing them. From knowing the
past behavior and the present behavior of the node the trust values are calculated. In order to
compute the nodes competence and reliability, trust values are calculated. Usually the trust
relationships absolute, sometimes trust is also dynamic or time-sensitive. If the nodes are not
broken then it is good to increase the trust values and vice versa it is necessary to decrease the trust
values if the nodes break often.

Choose
Source destinati
Nodes on

Discover Packet
neighbor transmis
sion

Check Establis
energy h route

Check
Deliver
trust
packets

Update Submit
credit receipts

Fig 1: System Architecture of E-STAR

Route establishment phase

We are proposing two routing protocols called Shortest reliable route (SRR) and Best available
route (BAR). The routing protocols have three main processes: i) Route request packet delivery
(RREQ); ii) Route selection; and iii) Route reply packet delivery (RREP)

52
The SRR Routing Protocol
To establish a route to the destination node the source node broadcasts RREQ packet and waits for
RREP packet. The source node embeds its requirements in the RREQ packet, and the nodes that
can satisfy these requirements broadcast the packet. The destination node establishes the shortest
route that can satisfy the source nodes requirements. The rationale of the SRR protocol is that the
node that satisfies the source nodes requirements is trusted enough to act as a relay. The protocol
is useful to establish a route that avoids the low-trusted nodes.

The BAR Routing Protocol

After receiving the first RREQ packet, the destination node waits for a while to receive more
RREQ packets if there are. Then, it selects the best available route if a set of feasible routes are
found. If there are multiple routes with lifetimes a, the destination node selects the most reliable
route, otherwise, it establishes multiple routes in such a way that reduces the routes number and
maximizes the reliability. The destination node should not select multiple routes with common
node(s) (if possible) to disallow one node to break the routes.

RESULTS

WSN consists of several sensor nodes in a network domain. Here 25 sensor nodes are randomly
deployed i.e from 0 to 24. Source and destination nodes are selected. The below result shows the
broadcasting of the packets to the respective nodes. As told before E-STAR combines both the
trust system and energy aware routing protocols such as SRR and BAR, it demonstrates that
through the trusted nodes the data is been transmitted correctly by route without any breakage of
route or frequent dropping of packets through the network. Since while transmitting any data it
relays on the intermediate node, instead of considering the intermediate nodes it is best to use the
trusted nodes which helps in establishing more stable and reliable routes

Fig 2: Establishing path using trust values

53
CONCLUSION

To establish stable and reliable routes in heterogeneous multi-hop wireless networks, the proposed
E-STAR protocol makes use of trust based and energy aware routing protocols. E-STAR not only
just stimulates the node but also maintains the routes stability by not breaking the route due to lack
of resources, malicious nodes. If the node reports any incorrect energy capability then it punishes
the node by decrementing the trust values so that it cannot be chosen for next routing. SRR and
BAR routing makes routing decisions by considering route length, reliability based on nodes past
behavior , and lifetime based on nodes previous energy capabilities. If the node wants to meet
trust/energy requirements then it depends on SRR protocol. Destination node determines the best
available route and this is done by BAR. From the analytic results shown E-STAR ensure trust
calculation without false accusation.

REFERENCES

D. Wei, C. Kuo, and K. Naik An protocol, called MANET Anonymous Point-to-point

Communication Protocol over mobile networks,IEEE Journal on Selected Areas in
Communications, vol. 25, no. 1, January 2007.
K. Liu, J. Deng, and K. Balakrishnan An acknowledgement-based approach for the misbehavior
in MANETs, IEEE Transaction on Mobile Computing, vol. 6, no. 5, pp 536550, May 2007.
S. Marti, T. Giuli, K. Lai, and M. Bakeer, Anonymous routing misbehaviour in mobile ad hoc
networks, Proc. of IEEE/ACM MobiCom00, pp. 255265, Boston, MA, August 6-11, 2000.
D. Johnson, D. Maltzy, and J. Broach, DSR The dynamic source routing protocol wireless
networks. In C. Perkins, editor, Ad Hoc Networking, chapter 5, pp. 139-172. Addison- Wesley,
2001.
G. Sheni J. Liu, D. Wang, J. Wanguo, and S. Jinu, Multi-hop relay for wireless access
networks, Bell Labs Technical Journal, vol. 13,no. 4, pp. 175-193, 2009.
M. Stojmenovic, V. Narasimhan, and A. Nayak, Autoregressive trust management in wireless
networks, Ad hoc & Sensor Wireless Networks, vol. 16 Issue 1-3, pp. 229-242 2012.
H. Li and M. Singhal, Trust management in distributed wireless communication ad-hoc systems,
IEEE Computers, vol. 40, no. 2, pp. 45-53, February 2007.

54