Throughput Maximization for Multi-Hop

Wireless Networks with Network-Wide

Energy Constraint

Abstract
In a wireless sensor network, sensor nodes monitor the environment, detect events
of interest, produce data, and collaborate in forwarding the data toward a host. An
unattended and hostile environment to perform the monitoring and data collection
tasks. When it is deployed in such an environment, it lacks physical protection and
is subject to node compromise.
Multi-Hop Wireless Networks are characterized by the sporadic connectivity
between their nodes and therefore the lack of stable end-to-end paths from source
to destination. Since the future node connections are mostly unknown in these
networks, opportunistic forwarding is used to deliver messages. However, making
effective forwarding decisions using only the network characteristics (i.e. average
intermeeting time between nodes) extracted from contact history is a challenging
problem. We then look at the effects of the proposed metric on the shortest path
based routing designed for delay tolerant networks. We propose Conditional
Shortest Path Routing (CSPR) protocol that routes the messages over conditional
shortest paths in which the cost of links between nodes is defined by conditional
intermeeting times rather than the conventional intermeeting times. Through trace-
driven simulations, we demonstrate that CSPR achieves higher delivery rate and
lower end-to-end delay compared to the shortest path based routing protocols that
use the conventional intermeeting time as the link metric.

EXISTING SYSTEM
Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult
due to the fact that the network graph is rarely (if ever) connected.
A key challenge is to find a route that can provide good delivery
performance and low end-to-end delay in a disconnected network graph
where nodes may move freely.
Some bridge nodes are identified based on their centrality characteristics,
i.e., on their capability to broker information exchange among otherwise
disconnected nodes.










PROPOSED SYSTEM

Data caching strategy for ad hoc networks whose nodes exchange
information items in a peer-to-peer fashion.
Extensive analysis and simulations have been conducted to verify the
effectiveness and efficiency of the scheme.
We propose Conditional Shortest Path Routing (CSPR) protocol that routes
the messages over conditional shortest paths in which the cost of links
between nodes is defined by conditional intermeeting times rather than the
conventional intermeeting times.
We demonstrate that CSPR achieves higher delivery rate and lower end-to-
end delay compared to the shortest path based routing protocols that use the
conventional intermeeting time as the link metric.
The results in this paper offer both theoretical solutions and practical
insights to network operators when total energy consumption is of interest
while maximizing network throughput.








SOFTWARE REQUIREMENTS

Platform : JAVA (JDK1.6)
Frontend : Java swing
IDE : Net Beans 6.9
Operating System : Windows XP

HARDWARE REQUIREMENTS
RAM : 1GB
Hard disk : 40GB
Processor : Intel(R) Core 2 Duo (2.00 GHz)