REUSABILITY-AWARE ROUTING WITH ENHANCED SECURE DATA TRANSMISSION USING HOP-BY-HOP ROUTING ALGORITHM

International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7009(P)
Issue 05, Volume 04 (March 2017) SPECIAL ISSUE www.ijiris.com ISSN: 2349-7017(O)
_____________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.346
ISRAJIF (2016): 3.318 & Indexcopernicus ICV (2015):73.48
© 2014- 17, IJIRAE- All Rights Reserved Page -58
REUSABILITY-AWARE ROUTING WITH ENHANCED
SECURE DATA TRANSMISSION USING HOP-BY-HOP
ROUTING ALGORITHM
Mamatha C R1
, Rashmi R2
, Kavitha Bai A S3
1,2,3
Assistant Professor, Computer Science & Engineering,
Vemana Institute of Technology, Bengaluru-34, India
Abstract- Recent developments made in wireless environment attract several users for transmitting their data in secured
manner. In order to transact the data in lesser time, an optimized and shortest route should be selected by the source
node. Though there are several protocols exist, this issue is not yet resolved. In this paper, we have proposed a novel
routing protocol, SSAAR that provide an end –to –end throughput between the source node and the destination node. The
authentication is provided using Elliptical curves. Every user in the wireless network generates public key and secret key.
The secret key is further furnished and verified by our routing protocols that ensures the security and reliability of the
proposed system. An experimental result proves the effectiveness of the proposed protocols.
Keywords: Wireless environment, routing protocols, message authentication, elliptical curves and reliability.
I. INTRODUCTION
Ad-Hoc network is a dynamic multihop wireless network that's established by a collection of mobile nodes on a shared
wireless channel. Every mobile host performs native broadcasts so as to spot its existence to the encompassing hosts [1].
Encompassing hosts are nodes that are in shut proximity to the sending host. In this method, every mobile host becomes
probably a router and its potential to dynamically establish routes between itself and nodes to that a route exists. Ad-Hoc
Networks were at first projected for military applications like battled communications and disaster recovery; however the
evolution of the multimedia system Technology and therefore the business interest of firms to succeed in wide civilian
applications created QoS in MANETS. Though a lot of progress has been exhausted QoS for wire based mostly networks,
there are still several issues. Furthermore, the issues that exist for QoS in wire-based networks, MANETS face three new
constraints. These constrains are: a)the bandwidth Constrains, since a MANET has typically poor bandwidth resources, b) the
Dynamic Topology of the MANET, since nodes are regularly dynamic location, connecting and disconnecting from the
network creating connections persistently unreliable, and c)the restricted process and Storing capabilities of mobile nodes, in
distinction with routers on the internet [2]. Because of this constrain we will not design nodes during an advanced manner.
Though QoS and quality are terms that sometimes go along, we've to stay quality as low as potential since this might
additionally result in excessive power consumption that is another downside which will arise.
Most portable computer computers and plenty of personal digital assistants currently accompany 802.11-compliant air
interfaces. With the choice to work them in unintentional mode, 802.11 is that the primary sanctionative technology of
MANETs. Providing quality of service (QoS) to users during a MANET may be a key concern for service suppliers. Several
recommended applications encompass period voice and video traffic that need QoS support for effective communication [3].
The aim of any QoS support model is to supply services with guarantees in terms of delay, bandwidth, jitter, or packet loss.
To supply such guarantees in dynamic unintentional networks, the media access management (MAC) layer is accountable for
bandwidth allocation at individual devices, whereas the network layer should take into account resources on the entire path of
transmission. One in every of the foremost crucial mechanisms for providing QoS guarantees is Admission Management
(AC). AC aims to estimate the state of network's resources and thereby to choose that application information flows will be
admitted while not promising additional resources than are obtainable and so violating antecedently created guarantees. AC
has the task of dominant the usage and allocation of network resources for varied applications requiring extra services. AC
may be a key part in multimedia system systems that must permit the bandwidth to be utilized by flows only it's obtainable.
The rest of the paper is organized as follows: Section II describes the related work; Section III describes the proposed work;
Section IV presents the experimental analysis and concludes in Section V.

_____________________________________________________________________________________________________
II. RELATED WORK
The author in [3] proposed to supply a comprehensive survey of the salient unicast AC schemes designed for IEEE 802.11.
The relevant issues for the look of such protocols are mentioned and a number of other strategies of classifying the schemes
found within the literature are planned. A quick define of the operation, reaction to route failures, additionally because the
strengths and weaknesses of every protocol was given. This allowed patterns within the style and trends within the
development of AC protocols to be known. The author in [4] presented an ascendable and economical admission
management framework – contention-aware admission management protocol (CACP) that support QoS in unintentional
networks. They conjointly demonstrated the effectiveness of CACP compared to existing approaches through intensive
simulations. In [5], author Johnson and Maltz presented a protocol for routing in unintentional networks that uses dynamic
supply routing. The protocol adapts quickly to routing changes once host movement is frequent, nonetheless needs very little
or no overhead in periods within which hosts move less often. Supported results from a packet-level simulation of mobile
hosts in operation in anAdhoc network, the protocol performs run over a range of environmental conditions like host density
and movement rates. For nearly the best rates of host movement simulated, the overhead of the protocol is kind of low,
falling to simply 125th of total knowledge packets transmitted for moderate movement rates in network of 24 mobile hosts.
The distinction long between the routes used and therefore the best route lengths is negligible, and in most cases, route
lengths area unit on the average inside an element of 1.01 of best.
The author in [6] proposed a QoS-aware routing protocol that comes with associate admission management theme and a
feedback theme to fulfill the QoS needs of period applications. The novel parts of this QoSaware routing protocol is that the
use of the approximate bandwidth estimation reacts to network traffic. This approach implements these schemes by two
bandwidth estimation strategies to search out the residual bandwidth accessible at every node to support new streams. They
simulated the QoS-aware routing protocol for nodes running the IEEE 802.11 medium access management. The results
showed that the packet delivery quantitative relation will increase greatly, and packet delay and energy dissipation decrease
considerably, whereas the general end-to-end turnout isn't compact, compared with routing protocols that don't offer QoS
support. The author in [7] completely studied a unique low-complexity passive observation-based admission management
theme for making certain that sessions' turnout needs are upheld in a very contention-based, collision-prone multi-hop
Edouard MANET. They experimented on giant networks; even at offered traffic hundreds greatly exceptional the network
capability, a minimum of 880 yards of admitted sessions maintain their desired turnout throughout their period.
The author in [8] proposed and evaluated new solutions for the performance of QAR and AC protocols within the face of
quality, shadowing, and ranging link SINR. It’s found that proactively maintaining backup routes for active sessions,
adapting transmission rates, and routing around quickly low-SINR links will perceptibly improve the dependability of
assured turnout services. The author in [9] offered a survey of QoS routing solutions for MANETs which needs the
interaction and cooperation of many parts like QoS routing protocol, resource reservation theme and QoS capable at Medium
Access Management (MAC) layer. A summary of QoS multicast protocols that are planned within the past literatures are
bestowed. Additionally, the performances of those protocols are compared with reference to performance metrics. The author
in [10] represented to change the support of applications that need period for communication in unintentional networks;
congestion should be prevented in order that the required quality of service is often provided. Associate admission
management mechanism is a vital part of the standard of service resolution. Sadly, current admission management solutions
encounter issues throughout quality, usually leading to unacceptable disruptions in communication.
III. PROPOSED WORK
This section depicts the proposed security algorithm in an elaborated manner. The proposed SSAAR consist of two phases,
namely, signature generation, signature verification. A hop by hop message authentication scheme is introduced to provide
an incessant secure and efficient SSAAR. An authenticated message will be generated for every message m in order to verify
that the sender is authorized or not. The authentication is generated by elliptic curves. Every user inside the network should
generate a signature message for its verification. Consider an elliptic curve:
∶ = + +
Where a and b € Fp and 〖4a〗^3+ 〖27b〗^2≢0 mod p. The set E(F_p) consists of all points (x,y) ∈Fpon the curve,
together with a special point O, called the point at infinity. Let G = (x_G,y_G) be a base point on E(Fp) whose order is a very
large value N. user A selects a random integer d_A ϵ[1, N-1] as his private key. Then, he can compute his public key Q_A
from
Q_A=d_A × G.
Public key is the point on the curve and private key is a random number chosen by user. Thus, ECC deploys a small key size
to ensure higher security. The verification process is the process taken to check whether the sender and receiver are mutually
authorized.

_____________________________________________________________________________________________________
3.1 Algorithm for Signature Generation
Let user A sign a message m, the steps followed are:
1. Select a random integer k_A,1≤ k_A≤ N-1.
2. Calculate r = x_A mod N, Where (x_A,y_A) = k_A G. If r = 0, go back to step 1.
3. Calculate ℎ ← ℎ( , )where h is a cryptographic hash function, such as SHA-1, and ←denotes the l leftmost bits of the
hash.
4. Calculate s = rd_A h_A+k_Amod N. If s =0, go back to step 2.
5. The signature is the pair (r,s).
3.2 Algorithm for Signature Verification
Another user B verifies whether user A’s signature is valid sign or not. As input, user B should possess public key of User A,
QA,
1. Checks that Q_A≠O, otherwise invalid
2. Checks that Q_A lies on the curve
3. Checks that nQ_A=O
After that, user B follows these steps to verify the signature:
1. Verify that r and s are integers in [1, N – 1]. If not, the signature is invalid.
2. Calculateℎ ← ℎ( , ) ,, where h is the same function used in the signature generation.
3. Calculate (x_1,x_2) = sG - rh_A Q_Amod N.
4. The signature is valid if r = x_1 mod N, invalid otherwise.
Fig.1. Proposed architecture
IV.EXPERIMENTAL ANALYSIS
This section depicts the experimental analysis of the proposed algorithm.
Fig.1. Creating the three nodes with specified range and distance
Source Node
Destination Node
Private Key
Public Key
Private Key
Public Key
Private Key
Public Key
MES Signature
generation
Data
MES Signature
verification
Message
Authentication

_____________________________________________________________________________________________________
Fig. 2. Estimating its neighboring nodes and its details like port, IP address, bandwidth rate, signal quality and transaction
quality.
Fig.3. Creation of multi-hop path
Fig.4. Path selection and uploading the file
Fig.5. Sending the message to the destined node under the level of cost factor

_____________________________________________________________________________________________________
Fig.6 Successful process of selecting the optimized path
Fig.7. Successful transaction of the message
Fig.8. Source node confirms whether which node received the file and its details.
V. CONCLUSION
This paper concentrates on providing an end-to-end throughput service in multi-hop wireless environment. To achieve this,
we have proposed a novel routing named, SSAAR routing protocol. By eliminating the unwanted messages forwarding to the
receiver, we can achieve a secured wireless systems. Message authentication schemes are introduced to develop a wireless
network environment. We specifically take step on message content authenticity via Elliptical Curve Cryptosystem (ECC).
The proposed algorithm contains two phases, namely, Signature generation and signature verification. The authentication is
generated by elliptic curves. Every user inside the network should generate a signature message for its verification. The
proposed SSAAR protocol allowed any node to transmit and authenticate an unlimited number of messages without suffering
the threshold problem and provides message source privacy. Experimental results proved the effectiveness of the proposed
system.

_____________________________________________________________________________________________________
REFERENCES
[1]. Tong Meng et al, “Spatial Reusability-Aware Routing in Multi-Hop Wireless Networks”, IEEE transactions on
computers, 65(1), 2016.
[2]. S. Zhu, S. Setia, S. Jajodia, and P. Ning, “An Interleaved Hop-By- Hop Authentication Scheme for Filtering False Data
in Sensor Networks,” Proc. IEEE Symp. Security and Privacy, 2004.
[3]. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, “Perfectly-Secure Key Distribution for
Dynamic Conferences,” Proc. Advances in Cryptology (Crypto ’92), pp. 471-486, Apr. 1992.
[4]. W. Zhang, N. Subramanian, and G. Wang, “Lightweight and Compromise-Resilient Message Authentication in Sensor
Networks,” Proc. IEEE INFOCOM, Apr. 2008.
[5]. A. Perrig, R. Canetti, J. Tygar, and D. Song, “Efficient Authentication and Signing of Multicast Streams over Lossy
Channels,” Proc. IEEE Symp. Security and Privacy May 2000.
[6]. M. Albrecht, C. Gentry, S. Halevi, and J. Katz, “Attacking Crypto- graphic Schemes Based on ‘Perturbation
Polynomials’,” Report 2009/098, http://eprint.iacr.org/, 2009.
[7]. R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,”
Comm. ACM, vol. 21, no. 2, pp. 120-126, 1978.
[8]. T.A. ElGamal, “A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans.
Information Theory, vol. IT-31, no. 4, pp. 469-472, July 1985.
[9]. H. Wang, S. Sheng, C. Tan, and Q. Li, “Comparing Symmetric-Key and Public-Key Based Security Schemes in Sensor
Networks: A Case Study of User Access Control,” Proc. IEEE 28th Int’l Conf. Distributed Computing Systems
(ICDCS), pp. 11-18, 2008.
[10]. D. Pointcheval and J. Stern, “Security Proofs for Signature Schemes,” Proc. Advances in Cryptology (EUROCRYPT),
pp. 387- 398, 1996.

REUSABILITY-AWARE ROUTING WITH ENHANCED SECURE DATA TRANSMISSION USING HOP-BY-HOP ROUTING ALGORITHM

More Related Content

What's hot (19)

Similar to REUSABILITY-AWARE ROUTING WITH ENHANCED SECURE DATA TRANSMISSION USING HOP-BY-HOP ROUTING ALGORITHM (20)

Recently uploaded (20)

REUSABILITY-AWARE ROUTING WITH ENHANCED SECURE DATA TRANSMISSION USING HOP-BY-HOP ROUTING ALGORITHM