Scribd
Upload
71 views

IEEE Java Projects Abstract 2010

Uploaded by

Balraj Sadashivappa
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
71 views

IEEE Java Projects Abstract 2010

Uploaded by

Balraj Sadashivappa
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Project – 1

BSMR: Byzantine-Resilient Secure Multicast Routing in Multihop Wireless


Networks

Multihop wireless networks rely on node cooperation to provide multicast


services. The multihop communication offers increased coverage for such
services but also makes them more vulnerable to insider (or Byzantine) attacks
coming from compromised nodes that behave arbitrarily to disrupt the
network. In this work, we identify vulnerabilities of on-demand multicast
routing protocols for multihop wireless networks and discuss the challenges
encountered in designing mechanisms to defend against them. We propose
BSMR, a novel secure multicast routing protocol designed to withstand insider
attacks from colluding adversaries. Our protocol is a software-based solution
and does not require additional or specialized hardware.

Project - 2
Connection-Based Scheduling for Supporting Real-Time Traffic in Wireless
Mesh Networks

Aim

Packet transmission scheduling for supporting real time traffic in aWMN


is difficult, and one of the main challenges is to coordinate temporal operations
of the mesh access points (APs) in order to provide strict latency guarantee
while efficiently utilizing the radio resources.

Synopsis

In infrastructure-based wireless mesh networks (WMNs), such as a


wireless local area network (WLAN) mesh network, mesh access points (APs)
are connected to each other via one or multiple hops. Each AP is responsible
for forwarding packets for the end users associated to it as well as exchanging
packets with neighboring APs based on the destinations of the packets. This is
a very challenging issue in WMNs due to the fact that each AP may receive
packets from and forward packets to multiple other APs, but each radio in an
AP can only communicate with one other AP at a time. In existing bottleneck
first scheduling (BFS) scheme, which achieves capacity performance very close
to the global optimal results. However, the complexity of BFS can be high due
to the fact that the scheme tries to coordinate transmission times at different
APs for different connections. For each connection, the order of making
scheduling decisions for each of its hops is not necessarily the same as the
order in which the packets are forwarded.

Project - 3
Distributed Energy-Efficient Cooperative Routing in Wireless Networks

Abstract

We propose a cooperation-based routing algorithm, namely, the Minimum


Power Cooperative Routing (MPCR) algorithm, which makes full use of the
cooperative communications while constructing the minimum-power route. The
MPCR algorithm constructs the minimum-power route, which guarantees
certain throughput, as a cascade of the minimum-power single-relay building
blocks from the source to the destination. Thus, any distributed shortest path
algorithm can be utilized to find the optimal cooperative route with polynomial
complexity. Using analysis, we show that the MPCR algorithm can achieve
power saving of 65.61% in regular linear networks and 29.8% in regular grid
networks compared to the existing cooperation-based routing algorithms,
where the cooperative routes are constructed based on the shortest-path
routes.

Project - 4
Energy-Efficient SINR-Based Routing for Multi-hop Wireless Networks

Abstract:

We develop an energy-efficient routing scheme that takes into account the


interference created by existing flows in the network. The routing scheme chooses a
route such that the network expends the minimum energy satisfying with the
minimum constraints of flows. Unlike previous works, we explicitly study the impact of
routing a new flow on the energy consumption of the network. Using implementation.
We show that the routes chosen by our algorithm (centralized and distributed) are
more energy efficient than the state of the art.

Algorithm / Technique used:

Energy Efficient Routing Technique

Project - 5

Improving Security of Real-Time Wireless Networks through Packet Scheduling

Abstract:

In this paper we remedy this problem by proposing a novel dynamic security-aware packet-
scheduling algorithm, which is capable of achieving high quality of security for real-time packets while
making the best effort to guarantee real-time requirements (e.g., deadlines) of those packets. We
conduct extensive simulation experiments to evaluate the performance of our algorithm. Experimental
results show that compared with two baseline algorithms, the proposed algorithm can substantially
improve both quality of security and real-time packet guarantee ratio under a wide range of workload
characteristics.

Project - 6

Message Authentication in Computationally Constrained Environments

Abstract

RFID and Wireless Sensor Networks exemplify computationally


constrained environments, where the compact nature of the components
cannot support complex computations or high communication overhead. On
the other hand, such components should support security applications such as
message integrity, authentication, and time stamping. The latter are efficiently
implemented by Hash Message Authentication Codes (HMAC). As clearly stated
in the literature, current approved implementations of HMAC require resources
that cannot be supported in constrained components. An approach to
implement a compact HMAC by the use of stream ciphering is presented in this
paper.

Project - 7
On the Security of Route Discovery in MANETs

Abstract

In this paper, we show that the security proof for the route discovery
algorithm endairA is flawed, and moreover, this algorithm is vulnerable to a
hidden channel attack. We also analyze the security framework that was used
for route discovery and argue that composability is an essential feature for
ubiquitous applications. We conclude by discussing some of the major security
challenges for route discovery in MANETs.

Project - 8
Optimal Routing and Data Aggregation for Maximizing Lifetime of
Wireless Sensor Networks
Abstract:
An optimal routing and data aggregation scheme for wireless sensor
networks is proposed in this paper. The objective is to maximize the network
lifetime by jointly optimizing data aggregation and routing. We adopt a model to
integrate data aggregation with the underlying routing scheme and present a
smoothing approximation function for the optimization problem. The necessary
and sufficient conditions for achieving the optimality are derived and a
distributed gradient algorithm is designed accordingly. We show that the
proposed scheme can significantly reduce the data traffic and improve the
network lifetime. The distributed algorithm can converge to the optimal value
efficiently under all network configurations.

Project - 9
Route Stability in MANETs under the Random Direction Mobility Model

Abstract:

A fundamental issue arising in mobile ad hoc networks (MANETs) is the


selection of the optimal path between any two nodes. A method that has been
advocated to improve routing efficiency is to select the most stable path so as to
reduce the latency and the overhead due to route reconstruction. In this work, we
study both the availability and the duration probability of a routing path that is
subject to link failures caused by node mobility. In particular, we focus on the case
where the network nodes move according to the Random Direction model, and we
derive both exact and approximate (but simple) expressions of these probabilities.
Through our results, we study the problem of selecting an optimal route in terms of
path availability. Finally, we propose an approach to improve the efficiency of reactive
Routing protocols.

Algorithm / Technique used:

Random Direction model

You might also like