06-03-2013, 02:50 PM
Improved Throughput in Mobile Ad Hoc Networks by Multihop Relay Scheme
Improved Throughput.pptx (Size: 233.98 KB / Downloads: 19)
ABSTRACT
In communication networks throughput is the average rate of successful message delivery over a communication channel. Throughput capacity in mobile ad hoc networks has been studied extensively under many different mobility models.
we investigate the throughput capacity under a more practical restricted random mobility model, and attempt to provide a smooth trade-off between throughput and delay to fill the big gap existing in the literature.
By proposing a new multihop relay scheme, we present smooth trade-offs between throughput and delay by controlling nodes’ mobility.
Existing System
In existing system most previous research assumes global mobility, and the results show that a constant per-node throughput can be achieved at the cost of very high delay.
Thus, we are having a very big gap here, i.e., either low throughput and low delay in static networks or high throughput and high delay in mobile networks.
The network area is fixed and the density of nodes increases as fast as the number of nodes n, the per-node throughput capacity in random ad hoc networks scales and the per-node transport capacity in arbitrary ad hoc networks scales as, respectively, i.e., wireless ad hoc networks cannot scale.
Proposed System
We propose a new multihop relaying scheme, and investigate the throughput, delay, and mobility in wireless ad hoc networks.
Instead of global mobility, we consider a more practical restricted random mobility model, and find that we can provide smooth trade-offs between throughput and delay in mobile ad hoc networks by controlling nodes mobility pattern.
And also we propose joint coding scheduling algorithms to achieve the optimal throughput and delay trade-off.
SERVER MODULE:
Server Module is the first module. This module contains the data of the connectivity nodes. If the source node is added, the server block shows the node of the IP address which was added.
The maintaining process is source node, relay node and destination node. A cell in which the source node of a packet is located is called a Source Cell.
The other cells which a packet goes through are called Relay Cells. In this process we focus on the capacity of mobile ad hoc networks in the unicast case without any coding schemes.
CONCLUSION
Mobile ad hoc networks have been proved to be able to provide non diminishing per-node throughput even when the number of nodes in the network goes to infinity.
In other cases, we expect high throughput, but can tolerant a reasonable length of delay. A delay tolerant network (DTN) or a social network can be such an example.
Instead of global mobility, we consider a more practical restricted random mobility model, and find that we can provide smooth trade-offs between throughput and delay in mobile ad hoc networks by controlling nodes’ mobility pattern.