Professional Documents
Culture Documents
Mobile AD HOC Networks
Mobile AD HOC Networks
BY
Email: poornima587@yahoo.com
Viswanadapalli_anush@yahoo.com
MOBILE COMPUTING
The term Mobile Computing emphasizes the basic feature of mobility which refers to
a person or a device that moves between different geographical locations or different networks or
different communication devices or in different applications. So mobile computing is a process that
deals with the way of communication by using a Mobile Computer.
The communication in a Mobile Computer can be done by using different Networks
which includes various protocols for different issues. A protocol is necessary for transferring the
information from one node to other through wireless medium. So different protocols are used for
different purposes and according to the type of Network connection.
This paper mainly concerned with the popular Mobile Network called the MANET
(Mobile Ad Hoc Network) and its design issues and operations. It also includes the routing concept
and the different routing protocols that are used in MANETs. Since it is the most powerful Network
used in military applications researches were going on to improve manageability, security, and
availability of communication through this type of technology.
MOBILE COMPUTING
Mobile Computer Definition: A Portable Computer, which retains its Network Connection (wireless
interface) even on move is called mobile computer.
Inheritance: -A new task created by an application may have to inherit some properties of the host
device. Since properties of all mobile hosts are not same, the inherited properties of a task may differ at
different devices. So, applications must be able to adapt themselves according to the environment and
must have the capabilities to inherit the properties of computing ambients.
Hoarding: -In order to continue computation in disconnected mode, applications may need to hoard
some file/information from databases of fixed network/MSS) in local memory prior to disconnection.
Changes made to files during disconnection period have to be consolidated with the databases after
reconnection
1Cloning: -Task/Process/Object cloning and migration across different hosts and/or MSSs may take
place in the environment. This requires that applications must be able to save the state of task prior to
migration and to create a new task with a predetermined state.
2
Sharing and Synchronization: -When more than one mobile host want to share information/data
present at fixed network, applications must be aware of the need for read/ write synchronization with
other mobile users. Also, when there is an update to shared data, there has to be some mechanism to
inform all potential users about the update
TYPES OF MOBILE NETWORKS:
There are mainly two types of mobile networks.
• Conventional(With infrastructure)
• Ad hoc networks(MANETs)
(Without any infrastructure)
Mobile Ad Hoc Networks (MANETs): - A MANET (Mobile Ad Hoc Network) is an autonomous
collection of mobile users that communicate over relatively bandwidth constrained wireless links. It is
a network architecture that can be rapidly deployed without relying on pre-existing fixed network
infrastructure. The nodes in a MANET can dynamically join and leave the network, frequently, often
without warning, and possibly without disruption to other nodes communication
Groups of nodes that have a common goal can create formations (clusters) and migrate
together, similarly to military units on missions or to guided tours on excursions. Examples of network
nodes are pedestrians, soldiers, or unmanned robots. Examples of mobile platforms on which the
network nodes might reside are cars, trucks, buses, tanks, trains, planes, helicopters or ships.
MANETs are distinguished from other ad-hoc networks by rapidly changing network
topologies, influenced by the network size and node mobility. Such networks typically have a large
span and contain hundreds to thousands of nodes. The MANET nodes exist on top of diverse platforms
that exhibit quite different mobility patterns. Within a MANET, there can be significant variations in
nodal speed (from stationary nodes to high-speed aircraft), direction of movement,
acceleration/deceleration or restrictions on paths (e.g., a car must drive on a road, but a tank does not).
Addressing the problems: An approach taken to address the convergence problem is the application
of the Link State protocols to the ad hoc environment. An example of the latter is the Optimized Link
State Routing protocol (OLSR).
Another approach taken by some researchers is the proactive Path finding
algorithms. In this approach, which combines the features of the Distance Vector and Link State
approaches, every node in the network constructs a Minimum Spanning Tree (MST), using the
information of the MSTs of its neighbors, together with the cost of the link to its neighbors. The Path
Finding algorithms allow reducing the amount of control traffic, to reduce the possibility of temporary
routing loops, and to avoid the "counting to-infinity" problem. An example of this type of routing
protocols is the Wireless Routing Protocol (WRP).
APPLICATION OF PROACTIVE PROTOCOL:
The main issue with the application of proactive protocols to the ad hoc networking environment stems
from the fact, that as the topology continuously changes, the cost of updating the topological
information may be prohibitively high. Moreover, if the network activity is low, the information about
the actual topology is may even not be used and the investment of limited transmission and computing
resources in maintaining the topology is lost.
Reactive routing protocols: These are based on some type of "query-reply" dialog. Reactive
protocols do not attempt to continuously maintain the up-to-date topology of the network. Rather,
when the need arises, a reactive protocol invokes a procedure to find a route to the destination; such a
procedure involves some sort of flooding the network with the route query. As such, such protocols are
often also referred to as on demand.
Examples: The Temporally Ordered Routing Algorithm (TORA), the Dynamic Source Routing
(DSR), and Ad hoc On Demand Distance Vector (AODV).
• In TORA, the route replies use controlled flooding to distribute the routing information through
a form of a Directed Acyclic Graph (DAG), which is rooted at the destination.
• The DSR and the AODV protocols, on the other hand, use unicast to route the reply back to the
source of the routing query, along the reverse path of the query packet.