www.globalsoftsolutions.in
gsstrichy@gmail.com
PATH RECONSTRUCTION IN DYNAMIC WIRELESS SENSOR
NETWORKS USING COMPRESSIVE SENSING
ABSTRACT
CSPR, a compressive-sensing based approach is proposed for path reconstruction
in wireless sensor networks. By viewing the whole network as a path
representation space, an arbitrary routing path can be represented by a path vector
in the space. As path length is usually much smaller than the network size, such
path vectors are sparse, i.e., the majority of elements are zeros. By encoding sparse
path representation into packets, the path vector can be recovered from a small
amount of packets using compressive sensing technique. CSPR formalizes the
sparse path representation and enables accurate and efficient per-packet path
reconstruction. CSPR is invulnerable to network dynamics and lossy links due to
its distinct design. A set of optimization techniques is further proposed to improve
the design.
www.globalsoftsolutions.in
gsstrichy@gmail.com
INTRODUCTION
The per packet routing path serves as the meta-information for understanding
detailed wireless sensor networks (WSNs) behaviors in many network maintenance
and diagnosis situations, e.g., routing dynamics, detection on routing holes or
wormholes or even per-hop per-packet transmission delay, network diagnosis, etc.
Reconstructing per-packet routing path information, however, has been known to
be nontrivial. WSNs are self-organized and usually deployed in dynamic
environments. The underlying network topology constantly changes, and no fixed
routing path can be expected for each node. A straightforward solution to reveal
the packet path is to record the complete path during packet forwarding, e.g.,
storing the ID sequence of all relay nodes, in each packet. The introduced overhead
linearly grows with the path length, far from scalable.
www.globalsoftsolutions.in
gsstrichy@gmail.com
PROBLEM DEFINITION
There have been many efforts made to address the per-packet path reconstruction
problem in WSNs. The method that identifies packet paths via hash values triggers
disastrous computation overhead. Some methods reconstruct path information by
leveraging interpacket correlation in sufficiently stable and reliable networks.
However, according to our investigation on the practical packet trace from
CitySee, a real-deployed and large-scale WSN, we observe nonnegligible topology
variation and high packet loss all the time. Both topology instability and packet
loss significantly deteriorate existing path reconstruction methods in practical
WSNs.
PROPOSED SOLUTION
Deterioration of existing path reconstruction methods leads to identify the path
reconstruction problem from a new perspective, which requires no interpacket
correlations and thus makes the solution insensitive to network dynamics and lossy
links. The key insight of proposed design is as follows. The length of a routing
path is usually much smaller than the network size. Therefore, we can construct a
path representation space, the number of whose dimensions equals the total
number of nodes in the network. In such a representation space, an arbitrary
routing path can be represented by a path vector, where each element corresponds
to a node in the network. The path vector sets the hop numbers for nodes on the
path and zeros for those not involved in the path. As the path length is much
smaller than the network size, such path vectors are thus sparse, i.e., the majority
of elements are zeros. The path reconstruction becomes a problem of unveiling all
existing path vectors hidden in the representation space. If all nonzero elements of
a path vector can be encoded (with few bytes) into the packets forwarded along the
www.globalsoftsolutions.in
gsstrichy@gmail.com
path, we can recover the path vector based on a small amount of packets using
compressive sensing technique.
www.globalsoftsolutions.in
gsstrichy@gmail.com
EXISTING SYSTEM
 MNT reconstructs per-packet path by exploiting interpacket correlation, i.e.,
a relayed packet and its adjacent packets locally generated at any node are
usually forwarded to the same next hop. Such local packets serve as anchors
of the relayed packet at node i. As the first-hop receiver is recorded in
packets, the path of a packet can be obtained by concatenating the first-hop
receivers of all its anchors.
 Pathfinder tolerates certain inconsistence in interpacket correlation via
explicitly recording inconsistence in packets. The reconstruction failure
occurs once the inconsistence exceeds the tolerance capacity. To accurately
locate anchors, Pathfinder further imposes the packet generation rate of each
node to be identical and fixed.
Sparse Representation of Routing Paths
 Since sensory data in WSNs are usually collected with a direct acyclic graph
(DAG) routing structure. In such a representation space, any routing path
can be presented by a path vector. According to whether a node is involved
in the routing path, the path vector sets either hop number or zero for its
corresponding element.
 As the path length is much smaller than the network size, the path vector is
thus sparse, i.e., the majority of elements in the vector are zeros.
Disadvantages
 Both MNT and Pathfinder require stable network topology such that
interpacket correlation can be captured.
www.globalsoftsolutions.in
gsstrichy@gmail.com
PROPOSED SYSTEM
 To propose a Compressive-Sensing-based Path Reconstruction method,
CSPR, which formalizes the sparse path representation and leverages
compressive sensing to recover routing paths.
 CSPR lets intermediate nodes briefly annotate the transmitted packets and
classifies packets traveling along different paths into different groups.
 For a particular path, the forwarded packets encode independent
observations and CSPR performs compressive sensing to recover the path
when a certain amount of packets is collected.
 In addition to the basic design, a set of optimization techniques is proposed
to gradually shrink the representation space and reduce the sparsity of
unrecovered path vectors.
 The numbers of packets needed for remaining path reconstructions are
lowered, and processing is thus accelerated.
Advantages
 The path reconstruction by CSPR requires no interpacket correlations and
utilizes only a small number of received packets.
 CSPR is thus invulnerable to topology dynamics and lossy links.
 On the protocol level, CSPR introduces only small and fixed overhead in
annotating each packet, which could be optimized accordingly for practical
WSNs.
www.globalsoftsolutions.in
gsstrichy@gmail.com
INTRODUCTION
Path Reconstruction Problem
A WSN consists of a number of sensor nodes and a sink. All sensor nodes generate
and relay packets to the sink. To collect packets, the sink builds a routing structure,
e.g., data collection tree, information potential, etc., covering all the sensor nodes
in the network. After generating one packet, the source node forwards it to its
parent node, and the packet will be further forwarded until it reaches the sink. Due
to the network dynamics, each node will periodically search for the best parent
node. The routing path from each node to the sink thus may change. At the sink, a
path reconstruction method is desired to recover the path each packet traveled. One
packet path is an ID sequence from the source of the packet to the sink, including
IDs of all intermediate nodes relaying this packet and their hop numbers as well.
Compressive-Sensing-Based Path Reconstruction:
For the path vector of a routing path, if its nonzero elements can be encoded into
each packet forwarded along the path, it is viable to recover the vector based on a
small amount of packets using compressive sensing.
www.globalsoftsolutions.in
gsstrichy@gmail.com
1) Accurate Packet Classification: Packet classification into each path group must
be accurate. It is vital to distinguish each individual path and classify the packets
into the right group. Packet misclassification will lead to path reconstruction error
for one group. Therefore, packet classification must have high accuracy.
2) Lightweight Per-Packet Annotation: To enable the compressive-sensing-based
path reconstruction, packets need to carry encoded information for all nonzero
elements of the path vectors representing their traveling paths. In particular, when
one packet is relayed by an intermediate node, the node needs to annotate its hop
number along the path into the packet header. As a result, packet header is updated
hop by hop. The annotation overhead must be small. In particular, the annotation
field in the packet header should be small in size and remain constant. In addition,
updating should be performed in a distributed manner without introducing any
centralized control.
3) Short Per-Packet Path Recovery Delay: To perform compressive- sensing-based
path reconstruction for one path group, the number of packets accumulated in this
group should be at least to ensure a good recovery quality. Some path groups,
however, cannot accumulate sufficient packets even after a long time. As practical
requirement, per-packet path recovery delay should not be excessively long.
www.globalsoftsolutions.in
gsstrichy@gmail.com
HARDWARE REQUIREMENTS
Processor
: Any Processor above 500 MHz.
Ram
: 128Mb.
Hard Disk
: 10 Gb.
Compact Disk
: 650 Mb.
Input device
: Standard Keyboard and Mouse.
Output device
: VGA and High Resolution Monitor.
SOFTWARE SPECIFICATION
Operating System
: Windows Family.
Programming Language : JDK 1.5 or higher
Database
: MySQL 5.0
MAXIMIZING P2P FILE ACCESS AVAILABILITY IN MOBILE AD HOC
NETWORKS THOUGH REPLICATION FOR EFFICIENT FILE SHARING
ABSTRACT
File sharing applications in mobile ad hoc networks (MANETs) have attracted
more and more attention in recent years. The efficiency of file querying suffers
from the distinctive properties of such networks including node mobility and
limited communication range and resource. An intuitive method to alleviate
www.globalsoftsolutions.in
gsstrichy@gmail.com
this problem is to create file replicas in the network. However, despite the
efforts on file replication, no research has focused on the global optimal replica
creation with minimum average querying delay. Specifically, current file
replication protocols in mobile ad hoc networks have two shortcomings. First,
they lack a rule to allocate limited resource to different files in order to
minimize the average querying delay. Second, they simply consider storage as
resource for replicas, but neglect the fact that the file holders’ frequency of
meeting other nodes also plays an important role in determining file
availability. Actually, a node that has a higher meeting frequency with others
provides higher availability to its files. This becomes even more evident in
sparsely distributed MANETs, where nodes meet disruptively. A new concept of
resource for file replication is proposed, which considers both node storage and
meeting frequency. Influence of resource allocation is studied on the average
querying delay and derive a resource allocation rule to minimize the average
querying delay. A distributed file replication protocol is proposed to realize the
proposed rule.
www.globalsoftsolutions.in
gsstrichy@gmail.com
INTRODUCTION
With the popularity of mobile devices, i.e., smartphones and laptops, MANET’s
future is envisioned consisted of these mobile devices. By MANETs, both
normal MANETs and disconnected MANETs (or delay tolerant networks (DTNs).
The former has a relatively dense node distribution in a local area while the
latter has sparsely distributed nodes that opportunistically meet each other.
On the other side, the emerging of mobile file sharing applications also
motivates the investigation on the peer-to-peer (P2P) file sharing over such
MANETs. The local P2P model provides three advantages. Firstly, it enables file
sharing when no base stations are available. Secondly, with the P2P
architecture, the bottleneck on overloaded servers in current client-server
based file sharing systems can be avoided. Thirdly, it exploits the otherwise
wasted peer to peer communication opportunities among mobile nodes. As a
result, nodes can freely and unobtrusively access and share files in the
distributed MANET environment, which can possibly support some interesting
applications.
For example, mobile nodes can share files based on users’ proximity in the
same building or a local community. Tourists can share their travel
experiences or emergency information with other tourists through digital
devices directly even when no base station is available in remote areas. Drivers
can share road or weather information through the vehicle-to-vehicle
communication. However, the distinctive properties of MANETs, including node
mobility, limited communication range and resource, have rendered many
difficulties in realizing such a P2P file sharing system. For example, file
searching turns out to be non-trivial and time consuming since nodes in
MANETs move around freely and can exchange information only when they are
within the communication range.
EXISTING SYSTEM
www.globalsoftsolutions.in
gsstrichy@gmail.com
 In existing file replication protocols, each individual node replicates files
it frequently queries, or a group of nodes create one replica for each file
they frequently query.
 Content caching in more sparsely distributed MANETs for efficient data
retrieval or message routing is used. They basically follow an intuitive
way to cache data that are frequently queried on places that are visited
frequently by mobile nodes.
Disadvantages
 In frequent queries based on individual node’s file replication, redundant
replicas are easily created in the system, wasting resources.
 In frequent queries based on group of node’s file replication, though
redundant replicas are reduced by group cooperation, neighboring nodes
may separate from each other due to node mobility, leading to large
query delay.
 Both the two categories file replication and content caching methods fail
to thoroughly consider that a node’s mobility affects the availability of its
files.
 Lack a rule to allocate limited resource to different files for replica
creation in order to achieve the minimum global average querying delay,
i.e., global search efficiency optimization under limited resource.
 Existing system simply considers storage as the resource for replicas, but
neglect that a node’s frequency to meet other nodes also influences the
availability of its files. Files in a node with a higher meeting ability have
higher availability.
PROPOSED SYSTEM
www.globalsoftsolutions.in
gsstrichy@gmail.com
 A new concept of resource for file replication is proposed, which
considers both node storage and node meeting ability.
 To study the influence of resource allocation on the average querying
delay and derive an optimal file replication rule that allocates resources
to each file based on its popularity and size.
Advantages
 The problem of resource allocation for replica creation is done to achieve
global file searching optimization in MANETs.
 To propose a file replication protocol based on the rule, which
approximates the minimum global querying delay in a fully distributed
manner.
www.globalsoftsolutions.in
gsstrichy@gmail.com
HARDWARE REQUIREMENTS
Processor
: Any Processor above 500 MHz.
Ram
: 128Mb.
Hard Disk
: 10 Gb.
Compact Disk
: 650 Mb.
Input device
: Standard Keyboard and Mouse.
Output device
: VGA and High Resolution Monitor.
SOFTWARE SPECIFICATION
Operating System
: Windows Family.
Techniques
: JDK 1.5 or higher
Database
: MySQL 5.0
SECURE AND VERIFIABLE POLICY UPDATE OUTSOURCING FOR
BIG DATA ACCESS CONTROL IN THE CLOUD
ABSTRACT
Due to the high volume and velocity of big data, it is an effective option to store
big data in the cloud, as the cloud has capabilities of storing big data and
processing high volume of user access requests. Attribute-Based Encryption (ABE)
www.globalsoftsolutions.in
gsstrichy@gmail.com
is a promising technique to ensure the end-to-end security of big data in the cloud.
However, the policy updating has always been a challenging issue when ABE is
used to construct access control schemes. A trivial implementation is to let data
owners retrieve the data and re-encrypt it under the new access policy, and then
send it back to the cloud. This method, however, incurs a high communication
overhead and heavy computation burden on data owners. A novel scheme is
proposed that enable efficient access control with dynamic policy updating for big
data in the cloud. Developing an outsourced policy updating method for ABE
systems is focused. This method can avoid the transmission of encrypted data and
minimize the computation work of data owners, by making use of the previously
encrypted data with old access policies. Policy updating algorithms is proposed for
different types of access policies. An efficient and secure method is proposed that
allows data owner to check whether the cloud server has updated the ciphertexts
correctly. The analysis shows that this policy updating outsourcing scheme is
correct, complete, secure and efficient.
INTRODUCTION
Big data refers to high volume, high velocity, and/or high variety information
assets that require new forms of processing to enable enhanced decision making,
insight discovery and process optimization. Due to its high volume and
complexity, it becomes difficult to process big data using on-hand database
management tools. An effective option is to store big data in the cloud, as the cloud
has capabilities of storing big data and processing high volume of user access
requests in an efficient way. When hosting big data into the cloud, the data security
becomes a major concern as cloud servers cannot be fully trusted by data owners.
www.globalsoftsolutions.in
gsstrichy@gmail.com
PROBLEM DEFINITION
The policy updating is a difficult issue in attribute-based access control systems,
because once the data owner outsourced data into the cloud, it would not keep a
copy in local systems. When the data owner wants to change the access policy, it
has to transfer the data back to the local site from the cloud, reencrypt the data
under the new access policy, and then move it back to the cloud server. By doing
so, it incurs a high communication overhead and heavy computation burden on
data owners. This motivates us to develop a new method to outsource the task of
policy updating to cloud server.
The grand challenge of outsourcing policy updating to the cloud is to guarantee the
following requirements:
1) Correctness: Users who possess sufficient attributes should still be able to
decrypt the data encrypted under new access policy by running the original
decryption algorithm.
2) Completeness: The policy updating method should be able to update any type of
access policy.
3) Security: The policy updating should not break the security of the access control
system or introduce any new security problems.
www.globalsoftsolutions.in
gsstrichy@gmail.com
EXISTING SYSTEM
 Attribute-Based Encryption (ABE) has emerged as a promising technique to
ensure the end-to-end data security in cloud storage system. It allows data
owners to define access policies and encrypt the data under the policies, such
that only users whose attributes satisfying these access policies can decrypt
the data.
 The policy updating problem has been discussed in key policy structure and
ciphertext-policy structure.
Disadvantages
 When more and more organizations and enterprises outsource data into the
cloud, the policy updating becomes a significant issue as data access policies
may be changed dynamically and frequently by data owners. However, this
policy updating issue has not been considered in existing attribute-based
access control schemes.
 Key policy structure and ciphertext-policy structure cannot satisfy the
completeness requirement, because they can only delegate key/ciphertext
with a new access policy that should be more restrictive than the previous
policy.
 Furthermore, they cannot satisfy the security requirement either.
www.globalsoftsolutions.in
gsstrichy@gmail.com
PROPOSED SYSTEM
 Focus on solving the policy updating problem in ABE systems, and propose
a secure and verifiable policy updating outsourcing method.
 Instead of retrieving and re-encrypting the data, data owners only send
policy updating queries to cloud server, and let cloud server update the
policies of encrypted data directly, which means that cloud server does not
need to decrypt the data before/during the policy updating.
 To formulate the policy updating problem in ABE sytems and develop a new
method to outsource the policy updating to the server.
 To propose an expressive and efficient data access control scheme for big
data, which enables efficient dynamic policy updating.
 To design policy updating algorithms for different types of access policies,
e.g., Boolean Formulas, LSSS Structure and Access Tree.
 To propose an efficient and secure policy checking method that enables data
owners to check whether the ciphertexts have been updated correctly by
cloud server.
www.globalsoftsolutions.in
gsstrichy@gmail.com
Advantages
 This scheme can not only satisfy all the above requirements, but also avoid
the transfer of encrypted data back and forth and minimize the computation
work of data owners by making full use of the previously encrypted data
under old access policies in the cloud.
 This method does not require any help of data users, and data owners can
check the correctness of the ciphertext updating by their own secret keys and
checking keys issued by each authority.
 This method can also guarantee data owners cannot use their secret keys to
decrypt any ciphertexts encrypted by other data owners, although their secret
keys contain the components associated with all the attributes.
www.globalsoftsolutions.in
gsstrichy@gmail.com
LITERATURE SUMMARY
Attribute-based encryption (ABE)
ABE technique is regarded as one of the most suitable technologies for data access
control in cloud storage systems.
There are two complementary forms of ABE
Key-Policy ABE (KP-ABE)
In KPABE, attributes are used to describe the encrypted data and access policies
over these attributes are built into user’s secret keys
Ciphertext-Policy ABE (CP-ABE)
In CP-ABE, attributes are used to describe the user’s attributes and the access
policies over these attributes are attached to the encrypted data.
Recently, some attribute-based access control schemes were proposed to ensure the
data confidentiality in the cloud. It allows data owners to define an access structure
on attributes and encrypt the data under this access structure, such that data owners
can define the attributes that the user needs to possess in order to decrypt the
ciphertext.
However, the policy updating becomes a difficult issue when applying ABE
methods to construct access control schemes, because once data owner outsource
the data into cloud, they won’t store in local systems.
To change the access policies of encrypted data in the cloud, a trivial method is to
let data owners retrieve the data and re-encrypt it under the new access policy, and
then send it back to the cloud server.
www.globalsoftsolutions.in
gsstrichy@gmail.com
But this method will incur a high communication overhead and heavy computation
burden on data owners.
Key-Policy Attribute-Based Encryption
This method discussed on how to change the policies on keys. Authors also
proposed a ciphertext delegation method to update the policy of ciphertext.
However, these methods cannot satisfy the completeness requirement, because
they can only delegate key/ciphertext with a new access policy which is more
restrictive than the previous policy.
They cannot satisfy the security requirement either.
www.globalsoftsolutions.in
gsstrichy@gmail.com
HARDWARE REQUIREMENTS
Processor
: Any Processor above 500 MHz.
Ram
: 128Mb.
Hard Disk
: 10 Gb.
Compact Disk
: 650 Mb.
Input device
: Standard Keyboard and Mouse.
Output device
: VGA and High Resolution Monitor.
SOFTWARE SPECIFICATION
Operating System
: Windows Family.
Techniques
: JDK 1.5 or higher
Database
: MySQL 5.0
A PRIVACY-PRESERVING FRAMEWORK FOR MANAGING MOBILE
AD REQUESTS AND BILLING INFORMATION
www.globalsoftsolutions.in
gsstrichy@gmail.com
www.globalsoftsolutions.in
gsstrichy@gmail.com
ABSTRACT
Organizations are starting to realize the significant value of advertising on mobile
devices, and a number of systems have been developed to exploit this opportunity.
From a privacy perspective, practically all systems developed so far are based
either on a trusted third-party model or on a generalized architecture. A system
proposed
for
delivering
context,
location,
time,
and
preference-aware
advertisements to mobiles with a novel architecture to preserve privacy. The main
adversary in this model is the server distributing the ads, which is trying to identify
users and track them, and to a lesser extent, other peers in the wireless network.
When a node is interested in an ad, it forms a group of nearby nodes seeking ads
and willing to cooperate to achieve privacy. Peers combine their interests using a
shuffling mechanism in an ad-hoc network and send them through a primary peer
to the ad-server. In this way, preferences are masqueraded to request custom ads,
which are then distributed by the primary peer. Another mechanism is proposed to
implement the billing process without disclosing user identities.
www.globalsoftsolutions.in
gsstrichy@gmail.com
INTRODUCTION
Whether it is TV, radio, newspapers, or the Internet, advertisements generate
substantial revenues. And, as mobile devices get more involved as media delivery
platforms, the worth of advertising on these devices becomes significant. With
billions of mobile users worldwide, it is indeed a potentially huge market for
advertising. Moreover, considering that a decent fraction of these users own
smartphones or tablets certainly expands this opportunity. These users spend
significant time browsing the different multimedia and gaming capabilities of their
devices, making them more exposed to ads. Also, these devices now come with
Wi-Fi and 3G, meaning they can be reached virtually everywhere. Add to this GPS
capability and computing user preferences, and a new level of targeted advertising
can be attained.
www.globalsoftsolutions.in
gsstrichy@gmail.com
PROBLEM STATEMENT
Personalized ads that can match users’ preferences with products and services in
their vicinities have much higher chances of succeeding in capturing these users’
attention and achieving better customer satisfaction, consequently increasing the
profitability of ads.
The same aspects that make these devices great platforms for advertising also
impose strict guidelines since they contain key private data, like contacts
information and calendar entries. Hence, proper use and confidentiality of this data
should be respected.
www.globalsoftsolutions.in
gsstrichy@gmail.com
EXISTING SYSTEM
 Mix networks use a chain of proxy servers in the routing protocol in order to
make the tracing of communications harder. The protocol shuffles the
messages received from multiple senders and sends them out to the next
destination in a random order.
 Mixes are most effective when placed in series, like forwarding nodes in
mobile ad hoc networks (MANETs), and require constant sized flowing
traffic to avoid identifying those nodes that transmit data, and thus preserve
anonymity.
 A related technique is Onion routing that calls for repeatedly encrypting
messages and sending them through network nodes, called onion routers.
 Like peeling an onion, each router removes a layer of encryption to uncover
routing instructions, and sends the message to the next router where this is
repeated.
www.globalsoftsolutions.in
gsstrichy@gmail.com
Disadvantages
 Even though some are classified as real-time mixes, the majority use
asymmetric cryptographic systems, where at the routing level they encrypt,
or decrypt then encrypt, and then reroute, which is known to introduce large
overhead.
 Some of the proposed protocols, like ZAP, do not provide communication
anonymity, while ASR uses only asymmetric cryptosystems. Many of the
approaches proposed for ad-hoc networks, implicitly assume a trusted
network operator and involve multiparty components for computing
cryptography keys and functions.
 There are several weaknesses that are associated with the proposed mix
protocols in the literature. Timing analysis is one of them, where an
adversary might know if a node is communicating with a server by
correlating when messages are sent by a server and when messages are
received by the node.
www.globalsoftsolutions.in
gsstrichy@gmail.com
PROPOSED SYSTEM
 To propose a system for delivering user or application requested ads,
tailored to match users’ preferences whilst preserving their privacy and
taking into consideration context, time, and location.
 This is done by aggregating requests and sending them through one of the
users, who later anonymously contacts the server with the list of aggregated
interests. After receiving the ads, the designated user distributes them to the
users in the same way they were collected, through an ad-hoc connection.
 Billing reports of clicks ads are managed much in the same manner, and
piggybacked on requests for ads.
 This prohibits the server distributing the ads from identifying users or
associating them with preferences, times, and locations.
www.globalsoftsolutions.in
gsstrichy@gmail.com
Advantages
 A simpler overall system that allows peers to send requests any time, and
does not require them to back-off for a certain time after becoming primary.
 An extended fairness method that makes fairness in the system long-lived,
i.e., widespread among all peers, and not temporary where it only applies to
peers in the same group.
 A new billing system that does not rely on a trusted third party model
(server).
 A more robust shuffling technique with multiple encryption levels that
greatly increases privacy.
 An aggregation scheme that retains privacy even when the number of peers
in the group is small.
 A new caching system that stores not only application requests but also
specific requested ads.
 Algorithms that make the system more resilient to malicious attempts to
breach user privacy.
 Mobile advertising relies on content providers like applications and
webpages to deliver ads to users. Service providers register ads to an adserver, which delivers them to users through content providers who usually
subscribe to host ads for profit making.
 When a user accesses an application subscribed to an ad-server, the
application requests an ad from the server with the user location and id.
www.globalsoftsolutions.in
gsstrichy@gmail.com
 The server then checks based on the id the interests of the user through an
online profile, and delivers targeted ads that refer to service providers in the
vicinity of the user which are relevant to his interests.
 After the user clicks the delivered ad, a click report is sent to the ad-server
for billing purposes.
 Ad server has the ability to track users even if it declares that such
information is not being stored, knowing that most ad-providers
acknowledge that they store such information.
 The ad-server has access to all the users’ personal information including
their interests and location info, and thus it can easily profile users. Even
though such privacy invasion of user personal information is currently
regulated by the industry, several users decide not to opt-in because of
privacy concerns. Thus, implementing a privacy preserving architecture will
ensure a greater extent of penetration of targeted advertising.
www.globalsoftsolutions.in
gsstrichy@gmail.com
LITERATURE SUMMARY
MobiAd
MobiAd sends ads target users geographically based on their interests. The user’s
profile is kept local and isolated from other applications and from the server.
Billing is addressed by the architecture through click reports that contain the
pseudorandom IDs of the ads, and are aggregated and sent through delay tolerant
networks toward the ad provider.
Drawbacks
This work though does not specify important details like the frequency of
broadcasts which might not be available when users actually require ads. It also
suggests that users cache ads, but this will not work for localized ads since users’
locations could change. Also, ads are pre-fetched and stored locally, the
broadcasted ads may not necessarily match the interests of all users in the vicinity.
MoMa-system
MoMa-system was introduced as a mobile marketing platform, and was compared
to another advertising system. A request for an ad containing the user’s references
to his profiles is sent to an anonymizer, a trustworthy party, and saved in its
database. The anonymizer encrypts the private user data and sends the request to a
server, thus obscuring the original IP where the request came from. In turn, the
server sends the user the specific ads.
Drawbacks
MoMa does not specify a billing scheme.
www.globalsoftsolutions.in
gsstrichy@gmail.com
BlueMall
BlueMall is presented for mobile advertising in a mall, based on a hybrid system of
a wired core network and a wireless edge network (Bluetooth). When an access
point detects a mobile user with activated Bluetooth, it checks its database for
previous interactions and stored frequent zones to provide related advertising.
BlueMall keeps track of the ads the users are receiving to avoid spamming them
and allows them to opt out from this service by deactivating their Bluetooth
connection.
Drawbacks
The model however does not account for privacy concerns, since the database
contains all necessary information to profile users and track them, as it stores
users’ visits, frequent zones, and mobility behaviors.
B-MAD
B-MAD is another system, which relies on proximity to known Bluetooth devices
to determine the user’s location. In a typical scenario, the devices would report the
location and Bluetooth address of a user to the ad server which tries to recognize
him and send location-based ads through service messages. The user can see the ad
by clicking on the URL in the message after reading its description.
Drawbacks
This system has problems like inaccurate determined locations, large time delays,
substantial privacy and security issues, and non-personalized advertising.
www.globalsoftsolutions.in
gsstrichy@gmail.com
Google’s AdMob and Apple’s iAd
Google’s AdMob and Apple’s iAd are the most popular applications that deliver
targeted advertising on mobile devices. To deliver ads that are of interest to users,
AdMob collects information such as session information, browser cookies, device
type, carrier provider, IP addresses, device ID, carrier user ID, geo-location
information, sites visited, and clicks on advertisements. In a very similar way, iAd
delivers interest related advertisements by using cookies and other technologies in
mobile advertising services.
Drawbacks
Obviously, both Google and Apple are storing data and interests that identify each
individual, and hence user privacy may be compromised.
AdDroid
AdDroid is proposed as a tool to separate the privilege given to advertisers in
Android from the application requesting the ads. Based on the notion that a great
percentage of applications are granted the privilege of accessing the user’s
preferences due to ads, AdDroid introduces an API with advertisement permissions
for Android as an intermediary party that supplies the user’s preferences to the
advertising networks. The application provides the API with specific data to
identify which network to fetch data from, and hence it will not be granted the
privilege to access the user’s preferences.
Drawbacks
This system increases privacy, but it still grants the advertising network full access
to the user’s personal interests.
www.globalsoftsolutions.in
gsstrichy@gmail.com
HARDWARE REQUIREMENTS
Processor
: Any Processor above 500 MHz.
Ram
: 128Mb.
Hard Disk
: 10 Gb.
Compact Disk
: 650 Mb.
Input device
: Standard Keyboard and Mouse.
Output device
: VGA and High Resolution Monitor.
SOFTWARE SPECIFICATION
Operating System
: Windows Family.
Techniques
: JDK 1.5 or higher
Database
: MySQL 5.0
Defending Against Collaborative Attacks by Malicious Nodes in
MANETs: A Cooperative Bait Detection Approach
In mobile ad hoc networks (MANETs), a primary requirement for the
establishment of communication among nodes is that nodes should cooperate
with each other. In the presence of malevolent nodes, this requirement may
www.globalsoftsolutions.in
gsstrichy@gmail.com
lead to serious security concerns; for instance, such nodes may disrupt the
routing process. In this context, preventing or detecting malicious nodes
launching grayhole or collaborative blackhole attacks is a challenge. This
paper attempts to resolve this issue by designing a dynamic source routing
(DSR)-based routing mechanism, which is referred to as the cooperative bait
detection scheme (CBDS), that integrates the advantages of both proactive
and reactive defense architectures. Our CBDS method implements a reverse
tracing technique to help in achieving the stated goal. Simulation results are
provided, showing that in the presence of malicious-node attacks, the CBDS
outperforms the DSR, 2ACK, and best-effort fault-tolerant routing (BFTR)
protocols (chosen as benchmarks) in terms of packet delivery ratio and
routing overhead (chosen as performance metrics).
EXISTING
SYSTEM
* Detection mechanisms that have been proposed so far can be grouped into
two
broad
categories.
Proactive
detection
schemes
*
Schemes that need to constantly detect or monitor nearby nodes.
* Regardless of the existence of malicious nodes, the overhead of detection
is constantly created, and the resource used for detection is constantly
wasted.
* One of the advantages of these types of schemes is that it can help in
preventing
or
avoiding
an
attack
in
its
initial
stage.
* Liu et al. proposed a 2ACK scheme for the detection of routing misbehavior
in MANETs. In this scheme, two-hop acknowledgement packets are sent in
the opposite direction of the routing path to indicate that the data packets
have been successfully received. A parameter acknowledgment ratio, i.e.,
Rack, is also used to control the ratio of the received data packets for which
the acknowledgment is required. This scheme belongs to the class of
proactive schemes and, hence, produces additional routing overhead
regardless of the existence of malicious nodes.
Reactive
detection
* Schemes are those that trigger only when the destination node detects a
significant
drop
in
the
packet
delivery
ratio.
* Xue and Nahrstedt proposed a prevention mechanism called best-effort
fault-tolerant routing (BFTR). Their BFTR scheme uses end-to-end
acknowledgements to monitor the quality of the routing path to be chosen by
the destination node. If the behavior of the path deviates from a predefined
behavior set for determining “good” routes, the source node uses a new route.
www.globalsoftsolutions.in
gsstrichy@gmail.com
Disadvantages
* Existing solutions deal with the detection of a single malicious node or
require enormous resource in terms of time and cost for detecting cooperative
blackhole
attacks.
* Existing methods require specific environments or assumptions in order to
operate.
* Under BFTR scheme, malicious nodes may still exist in the new chosen
route, and this scheme is prone to repeated route discovery processes, which
may lead to significant routing overhead.
PROPOSED
SYSTEM
* To propose a detection scheme called the cooperative bait detection
scheme (CBDS), which aims at detecting and preventing malicious nodes
launching
grayhole/collaborative
blackhole
attacks
in
MANETs.
* The source node stochastically selects an adjacent node with which to
cooperate, in the sense that the address of this node is used as bait
destination address to bait malicious nodes to send a reply RREP message.
* Malicious nodes are thereby detected and prevented from participating in
the
routing
operation,
using
a
reverse
tracing
technique.
*
CBDS
is
DSR-based.
* As such, it can identify all the addresses of nodes in the selected routing
path from a source to destination after the source has received the RREP
message.
ADVANTAGES
* Proposed detection scheme takes advantage of the characteristics of both
the reactive and proactive schemes to design a DSR-based routing scheme
able to detect grayhole/ collaborative blackhole attacks in MANETs