NS2 2012 BE and ME final year projects.

1. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
NS2 PROJECTS 2012
1. The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile
Sinks – projects 2012
ABSTRACT
Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications
for efficient data accumulation, localized sensor reprogramming, and for
distinguishing and revoking compromised sensors. However, in sensor networks
that make use of the existing key predistribution schemes for pairwise key
establishment and authentication between sensor nodes and mobile sinks, the
employment of mobile sinks for data collection elevates a new security challenge:
in the basic probabilistic and q-composite key predistribution schemes, an
attacker can easily obtain a large number of keys by capturing a small fraction of
nodes, and hence, can gain control of the network by deploying a replicated
mobile sink preloaded with some compromised keys. This article describes a
three-tier general framework that permits the use of any pairwise key
predistribution scheme as its basic component. The new framework requires two
separate key pools, one for the mobile sink to access the network, and one for
pairwise key establishment between the sensors. To further reduce the damages
caused by stationary access node replication attacks, we have strengthened the
authentication mechanism between the sensor and the stationary access node in
the proposed framework. Through detailed analysis, we show that our security

2. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
framework has a higher network resilience to a mobile sink replication attack as
compared to the polynomial pool-based scheme.
2. TAM: A Tiered Authentication of Multicast Protocol for Ad-Hoc Networks –
projects 2012
ABSTRACT:
Ad-hoc networks are becoming an effective tool for many mission critical
applications such as troop coordination in a combat field, situational awareness,
etc. These applications are characterized by the hostile environment that they
serve in and by the multicast-style of communication traffic. Therefore,
authenticating the source and ensuring the integrity of the message traffic
become a fundamental requirement for the operation and management of the
network. However, the limited computation and communication resources, the
large scale deployment and the unguaranteed connectivity to trusted authorities
make known solutions for wired and single-hop wireless networks inappropriate.
This paper presents a new Tiered Authentication scheme for Multicast traffic
(TAM) for large scale dense ad-hoc networks. TAM combines the advantages of
the time asymmetry and the secret information asymmetry paradigms and
exploits network clustering to reduce overhead and ensure scalability. Multicast
traffic within a cluster employs a one-way hash function chain in order to
authenticate the message source. Cross-cluster multicast traffic includes
message authentication codes (MACs) that are based on a set of keys. Each

3. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
cluster uses a unique subset of keys to look for its distinct combination of valid
MACs in the message in order to authenticate the source. The simulation and
analytical results demonstrate the performance advantage of TAM in terms of
bandwidth overhead and delivery delay
3. Design and Implementation of TARF: A Trust-Aware Routing Framework for
WSNs- projects 2012
ABSTRACT:
The multihop routing in wireless sensor networks (WSNs) offers little protection
against identity deception through replaying routing information. An adversary
can exploit this defect to launch various harmful or even devastating attacks
against the routing protocols, including sinkhole attacks, wormhole attacks, and
Sybil attacks. The situation is further aggravated by mobile and harsh network
conditions. Traditional cryptographic techniques or efforts at developing trust-
aware routing protocols do not effectively address this severe problem. To
secure the WSNs against adversaries misdirecting the multihop routing, we have
designed and implemented TARF, a robust trust-aware routing framework for
dynamic WSNs. Without tight time synchronization or known geographic
information, TARF provides trustworthy and energy-efficient route. Most
importantly, TARF proves effective against those harmful attacks developed out
of identity deception; the resilience of TARF is verified through extensive
evaluation with both simulation and empirical experiments on large-scale WSNs

4. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
under various scenarios including mobile and RF-shielding network conditions.
Further, we have implemented a low-overhead TARF module in TinyOS; as
demonstrated, this implementation can be incorporated into existing routing
protocols with the least effort. Based on TARF, we also demonstrated a proof-of-
concept mobile target detection application that functions well against an
antidetection mechanism.
4. ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation
in Wireless Sensor Networks Using Sequential Hypothesis Testing-
projects 2012
ABSTRACT:
Due to the unattended nature of wireless sensor networks, an adversary can
physically capture and compromise sensor nodes and then mount a variety of
attacks with the compromised nodes. To minimize the damage incurred by the
compromised nodes, the system should detect and revoke them as soon as
possible. To meet this need, researchers have recently proposed a variety of
node compromise detection schemes in wireless ad hoc and sensor networks.
For example, reputation-based trust management schemes identify malicious
nodes but do not revoke them due to the risk of false positives. Similarly,
software-attestation schemes detect the subverted software modules of
compromised nodes. However, they require each sensor node to be attested
periodically, thus incurring substantial overhead. To mitigate the limitations of the
existing schemes, we propose a zone-based node compromise detection and
revocation scheme in wireless sensor networks. The main idea behind our
scheme is to use sequential hypothesis testing to detect suspect regions in which
compromised nodes are likely placed. In these suspect regions, the network

5. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
operator performs software attestation against sensor nodes, leading to the
detection and revocation of the compromised nodes. Through quantitative
analysis and simulation experiments, we show that the proposed scheme detects
the compromised nodes with a small number of samples while reducing false
positive and negative rates, even if a substantial fraction of the nodes in the zone
are compromised. Additionally, we model the detection problem using a game
theoretic analysis, derive the optimal strategies for the attacker and the defender,
and show that the attacker’s gain from node compromise is greatly limited by the
defender when both the attacker and the defender follow their optimal strategies.
5. Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network-
Mobile Computing, projects 2012
ABSTRACT
In a mobile ad hoc network, the mobility and resource constraints of mobile
nodes may lead to network partitioning or performance degradation. Several data
replication techniques have been proposed to minimize performance
degradation. Most of them assume that all mobile nodes collaborate fully in terms
of sharing their memory space. In reality, however, some nodes may selfishly
decide only to cooperate partially, or not at all, with other nodes. These selfish
nodes could then reduce the overall data accessibility in the network. In this
paper, we examine the impact of selfish nodes in a mobile ad hoc network from
the perspective of replica allocation. We term this selfish replica allocation. In
particular, we develop a selfish node detection algorithm that considers partial
selfishness and novel replica allocation techniques to properly cope with selfish

6. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
replica allocation. The conducted simulations demonstrate the proposed
approach outperforms traditional cooperative replica allocation techniques in
terms of data accessibility, communication cost, and average query delay.
6. Cut Detection in Wireless Sensor Networks – projects 2012
ABSTRACT:
A wireless sensor network can get separated into multiple connected components due
to the failure of some of its nodes, which is called a “cut.” In this paper, we consider the
problem of detecting cuts by the remaining nodes of a wireless sensor network. We
propose an algorithm that allows 1) every node to detect when the connectivity to a
specially designated node has been lost, and 2) one or more nodes (that are connected
to the special node after the cut) to detect the occurrence of the cut. The algorithm is
distributed and asynchronous: every node needs to communicate with only those nodes
that are within its communication range. The algorithm is based on the iterative
computation of a fictitious “electrical potential” of the nodes. The convergence rate of
the underlying iterative scheme is independent of the size and structure of the network.
We demonstrate the effectiveness of the proposed algorithm through simulations and a
real hardware implementation.

7. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
7. fast Data Collection in Tree-Based Wireless Sensor Networks- Mobile
Computing, projects 2012
Abstract:Fast Data Collection in Tree-Based Wireless Sensor Networks
We investigate the following fundamental question – how fast can information be
collected from a wireless sensor network organized as tree? To address this, we
explore and evaluate a number of different techniques using realistic simulation models
under the many-to-one communication paradigm known as convergecast. We first
consider time scheduling on a single frequency channel with the aim of minimizing the
number of time slots required (schedule length) to complete a convergecast. Next, we
combine scheduling with transmission power control to mitigate the effects of
interference, and show that while power control helps in reducing the schedule length
under a single frequency, scheduling transmissions using multiple frequencies is more
efficient. We give lower bounds on the schedule length when interference is completely
eliminated, and propose algorithms that achieve these bounds. We also evaluate the
performance of various channel assignment methods and find empirically that for
moderate size networks of about 100 nodes, the use of multi-frequency scheduling can
suffice to eliminate most of the interference. Then, the data collection rate no longer
remains limited by interference but by the topology of the routing tree. To this end, we
construct degree-constrained spanning trees and capacitated minimal spanning trees,
and show significant improvement in scheduling performance over different deployment
densities. Lastly, we evaluate the impact of different interference and channel models
on the schedule length.

8. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
8. Hop-by-Hop Routing in Wireless Mesh Networks with Bandwidth
Guarantees- Mobile Computing, projects 2012
Abstract:
Wireless Mesh Network (WMN) has become an important edge network to provide
Internet access to remote areas and wireless connections in a metropolitan scale. In
this paper, we study the problem of identifying the maximum available bandwidth path,
a fundamental issue in supporting quality-of-service in WMNs. Due to interference
among links, bandwidth, a well-known bottleneck metric in wired networks, is neither
concave nor additive in wireless networks. We propose a new path weight which
captures the available path bandwidth information. We formally prove that our hop-by-
hop routing protocol based on the new path weight satisfies the consistency and loop-
freeness requirements. The consistency property guarantees that each node makes a
proper packet forwarding decision, so that a data packet does traverse over the
intended path. Our extensive simulation experiments also show that our proposed path
weight outperforms existing path metrics in identifying high-throughput paths.
Wireless Mesh Network (WMN) has become an important edge network to provide
Internet access to remote areas and wireless connections in a metropolitan scale. In
this paper, we study the problem of identifying the maximum available bandwidth path,
a fundamental issue in supporting quality-of-service in WMNs. Due to interference
among links, bandwidth, a well-known bottleneck metric in wired networks, is neither
concave nor additive in wireless networks. We propose a new path weight which
captures the available path bandwidth information. We formally prove that our hop-by-
hop routing protocol based on the new path weight satisfies the consistency and loop-
freeness requirements. The consistency property guarantees that each node makes a

9. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
proper packet forwarding decision, so that a data packet does traverse over the
intended path. Our extensive simulation experiments also show that our proposed path
weight outperforms existing path metrics in identifying high-throughput paths.
9. Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc
Networks- Mobile Computing, projects 2012
Abstract:Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc
Networks
This paper addresses the problem of delivering data packets for highly dynamic mobile
ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols
are susceptible to node mobility, especially for large-scale networks. Driven by this
issue, we propose an efficient Position-based Opportunistic Routing (POR) protocol
which takes advantage of the stateless property of geographic routing and the
broadcast nature of wireless medium. When a data packet is sent out, some of the
neighbor nodes that have overheard the transmission will serve as forwarding
candidates, and take turn to forward the packet if it is not relayed by the specific best
forwarder within a certain period of time. By utilizing such in-the-air backup,
communication is maintained without being interrupted. The additional latency incurred
by local route recovery is greatly reduced and the duplicate relaying caused by packet
reroute is also decreased. In the case of communication hole, a Virtual Destination-
based Void Handling (VDVH) scheme is further proposed to work together with POR.
Both theoretical analysis and simulation results show that POR achieves excellent

10. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
performance even under high node mobility with acceptable overhead and the new void
handling scheme also works well
10. Minimizing Delay And Maximizing Lifetime For Wireless Sensor Networks With
Any Cast
ABSTRACT:
In this paper, we are interested in minimizing the delay and maximizing the lifetime of
event-driven wireless sensor networks for which events occur infrequently. In such
systems, most of the energy is consumed when the radios are on, waiting for a packet
to arrive. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of
these energy-constrained wireless sensor networks. However, sleep-wake scheduling
could result in substantial delays because a transmitting node needs to wait for its next-
hop relay node to wake up. An interesting line of work attempts to reduce these delays
by developing ¿anycast¿-based packet forwarding schemes, where each node
opportunistically forwards a packet to the first neighboring node that wakes up among
multiple candidate nodes. In this paper, we first study how to optimize the anycast
forwarding schemes for minimizing the expected packet-delivery delays from the sensor
nodes to the sink. Based on this result, we then provide a solution to the joint control
problem of how to optimally control the system parameters of the sleep-wake
scheduling protocol and the anycast packet-forwarding protocol to maximize the
network lifetime, subject to a constraint on the expected end-to-end packet-delivery
delay. Our numerical results indicate that the proposed solution can outperform prior
heuristic solutions in the literature, especially under practical scenarios where there are
obstructions, e.g., a lake or a mountain, in the coverage area of the wireless sensor
network.

11. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
11. Optimize Storage Placement In Sensor Networks
ABSTRACT:
Data storage has become an important issue in sensor networks as a large amount of
collected data need to be archived for future information retrieval. Storage nodes
are introduced in this paper to store the data collected from the sensors in their
proximities. The storage nodes alleviate the heavy load of transmitting all data to a
central place for archiving and reduce the communication cost induced by the
network query. The objective of this paper is to address the storage node
placement problem aiming to minimize the total energy cost for gathering data to
the storage nodes and replying queries. We examine deterministic placement of
storage nodes and present optimal algorithms based on dynamic programming.
Further, we give stochastic analysis for random deployment and conduct
simulation evaluation for both deterministic and random placements of storage
nodes.
12. Secure Data Collection In Wireless Sensor Networks Using Randomized
Dispersive Routes

12. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
Compromised-node and denial-of-service are two key attacks in wireless sensor
networks (WSNs). In this paper, we study routing mechanisms that circumvent
(bypass) black holes formed by these attacks. We argue that existing multi-path
routing approaches are vulnerable to such attacks, mainly due to their
deterministic nature. So once an adversary acquires the routing algorithm, it can
compute the same routes known to the source, and hence endanger all
information sent over these routes. In this paper, we develop mechanisms that
generate randomized multipath routes. Under our design, the routes taken by the
“shares” of different packets change over time. So even if the routing
algorithm becomes known to the adversary, the adversary still cannot pinpoint
the routes traversed by each packet. Besides randomness, the routes generated
by our mechanisms are also highly dispersive and energy-efficient, making them
quite capable of bypassing black holes at low energy cost. Extensive simulations
are conducted to verify the validity of our mechanisms.
13. Performance Modeling of Message Dissemination In Vehicular Ad Hoc Networks
with Priority
ABSTRACT:
In this paper, we present an analytical study for the performance of message
dissemination in vehicular ad hoc networks (VANETs) with two priority classes. It
is assumed that the message traffic generated by event-driven safety
applications has higher priority compared to the remaining network traffic. First,
we derive the distribution of the number of concurrent transmissions of lower
priority messages in the system at the steady state, through a birth-death
process analysis. The distribution has a simple product form solution. We also
derive the percentage of destination node population which cannot receive the
message error free due to interference. Subsequently, we determine the

13. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
average forwarding distance and the number of nodes which receive a high-
priority message in the presence of low-priority traffic. Numerical results are
provided along with simulation results that confirm the accuracy of the proposed
analysis. The distribution of the number of concurrent transmissions is shown to
have a bell-shape curve. Results also show that larger transmission ranges do
not necessarily improve the per hop safety-message forwarding distance as
more nodes may be exposed to interference, especially in networks with higher
node densities.
14. An Attribute-Based Access Control System for Emergency Services over
Vehicular Ad Hoc Networks
ABSTRACT
In this paper, we propose an Attribute-Based Access Control System (ABACS) for
emergency services with security assurance over Vehicular Ad Hoc Networks
(VANETs). ABACS aims to improve the efficiency of rescues mobilized via
emergency communications over VANETs. By adopting fuzzy identity-based
encryption, ABACS can select the emergency vehicles that can most appropriately
deal with an emergency and securely delegate the authority to control traffic
facilities to the assigned emergency vehicles. Using novel cryptographic
preliminaries, ABACS realizes confidentiality of messages, prevention of collusion
attacks, and fine-grained access control. As compared to the current PKI scheme,
the computational delay and transmission overhead can be reduced by exploiting
the advantages afforded by message broadcasting, which is heavily used in ABACS.
The performance evaluation demonstrates that ABACS is a suitable candidate for
realizing emergency services via VANETs.

14. IEEE 2012 NS2 Titles & Abstract
FOR REGISTER: www.finalyearstudentsproject.com
CONTACT NO.: 91-9176696486.
Address: No.73, karuneegar street, Adambakkam, Chennai-88
15. Delaying Transmissions in Data Communication Networks to Improve
Transport-Layer Performance
ABSTRACT
Packet losses in the network have a considerable performance impact on transport-
layer throughput. For reliabledata transfer, lost packets require retransmissions and
thus cause very long delays. This tail of the packet delaydistribution
causes performance problems. There are several approaches to trading
off networking resources up-front to reduce long delays for some packets (e.g., forward
error correction, network coding). We propose packet pacing as an alternative that
changes traffic characteristics favorably by adding
intentional delay inpacket transmissions. This intentional delay counters the principle of
best effort but can reduce the burstiness of traffic and improve overall network operation
- in particular in network with small packet buffers. As a result,
pacing improves transport-layer performance, providing a tradeoff example where small
amounts of additionaldelay can significantly increase connection bandwidth. We present
a Queue Length Based Pacing (QLBP) algorithm that paces network traffic using a
single queue and that can be implemented with small computational and memory
overhead. We present a detailed analysis on delay bounds and the quantitative impact
of QLBP pacing on network traffic. Through simulation, we show how the proposed
pacing technique can improveconnection throughput in small-buffer networks.