Professional Documents
Culture Documents
Submitted By
(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)
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.
Finally we thank one and all that have contributed directly or indirectly to
this thesis.
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.
Date:
Place:
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
ABSTRACT i
CONTENTS iii
LIST OF FIGURES iv
1. INTRODUCTION 1
1.1 Introduction to Mobile Computing 2
2. LITERATURE SURVEY 6
3. SYSTEM ANALYSIS 10
3.1 Exisiting System 11
4. SYSTEM REQUIREMENTS 20
4.1 Hardware Requirements 21
5. SYSTEM DESIGN 22
iii
5.2.4 Activity Diagram 30
6. IMPLEMENTATION 32
6.1 Modules 33
7. SYSTEM TESTING 45
8. CONCLUSION 50
9. FUTURE SCOPE 52
10. BIBLOGRAPHY 54
iv
LIST OF FIGURES
CHAPTER NO CONTENTS PAGENO
v
Privacy-Preserving & Truthful Detection Of Packet Dropping Attacks in Wireless Ad Hoc Networks
Chapter-1
INTRODUCTION
1. INTRODUCTION
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.
7. Palmtops/pocket computers
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.
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.
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
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.
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.
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.
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.
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:
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.
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.
BLOCK DIAGRAM:
Source
Destination
Packet Drop
Packet Transmission
Link Failure
Source
Destination
Chapter-4
SYSTEM SPECIFICATIONS
4. SYSTEM REQUIREMENTS
Chapter-5
SYSTEM DESIGN
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
Receives and
Transfer Destination
Save the File
File
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.
IP Address
Generate MAC
View Packet
droppers,Logs Alloted
Time, MAC
Source Router
IP Address IP Address
Browse File Monitor Nodes
HLA Destination
IP Address IP Address
Attacks
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
Logi
nnn
Connect through
IP Address
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.
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
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.
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
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.
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.
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;
p1=new JPanel();
p1.setLayout(null);
p1.setBackground(Color.white);
mbr=new MenuBar();
setMenuBar(mbr);
m1=new Menu("File");
nod=new ImageIcon(this.getClass().getResource("node.jpg"));
nodl.setIcon(nod);
nodl.setForeground(Color.GREEN);
p1.add(nodl);
// down=new ImageIcon(this.getClass().getResource("down.png"));
// downl.setIcon(down);
// downl.setForeground(Color.GREEN);
// p1.add(downl);
ids=new ImageIcon(this.getClass().getResource("ids.jpg"));
idsl.setIcon(ids);
idsl.setForeground(Color.GREEN);
p1.add(idsl);
a1=new ImageIcon(this.getClass().getResource("black.jpg"));
a11=new JLabel("Node1");
a11.setIcon(a1);
p1.add(a11);
l1=new JLabel();
p1.add(l1);
l2=new JLabel();
p1.add(l2);
l3=new JLabel();
p1.add(l3);
a2=new ImageIcon(this.getClass().getResource("black.jpg"));
a22=new JLabel("Node2");
a22.setIcon(a2);
p1.add(a22);
l4=new JLabel();
p1.add(l4);
l5=new JLabel();
p1.add(l5);
a3=new ImageIcon(this.getClass().getResource("black.jpg"));
a33=new JLabel("Node5");
a33.setIcon(a3);
p1.add(a33);
l6=new JLabel();
p1.add(l6);
l7=new JLabel();
p1.add(l7);
a4=new ImageIcon(this.getClass().getResource("black.jpg"));
a44=new JLabel("Node8");
a44.setIcon(a4);
p1.add(a44);
l8=new JLabel();
p1.add(l8);
l9=new JLabel();
p1.add(l9);
a5=new ImageIcon(this.getClass().getResource("black.jpg"));
a55=new JLabel("Node11");
a55.setIcon(a5);
p1.add(a55);
l10=new JLabel();
p1.add(l10);
l11=new JLabel();
{12345,3939,1412,4445,4444,1111,2222};
t.setName("Listener-" + ports[i]);
t.start();
SOURCE :
DESTINATION :
AUDITOR :
DETECTION :
i) Normal Case :
Chapter-7
TESTING
SYSTEM TESTING
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.
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.
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.
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 objectives
Test Results: All the test cases mentioned above passed successfully. No
defects encountered.
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.
[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.
[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.
[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.
[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.
[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.
[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.