ECC Based secure handover in cellular network

ACKNOWLEDGEMENT

First and foremost, we record our sincere thanks to Almighty GOD and our
beloved parents who provided us this chance during our tenure in college. We are
grateful to our college & Dr.PRINCIPAL NAME M.E, PhD,our beloved
principal.
We are also thankful to Mrs.HOD NAME B.Tech , Head of the Department
of Computer Science And Engineering for providing the necessary facilities during
the execution of our project work. We also thank for her valuable suggestions,
advice, guidance and constructive ideas in each and every step, which was indeed a
great need towards the successful completion of the project.
This project would not have been a success without my Internal guide. So, I
would extend my deep sense of gratitude to my Internal guide Ms. GUIDE NAME
B.Tech., for the effort she took in guiding me in all the stages of completion of my
project work..
We are very much indebted to our external guide Mr.XXXX B.E, project
guide of COMPANY NAME for relentlessly supporting us with technical
guidance throughout our project work .

PROJECT MEMBER1
PROJECT MEMEBER2

ABSTRACT
A handover authentication module in mobile networks enables mobile nodes to
securely and seamlessly roam over multiple access points. However, designing an
appropriate handover authentication protocol is a difficult task because wireless
networks are susceptible to attacks, and mobile nodes have limited power and
processing capability. In this article, we identify the security and efficiency
requirements of a good handover authentication protocol and analyze the existing
related protocols, and show that many such protocols are either insecure or in
efficient. Then we proposes the ecc-based encryption and proposed the conditions
in which the perfect secrecy is obtained. Security of data is an issue that is of
significant interest. In this paper, we propose ecc-based data encryption system.
ecc could also be treated as an encryption algorithm with good secrecy

LIST OF ABBREVIATIONS
SWNET - Social Wireless Networks
CP - Content Providers
EC - End Consumers
MANET - Mobile Ad-hoc Network
LRU - Least Recently Used
LFU - Least Frequently Used
BU - Boston University
ISP - Internet Service Provider
NLANR - National Lab for Applied Network Research
NS2 Network Simulator2
NGWS - Next Generation Window Service

CHAPTER 1- INTRODUCTION
1.1

Introduction

What is Mobile Computing?

Mobile computing is the discipline for creating an information management
platform, which is free from spatial and temporal constraints. The freedom from
these constraints allows its users to access and process desired information from
anywhere in the space. The state of the user, static or mobile, does not affect the
information management capability of the mobile platform. A user can continue to
access and manipulate desired data while traveling on plane, in car, on ship, etc.
Thus, the discipline creates an illusion that the desired data and sufficient
processing power are available on the spot, where as in reality they may be located
far away. Otherwise Mobile computing is a generic term used to refer to a variety
of devices that allow people to access data and information from where ever they
are.

Structure of mobile computing

Different types of devices used for the mobile computing:
1.
2.
3.
4.
5.
6.
7.

Personal digital assistant/enterprise digital assistant

Smartphones
Tablet computers
Netbooks
Ultra-mobile PCs
Wearable computers
Palmtops/pocket computers

Applications of Mobile Computing:

1.

Vehicles:
Tomorrows cars will comprise many wireless communication systems

and mobility aware applications. Music, news, road conditions, weather reports,
and other broadcast information are received via digital audio broadcasting (DAB)
with 1.5 M-bits/s. For personal communication, a global system for mobile
communications (GSM) phone might be available offering voice and data
connectivity with 384 k-bits/s. For remote areas satellite communication can be
used, while the current position of the car is determined via global positioning
system (GPS). Additionally, cars driving in the same area build a local ad-hoc
network for fast information exchange in emergency situations or to help each
other keeping a safe distance. In case of an accident, not only will the airbag be
triggered, but also an emergency call to a service provider informing ambulance
and police. Cars with this technology are already available. Future cars will also
inform other cars about accidents via the ad hoc network to help them slow down
in time, even before a driver can recognize the accident. Buses, trucks, and train
are already transmitting maintenance and logistic information to their home base,

which helps o improve organization (fleet management), and thus save time and
money.

2.

Emergency:
Just imagine the possibilities of an ambulance with a high quality

wireless connection to a hospital. After an accident, vital information about

injured persons can be sent to the hospital immediately. There, all necessary steps
for this particular type of accident can be prepared or further specialists can be
consulted for an early diagnosis. Furthermore,

wireless networks are the

only means of communication in the case of natural disasters such as hurricanes or

earthquakes.
3. Business:
Todays typical traveling salesman needs instant access to the
companys database: to ensure that the files on his or her laptop reflect the actual
state, to enable the company to keep track of all activities of their traveling
employees, to keep databases consistent etc., with wireless access, the laptop can
be turned into a true mobile office.

Benefits of Mobile Computing:

Improve business productivity by streamlining interaction and taking
advantage of immediate access
Reduce business operations costs by increasing supply chain visibility,
optimizing logistics and accelerating processes
Strengthen customer relationships by creating more opportunities to connect,
providing information at their fingertips when they need it most

 Gain competitive advantage by creating brand differentiation and expanding

customer experience
Increase work force effectiveness and capability by providing on-the-go
access
Improve business cycle processes by redesigning work flow to utilize mobile
devices that interface with legacy applications
Advantages of Mobile Computing:
Mobile computing has changed the complete landscape of human being life.
Following are the clear advantages of Mobile Computing:
1. Location flexibility:
This has enabled user to work from anywhere as long as there is a connection
established. A user can work without being in a fixed position. Their mobility
ensures that they are able to carry out numerous tasks at the same time perform
their stated jobs.
2. Saves Time:
The time consumed or wasted by travelling from different locations or to the office
and back, have been slashed. One can now access all the important documents and
files over a secure channel or portal and work as if they were on their computer. It
has enhanced telecommuting in many companies. This also reduces unnecessary
expenses that might be incurred.
3. Enhanced Productivity:
Productive nature has been boosted by the fact that a worker can simply work
efficiently and effectively from which ever location they see comfortable and
suitable. Users are able to work with comfortable environments.

4. Ease of research:
Research has been made easier, since users will go to the field and search for facts
and feed them back to the system. It has also made it easier for field officer and
researchers to collect and feed data from wherever they without making
unnecessary trip to and from the office to the field.
5. Entertainment:
Video and audio recordings can now be streamed on the go using mobile
computing. It's easy to access a wide variety of movies, educational and
informative material. With the improvement and availability of high speed data
connections at considerable costs, one is able to get all the entertainment they want
as they browser the internet for streamed data. One can be able to watch news,
movies, and documentaries among other entertainment offers over the internet.
This was not such before mobile computing dawned on the computing world.
6. Streamlining of Business Processes:
Business processes are now easily available through secured connections. Basing
on the factor of security, adequate measures have been put in place to ensure
authentication and authorization of the user accessing those services.
Some business functions can be run over secure links and also the sharing of
information between business partners. Also it's worth noting that lengthy
travelling has been reduced, since there is the use of voice and video conferencing.
Meetings, seminars and other informative services can be conducted using the
video and voice conferencing. This cuts down on travel time and expenditure.
VEHICULAR AD HOC NETWORKS (VANETS)

Vehicular ad hoc networks (VANETs) have been quite a hot research area in the last few years.
Due to their unique characteristics such as high dynamic topology and predictable mobility,
VANETs attract so much attention of both academia and industry. In this paper, we provide an
overview of the main aspects of VANETs from a research perspective. This paper starts with the
basic architecture of networks, then discusses three popular research issues and general research
methods, and ends up with the analysis on challenges and future trends of VANETs.
INTRODUCTION
Recently, with the development of vehicle industry and wireless communication technology,
vehicular ad hoc networks are becoming one of the most promising research fields.
VANETs which use vehicles as mobile nodes are a subclass of mobile ad hoc networks
(MANETs) to provide communications among nearby vehicles and between vehicles and nearby
roadside equipment but apparently differ from other networks by their own characteristics.
Specifically, the nodes (vehicles) in VANETs are limited to road topology while moving, so if the
road information is available, we are able to predict the future position of a vehicle; what is
more, vehicles can afford significant computing, communication, and sensing capabilities as well
as providing continuous transmission power themselves to support these functions .
However, VANETs also come with several challenging characteristics, such as potentially large
scale and high mobility. Nodes in the vehicular environment are much more dynamic because
most cars usually are at a very high speed and change their position constantly. The high mobility
also leads to a dynamic network topology, while the links between nodes connect and disconnect
very often. Besides, VANETs have a potentially large scale which can include many participants
and extend over the entire road network .
It is precisely because of both of these unique attractive features and challenging characteristics
that VANETs could draw the attention from both industry and academia.
Therefore, several articles have tried to summarize the issues about vehicular networks. For
example, in the authors discuss the research challenges of routing in VANETs and then
summarize and compare the performance of routing protocols; Hartenstein and Laberteaux

present an overview on the communication and networking aspects of VANETs and summarize
the current state of the art at that time ; Raya and Hubaux address the security of VANETs
comprehensively and provide a set of security protocols as well ; in , the authors propose a
taxonomy of a large range of mobility models available for vehicular ad hoc networks. These
articles all reviewed specific research areas in VANETs. In addition, others papers like provide
comprehensive overview of applications, architectures, protocols, and challenges in VANETs and
especially introduce VANETs projects and standardization efforts in different regions (i.e., USA,
Japan, and Europe); Al-Sultan et al. provide detailed information for readers to understand the
main aspects and challenges related to VANETs, including network architecture, wireless access
technologies, characteristics, applications, and simulation tools .
Compared with these current articles, this paper adds the introduction of layered architecture for
VANETs so that the summary of network architecture is more complete. Also, we organize the
overview of the vehicular ad hoc networks in a novel way. That is, we introduce the VANETs
from the research perspective in the paper, including some current hot research issues and
general methods, which do good to the progress of VANETs. Moreover, we provide a more
comprehensive analysis on VANETs research challenges and future trends, beneficial for further
systematic research on VANETs. In summary, this paper covers basic architecture, some research
issues, general research methods of VANETs, and some key challenges and trends as well as
providing an overall reference on VANETs.
ARCHITECTURE
This part describes the system architecture of vehicular ad hoc networks. We first introduce the
main components of VANETs architecture from a domain view. Then, we explain their
interaction and introduce the communication architecture. Besides, we provide a presentation of
the layered architecture for VANETs.

MAIN COMPONENTS

According to the IEEE 1471-2000 and ISO/IEC 42010 architecture standard guidelines, we are
able to achieve the VANETs system by entities which can be divided into three domains: the
mobile domain, the infrastructure domain, and the generic domain .
As is shown in Figure 1, the mobile domain consists of two parts: the vehicle domain and the
mobile device domain. The vehicle domain comprises all kinds of vehicles such as cars and
buses. The mobile device domain comprises all kinds of portable devices like personal
navigation devices and smartphones.

Figure 1: VANETs system domains.

Within the infrastructure domain, there are two domains: the roadside infrastructure domain and
the central infrastructure domain. The roadside infrastructure domain contains roadside unit
entities like traffic lights. The central infrastructure domain contains infrastructure management
centers such as traffic management centers (TMCs) and vehicle management centers .

However, the development of VANETs architecture varies from region to region. In the CAR-2X communication system which is pursued by the CAR-2-CAR communication consortium, the
reference architecture is a little different. CAR-2-CAR communication consortium (C2C-CC) is
the major driving force for vehicular communication in Europe and published its manifesto in
2007. This system architecture comprises three domains: in-vehicle, ad hoc, and infrastructure
domain.
As shown in Figure 2, the in-vehicle domain is composed of an on-board unit (OBU) and one or
multiple application units (AUs). The connections between them are usually wired and
sometimes wireless. However, the ad hoc domain is composed of vehicles equipped with OBUs
and roadside units (RSUs). An OBU can be seen as a mobile node of an ad hoc network and RSU
is a static node likewise. An RSU can be connected to the Internet via the gateway; RSUs can
communicate with each other directly or via multihop as well. There are two types of
infrastructure domain access, RSUs and hot spots (HSs). OBUs may communicate with Internet
via RSUs or HSs. In the absence of RSUs and HSs, OBUs can also communicate with each other
by using cellular radio networks (GSM, GPRS, UMTS, WiMAX, and 4G) [2].

Figure 2: C2C-CC reference architecture

Communication Architecture
Communication types in VANETs can be categorized into four types. The category is closely
related to VANETs components as described above. Figure 3 describes the key functions of each
communication type .

Figure 3: Key functions of each communication type.

In-vehicle communication, which is more and more necessary and important in VANETs
research, refers to the in-vehicle domain. In-vehicle communication system can detect a vehicles

performance and especially drivers fatigue and drowsiness, which is critical for driver and
public safety.
Vehicle-to-vehicle (V2V) communication can provide a data exchange platform for the drivers to
share information and warning messages, so as to expand driver assistance.

Vehicle-to-road infrastructure (V2I) communication is another useful research field in VANETs.

V2I communication enables real-time traffic/weather updates for drivers and provides
environmental sensing and monitoring.
Vehicle-to-broadband cloud (V2B) communication means that vehicles may communicate via
wireless broadband mechanisms such as 3G/4G. As the broadband cloud may include more
traffic information and monitoring data as well as infotainment, this type of communication will
be useful for active driver assistance and vehicle tracking.
Layered Architecture for VANETs
The open systems interconnection (OSI) model is well known to most readers, which groups
similar communication functions into one of seven logical layers [16]. The session layer and
presentation layer are omitted here, and a given layer can be further partitioned into sublayers in
this architecture, as illustrated in Table 1 [17].

Table 1: OSI reference architecture.

Generally, the architecture of VANETs may differ from region to region, and thus the protocols
and interfaces are also different among them. For instance, Table 2 illustrates the protocol stack
for dedicated short-range communication (DSRC) in the US. DSRC is specifically designed for
automotive use and a corresponding set of protocols and standards . The US FCC has allocated
75MHz of spectrum for DSRC communication, from 5.850GHz to 5.925GHz . Different
protocols are designed to use at the various layers; some of them are still under active
development now. The IEEE 802.11p, an approved amendment to the IEEE 802.11 standard to
add wireless access in vehicular environments (WAVE), is focused primarily on the PHY layer
and MAC sublayer of the stack. IEEE 1609 is a higher layer standard based on the IEEE
802.11p. IEEE 1609 represents a family of standards that function in the middle layers of the
protocol stack to flexibly support safety applications in VANETs, while nonsafety applications
are supported through another set of protocols. In particular, network layer services and transport
layer services for nonsafety applications are provided by three quite stable protocols: IPv6, TCP,
and UDP .

LITERATURE SURVEY
1) Security Framework for Hybrid Wireless Mesh Protocol in Wireless Mesh
Networks

AUTHORS: M. Avula, S.-G. Lee, and S.-M. Yoo

Wireless Mesh Networks (WMNs) are emerging as promising, convenient next

generation wireless network technology. There is a great need for a secure
framework for routing in WMNs and several research studies have proposed secure
versions of the default routing protocol of WMNs. In this paper, we propose a
security framework for Hybrid Wireless Mesh Protocol (HWMP) in WMNs.
Contrary to existing schemes, our proposed framework ensures both endto-end and
point-to-point authentication and integrity to both mutable and non-mutable fields
of routing frames by adding message extension fields to the HWMP path selection
frame elements. Security analysis and simulation results show that the proposed
approach performs significantly well in spite of the cryptographic computations
involved in routing

2) Selfish Attacks and Detection in Cognitive Radio Ad-Hoc Networks

AUTHORS: Minho Jo, Longzhe Han, Dohoon Kim, and Hoh Peter In

Cognitive radio is an opportunistic communication technology designed to help

unlicensed users utilize the maximum available licensed bandwidth. Cognitive
radio has recently attracted a lot of research interest. However, little research has
been done regarding security in cognitive radio, while much more research has
been done on spectrum sensing and allocation problems. A selfish cognitive radio
node can occupy all or part of the resources of multiple channels, prohibiting other
cognitive radio nodes from accessing these resources. Selfish cognitive radio
attacks are a serious security problem because they significantly degrade the
performance of a cognitive radio network. In this article we identify a new selfish
attack type in cognitive radio ad-hoc networks and propose an easy and efficient
selfish cognitive radio attack detection technique, called COOPON, with
multichannel resources by cooperative neighboring cognitive radio nodes.

3)An Anonymous and Self-Verified Mobile Authentication with Authenticated

Key Agreement for Large-Scale Wireless Networks.
AUTHORS: Chin-Chen Chang, Hao-Chuan Tsai.
Increasing numbers of mobile users are being allowed to use wireless networks,
and universal access is being promoted. In the absent of a single, trusted
authentication server, it is a great challenge to ensure the inter-domain security,
which makes it feasible for users to migrate into foreign domains. Thus, an
authentication mechanism is needed between mobile users and foreign servers, and

an authenticated key also is highly desirable to support secure communications in

wireless networks. In addition, maintaining the anonymity of users is an important
security requirement, such as the information about customerss behaviors. Recent
research has focused on these issues and has provided definitions and some
constructions. Importantly, Tang and Wu proposed an efficient mobile
authentication scheme, which they called Efficient Mobilization Authentication
Scheme

(EMAS),

which

enjoys

both

computational

efficiency

and

communication efficiency that exceed the efficiencies of other recent mobile

authentication schemes. Unfortunately, we found out that Tang and Wus scheme
does not meet the basic security requirements. Therefore, to develop a more
acceptable mobile authentication scheme, we propose a self-verified mobile
authentication scheme that has a novel architecture. To provide the better
computation efficiency and storage efficiency, our scheme does not require of
long-term secret keys on the servers.

4) A Lightweight Privacy-Preserving Protocol Using Chameleon Hashing for

Secure Vehicular Communications.
AUTHORS: An-Ni Shen , Song Guo , Deze Zeng and Mohsen Guizani
Many services and applications in vehicular adhoc networks (VANETs) require
preserving and secure data communications. To improve driving safety and
comfort, the traffic-related status information will be broadcasted regularly and
shared among drivers. Without the security and privacy guarantee, attackers could

track their interested vehicles by collecting and analyzing their traffic messages.
Hence, anonymous message authentication is an essential requirement of VANETs.
On the other hand, when a vehicle is involved in a dispute event of warning
message, the certificate authority should be able to recover the real identity of this
vehicle. To deal with this issue, we propose a new privacy-preserving
authentication protocol with authority traceability using elliptic curve based
chameleon hashing. Compared with existing schemes, our approach possesses the
following features: (1) mutual and anonymous authentication, (2) unlinkability, (3)
authority tracking capability and (4) high efficiency. We also demonstrate the
merits of our proposed scheme through extensive security analysis and
performance evaluation.

5) Comments on Analysis and Improvement of a Secure and Efficient

Handover Authentication Based on Bilinear Pairing Functions.
AUTHORS: D. Boneh, B. Lynn, and H. Shacham
Usually the main primitive in building a secure wireless authentication is a
cryptographic algorithm, such as digital signature scheme. He et al. proposed a
handover authentication protocol in [1] (IEEE Trans. Wireless Commun., vol. 11,

no. 1, 2011) and a distributed reprogramming protocol in [3] (IEEE Trans. Ind.
Electron., vol. 59, no. 11, 2012) for wireless networks. Both protocols are based on
an identity-based signature scheme which is claimed to be secure yet efficient.
Very recently, He et al. pointed out that such a signature scheme is vulnerable to
the key compromised problem. They proposed a simple modification to fix this
problem without losing the efficiency and security of the scheme in both [2] (IEEE
Commun. Lett., vol. 16, no. 8, 2012) and [4] (IEEE Trans. Ind. Electron., to
appear). In this letter, we show that the proposed modification remains vulnerable
to the key compromised problem

PROBLEM OVERVIEW
Daojing

He,

Sammy

Chan,

and

Mohsen

Guizani proposed a

unique relinquishing authentication protocol named HashHand and showed that it

outperforms the above-named protocols on security and potency. HashHand is
incredibly computation and communication-efficient attributable to 2 factors. First,
it needs solely 2 rounds of communication between associate degree MN associate
degreed an AP for mutual authentication (i.e., subscription validation and server
authentication)

and

key institution, whereas the

others need a

minimum

of 3handshakes. Second, it doesn't need transmission or verification of any

certificate

as within

the ancient public

key

cryptosystem.

Additionally,

with relevance security functions, compared to the schemes of HashHand relax the
idea that the APs square measure trustworthy and wouldn't disclose users privacyrelated data. Moreover, HashHand will resist the DoS attacks against the two-party
approach that severely have an effect on the provision of APs.
DISADVANTAGES
It occupy high memory
It has session key process, one time session key will be changed pervious
data should be loss

GENERAL REQUIREMENTS
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:-

Processor

-Pentium III

Speed

1.1 Ghz

RAM

256 MB(min)

Hard Disk

- 20 GB

 Floppy Drive

1.44 MB

Key Board

Standard Windows Keyboard

Mouse

- Two or Three Button Mouse

Monitor

SVGA

SOFTWARE REQUIREMENTS:

Operating System

: LINUX

Tool

: Network Simulator-2

Front End

:O TCL (Object Oriented Tool Command

Language)

SOFTWARE DESCRIPTION

THE NETWORK SIMULATOR 2.33 (NS2)

Network Simulator (NS2) is a discrete event driven simulator developed at
UC Berkeley. It is part of the VINT project. The goal of NS2 is to support
networking research and education. It is suitable for designing new protocols,
comparing different protocols and traffic evaluations. NS2 is developed as a
collaborative environment. It is distributed freely and open source. A large amount
of institutes and people in development and research use, maintain and develop

NS2. This increases the confidence in it. Versions are available for FreeBSD,
Linux, Solaris, Windows and Mac OS X.
STRUCTURE OF NS2
NS2 is built using object oriented methods in C++ and OTcl (object oriented
variant of Tcl.

Fig 5.1 Simplified Users View of Ns

can see in Fig 5.1, NS2 interprets the simulation scripts written in OTcl. A user has
to set the different components (e.g. event scheduler objects, network components
libraries and setup module libraries) up in the simulation environment. The user
writes his simulation as a OTcl script, plumbs the network components together to
the complete simulation. If he needs new network components, he is free to
implement them and to set them up in his simulation as well. The event scheduler
as the other major component besides network components triggers the events of
the simulation (e.g. sends packets, starts and stops tracing). Some parts of NS2 are
written in C++ for efficiency reasons. The data path (written in C++) is separated
from the control path (written in OTcl). Data path object are compiled and then

made available to the OTcl interpreter through an OTcl linkage (tclcl) which maps
methods and member variables of the C++ object to methods and variables of the
linked OTcl object. The C++ objects are controlled by OTcl objects. It is possible
to add methods and member variables to a C++ linked OTcl object.

FUNCTIONALITIES OF NS2.33
Functionalities for wired, wireless networks, tracing, and visualization are
available in NS2.
Support for the wired world include
Routing DV, LS, and PIM-SM.
Transport protocols: TCP and UDP for unicast and SRM for multicast.
Traffic sources: web, ftp, telnet, cbr (constant bit rate), stochastic, real audio.
Different types of Queues: drop-tail, RED, FQ, SFQ, DRR.
Quality of Service: Integrated Services and Differentiated Services.
Emulation.
Support for the wireless world include
Ad hoc routing with different protocols, e.g. AODV, DSR, DSDV, TORA
Wired-cum-wireless networks
Mobile IP
Directed diffusion

 Satellite
Senso-MAC
Multiple propagation models (Free space, two-ray ground, shadowing)
Energy models
Tracing
Visualization
Network Animator (NAM)
Trace Graph
Utilities
Mobile Movement Generator

Fig 5.2 OTcl and C++: the duality

MOBILE NETWORKING IN NS2.33

This section describes the wireless model that was originally ported as
CMUs Monarch groups mobility extension to NS2. The first section covers the
original mobility model ported from CMU/Monarch group. In this section, we
cover the internals of a mobile node, routing mechanisms and network components
that are used to construct the network stack for a mobile node. The components
that are covered briefly are Channel, Network interface, Radio propagation model,
MAC protocols, Interface Queue, Link layer and Address resolution protocol
model (ARP). CMU trace support and Generation of node movement and traffic
scenario files are also covered in this section. The original CMU model allows
simulation of pure wireless LANs or multihop ad-hoc networks. Further extensions
were made to this model to allow combined simulation of wired and wireless
networks. MobileIP was also extended to the wireless model.
THE BASIC WIRELESS MODEL IN NS
The wireless model essentially consists of the MobileNode at the core, with
additional supporting features that allows simulations of multi-hop ad-hoc
networks, wireless LANs etc. The MobileNode object is a split object. The C++
class MobileNode is derived from parent class Node. A MobileNode thus is the
basic Node object with added functionalities of a wireless and mobile node like
ability to move within a given topology, ability to receive and transmit signals to

and from a wireless channel etc. A major difference between them, though, is that a
MobileNode is not connected by means of Links to other nodes or mobilenodes. In
this section we shall describe the internals of MobileNode, its routing mechanisms,
the routing protocols dsdv, aodv, tora and dsr, creation of network stack allowing
channel access in MobileNode, brief description of each stack component, trace
support and movement/traffic scenario generation for wireless simulations.
MOBILE NODE: CREATING WIRELESS TOPOLOGY
MobileNode is the basic nsNode object with added functionalities like movement,
ability to transmit and receive on a channel that allows it to be used to create
mobile, wireless simulation environments. The class MobileNode is derived from
the base class Node. MobileNode is a split object. The mobility features including
node movement, periodic position updates, maintaining topology boundary etc are
implemented in C++ while plumbing of network components within MobileNode
itself (like classifiers, dmux , LL, Mac, Channel etc) have been implemented in
Otcl.
Table 5.1: Available Options For Node Configuration

Option

Available Values

Default

General
Address type

Flat, Hierarchical

Flat

MPLS

ON,OFF

OFF

Both Satellite and Wireless Oriented

Wired Routing

ON,OFF

OFF

II Type

LL,LL/sat

OFF

Mac Type

Mac/802_11,Mac/Csma/Ca,

OFF

Mac/Sat/Unslotted/Aloha,Mac/Tdma
ifq Type

Queue/DropTail,

OFF

Queue/Droptail/PriQueue
Phy Type

Phy/wirelessPhy,Physat

Option

Available Values

OFF

Default

Satellite Oriented
satNodeType

Polar,Geo,Terminal,Geo-repeater

OFF

downlinkBW

<bandwidth value, e.g 2MB>

OFF

Wireless Oriented
Adhoc Routing

DIFFUSION/RATE,DIFFUSION/PROB,

OFF

DSDV,FLOODING,OMNICAST,AODV,TORA
propType

Propagation/2RayGround,Propagation Shadowing

OFF

propInstance

Propagation/2RayGround,Propagation Shadowing

OFF

antType

Antenna/Omni Antenna

OFF

Channel

Channel/Wireless Channel,Channel/sat

OFF

topoInstance

<toplogy file>

OFF

MobileIP

ON,OFF

OFF

Energy model

Energy model

OFF

Initial Energy

<value in joules>

OFF

rxPower

<value in W>

OFF

txPower

<value in W>

OFF

Idle Power

<value in W>

OFF

AgentTrace

ON,OFF

OFF

routerTrace

ON,OFF

OFF

macTrace

ON,OFF

OFF

movementTrace

ON,OFF

OFF

Errproc

UniformErrorProc

OFF

FECProc

toraDebug

ON,OFF

?
OFF

PROPOSED SYSTEM:
We identify the security and efficiency requirements of a good handover
authentication protocol and analyze the existing related protocols, and show
that many such protocols are either insecure or inefficient. Then we review
a recently proposed protocol named ECC, which has been shown to
outperform all other protocols on security and efficiency.
Furthermore, we propose a ECC Based secure handover in cellular
network ,which

Elliptic curve cryptography (ECC) is an approach to

public-key cryptography based on the algebraic structure of elliptic curves

over finite fields. ECC requires smaller keys compared to non-ECC
cryptography (based on plain Galois fields) to provide equivalent security.
ADVANTAGES:
Perfect secrecy ensured
Increase privacy.
Consume the constant energy
Use the ECC to generate the asymmetric encryption key
Increase Data Confidentiality

FLOW DIAGRAM

MODULES:
Network Formation
Key Generation
Key Sharing
Authentication verification
Performance Evaluation

MODULES DESCRIPTION:
Network Formation
We were able to secure a relatively strong signal strength in line of sight.
We were careful to ensure that devices were connected to the particular
target sector for the test scenario. We ensured that all the BSs were locked to
a particular carrier frequency throughout the experiments.

We ensured that the BSs were in the middle of each of the sectors we
measured, and that the radio environments for each of the BSs was as similar
as possible, while maintaining a half-wavelength separation between BSs.

Key Generation
A public key Q = (xQ,yQ) associated with a domain parameter

 (q, a, b, G, n, h) is generated for an entitiy A using the following

procedure :

Select a random or pseudo-random integer d in the interval [1,n-1].

Compute Q = dG.
A's public key is Q; A's private key is d.

Key Sharing
Entity A has domain parameters D = (q, a, b, G, n, h) and

public key QA and private key dA. And entity B has authentic

copies of D and QA.

To sign a message m, A does the following:

Select a random integer k from [1,n-1].
Compute kG = (x1,y1) and r = x1 mod n. If r = 0 then go to step 1.
Compute k-1 mod n. Compute e = SHA-1(m).
Compute s = k-1{e + dA . r} mod n.

If s = 0 then go to step 1.

A's signature for the message m is (r, s).

Authentication Verification

 A public key Q = (xQ,yQ) associated with a domain parameter

(q, a, b, G, n, h) is validated for an entitiy A using the following
procedure :
Check that Q O
Check that xQ and yQ are properly represented elements of GF(q).
Check that Q lies on the elliptic curve defned by a and b.
Check that nQ = O.

IMPLEMENTATION ENVIRONMENT

Network simulator 2 is used as the simulation tool in this project. NS was chosen
as the simulator partly because of the range of features it provides and partly
because it has an open source code that can be modified and extended. There are
different versions of NS and the latest version is ns-2.1b9a while ns-2.1b10 is
under development

NETWORK SIMULATOR (NS)

Network simulator (NS) is an objectoriented, discrete event simulator for

networking research. NS provides substantial support for simulation of TCP,
routing and multicast protocols over wired and wireless networks. The simulator is
a result of an ongoing effort of research and developed. Even though there is a
considerable confidence in NS, it is not a polished product yet and bugs are being
discovered and corrected continuously.

NS is written in C++, with an OTcl1 interpreter as a command and

configuration interface. The C++ part, which is fast to run but slower to change, is
used for detailed protocol implementation. The OTcl part, on the other hand, which
runs much slower but can be changed very fast
quickly, is used for simulation configuration. One of the advantages of this split-

language program approach is that it allows for fast generation of large scenarios.
To simply use the simulator, it is sufficient to know

OTcl. On the other hand, one disadvantage is that modifying and extending the
simulator requires programming and debugging in both languages.
NS can simulate the following:
1. Topology: Wired, wireless
2. Sheduling Algorithms: RED, Drop Tail,
3. Transport Protocols: TCP, UDP
4. Routing: Static and dynamic routing
5. Application: FTP, HTTP, Telnet, Traffic generators

USERS VIEW OF NS-2

Simulation OTcl Script

OTcl
Interpreter

Simulation

Results

C++
Libraries
Figure 5.1 Block diagram of Architecture of NS-2

NETWORK COMPONENTS

This section talks about the NS components, mostly compound network

components. Figure 1.1 shows a partial OTcl class hierarchy of NS, which will
help understanding the basic network components.

Figure 5.2 OTcl Class Hierarchy

The root of the hierarchy is the TclObject class that is the super class of
all OTcl library objects (scheduler, network components, timers and the other
objects including NAM related ones). As an ancestor class of TclObject, NsObject

class is the super class of all basic network component objects that handle packets,
which may compose compound network objects such as nodes and links. The basic
network components are further divided into two subclasses, Connector and
Classifier, based on the number of the possible output DATA paths. The basic
network and
objects that have only one output DATA path are under the Connector class, and
switching objects that have possible multiple output DATA paths are under the
Classifier class.

CLASS TCL
The class Tcl encapsulates the actual instance of the OTcl interpreter and
provides the methods to access and communicate with that interpreter, code. The
class provides methods for the following operations:
1.obtain a reference to the Tel instance
2.invoke OTcl procedures through the interpreter
3.retrieve, or pass back results to the interpreter
4.report error situations and exit in an uniform manner
5.store and lookup "TclObjects"
6.acquire direct access to the interpreter.

Obtain a Reference to the class Tcl instance

A single instance of the class is declared in -tclcl/Tcl.cc as a static
member variable. The statement required to access this instance is Tel& tel =
Tcl::instance();

Invoking OTcl Procedures

There are four different methods to invoke an OTcl command through
the instance, tcl. They differ essentially in their calling arguments. Each function
passes a string to the interpreter that then evaluates the string in a global context.
These methods will return to the caller if the interpreter returns TCL_OK. On the
other hand, if the interpreter returns TCL_ERROR, the methods will call tkerror{}.
The user can overload this procedure to selectively disregard certain types of
errors.

1.Passing

Results to/from the Interpreter: When the interpreter invokes a C+

+ method, it expects the result back in the private member variable, tcl-> result.
2.Error

Reporting and Exit: This method provides a uniform way to report

errors in the compiled code.

COMMAND METHODS: DEFINITION AND INVOCATION

For every TclObject that is created, ns establishes the instance
procedure,cmd{}, as a hook to executing methods through the compiled shadow
object. The procedure cmd{} invokes the method command() of the shadow object
automatically, passing the arguments to cmd{} as an argument vector to the
command() method. The user can invoke the cmd {} method in one of two ways,

by explicitly invoking the procedure, specifying the desired operation as the first
argument, or implicitly, as if
there were an instance procedure of the same name as the desired operation. Most
simulation scripts will use the latter form.
Consider the distance computation in SRM is done by the compiled
object. It is often used by the interpreted object. It is usually invoked as
$srmObject distance? (Agent Address)If there is no instance procedure called
distance? the interpreter will invoke the instance procedure unknown{}, defined in
the base class TclObject. The unknown procedure then invokes
$srmObject cmd distance? (agentAddress)
to execute the operation through the compiled object's command()
procedure. The user could explicitly invoke the operation directly. One reason for
this might be to overload the operation by using an instance procedure of the same
name.
For example,
Agent/SRM/Adaptive instproc distance? addr {
$self instvar distanceCache_($addr)
if![info exists distanceCache_($addr)] {
set distanceCache_($addr) [$self cmd distance? $addr]
}
set distanceCache_($addr)
}

The

following

shows

how

the

command()

method

using

SRMAgent::command()

int ASRMAgent::command(int argc, const char*const*argv) {

Tcl& tcl = Tcl::instance ();
if (argc == 3) {
if (strcmp(argv[1], "distance?") == 0) {
int sender = atoi(argv[2]);
SRMinfo* sp = get_state(sender);
tcl.tesultf("%f", sp->distance_);
return TCL_OK;

'

}
}
return (SRMAgent::command(argc, argv));

The following observations are made from this piece of code:

The function is called with two arguments. The first argument (argc)
indicates the number of arguments specified in the command line to the interpreter.
The command line arguments vector (argv) consists of argv[0] contains the name
of the method, "cmd" and argv[1] specifies the desired operation. If the user
specified any arguments, then they are placed in argv[2...(argc - 1)]. The arguments

are passed as strings. They must be converted to the appropriate data type. If the
operation is successfully matched, the match should return the result of the
operation, command () it must return either TCL_OK or TCL_ERROR to indicate
success or failure as its return code. If matched in this method, it must invoke its
parent's command method, and return the corresponding result. This permits the
user to conceive of operations as having the same inheritance properties as instance
procedures or compiled methods. In the event that this command method is defined
for a class with multiple inheritances, one of two implementations can be chosen

1.Either they can invoke one of the parent's command methods, and return the
result of that invocation.

2.They can each of the parent's command methods in some sequence, and return
the result of the first invocation that is successful. If none of them are successful,
then they should return an error.

MOBILE NETWORKING IN NS

The wireless model essentially consists of the Mobile Node at the core with
additional supporting features that allows simulations of multi-hop ad-hoc
networks, wireless LANs etc. The Mobile Node object is a split object. The C++
class Mobile Node is derived from parent class Node. A Mobile Node thus is the
basic Node object with added functionalities of a wireless and mobile node like
ability to move within a given topology, ability to receive and transmit signals to

and from a wireless channel etc. A major difference between them is that a mobile
Node is not connected by means of Links to other nodes or mobile nodes.

Mobile Node is the basic nsNode object with added functionalities like
movement, ability to transmit and receive on a channel that allows it to be used to
create mobile, wireless simulation environments. The class Mobile Node is derived
from the base class Node. The four ad-hoc routing protocols that are currently
supported are, Dynamic Source Routing (DSR), Temporally ordered Routing
Algorithm (TORA) and Adhoc On-demand Distance Vector (AODV).

The general structure for defining a mobile node in ns2 is described as

follows:

$ns node-config -adhocRouting $opt (adhocRouting)

-IIType $opt (II)

-macType $opt (mac)

-ifqType $opt (ifq) -ifqLen $opt (ifqlen)

-antType $opt (ant)

-proplnstance [new $opt (prop) -phyType $opt (netif)

-channel [new $opt (chan)]

-topolnstance $topo

-wiredRouting OFF

-agentTrace ON

-routerTrace OFF

-macTrace OFF

The above API configures for a mobile node with all the given values of
ad hoc-routing protocol, network stack, channel, topography, propagation model,
with wired routing turned on or off (required for wired-cum-wireless scenarios)
and tracing turned on or off at different levels (router, mac, agent).

EXPERIMENTS AND RESULTS

S
IMULATION ENVIRONMENT
Simulations are configured for the performance evaluation of AODV, DSR
with the metrics like throughput, end to end delay and packet delivery ratio
with the following parameters given in the table.
PARAMETER

VALUE

Protocols

ECC

Simulation Time

200 S

Number of nodes

50,48

Simulation Area

1000 m x 1000 m

Pause Time

0s

Network Simulator

NS 2.34

PERFORMANCE EVALUATION
In this section, evaluate the performance of simulation. We are using the
xgraph for evaluate the performance. We choose the some evaluation metrics:
Packet delivery ratio the ratio of the total number of packets received by the
destination node to the number of packet sent by the source, Packet loss the total
number of packet losses, during the data transmission, End-to-End delay the time
taken to be data transmitted from source node to destination node.

CONCLUSION
In this article, we have discussed the security and efficiency requirements of
handover authentication protocols. We have reviewed the recent developments of
such protocols. Although ECC outperforms all other proposed protocols, it Elliptic
curve cryptography can be a substitute for HashHand in efficacious applications
because of its efficiency in software as well as in hardware realizations. ECC offers
an enhanced security with shorter bit sizes than other cryptography functions.
Shorter key length is useful to save bandwidth, power, and it improves the
performance. The recent sensor devices have restricted computational power. In
order to realize 80 bit of security in ECC, it requirements 160bit parameters size,
and offers the same security level presented by 1024 bit RSA. Unlike the past,
combination in ECC catches the attention of experts because it can be used to build
cryptographic schemes that cannot be built in any other way.

CHAPTER 13- REFERENCES

[1] M. Avula, S.-G. Lee, and S.-M. Yoo, Security Framework for Hybrid
Wireless Mesh Protocol in Wireless Mesh Networks, KSII Trans. Internet
and Info. Sys., vol. 8, no. 1, Jan. 2014, pp. 19822004.
[2] M. Jo et al., Selfish Attacks and Detection in Cognitive Radio Ad Hoc
Networks, IEEE Network, vol. 27, no. 3, May/June, 2013, pp. 4650.
[3] ETSI, GSM 02.09: Security Aspects, 1993.
[4] 3GPP Specification TS 33.102, 3G Security, Security Architecture, Dec.
2002.
[5] C.-C. Chang and H.-C. Tsai, An Anonymous and Self-Verified Mobile
Authenti-cation with Authenticated Key Agreement for Large-Scale Wireless
Networks,IEEE Trans. Wireless Comm., vol. 9, no. 11, Nov. 2010., pp. 334653
[6] G. Yang et al., Universal Authentication Protocols for Anonymous Wire-less
Communications, IEEE Trans. Wireless Commun., vol. 9, no. 1, Jan.
2010, pp. 16874.
[7] D. He et al., Privacy-Preserving Universal Authentication Protocol for
Wireless Communications, IEEE Trans. Wireless Commun., vol. 10, no.
2, Feb. 2011, pp. 43136.

[8] Q. Han et al., Efficient and Robust Identity-Based Handoff Authentication

in Wireless Networks, Proc. INCoS 12, pp. 22228.
[9] A. Shen et al., A lIghtweight Privacy-Preserving Protocol Using
Chameleon Hashing for Secure Vehicular Communications, Proc. IEEE
WCNC, 2012, pp. 254348.
[10] J. Choi and S. Jung, A Handover Authentication Using Credentials
Based on Chameleon Hashing, IEEE Commun. Lett., vol. 14, no. 1, Jan.
2010, pp. 5456.
[11] C. Lai et al., CPAL: A Conditional Privacy-Preserving Authentication with
Access Linkability for Roaming Service, IEEE Internet of Things J., vol. 1,
no. 1, Feb. 2014, pp. 4657.
[12] D. He et al., Secure and Efficient Handover Authentication Based on
Bilinear Pairing Functions, IEEE Trans. Wireless Commun., vol. 11, no. 1,
Jan. 2012, pp. 4853.
[13] D. He et al., Analysis and Improvement of a Secure and Efficient Hand -over
Authentication for Wireless Networks, IEEE Commun. Lett., vol. 16,
no. 8, Aug. 2012, pp. 127073.
[14] S. Yeo et al., Comments on Analysis and Improvement of a Secure and
Efficient Handover Authentication Based on Bilinear Pairing Functions,
IEEE Commun. Lett., vol. 17, no. 8, Aug. 2013, pp. 152123.

[15] D. Freeman, Converting Pairing-Based Cryptosystems from CompositeOrder Groups to Prime-Order Groups, Proc. EUROCRYPT, vol. 6110 of
LNCS, 2010, pp. 44-61.