Whole

Privacy-Preserving and Truthful Detection Of
Packet Dropping Attacks in Wireless

Ad Hoc Networks
A MINI PROJECT REPORT
Submitted in partial fulfillment of the requirements
For the award of
BACHELOR OF TECHNOLOGY
In
COMPUTER SCIENCE AND ENGINEERING
Submitted By
A.L.NAVYA SREE N.K.SWETHA

(14A21A0554) (14A21A0589)
P.LAKSHMI SURYA P.V.V.PHANINDRA
(14A21A0592) (14A21A0591)
Under the Esteemed Guidance of
Mr. M. Satyanarayana Asst. Professor
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY
(Approved by AICTE, Affiliated to JNTU-Kakinada, Accredited by NBA and NAAC)
(AUTONOMOUS)
Seetharampuram, Narsapur – 534 280,W.G.Dt. (A.P)
2014-2018
SWARNANDHRA COLLEGE OF ENGINEERING &TECHNOLOGY
(Approved By AICTE &Affliated To JNTU-Kakinada,Accredited by NAAC&NBA)
(AUTONOMOUS)
SEETHARAMAPURAM, NARSAPUR-534 280, W.G.Dt. (A.P)
DEPARTMENT OF COMPUTER SCIENCE &ENGINEERING
Certificate
Certified that this project work titled “CRAFTSY WEBSITE” is a bonafide
work of M.YASHWANTHI (14A21A0584),V.JAITRI NAGA SAI
(14A21A05A2), M.BINDU SAI (14A21A0585), N.PRAGNATHY
(14A21A0536) of IV B.Tech who carried out the work under my
supervision,and submitted in partial fulfillment of the requirement for the award
of degree, BACHELOR OF TECHNOLOGY in COMPUTER SCIENCE &
ENGINEERING, during the academic year 2017-2018.
Thesis Advisor Head of the Department

Mr. N.Tulasi Raju Dr.Y.Vamsidhar
Asst Professor. Professor.
ACKNOWLEDGEMENT
We extend our heartfelt gratitude to the almighty for giving me strength
in proceeding with this project. With profound gratitude, respect and pride, we
express our sincere thanks to Dr. S.Ramesh Babu, secretary and correspondent
of our college for making necessary arrangement for doing the project.
We would like to thank Dr.M.Srinivasa Kumar, principal for his

timely suggestions and for giving us permission to carry out the project. We
would like to express our grateful thanks to Dr. Y.Vamsidhar, HOD. C.S.E
DEPT, for his valuable suggestions and guidance in regarding the software
analysis, Design and also for his continuous effort in successful completion of
the Project.
Our deep gratitude to internal guide Mr.M. Satyanarayana.We thank

him for his dedication, guidance, council and keen interest at every stage of the
project.
Finally we thank one and all that have contributed directly or indirectly to
this thesis.
1 A.LAKSHMI NAVYA SREE (14A21A0584)
2 N.KHAMBU SWETHA (14A21A05A2)
3 P.LAKSHMI SURYA (14A21A0585)
4 P.V.V.PHANINDRA (14A21A0536)
DECLARATION
We certify that
a . The project work contained in the thesis is original and has been done
by under the guidance of my supervisor.
b. The work has not been submitted to any other university for the award
of any degree or diploma.
c. The guidelines of the university are followed in writing the thesis.
Date:
Place:
Reg No Name Of The Student Signature
14A21A0554 A.LAKSHMI NAVYA SREE
14A21A0589 N.KHAMBU SWETHA
14A21A0592 P.LAKSHMI SURYA
14A21A0591 P.V.V.PHANINDRA
ABSTRACT
i
ABSTRACT
Link error and malicious packet dropping are two sources for packet losses in multi-hop
wireless ad hoc network. In this paper, while observing a sequence of packet losses in the
network, we are interested in determining whether the losses are caused by link errors only,
or by the combined effect of link errors and malicious drop. We are especially interested in
the insider-attack case, whereby malicious nodes that are part of the route exploit their
knowledge of the communication context to selectively drop a small amount of packets
critical to the network performance. Because the packet dropping rate in this case is
comparable to the channel error rate, conventional algorithms that are based on detecting the
packet loss rate cannot achieve satisfactory detection accuracy. To improve the detection
accuracy, we propose to exploit the correlations between lost packets. Furthermore, to ensure
truthful calculation of these correlations, we develop a homomorphic linear authenticator
(HLA) based public auditing architecture that allows the detector to verify the truthfulness of
the packet loss information reported by nodes. This construction is privacy preserving,
collusion proof, and incurs low communication and storage overheads. To reduce the
computation overhead of the baseline scheme, a packet-block-based mechanism is also
proposed, which allows one to trade detection accuracy for lower computation complexity.
Through extensive simulations, we verify that the proposed mechanisms achieve significantly
better detection accuracy than conventional methods such as a maximum-likelihood based
detection.
ii
CONTENTS
CHAPTER NO TITLE PAGENO
ABSTRACT i
CONTENTS iii
LIST OF FIGURES iv
1. INTRODUCTION 1
1.1 Introduction to Mobile Computing 2
1.2 Application Area 3
2. LITERATURE SURVEY 6
3. SYSTEM ANALYSIS 10
3.1 Exisiting System 11
3.2 Proposed System 12
3.3 System Study 13
3.4 Input and Ouptut Design 15
3.4 System Architecture 17
4. SYSTEM REQUIREMENTS 20
4.1 Hardware Requirements 21
4.2 Software Requirements 22
5. SYSTEM DESIGN 22
5.1 Data Flow Diagram 23
5.2 UML Diagram 25
5.2.1 Use Case Diagram 26
5.2.2 Class Diagram 28
5.2.3 Sequence Diagram 29
iii
5.2.4 Activity Diagram 30
6. IMPLEMENTATION 32
6.1 Modules 33
6.2 Source Code 34
6.3 Screen Shots . 41
7. SYSTEM TESTING 45
7.1 Types of Tests 46
7.2 Integration Testing 49
7.3 Acceptance Testing 49
8. CONCLUSION 50
9. FUTURE SCOPE 52
10. BIBLOGRAPHY 54
iv
LIST OF FIGURES
CHAPTER NO CONTENTS PAGENO
1 Structure of mobile computing 2

2 SYSTEM ARCHITECTURE 17
3.5.1 Block Diagram of Network 17
3.5.2 Block Diagram during Attacker Case 18
3.5.3 Block Diagram during Normal Case 19
5 5.1 Data Flow Diagram 24
5.2 UML Diagrams
5.2.1 UseCase Diagram 27
5.2.2 Class Diagram 28
5.2.3 Sequence Diagram 29
5.2.4 Activity Diagram 31
v
Privacy-Preserving & Truthful Detection Of Packet Dropping Attacks in Wireless Ad Hoc Networks
Chapter-1
INTRODUCTION
SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 1

1. INTRODUCTION
1.1 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.
Fig : 1 Structure of mobile computing
Different types of devices used for the mobile computing:
1. Personal digital assistant/enterprise digital assistant

2. Smartphones
3. Tablet computers
4. Netbooks
5. Ultra-mobile PCs
6. Wearable computers

7. Palmtops/pocket computers
1.2 Applications of Mobile Computing:
1. Vehicles:
Tomorrow’s 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:
Today’s typical traveling salesman needs instant access to the company’s
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
1.3 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.

Chapter-2
LITERATURE SURVEY

2.LITERATURE SURVEY
1.Provable data possession at untrusted stores
AUTHORS: C. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D.

Song
We introduce a model for provable data possession (PDP) that allows a client that has stored
data at an untrusted server to verify that the server possesses the original data without
retrieving it. The model generates probabilistic proofs of possession by sampling random sets
of blocks from the server, which drastically reduces I/O costs. The client maintains a constant
amount of metadata to verify the proof. The challenge/response protocol transmits a small,
constant amount of data, which minimizes network communication. Thus, the PDP model for
remote data checking supports large data sets in widely-distributed storage system.
We present two provably-secure PDP schemes that are more efficient than previous solutions,
even when compared with schemes that achieve weaker guarantees. In particular, the
overhead at the server is low (or even constant), as opposed to linear in the size of the data.
Experiments using our implementation verify the practicality of PDP and reveal that the
performance of PDP is bounded by disk I/O and not by cryptographic computation.
2. Proofs of storage from homomorphic identification protocols
AUTHORS: G. Ateniese, S. Kamara, and J. Katz

Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server
faithfully stores a file. Previous work has shown that proofs of storage can be constructed
from any homomorphic linear authenticator (HLA). The latter, roughly speaking, are
signature/message authentication schemes where `tags' on multiple messages can be
homomorphically combined to yield a `tag' on any linear combination of these messages.
We provide a framework for building public-key HLAs from any identification protocol
satisfying certain homomorphic properties. We then show how to turn any public-key HLA
into a publicly-verifiable PoS with communication complexity independent of the file length
and supporting an unbounded number of verifications. We illustrate the use of our
transformations by applying them to a variant of an identification protocol by Shoup, thus
obtaining the first unbounded-use PoS based on factoring (in the random oracle model).

3. ODSBR: An on-demand secure byzantine resilient routing protocol for

wireless ad hoc networks
AUTHORS: B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H.
Rubens
Ah hoc networks offer increased coverage by using multihop communication. This
architecture makes services more vulnerable to internal attacks coming from compromised
nodes that behave arbitrarily to disrupt the network, also referred to as Byzantine attacks. In
this work, we examine the impact of several Byzantine attacks performed by individual or
colluding attackers. We propose ODSBR, the first on-demand routing protocol for ad hoc
wireless networks that provides resilience to Byzantine attacks caused by individual or
colluding nodes. The protocol uses an adaptive probing technique that detects a malicious
link after log n faults have occurred, where n is the length of the path. Problematic links are
avoided by using a route discovery mechanism that relies on a new metric that captures
adversarial behavior. Our protocol never partitions the network and bounds the amount of
damage caused by attackers. We demonstrate through simulations ODSBR's effectiveness in
mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the
adversary's effort gives insights into their relative strengths, their interaction, and their
importance when designing multihop wireless routing protocols.
4. TWOACK: Preventing selfishness in mobile ad hoc networks

AUTHORS: K. Balakrishnan, J. Deng, and P. K. Varshney
Mobile ad hoc networks (MANETs) operate on the basic underlying assumption that all
participating nodes fully collaborate in self-organizing functions. However, performing
network functions consumes energy and other resources. Therefore, some network nodes may
decide against cooperating with others. Providing these selfish nodes, also termed
misbehaving nodes, with an incentive to cooperate has been an active research area recently.
In this paper, we propose two network-layer acknowledgment-based schemes, termed the
TWOACK and the S-TWOACK schemes, which can be simply added-on to any source
routing protocol. The TWOACK scheme detects such misbehaving nodes, and then seeks to
alleviate the problem by notifying the routing protocol to avoid them in future routes. Details
of the two schemes and our evaluation results based on simulations are presented in this
paper. We have found that, in a network where up to 40% of the nodes may be misbehaving,

the TWOACK scheme results in 20% improvement in packet delivery ratio, with a
reasonable additional routing overhead.
5.Short signatures from the weil pairing
AUTHORS: D. Boneh, B. Lynn, and H. Shacham
We introduce a short signature scheme based on the Computational Diffie–Hellman
assumption on certain elliptic and hyperelliptic curves. For standard security parameters, the
signature length is about half that of a DSA signature with a similar level of security. Our
short signature scheme is designed for systems where signatures are typed in by a human or
are sent over a low-bandwidth channel. We survey a number of properties of our signature
scheme such as signature aggregation and batch verification.

Chapter-3
SYSTEM ANALYSIS

3.1EXISTING SYSTEM:
 The most of the related works preclude the ambiguity of the environment by assuming
that malicious dropping is the only source of packet loss, so that there is no need to
account for the impact of link errors. On the other hand, for the small number of
works that differentiate between link errors and malicious packet drops, their
detection algorithms usually require the number of maliciously-dropped packets to be
significantly higher than link errors, in order to achieve an acceptable detection
accuracy.
 Depending on how much weight a detection algorithm gives to link errors relative to
malicious packet drops, the related work can be classified into the following two
categories.
 The first category aims at high malicious dropping rates, where most (or all) lost
packets are caused by malicious dropping.
 The second category targets the scenario where the number of maliciously dropped
packets is significantly higher than that caused by link errors, but the impact of link
errors is non-negligible.
DISADVANTAGES OF EXISTING SYSTEM:
 In an open wireless environment, link errors are quite significant, and may not be
significantly smaller than the packet dropping rate of the insider attacker. So, the
insider attacker can camouflage under the background of harsh channel conditions. In
this case, just by observing the packet loss rate is not enough to accurately identify the
exact cause of a packet loss. This problem has not been well addressed in the existing
system.
 In the existing system first category case, the impact of link errors is ignored.
 In the second Category, Certain knowledge of the wireless channel is necessary in this
case.

3.2PROPOSED SYSTEM:
 In this paper, we develop an accurate algorithm for detecting selective packet drops
made by insider attackers.
 Our algorithm also provides a truthful and publicly verifiable decision statistics as a
proof to support the detection decision. The high detection accuracy is achieved by
exploiting the correlations between the positions of lost packets, as calculated from
the auto-correlation function (ACF) of the packet-loss bitmap—a bitmap describing
the lost/received status of each packet in a sequence of consecutive packet
transmissions.
 The basic idea behind this method is that even though malicious dropping may result
in a packet loss rate that is comparable to normal channel losses, the stochastic
processes that characterize the two phenomena exhibit different correlation structures
(equivalently, different patterns of packet losses). Therefore, by detecting the
correlations between lost packets, one can decide whether the packet loss is purely
due to regular link errors, or is a combined effect of link error and malicious drop.
 Our algorithm takes into account the cross-statistics between lost packets to make a
more informative decision, and thus is in sharp contrast to the conventional methods
that rely only on the distribution of the number of lost packets.
ADVANTAGES OF PROPOSED SYSTEM:
 The proposed system with new HLA construction is collusion-proof.

 The proposed system gives the advantage of privacy-preserving.
 Our construction incurs low communication and storage overheads at intermediate
nodes. This makes our mechanism applicable to a wide range of wireless devices,
including low-cost wireless sensors that have very limited bandwidth and memory
capacities. This is also in sharp contrast to the typical storage-server scenario, where
bandwidth/storage is not considered an issue.
 Last, to significantly reduce the computation overhead of the baseline constructions so
that they can be used in computation-constrained mobile devices, a packet-block-
based algorithm is proposed to achieves scalable signature generation and detection.

3.3 SYSTEM STUDY
FEASIBILITY STUDY
The feasibility of the project is analyzed in this phase and business proposal is
put forth with a very general plan for the project and some cost estimates. During system
analysis the feasibility study of the proposed system is to be carried out. This is to ensure that
the proposed system is not a burden to the company. For feasibility analysis, some
understanding of the major requirements for the system is essential.
Three key considerations involved in the feasibility analysis are
 ECONOMICAL FEASIBILITY
 TECHNICAL FEASIBILITY
 SOCIAL FEASIBILITY
ECONOMICAL FEASIBILITY:
This study is carried out to check the economic impact that the system will have
on the organization. The amount of fund that the company can pour into the research and
development of the system is limited. The expenditures must be justified. Thus the developed
system as well within the budget and this was achieved because most of the technologies
used are freely available. Only the customized products had to be purchased.
TECHNICAL FEASIBILITY:
This study is carried out to check the technical feasibility, that is, the technical
requirements of the system. Any system developed must not have a high demand on the
available technical resources. This will lead to high demands on the available technical
resources. This will lead to high demands being placed on the client. The developed system
must have a modest requirement, as only minimal or null changes are required for
implementing this system.

SOCIAL FEASIBILITY:
The aspect of study is to check the level of acceptance of the system by the user. This
includes the process of training the user to use the system efficiently. The user must not feel
threatened by the system, instead must accept it as a necessity. The level of acceptance by the
users solely depends on the methods that are employed to educate the user about the system
and to make him familiar with it. His level of confidence must be raised so that he is also able
to make some constructive criticism, which is welcomed, as he is the final user of the system.

3.4 INPUT DESIGN & OUTPUT DESIGN
INPUT DESIGN
The input design is the link between the information system and the user. It comprises the
developing specification and procedures for data preparation and those steps are necessary to
put transaction data in to a usable form for processing can be achieved by inspecting the
computer to read data from a written or printed document or it can occur by having people
keying the data directly into the system. The design of input focuses on controlling the
amount of input required, controlling the errors, avoiding delay, avoiding extra steps and
keeping the process simple. The input is designed in such a way so that it provides security
and ease of use with retaining the privacy. Input Design considered the following things:
 What data should be given as input?

 How the data should be arranged or coded?
 The dialog to guide the operating personnel in providing input.
 Methods for preparing input validations and steps to follow when error occur.
OBJECTIVES
1.Input Design is the process of converting a user-oriented description of the input into a
computer-based system. This design is important to avoid errors in the data input process and
show the correct direction to the management for getting correct information from the
computerized system.
2. It is achieved by creating user-friendly screens for the data entry to handle large volume of
data. The goal of designing input is to make data entry easier and to be free from errors. The
data entry screen is designed in such a way that all the data manipulates can be performed. It
also provides record viewing facilities.
3.When the data is entered it will check for its validity. Data can be entered with the help of
screens. Appropriate messages are provided as when needed so that the user
will not be in maize of instant. Thus the objective of input design is to create an input layout
that is easy to follow

OUTPUT DESIGN
A quality output is one, which meets the requirements of the end user and presents the
information clearly. In any system results of processing are communicated to the users and to
other system through outputs. In output design it is determined how the information is to be
displaced for immediate need and also the hard copy output. It is the most important and
direct source information to the user. Efficient and intelligent output design improves the
system’s relationship to help user decision-making.
1. Designing computer output should proceed in an organized, well thought out manner; the
right output must be developed while ensuring that each output element is designed so that
people will find the system can use easily and effectively. When analysis design computer
output, they should Identify the specific output that is needed to meet the requirements.
2.Select methods for presenting information.
3.Create document, report, or other formats that contain information produced by the system.
The output form of an information system should accomplish one or more of the following
objectives.
 Convey information about past activities, current status or projections of the

 Future.
 Signal important events, opportunities, problems, or warnings.
 Trigger an action.
 Confirm an action.

3.5 SYSTEM ARCHITECTURE:
Fig 3.5 System Architecture
3.5.1 BLOCK DIAGRAM:
Fig 3.5.1 Block Diagram of Network

BLOCK DIAGRAM:
Wireless Ad hoc Network
Source
Destination
Packet Drop
Packet Transmission
Link Failure
Fig 3.5.1 Block Diagram During Attacker Case

Wireless Ad hoc Network
Source
Destination
HLA Scheme – Link

Failure Detection
Packet Transmission
Fig 3.5.1 Block Diagram During Normal Case

Chapter-4
SYSTEM SPECIFICATIONS

4. SYSTEM REQUIREMENTS
4.1 HARDWARE REQUIREMENTS:
 System : Pentium IV 2.4 GHz.

 Hard Disk : 40 GB.
 Floppy Drive : 1.44 Mb.
 Monitor : 15 VGA Colour.
 Mouse : Logitech.
 Ram : 512 Mb.
4.2 SOFTWARE REQUIREMENTS:
 Operating system : Windows XP/7.

 Coding Language : JAVA/J2EE
 IDE : Netbeans 7.4
 Database : MYSQL

Chapter-5
SYSTEM DESIGN

5.1 DATA FLOW DIAGRAM:
1. The DFD is also called as bubble chart. It is a simple graphical formalism that can be
used to represent a system in terms of input data to the system, various processing
carried out on this data, and the output data is generated by this system.
2. The data flow diagram (DFD) is one of the most important modeling tools. It is used
to model the system components. These components are the system process, the data
used by the process, an external entity that interacts with the system and the
information flows in the system.
3. DFD shows how the information moves through the system and how it is modified by
a series of transformations. It is a graphical technique that depicts information flow
and the transformations that are applied as data moves from input to output.
4. DFD is also known as bubble chart. A DFD may be used to represent a system at any
level of abstraction. DFD may be partitioned into levels that represent increasing
information flow and functional detail.

Source
Generate MAC
IP Address Browse File
Address
WSN Nodes
Transfer
File
Packet
Droppers
HLA Scheme
Link Failure
Prevents from Link

Failures
Receives and
Transfer Destination
Save the File
File
Fig 5.1 Data Flow Diagram

5.2 UML DIAGRAMS
UML stands for Unified Modeling Language. UML is a standardized general-purpose

modeling language in the field of object-oriented software engineering. The standard is
managed, and was created by, the Object Management Group.
The goal is for UML to become a common language for creating models of object
oriented computer software. In its current form UML is comprised of two major components:
a Meta-model and a notation. In the future, some form of method or process may also be
added to; or associated with, UML.
The Unified Modeling Language is a standard language for specifying, Visualization,
Constructing and documenting the artifacts of software system, as well as for business
modeling and other non-software systems.
The UML represents a collection of best engineering practices that have proven
successful in the modeling of large and complex systems.
The UML is a very important part of developing objects oriented software and the
software development process. The UML uses mostly graphical notations to express the
design of software projects.
GOALS:
The Primary goals in the design of the UML are as follows:
1. Provide users a ready-to-use, expressive visual modeling Language so that they can
develop and exchange meaningful models.
2. Provide extendibility and specialization mechanisms to extend the core concepts.
3. Be independent of particular programming languages and development process.
4. Provide a formal basis for understanding the modeling language.
5. Encourage the growth of OO tools market.
6. Support higher level development concepts such as collaborations, frameworks,
patterns and components.
7. Integrate best practices.

5.2.1 USE CASE DIAGRAM:

A use case diagram in the Unified Modeling Language (UML) is a type of behavioral
diagram defined by and created from a Use-case analysis. Its purpose is to present a graphical
overview of the functionality provided by a system in terms of actors, their goals (represented
as use cases), and any dependencies between those use cases. The main purpose of a use case
diagram is to show what system functions are performed for which actor. Roles of the actors
in the system can be depicted.

Use case Diagram:
IP Address
Generate MAC
File Transfer Packet

Source Droppers
Drops the Packet
View Packet
droppers,Logs Alloted
Time, MAC
HLA Scheme Prevents

from Packet Droppers Destination
HLA
Receive and Save

file
Fig 5.2.1 UseCase Diagram

5.2.2 CLASS DIAGRAM:

In software engineering, a class diagram in the Unified Modeling Language (UML) is a type
of static structure diagram that describes the structure of a system by showing the system's
classes, their attributes, operations (or methods), and the relationships among the classes. It
explains which class contains information.
Source Router
IP Address IP Address
Browse File Monitor Nodes
Generate MAC() Verify MAC,Log()

Transfer File() Detect Malicious()
False Alarm()
HLA Destination
IP Address IP Address
Attacks
Static Attack() Receive()

Dynamic Attack() Save File()
Fig 5.2.2 Class Diagram

5.2.3 SEQUENCE DIAGRAM:

A sequence diagram in Unified Modeling Language (UML) is a kind of interaction diagram
that shows how processes operate with one another and in what order. It is a construct of a
Message Sequence Chart. Sequence diagrams are sometimes called event diagrams, event
scenarios, and timing diagrams.
Source HLA Attacker Destination
Browse
File
Generate
MAC
Transfer File
Transfer
File
Receive and Save
Static Attack
Dynamic Attack
Verifies MAC
address, Alloted
Time, Logs &
Attackers
Prevents from
Attacks & false
alarm rate rises
Receive and Save
Fig 5.2.3 Sequence Diagram

5.2.4 ACTIVITY DIAGRAM:
Activity diagrams are graphical representations of workflows of stepwise activities and

actions with support for choice, iteration and concurrency. In the Unified Modeling
Language, activity diagrams can be used to describe the business and operational step-by-step
workflows of components in a system. An activity diagram shows the overall flow of control.

Fig 5.2.4 Activity Diagram
Logi
nnn
Source HLA Router Attacker Destination
Connect through
IP Address
Verifies MAC address,

Alloted Time, Logs &
Attackers
Transfer File If Attacks

Receives and
NO Save the File
Prevents from Attacks

& packet droppers

Chapter-6
IMPLEMENTATION

6. IMPLEMENTATION
6.1 MODULES:
1. Network Configuration
2. Homomorphic Linear Authenticator
3. Setup Phase and Packet Transmission Phase
4. Audit Phase and Detection Phase
MODULES DESCRIPTION:
1.Network Configuration :
In this project we are using Wireless Adhoc Network. Here we mainly focus on static or
quasi-static network. In wireless network we need to send the packet through the node.
System is represented as a node. Here every node has communication range. By using this
range only we can transmit over packet. If source and destination node exists within the
communication range, source can directly transmit the packet. Otherwise, we need to select
the intermediate node based on the transmission range for transmit the packets.
2.Homomorphic Linear Authenticator :
To correctly calculate the correlation between lost packets, it is critical to enforce a truthful
packet-loss bitmap report by each node. We use HLA cryptographic primitive for this
purpose. The basic idea of our method is as follows. An HLA scheme allows the source,
which has knowledge of the HLA secret key, to generate HLA signatures s1, . . , sM for M
independent messages r1, . . . , rM, respectively. The HLA signatures are made in such a way
that they can be used as the basis to construct a valid HLA signature for any arbitrary linear
combination of the messages, ∑𝑀
𝑖=1 𝑐𝑖𝑟𝑖 , without the use of the HLA secret key, where ci’s
are randomly chosen coefficients. A valid HLA signature for ∑𝑀

𝑖=1 𝑐𝑖𝑟𝑖, can be constructed by
a node that does not have knowledge of the secret HLA key if and only if the node has full
knowledge of s1, . . . , sM. So, if a node with no knowledge of the HLA secret key provides a
valid signature for ∑𝑀
𝑖=1 𝑐𝑖𝑟𝑖 ,, it implies that this node must have received all the signatures
s1, . . . , sM.

3.Setup Phase and Packet Transmission Phase :
This phase takes place right after route PSD is established, but before any data packets are
transmitted over the route. In this phase, S decides on a symmetric-key crypto-system
(encrypt key, decrypt key) and K symmetric keys key1, . . . , keyK, where encrypt key and
decrypt key are the keyed encryption and decryption functions, respectively. S securely
distributes decrypt key and a symmetric key keyj to node nj on PSD, for j = 1, . . . ,K. Key
distribution may be based on the public-key crypto-system such as RSA: S encrypts keyj
using the public key of node nj and sends the cipher text to nj . nj decrypts the cipher text
using its private key to obtain keyj .
After completing the setup phase, S enters the packet transmission phase. Before sending out
a packet Pi, where i is a sequence number that uniquely identifies Pi, S computes ri = H1(Pi)
and generates the HLA signatures of ri for node nj , as follows
sji = [H2(i||j)uri ]x, for j = 1, . . . ,K
where || denotes concatenation. These signatures are then sent together with Pi to the route by
using a one-way chained encryption that prevents an upstream node from deciphering the
signatures intended for downstream nodes.
4.Audit Phase and Detecting Phase :
This phase is triggered when the public auditor Ad receives an ADR message from S. The
ADR message includes the id of the nodes on PSD, ordered in the downstream direction, i.e.,
n1, . . . , nK, S’s HLA public key information pk = (v, g, u), the sequence numbers of the most
recent M packets sent by S, and the sequence numbers of the subset of these M packets that
were received by D. Recall that we assume the information sent by S and D is truthful,
because detecting attacks is in their interest. The public auditor Ad enters the detection phase
after receiving and auditing the reply to its challenge from all nodes on PSD. The main tasks
of Ad in this phase include the following: detecting any overstatement of packet loss at each
node, constructing a packet-loss bitmap for each hop, calculating the autocorrelation function
for the packet loss on each hop, and deciding whether malicious behavior is present.

6.2 SOURCE CODE
Router.java:
import java.awt.*;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.io.BufferedInputStream;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.lang.management.ManagementFactory;
import java.lang.management.ThreadMXBean;
import java.math.BigInteger;
import java.net.ServerSocket;
import java.net.Socket;
import java.net.UnknownHostException;
import java.security.DigestInputStream;
import java.security.MessageDigest;
import java.sql.Connection;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.Statement;
import java.text.DateFormat;
import java.text.SimpleDateFormat;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Date;
import java.util.Random;
Router() throws SQLException
p1=new JPanel();
p1.setLayout(null);
setTitle("Router ::Privacy-Preserving and Truthful Detection of Packet

Dropping Attacks in Wireless Ad Hoc Networks");
p1.setBackground(Color.white);
mbr=new MenuBar();
setMenuBar(mbr);
m1=new Menu("File");
i1=new MenuItem("Update Bandwidth");
i2=new MenuItem("View Router Details");
i3=new MenuItem("View Attackers");
i4=new MenuItem("View Time Delay");
i5=new MenuItem("View Dropped Packets");
nod=new ImageIcon(this.getClass().getResource("node.jpg"));
nodl = new JLabel("LINK FAILURE");
nodl.setIcon(nod);
nodl.setBounds(240, 260, 300, 300);
nodl.setForeground(Color.GREEN);
p1.add(nodl);

// down=new ImageIcon(this.getClass().getResource("down.png"));
// downl = new JLabel();
// downl.setIcon(down);
// downl.setBounds(450, 330, 300, 300);
// downl.setForeground(Color.GREEN);
// p1.add(downl);
ids=new ImageIcon(this.getClass().getResource("ids.jpg"));
idsl = new JLabel("NODE FAILURE");
idsl.setIcon(ids);
idsl.setBounds(540, 260, 300, 300);
idsl.setForeground(Color.GREEN);
p1.add(idsl);
a1=new ImageIcon(this.getClass().getResource("black.jpg"));
a11=new JLabel("Node1");
a11.setIcon(a1);
a11.setBounds(50, 100, 500,200);
p1.add(a11);
l1=new JLabel();
l1.setBounds(120, 30, 500,200);
p1.add(l1);
l2=new JLabel();
l2.setBounds(120, 100, 500,200);

p1.add(l2);
l3=new JLabel();
l3.setBounds(120, 170, 500,200);
p1.add(l3);
a22.setIcon(a2);
a22.setBounds(150, 30, 500,200);
p1.add(a22);
l4=new JLabel();
l4.setBounds(220, 30, 500,200);
p1.add(l4);
l5=new JLabel();
l5.setBounds(165, 65, 500,200);
p1.add(l5);
a33.setIcon(a3);
a33.setBounds(250, 30, 500,200);
p1.add(a33);
l6=new JLabel();
l6.setBounds(320, 30, 500,200);
p1.add(l6);

l7=new JLabel();
l7.setBounds(265, 65, 500,200);
p1.add(l7);
a44.setIcon(a4);
a44.setBounds(350, -20, 500,200);
p1.add(a44);
l8=new JLabel();
l8.setBounds(420, -20, 500,200);
p1.add(l8);
l9=new JLabel();
l9.setBounds(365, 45, 500,200);
p1.add(l9);
a55.setIcon(a5);
a55.setBounds(450, -20, 500,200);
p1.add(a55);
l10=new JLabel();
l10.setBounds(520, -20, 500,200);
p1.add(l10);
l11=new JLabel();

l11.setBounds(465, 45, 500,200);
int[] ports = new int[]
{12345,3939,1412,4445,4444,1111,2222};
for (int i = 0; i < 7; i++)
Thread t = new Thread(new

PortListener(ports[i]));
t.setName("Listener-" + ports[i]);
t.start();

6.3 SCREEN SHOTS

NETWORK :
SOURCE :

DESTINATION :
AUDITOR :

PACKET DROPPING (Modifying the energy by attacker) :
PACKET DROPPING (Malicious Data by attacker) :

DETECTION :
i) Normal Case :
ii) Attacker Case :

Chapter-7
TESTING

SYSTEM TESTING
The purpose of testing is to discover errors. Testing is the process of

trying to discover every conceivable fault or weakness in a work product. It
provides a way to check the functionality of components, sub assemblies,
assemblies and/or a finished product It is the process of exercising software
with the intent of ensuring that the
Software system meets its requirements and user expectations and does not fail
in an unacceptable manner. There are various types of test. Each test type
addresses a specific testing requirement.
7.1 TYPES OF TESTS

Unit testing
Unit testing involves the design of test cases that validate that the internal
program logic is functioning properly, and that program inputs produce valid
outputs. All decision branches and internal code flow should be validated. It is
the testing of individual software units of the application .it is done after the
completion of an individual unit before integration. This is a structural testing,
that relies on knowledge of its construction and is invasive. Unit tests perform
basic tests at component level and test a specific business process, application,
and/or system configuration. Unit tests ensure that each unique path of a
business process performs accurately to the documented specifications and
contains clearly defined inputs and expected results.

Integration testing
Integration tests are designed to test integrated software components to
determine if they actually run as one program. Testing is event driven and is
more concerned with the basic outcome of screens or fields. Integration tests
demonstrate that although the components were individually satisfaction, as
shown by successfully unit testing, the combination of components is correct
and consistent. Integration testing is specifically aimed at exposing the
problems that arise from the combination of components.
Functional test
Functional tests provide systematic demonstrations that functions tested are
available as specified by the business and technical requirements, system
documentation, and user manuals.
Functional testing is centered on the following items:
Valid Input : identified classes of valid input must be accepted.
Invalid Input : identified classes of invalid input must be rejected.
Functions : identified functions must be exercised.
Output : identified classes of application outputs must be

exercised.
Systems/Procedures: interfacing systems or procedures must be invoked.
Organization and preparation of functional tests is focused on requirements,

key functions, or special test cases. In addition, systematic coverage pertaining
to identify Business process flows; data fields, predefined processes, and
successive processes must be considered for testing. Before functional testing is
complete, additional tests are identified and the effective value of current tests is
determined.

System Test
System testing ensures that the entire integrated software system meets
requirements. It tests a configuration to ensure known and predictable results.
An example of system testing is the configuration oriented system integration
test. System testing is based on process descriptions and flows, emphasizing
pre-driven process links and integration points.
White Box Testing

White Box Testing is a testing in which in which the software tester has
knowledge of the inner workings, structure and language of the software, or at
least its purpose. It is purpose. It is used to test areas that cannot be reached
from a black box level.
Black Box Testing

Black Box Testing is testing the software without any knowledge of the
inner workings, structure or language of the module being tested. Black box
tests, as most other kinds of tests, must be written from a definitive source
document, such as specification or requirements document, such as
specification or requirements document. It is a testing in which the software
under test is treated, as a black box .you cannot “see” into it. The test provides
inputs and responds to outputs without considering how the software works.
Unit Testing:
Unit testing is usually conducted as part of a combined code and unit test
phase of the software lifecycle, although it is not uncommon for coding and unit
testing to be conducted as two distinct phases.
Test strategy and approach

Field testing will be performed manually and functional tests will be
written in detail.

Test objectives
 All field entries must work properly.

 Pages must be activated from the identified link.
 The entry screen, messages and responses must not be delayed.
Features to be tested
 Verify that the entries are of the correct format

 No duplicate entries should be allowed
 All links should take the user to the correct page.
7.2 Integration Testing
Software integration testing is the incremental integration testing of two
or more integrated software components on a single platform to produce failures
caused by interface defects.
The task of the integration test is to check that components or software

applications, e.g. components in a software system or – one step up – software
applications at the company level – interact without error.
Test Results: All the test cases mentioned above passed successfully. No
defects encountered.
7.3 Acceptance Testing

User Acceptance Testing is a critical phase of any project and requires
significant participation by the end user. It also ensures that the system meets
the functional requirements.
Test Results: All the test cases mentioned above passed successfully. No
defects encountered.

Chapter-8
CONCLUSION

8.CONCLUSION
In this paper, we showed that compared with conventional detection algorithms that utilize
only the distribution of the number of lost packets, exploiting the correlation between lost
packets significantly improves the accuracy in detecting malicious packet drops. Such
improvement is especially visible when the number of maliciously dropped packets is
comparable with those caused by link errors. To correctly calculate the correlation between
lost packets, it is critical to acquire truthful packet-loss information at individual nodes. We
developed an HLA-based public auditing architecture that ensures truthful packet-loss
reporting by individual nodes. This architecture is collusion proof, requires relatively high
computational capacity at the source node, but incurs low communication and storage
overheads over the route. To reduce the computation overhead of the baseline construction, a
packet-block-based mechanism was also proposed, which allows one to trade detection
accuracy for lower computation complexity.

Chapter-9
FUTURE SCOPE

9. FUTURE SCOPE
Some open issues remain to be explored in our future work. First, the proposed
mechanisms are limited to static or quasi-static wireless ad hoc networks.
Frequent changes on topology and link characteristics have not been considered.
Extension to highly mobile environment will be studied in our future work. In
addition, in this paper we have assumed that source and destination are truthful
in following the established protocol because delivering packets end-to-end is in
their interest. Misbehaving source and destination will be pursued in our future
research. Moreover, in this paper, as a proof of concept, we mainly focused on
showing the feasibility of the proposed cypto-primitives and how second order
statistics of packet loss can be utilized to improve detection accuracy. As a first
step in this direction, our analysis mainly emphasize the fundamental features of
the problem, such as the untruthfulness nature of the attackers, the public
verifiability of proofs, the privacy-preserving requirement for the auditing
process, and the randomness of wireless channels and packet losses, but ignore
the particular behavior of various protocols that may be used at different layers
of the protocol stack. The implementation and optimization of the proposed
mechanism under various particular protocols will be considered in our future
studies.

Chapter-10
BIBLIOGRAPHY

10. REFERENCES
[1] J. N. Arauz, “802.11 Markov channel modeling,” Ph.D. dissertation, School Inform. Sci.,
Univ. Pittsburgh, Pittsburgh, PA, USA, 2004.
[2] C. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song,

“Provable data possession at untrusted stores,” in Proc. ACM Conf. Comput. and Commun.
Secur., Oct. 2007, pp. 598–610.
[3] G. Ateniese, S. Kamara, and J. Katz, “Proofs of storage from homomorphic identification
protocols,” in Proc. Int. Conf. Theory Appl. Cryptol. Inf. Security, 2009, pp. 319–333.
[4] B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, “ODSBR: An on-

demand secure byzantine resilient routing protocol for wireless ad hoc networks,” ACM
Trans. Inform. Syst. Security, vol. 10, no. 4, pp. 1–35, 2008.
[5] B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, “ODSBR: An on-

demand secure byzantine resilient routing protocol for wireless ad hoc networks,” ACM
Trans. Inf. Syst. Secur., vol. 10, no. 4, pp. 11–35, 2008.
[6] K. Balakrishnan, J. Deng, and P. K. Varshney, “TWOACK: Preventing selfishness in

mobile ad hoc networks,” in Proc. IEEE Wireless Commun. Netw. Conf., 2005, pp. 2137–
2142.
[7] D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the weil pairing,” J.
Cryptol., vol. 17, no. 4, pp. 297–319, Sep. 2004.
[8] S. Buchegger and J. Y. L. Boudec, “Performance analysis of the confidant protocol

(cooperation of nodes: Fairness in dynamic adhoc networks),” in Proc. 3rd ACM Int. Symp.
Mobile Ad Hoc Netw. Comput. Conf., 2002, pp. 226–236.
[9] L. Buttyan and J. P. Hubaux, “Stimulating cooperation in selforganizing mobile ad hoc

networks,” ACM/Kluwer Mobile Netw. Appl., vol. 8, no. 5, pp. 579–592, Oct. 2003.

[10] J. Crowcroft, R. Gibbens, F. Kelly, and S. Ostring, “Modelling incentives for

collaboration in mobile ad hoc networks,” presented at the First Workshop Modeling
Optimization Mobile, Ad Hoc Wireless Netw., Sophia Antipolis, France, 2003.
[11] J. Eriksson, M. Faloutsos, and S. Krishnamurthy, “Routing amid colluding attackers,” in

Proc. IEEE Int. Conf. Netw. Protocols, 2007, pp. 184–193.
[12] W. Galuba, P. Papadimitratos, M. Poturalski, K. Aberer, Z. Despotovic, and W. Kellerer,

“Castor: Scalable secure routing for ad hoc networks,” in Proc. IEEE INFOCOM, Mar. 2010,
pp. 1 –9.
[13] T. Hayajneh, P. Krishnamurthy, D. Tipper, and T. Kim, “Detecting malicious packet

dropping in the presence of collisions and channel errors in wireless ad hoc networks,” in
Proc. IEEE Int. Conf. Commun., 2009, pp. 1062–1067.
[14] Q. He, D. Wu, and P. Khosla, “Sori: A secure and objective reputation-based incentive
scheme for ad hoc networks,” in Proc. IEEE Wireless Commun. Netw. Conf., 2004, pp. 825–
830.
[15] D. B. Johnson, D. A. Maltz, and J. Broch, “DSR: The dynamic source routing protocol
for multi-hop wireless ad hoc networks,” in Ad Hoc Networking. Reading, MA, USA:
Addison-Wesley, 2001, ch. 5, pp. 139–172.
[16] W. Kozma Jr. and L. Lazos, “Dealing with liars: Misbehavior identification via Renyi-
Ulam games,” presented at the Int. ICST Conf. Security Privacy in Commun. Networks,
Athens, Greece, 2009.
[17] W. Kozma Jr., and L. Lazos, “REAct: Resource-efficient accountability for node
misbehavior in ad hoc networks based on random audits,” in Proc. ACM Conf. Wireless
Netw. Secur., 2009, pp. 103–110.
[18] K. Liu, J. Deng, P. Varshney, and K. Balakrishnan, “An acknowledgement- based

approach for the detection of routing misbehavior in MANETs,” IEEE Trans. Mobile
Comput., vol. 6, no. 5, pp. 536–550, May 2006.

[19] Y. Liu and Y. R. Yang, “Reputation propagation and agreement in mobile ad-hoc
networks,” in Proc. IEEE WCNC Conf., 2003, pp. 1510–1515.
[20] S. Marti, T. J. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehavior in mobile ad
hoc networks,” in Proc. ACM MobiCom Conf., 2000, pp. 255–265.
[21] G. Noubir and G. Lin, “Low-power DoS attacks in data wireless lans and
countermeasures,” ACM SIGMOBILE Mobile Comput. Commun. Rev., vol. 7, no. 3, pp. 29–
30, Jul. 2003.
[22] V. N. Padmanabhan and D. R. Simon, “Secure traceroute to detect faulty or malicious

routing,” in Proc. ACM SIGCOMM Conf., 2003, pp. 77–82.
[23] P. Papadimitratos and Z. Haas, “Secure message transmission in mobile ad hoc

networks,” Ad Hoc Netw., vol. 1, no. 1, pp. 193–209, 2003.
[24] A. Proano and L. Lazos, “Selective jamming attacks in wireless networks,” in Proc.
IEEE ICC Conf., 2010, pp. 1–6.
[25] A. Proano and L. Lazos, “Packet-hiding methods for preventing selective jamming
attacks,” IEEE Trans. Depend. Secure Comput., vol. 9, no. 1, pp. 101–114, Jan./Feb. 2012.
[26] R. Rao and G. Kesidis, “Detecting malicious packet dropping using statistically regular
traffic patterns in multihop wireless networks that are not bandwidth limited,” in Proc. IEEE
GLOBECOM Conf., 2003, pp. 2957–2961.
[27] H. Shacham and B. Waters, “Compact proofs of retrievability,” in Proc. Int. Conf.
Theory Appl. Cryptol. Inf. Secur., Dec. 2008, pp. 90– 107.
[28] T. Shu, M. Krunz, and S. Liu, “Secure data collection in wireless sensor networks using
randomized dispersive routes,” IEEE Trans. Mobile Comput., vol. 9, no. 7, pp. 941–954, Jul.
2010.

[29] T. Shu, S. Liu, and M. Krunz, “Secure data collection in wireless sensor networks using
randomized dispersive routes,” in Proc. IEEE INFOCOM Conf., 2009, pp. 2846–2850.
[30] C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-preserving public auditing for data
storage security in cloud computing,” in Proc. IEEE INFOCOM Conf., Mar. 2010, pp. 1–9.
[31] W. Xu, W. Trappe, Y. Zhang, and T. Wood, “The feasibility of launching and detecting
jamming attacks in wireless networks,” in Proc. ACM MobiHoc Conf., 2005, pp. 46–57.
[32] Y. Xue and K. Nahrstedt, “Providing fault-tolerant ad-hoc routing service in adversarial
environments,” Wireless Pers. Commun., Special Issue Secur. Next Generation Commun.,
vol. 29, no. 3, pp. 367–388, 2004.
[33] Y. Zhang, L. Lazos, and W. Kozma, “AMD: Audit-based misbehavior detection in

wireless ad hoc networks,” IEEE Trans. Mobile Comput., PrePrint, Vol. 99, published online
on 6 Sept. 2013.
[34] S. Zhong, J. Chen, and Y. R. Yang, “Sprite: A simple cheat-proof, credit-based system
for mobile ad-hoc networks,” in Proc. IEEE INFOCOM Conf., 2003, pp. 1987–1997.

Whole

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Whole

Загружено:

Авторское право:

Доступные форматы

Privacy-Preserving and Truthful Detection Of

Packet Dropping Attacks in Wireless

A.L.NAVYA SREE N.K.SWETHA

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SEETHARAMAPURAM, NARSAPUR-534 280, W.G.Dt. (A.P)

DEPARTMENT OF COMPUTER SCIENCE &ENGINEERING

Thesis Advisor Head of the Department

We would like to thank Dr.M.Srinivasa Kumar, principal for his

Our deep gratitude to internal guide Mr.M. Satyanarayana.We thank

1 A.LAKSHMI NAVYA SREE (14A21A0584)

2 N.KHAMBU SWETHA (14A21A05A2)

3 P.LAKSHMI SURYA (14A21A0585)

c. The guidelines of the university are followed in writing the thesis.

Reg No Name Of The Student Signature

14A21A0554 A.LAKSHMI NAVYA SREE

14A21A0589 N.KHAMBU SWETHA

14A21A0592 P.LAKSHMI SURYA

CHAPTER NO TITLE PAGENO

1.2 Application Area 3

3.2 Proposed System 12

3.3 System Study 13

3.4 Input and Ouptut Design 15

3.4 System Architecture 17

4.2 Software Requirements 22

5.1 Data Flow Diagram 23

5.2 UML Diagram 25

5.2.1 Use Case Diagram 26

5.2.2 Class Diagram 28

5.2.3 Sequence Diagram 29

6.2 Source Code 34

6.3 Screen Shots . 41

7.1 Types of Tests 46

7.2 Integration Testing 49

7.3 Acceptance Testing 49

1 Structure of mobile computing 2

5 5.1 Data Flow Diagram 24

5.2 UML Diagrams

5.2.1 UseCase Diagram 27

5.2.2 Class Diagram 28

5.2.3 Sequence Diagram 29

5.2.4 Activity Diagram 31

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 1

1.1 What is Mobile Computing?

Fig : 1 Structure of mobile computing

Different types of devices used for the mobile computing:

1. Personal digital assistant/enterprise digital assistant

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 2

1.2 Applications of Mobile Computing:

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 3

Benefits of Mobile Computing:

 Improve business productivity by streamlining interaction and taking advantage of

1.3 Advantages of Mobile Computing:

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 4

6. Streamlining of Business Processes:

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 5

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 6

AUTHORS: C. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D.

2. Proofs of storage from homomorphic identification protocols

AUTHORS: G. Ateniese, S. Kamara, and J. Katz

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 7

3. ODSBR: An on-demand secure byzantine resilient routing protocol for

4. TWOACK: Preventing selfishness in mobile ad hoc networks

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY Page 8