Route optimization in mobile adhoc networks

Ace p.

Order the writing of a tailor-made Computer science Term papers

Free quote online

Thesis Format .pdf

Route optimization in mobile adhoc networks

Download

Read an extract

Reader
Abstract
Contents
Extract

Abstract

With the increase of portable devices as well as progress in wireless communications, ad hoc networking is gaining importance with the increasing number of widespread applications. Ad hoc networking can be applied in places where there is little or no communication infrastructure or existing infrastructure is expensive or inconvenient to use. In MANETs, nodes do not have a priori knowledge of topology of network around them, they have to discover it. These networks are rapidly deployable community networks, which are the largely hobbyist-led development of interlinked computer networks. MANETs use limited network management and administration, in order to establish communications, dynamically. These algorithms need to keep routing table reasonably small, choose best route for given destination (fastest, most reliable, highest throughput, or cheapest route) and keep table up-to-date when nodes move or join. In this paper, we propose an efficient routing technique with minimum power consumption for Ad hoc networks.

Abstract
Introduction
Case study: MANETs
1. Reactive protocols
2. Quality of service
Problem formulation
AHP modeling
Optimization on power consumption
Optimization on node status
Optimization on traffic congestion
Results and discussion
Conclusion
References

Get this table of contents for free after login.

Extract

[...] If power consumption is the main parameter of interest, as in the mobile application taking into account the battery life, then nodes having lowest cost function should be selected. More power consumption may results in high power dissipations If high node density is the main consideration, then moderate cost function nodes need to be selected. The MANET is likely to have moderate number of nodes to cover the entire area of the network. However, high node density (number of nodes/area) may cause time delay problems to pass the information from source node to the destination node For heavy traffic condition, low cost function nodes need to be selected. [...]

[...] Yet in high mobility situations, path is long and link may frequently break, so that the overhead may be high. In contrast to table based protocols, geographic routing protocols like as utilize location to route the information. They do not exchange routing message to establish routes. When a node has data packets to be transmitted to other node, forwarding decision is made based upon the position of destination and the position neighbors of the forwarding node. Thus a geographical routing protocol is a stateless routing protocol. It is scalable and has low overhead. [...]

[...] Taken together, for those systems in which mobility is important and for which a synthetic mobility model is an essential ingredient, it would appear to be important to consider the influence of the human-level social network as something that informs likely individual and group mobility patterns CONCLUSION Optimized node selection is an essential component in deciding the route that is to be followed in a Mobile Ad-hoc network. However, owing to the variety of communication parameters that need to be optimized at the same time the problem tends to become highly complex. [...]

[...] Although, in this work a small size network has been taken into consideration for the sake of simplicity, but it exposes the hidden potential in GA and AHP techniques that can be tapped for the efficient route determinations in the emerging future commercial application of Mobile Ad hoc Networks REFERENCES Magnus Frodish, P.Johansson and Peter Larson, “Wireless Ad Hoc Networking,” Computer Science publication, IEEE Personal Communication, pp.270-280, August 1992. C.E. Perkins and P. Bhagwat, “Highly dynamic destination distance vector routing (DSDV) for mobile computer,” in proceedings of the ACM SIGCOMM'94. [...]

[...] Furthermore, it is necessary to integrate route maintenance in a QoS routing protocol so that it can deal with route breakdowns during communication. Another scholar presented a ticket-based probing algorithm for QoS routing in ad hoc networks. The idea is to use tickets to limit the number of candidate paths. When a source node wants to find QoS paths to a destination, it sends a message that contains a certain number of tickets. An approach proposed an adaptive QoS routing scheme based on the prediction of the local performance in ad hoc networks. [...]

pdf