International Journal of Advanced Engineering Research and Technology (IJAERT) 221

Volume 2 Issue 7, October 2014, ISSN No.: 2348 8190

CONNECTIVITY IN AUTONOMOUS MOBILE MESH NETWORKS

USING ONE-HOP NEIGHBOR INFORMATION UPDATE
M.kiruthika Devi*, R. Yamini**
*M.E Applied electronics, Sri Eshwar College of engineering, Coimbatore
**Assistant Professor, Sri Eshwar College of engineering, Coimbatore

ABSTRACT
MANETs are among the most popular network
communication technologies. One great challenge in
designing robust MANETs is to minimize network
partitions. As autonomous mobile users move about in a
MANET, the network topology may change rapidly and
unpredictably over time and portions of the network may
intermittently become partitioned. We address this
challenging problem by proposing a new class of robust
mobile ad hoc network called AMMNET. To maintain
the communication between all nodes even they are in
different groups Mesh Nodes are used. Mesh Nodes
which have the capability of changing its nature into
Inter-group router or Intra-group router, even it can act
as a bridge router. To make the communication effective
One-hop neighbor information update is used to find the
shortest path between any two nodes.
Keywords - MANET-Mobile Ad-hoc Network,
AMMNET-Autonomous Mobile Ad-hoc Network.

1. Introduction
A wireless network is any type of computer network that
uses wireless data connections for connecting network
nodes. Wireless networking is a method by which
homes, telecommunications networks and enterprise
installations avoid the costly process of introducing
cables into a building, or as a connection between
various
equipment
locations.
Wireless
telecommunications networks are generally implemented
and administered using radio communication. This
implementation takes place at the physical level of the
OSI model network structure. Examples of wireless
networks include cell phone networks, Wi-Fi local
networks and terrestrial microwave networks.
Communications satellites Satellites communicate
via microwave radio waves, which are not deflected by
the Earth's atmosphere. The satellites are stationed in
space, typically in geosynchronous orbit 35,400 km
above the equator. Cellular and PCS systems use several
radio communications technologies. The systems divide

the region covered into multiple geographic areas. Each

area has a low-power transmitter or radio relay antenna
device to relay calls from one area to the next area. Freespace optical communication uses visible or invisible
light for communications. In most cases, line-of-sight
propagation is used, which limits the physical
positioning of communicating devices.
Wireless technology has been one of the most
transforming and empowering technologies in recent
years. In particular, mobile ad hoc networks (MANETs)
are among the most popularly studied network
communication technologies. In such an environment,
no communication infrastructure is required. A mobile
ad hoc network (MANET) is a self-configuring
infrastructure less network of mobile devices connected
by wireless.
Each device in a MANET is free to move
independently in any direction, and will therefore change
its links to other devices frequently. Each must forward
traffic unrelated to its own use, and therefore be a router.
The primary challenge in building a MANET is
equipping each device to continuously maintain the
information required to properly route traffic. Such
networks may operate by themselves or may be
connected to the larger Internet.
A lot of research has been done in the past but the
most significant contributions have been the PGP and
trust based security. None of the protocols have made a
decent tradeoff between security and performance. In an
attempt to enhance security in MANETs many
researchers have suggested and implemented new
improvements to the protocols and some of them have
suggested new protocols.

2. Related work
One great challenge in designing robust MANETs is to
minimize network partitions. As autonomous mobile
users move about in a MANET, the network topology
may change rapidly and un-predictably over time; and
portions of the network may intermittently become
partitioned. This condition is undesirable, particularly

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 222

Volume 2 Issue 7, October 2014, ISSN No.: 2348 8190

for mission-critical applications such as crisis

management and battlefield communications. We
address this challenging problem in this paper by
proposing a new class of robust mobile ad hoc network
called
Autonomous
Mobile
Mesh
Networks
(AMMNET).
The AMMNET has the following additional
advantages [1]. The mobility of the mesh clients is
confined to the fixed area serviced by a standard wireless
mesh network due to the stationary mesh nodes. In
contrast, an AMMNET is a wireless mesh network with
autonomous mobile mesh nodes.
The topology adaptation of an AMMNET is
illustrated in Fig. 1:
Fig. 1a: The mesh clients initially concentrate in
one group.
Fig. 1b: The mesh clients move northwards and
split into two groups.
Fig. 1c: The same mesh clients now move and form
three groups.
We assume that each mobile mesh node is equipped
with a localization device such as GPS. In addition, a
mobile mesh node can detect mesh clients within its
sensing range, but does not know their exact locations.
In the performance evaluation of a protocol for an ad
hoc network [6], the protocol should be tested under
realistic conditions including data traffic models, and
realistic movements of the mobile users. These
movements are independent of each other.
To know this, the detection of beacon messages
transmitted from the clients is important. Two challenges
in designing AMMNET are, i)the mesh clients do not
have knowledge of their locations and ii)the topology
adaptation needs to be based on a highly efficient
distributed computing technique to keep up with the
dynamic movement of the mobile users.

Fig.1. Partition and its topology adaptation

We classify the works related to AMMNET into

three categories: 1) stationary wireless mesh networks:
AMMNET is a new type of mesh networks, but supports
dynamic topology adaptation, 2) sensor covering: the
techniques for sensor covering is related to the design of
covering mobile clients in AMMNET, and 3) location
tracking: tracking mobile clients in AMMNET is an
application of location tracking.
Stationary wireless mesh network: In the last few
years, stationary wireless mesh networks have been
developed to enable last-mile wireless broadband access
[7].Sensor covering. Our work on router deployment is
also related to recent work on sensor covering in a
stationary sensor network [28], [4], [3]. These schemes
ensure that each point in a target field is in the interior of
at least k different sensors. Several work [5], [8], [2]
further takes energy efficiency into account, and assigns
each sensor a sleep-active schedule to guarantee sensor
cover and, at the same time, prolong the lifetime of a
sensor network. More recently, some work exploits
sensor mobility to improve the performance of sensor
covering.
When we use distributed coordinate-free algorithm
[2], it helps to achieve high lifetime in sensor networks
and also provide k-coverage of the target field during the
network lifetime. Mobile nodes are clustered into groups
[10], with nodes within the same group exhibiting
significant correlation in their movements.
3. Tracking Mechanism
A client can connect to any nearby mesh node, which
helps relay data to the destination mesh node via multihop forwarding [6]. To support dynamically changing
mesh topology, mobile mesh nodes can be classified into
three types,
i)
Intergroup routers.
ii)
Intra-group routers.
iii)
Free routers.
The intergroup routers perform routing between the
groups, the intra-group routers perform routing inside
the group and redundant routers claimed as free routers
for future use. The low power node is replaced as a free
router and can go back to the initial location, for
example, control center, to replace the battery.
3.1 Adapting to Intra-group Movement
Sometimes, the client c moves out of the communication
range of router r into the communication range of an
adjacent router r1 in the same group, the another
possible scenario also can occur(i.e.) the missing client c
moves from the communication range of router r to a

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 223

Volume 2 Issue 7, October 2014, ISSN No.: 2348 8190

space not currently covered by any of the routers in the

group.

22)
end if
23) end if
24) end switch
25) end for
26) return

3.2 Reclaiming Redundant Routers

If intra- and intergroup routers are no longer required
due to client mobility, the AMMNET should reclaim
them for future use. If the all clients of router r are
covered by neighboring routers, r can switch to become
an intergroup router.
3.3 Interconnecting Groups
Given a set of intra-group routers that provide
communication coverage for a group of mobile users,
these mobile users might move out of this coverage area
in smaller groups. To avoid network partitioning, each of
the new groups must be supported by their local intragroup routers; and intergroup routers must organize
themselves into a sub-network of bridges to support the
intergroup communications.
3.3.1 Algorithm
1) for each Beacon message interval do
2) switch mode of router r do
3) case Intra-group
4)
if detect missing clients then
5)
Request the client list from neighboring
intra-group routers
6)
if all its clients are covered by neighbors
then
7)
switch to the Intergroup mode
8) else
9)
Assign free routers to navigate its
coverage boundary;
10) end if
11) end if
12) case Intergroup bridge
13) Piggyback its location in the forwarded
packets;
14) Retrieve the locations of other bridge
routers and identify of the inter group
routers along the bridge networks from the
forwarded packets;
15) Initiate topology adaptation (if necessary)
16) case Free
17) if receive the tracking request from intragroup routers then
18) Navigate the assigned segment to detect
the missing clients;
19) if locate the missing clients then
20) Switch to the intra-group mode;
21) Request some of the free routers to follow
this new intra group router;

Fig.2. AMMNET framework

3.4 Topology Adaptation
The clients in the coverage region of particular router
can move from one location to another location.
According to clients mobility, the topology is set and
routing is performed. Before communication we need to
adapt the topology. The topology adaptation can be
classified into two methods.
i) Local Adaptation.
ii) Global Adaptation
3.4.1 Local Adaptation
Among many topologies the star topology provides
shorter rely paths therefore it requires only few no of
intergroup routers. Here, bridge routers exchange their
location information and perform local adaptation.
3.4.2 Global Adaptation
Local topology adaptation provides local optimization. It
is desirable to also perform global topology adaptation to
achieve global optimality. This method provides better
overall end-to-end delay and free up intergroup routers
for subsequent local adaptation. In ideal case AMMNET
use few intergroup routers as possible to minimize the
number of mobile routers required and deliver good endto-end delay for the application.
4. Proposed Method
In this project we can find the shortest path from source
to destination. For timing consideration we need only

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 224

Volume 2 Issue 7, October 2014, ISSN No.: 2348 8190

shorter communication. The cost also reduced through

this.
4.1 Routing Protocol
There are two different types of protocol.

Step 3: source receives acknowledgement (intermediate

hop ids, distance) from intermediate hops(relays) and
destination.
Step 4: source finds shortest path by received
acknowledgement from destination.

4.1.1 Table-Driven (Proactive)

The nodes maintain a table of routes to every destination
in the network, for this reason they periodically
exchange messages. Keeping routes to all destinations
up-to-date, even if they are not used, is a disadvantage
with regard to the usage of bandwidth and of network
resources.
4.1.2 On-Demand (Reactive)
These protocols were designed to overcome the wasted
effort in maintaining unused routes. Routing information
is acquired only when there is a need for it. The needed
routes are calculated on demand. This saves the
overhead of maintaining unused routes at each node, but
on the other hand the latency for sending data packets
will considerably increase.
These protocols were designed to overcome the wasted
effort in maintaining unused routes. Routing information
is acquired only when there is a need for it. The needed
routes are calculated on demand. This saves the
overhead of maintaining unused routes at each node, but
on the other hand the latency for sending data packets
will considerably increase.

Step 5: Sends data through that path.

Fig.3. Communication in single group

When the nodes in the single group, the intra- group
router used for routing. This communication is
performed inside the group.

4.1.3 one-hop neighbor information update

To make the communication effective One-hop neighbor
information update is used to find the shortest path
between any two nodes. For communication between the
nodes or between groups initially the source enables the
route discovery process to find the shortest path based
on one hop neighbor information. All the nodes in
network maintain information such as location, ID,
distance and mobility of its neighbors. Based on this
information, source finds the shortest path to
communicate with destination. Shortest path also
contains minimum number of intermediate hops.
Fig.4. Intra-routing
4.1.3.1 Algorithm
Step 1: Nodes share and store information (id, position,
distance, mobility) of its neighbors who are in closer
than others in its coverage range.
Step 2: Source enables route discovery process. While
receiving discovery packet each node forwards to its one
hop neighbors.

If we want to perform communication between the

groups the inter group routers and bridge routers are
used. Here the major constraint is distance. In the small
distance communication the inter router used whereas in
case of long distance communication the bridge router
used. The following simulation results indicate the
difference between those situations.

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 225

Volume 2 Issue 7, October 2014, ISSN No.: 2348 8190

In this section, performance of network coverage and

performance of data forwarding can be evaluated.
5.1 Performance of Network Coverage
Each simulation includes 50 clients classified into three
mobile groups. We vary the moving speed of routers
from the mean speed of clients to six times of the mean
speed of clients. Oracle always uses the up-to-date
location information of clients to re-compute the
topology and, thereby, can best utilize all available
routers. Some failures occur under AMMNET due to
tracking of clients.
In AMMNET global adaptation cannot be performed
all the time therefore it requires more routers to cover all
the clients compare to Global-AMMNET. Whereas
Oracle connects every client using an R-tree with more
layers, as compared to the R-tree only including bridge
routers in AMMNET might require a few more routers
to cover the entire hierarchical topology.

Fig.5. Inter routing using inter router

Fig.6. Inter routing using Bridge router

5. Performance Evaluation
There are various schemes in the network.
TABLE: Performance of Schemes
Scheme
Performance
Grid-mesh
This simple scheme employs a
grid-based Square topology for the
mobile mesh nodes.
AMMNET
Routers adapt their locations using
only locally cached location
information about some of the
bridge routers.
GlobalGlobal adaptation is performed by
AMMNET
a randomly selected bridge router
whenever any client moves out of
the current network coverage area.
Oracle
It assumes location information of
all clients is available. The routers
can move to the assigned locations
in the network instantaneously
without any moving delay.

Fig.7. Number of clients covered by mesh nodes.

Fig.8. Number of routers required to cover various

numbers of clients.
The result shows that that AMMNET is scalable with
increases in the number of mesh clients if clients are
partitioned into a limited number of groups.

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 226

Volume 2 Issue 7, October 2014, ISSN No.: 2348 8190

5.2 Performance of Data Forwarding

We let each MANET user act as a mobile router, which
can transmit/receive its own data and also forward data
for other users.
The throughput of each method shown below.
Oracles throughput measured when the routing table in
each router has been reconfigured after each topology
adaption. The throughput of AMMNET is 33% greater
than the Grid-based method, because some sourcedestination pair is not served by any of the router. The
throughput of Global-AMMNET degrades gradually
when the moving speed increases.

Fig.9. Impact of client moving speed

11a) Energy

11b) Throughput

11c) Packet Delivery Ratio (PDR)

Fig.10. Hop count
The message can be delivered from one node to another
via multiple hop. The following result shows the
performance with the hop count and relevant data
exchange.
In this project various metrics are considered such as
energy, Throughput, Packet Delivery Ratio and Packet
Loss.
11d) Packet Loss
Fig.11. Results of various metrics

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 227

Volume 2 Issue 7, October 2014, ISSN No.: 2348 8190

The energy diagram shows the lifetime of the

network, Throughput shows the total performance, it
also represents number of bits transferred per second,
Packet Delivery Ratio (PDR) is define by the ratio
between number of bits transferred and number of bits
received and packet loss should be zero.

6. Conclusion
Generally, the conventional mobile ad-hoc network
suffer from network partitioning, this problem was
solved in the AMMNET. It supports both intra-routing
and inter-routing. Here, the mobile mesh routers of an
AMMNET track the users and dynamically adapt the
network topology and perform routing. It simply
forwards the date from source to destination via multiple
hops. This infrastructure provides full connectivity
without need of high cost of network coverage.
AMMNET does not consider that, whether the
routing path is the one, which is shortest distance
between the source-destination pair. Therefore, one-hop
neighbor information update method used to find the
shortest route. It maintains the informations such as
location, ID, distance and mobility of its neighbors and
provides cost-effective solution.
In my future research, many other issues are yet to be
examining, such as security, disappearing of mobile
client.

[7] I.F. Akyildiz, X. Wang, and W. Wang, Wireless

Mesh Networks:A Survey, Computer Networks, 2005.
[8] S. Kumar, T.H. Lai, and J. Balogh, On k-Coverage
in a Mostly Sleeping Sensor Network, Proc. ACM
MobiCom, 2004.
[9] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and
M. Srivastava, Coverage Problems in Wireless Ad-Hoc
Sensor Networks,Proc. IEEE INFOCOM, 2001.
[10] Yung-Chih Chen, Elisha Rosensweig, Jim Kurose,
Don
Towsley,Group
Detection
in
Mobility
Traces,2010

References
[1] Wei-Liang Shen, Chung-Shiuan Chen,Kate ChingJu
Lin,
Autonomous
Mobile
Mesh
Networks,ieeetransactions on mobile computing,2014.
[2] G.S. Kasbekar, Y. Bejerano, and S. Sarkar, Lifetime
and Coverage Guarantees through Distributed
Coordinate-Free Sensor Activation,Proc. ACM
MobiCom, 2009.
[3] Y. Bejerano, Simple and Efficient k-Coverage
Verification withoutLocation Information, Proc. IEEE
INFOCOM, 2008.
[4] C.-F. Huang and Y.-C. Tseng, The Coverage
Problem in aWireless Sensor Network, Mobile
Networks and Applications, 2005.
[5] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C.
Gill,Integrated
Coverage
and
Connectivity
Configuration in Wireless sensor Networks, Proc. ACM
First Intl Conf. Embedded Networked Sensor Systems
(SenSys), 2003.
[6] T. Camp, J. Boleng, and V. Davies, A Survey of
Mobility Models for Ad Hoc Network Research,
Wireless Comm. and Mobile Computing, 2002.

www.ijaert.org