connectivity in autonomous mobile mesh networks using one-hop neighbor information update

7/24/2019 CONNECTIVITY IN AUTONOMOUS MOBILE MESH NETWORKS USING ONE-HOP NEIGHBOR INFORMATION UPDATE

http://slidepdf.com/reader/full/connectivity-in-autonomous-mobile-mesh-networks-using-one-hop-neighbor-information 1/7

International Journal of Advanced Engineering Research and Technology (IJAERT)

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

www.ijaert.org

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

ABSTRACTMANETs are among the most popular networkcommunication 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 andunpredictably over time and portions of the network mayintermittently become partitioned. We address this

challenging problem by proposing a new class of robustmobile ad hoc network called AMMNET. To maintain

the communication between all nodes even they are indifferent groups Mesh Nodes are used. Mesh Nodeswhich have the capability of changing its nature intoInter-group router or Intra-group router, even it can actas a bridge router. To make the communication effective

One-hop neighbor information update is used to find theshortest 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 thatuses wireless data connections for connecting networknodes. Wireless networking is a method by which

homes, telecommunications networks and enterpriseinstallations avoid the costly process of introducingcables into a building, or as a connection betweenvarious equipment locations. Wirelesstelecommunications networks are generally implemented

and administered using radio communication. This

implementation takes place at the physical level of theOSI model network structure. Examples of wirelessnetworks include cell phone networks, Wi-Fi localnetworks and terrestrial microwave networks.

Communications satellites – Satellites communicatevia microwave radio waves, which are not deflected by

the Earth's atmosphere. The satellites are stationed inspace, typically in geosynchronous orbit 35,400 kmabove the equator. Cellular and PCS systems use several

radio communications technologies. The systems divide

the region covered into multiple geographic areas. Eacharea has a low-power transmitter or radio relay antennadevice to relay calls from one area to the next area. Free-space optical communication uses visible or invisible

light for communications. In most cases, line-of-sight propagation is used, which limits the physica positioning of communicating devices.

Wireless technology has been one of the most

transforming and empowering technologies in recentyears. In particular, mobile ad hoc networks (MANETs)are among the most popularly studied networkcommunication technologies. In such an environment

no communication infrastructure is required. A mobilead hoc network (MANET) is a self-configuringinfrastructure less network of mobile devices connected

by wireless.Each device in a MANET is free to move

independently in any direction, and will therefore changeits links to other devices frequently. Each must forwardtraffic unrelated to its own use, and therefore be a router

The primary challenge in building a MANET isequipping each device to continuously maintain the

information required to properly route traffic. Suchnetworks may operate by themselves or may beconnected to the larger Internet.

A lot of research has been done in the past but themost significant contributions have been the PGP and

trust based security. None of the protocols have made adecent tradeoff between security and performance. In anattempt to enhance security in MANETs many

researchers have suggested and implemented newimprovements 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 mobileusers move about in a MANET, the network topologymay change rapidly and un-predictably over time; and

portions of the network may intermittently become partitioned. This condition is undesirable, particularly

http://www.ijsret.org/







www.ijaert.org

space not currently covered by any of the routers in the

group.

3.2 Reclaiming Redundant Routers

If intra- and intergroup routers are no longer requireddue to client mobility, the AMMNET should reclaim

them for future use. If the all clients of router r arecovered by neighboring routers, r can switch to becomean intergroup router.

3.3 Interconnecting Groups

Given a set of intra-group routers that providecommunication 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 ofthe new groups must be supported by their local intra-

group routers; and intergroup routers must organizethemselves 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-group4) if detect missing clients then 5) Request the client list from neighboring

intra-group routers6) if all its clients are covered by neighbors

then

7) switch to the Intergroup mode

8)

else9) Assign free routers to navigate its

coverage boundary;

10)

end if

11) end if12)

case Intergroup bridge

13) Piggyback its location in the forwarded packets;

14) Retrieve the locations of other bridgerouters and identify of the inter group

routers along the bridge networks from theforwarded packets;

15)

Initiate topology adaptation (if necessary)16) case Free17) if receive the tracking request from intra-

group routers then 18)

Navigate the assigned segment to detectthe missing clients;

19) if locate the missing clients then 20) Switch to the intra-group mode;

21) Request some of the free routers to followthis new intra – group router;

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

26) return

Fig.2. AMMNET framework

3.4 Topology AdaptationThe clients in the coverage region of particular router

can move from one location to another locationAccording to client’s mobility, the topology is set androuting is performed. Before communication we need to

adapt the topology. The topology adaptation can beclassified into two methods.

i) Local Adaptation.

ii)

Global Adaptation

3.4.1 Local AdaptationAmong many topologies the star topology provides

shorter rely paths therefore it requires only few no ofintergroup routers. Here, bridge routers exchange theirlocation information and perform local adaptation.

3.4.2 Global Adaptation

Local topology adaptation provides local optimization. Iis desirable to also perform global topology adaptation to

achieve global optimality. This method provides better

overall end-to-end delay and free up intergroup routersfor subsequent local adaptation. In ideal case AMMNETuse few intergroup routers as possible to minimize thenumber of mobile routers required and deliver good end-

to-end delay for the application.

4. Proposed Method

In this project we can find the shortest path from sourceto destination. For timing consideration we need only








www.ijaert.org

shorter communication. The cost also reduced through

this.

4.1 Routing Protocol

There are two different types of protocol.

4.1.1 Table-Driven (Proactive)The nodes maintain a table of routes to every destinationin the network, for this reason they periodically

exchange messages. Keeping routes to all destinationsup-to-date, even if they are not used, is a disadvantage

with regard to the usage of bandwidth and of networkresources.

4.1.2 On-Demand (Reactive)These protocols were designed to overcome the wasted

effort in maintaining unused routes. Routing informationis acquired only when there is a need for it. The needed

routes are calculated on demand. This saves theoverhead of maintaining unused routes at each node, buton the other hand the latency for sending data packets

will considerably increase.These protocols were designed to overcome the wastedeffort in maintaining unused routes. Routing informationis acquired only when there is a need for it. The neededroutes are calculated on demand. This saves the

overhead of maintaining unused routes at each node, buton the other hand the latency for sending data packets

will considerably increase.

4.1.3 one-hop neighbor information updateTo make the communication effective One-hop neighborinformation update is used to find the shortest path

between any two nodes. For communication between thenodes or between groups initially the source enables theroute discovery process to find the shortest path based

on one hop neighbor information. All the nodes innetwork maintain information such as location, ID,

distance and mobility of its neighbors. Based on thisinformation, source finds the shortest path to

communicate with destination. Shortest path alsocontains minimum number of intermediate hops.

4.1.3.1 Algorithm

Step 1: Nodes share and store information (id, position,distance, mobility) of its neighbors who are in closerthan others in its coverage range.

Step 2: Source enables route discovery process. While

receiving discovery packet each node forwards to its onehop neighbors.

Step 3: source receives acknowledgement (intermediate

hop ids, distance) from intermediate hops(relays) anddestination.

Step 4: source finds shortest path by receivedacknowledgement from destination.

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.

Fig.4. Intra-routing

If we want to perform communication between the

groups the inter group routers and bridge routers areused. Here the major constraint is distance. In the small

distance communication the inter router used whereas incase of long distance communication the bridge routerused. The following simulation results indicate the

difference between those situations.








www.ijaert.org

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 agrid-based Square topology for the

mobile mesh nodes.

AMMNET Routers adapt their locations using

only locally cached locationinformation about some of the

bridge routers.

Global-AMMNET

Global adaptation is performed bya randomly selected bridge router

whenever any client moves out ofthe current network coverage area.

Oracle It assumes location information ofall clients is available. The routerscan move to the assigned locationsin the network instantaneouslywithout any moving delay.

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 threemobile groups. We vary the moving speed of routers

from the mean speed of clients to six times of the meanspeed of clients. Oracle always uses the up-to-datelocation information of clients to re-compute the

topology and, thereby, can best utilize all availablerouters. 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. WhereasOracle connects every client using an R-tree with more

layers, as compared to the R-tree only including bridgerouters in AMMNET might require a few more routers

to cover the entire hierarchical topology.

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

Fig.8. Number of routers required to cover variousnumbers of clients.

The result shows that that AMMNET is scalable withincreases in the number of mesh clients if clients are

partitioned into a limited number of groups.








www.ijaert.org

5.2 Performance of Data Forwarding

We let each MANET user act as a mobile router, whichcan transmit/receive its own data and also forward datafor other users.

The throughput of each method shown below.Oracle’s throughput measured when the routing table in

each router has been reconfigured after each topologyadaption. The throughput of AMMNET is 33% greaterthan the Grid-based method, because some source-

destination pair is not served by any of the router. Thethroughput of Global-AMMNET degrades gradually

when the moving speed increases.

Fig.9. Impact of client moving speed

Fig.10. Hop count

The message can be delivered from one node to anothervia multiple hop. The following result shows the

performance with the hop count and relevant dataexchange.

In this project various metrics are considered such asenergy, Throughput, Packet Delivery Ratio and PacketLoss.

11a) Energy

11b) Throughput

11c) Packet Delivery Ratio (PDR)

11d) Packet Loss

Fig.11. Results of various metrics








www.ijaert.org

The energy diagram shows the lifetime of the

network, Throughput shows the total performance, italso represents number of bits transferred per second,Packet Delivery Ratio (PDR) is define by the ratio

between number of bits transferred and number of bitsreceived and packet loss should be zero.

6. Conclusion

Generally, the conventional mobile ad-hoc network

suffer from network partitioning, this problem wassolved in the AMMNET. It supports both intra-routingand inter-routing. Here, the mobile mesh routers of anAMMNET track the users and dynamically adapt thenetwork topology and perform routing. It simply

forwards the date from source to destination via multiplehops. 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-hopneighbor information update method used to find the

shortest route. It maintains the information’s such aslocation, 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.

References[1] Wei-Liang Shen, Chung-Shiuan Chen,Kate ChingJuLin,” Autonomous Mobile Mesh

Networks”,ieeetransactions on mobile computing,2014. [2] G.S. Kasbekar, Y. Bejerano, and S. Sarkar, “Lifetimeand Coverage Guarantees through Distributed

Coordinate-Free Sensor Activation,”Proc. ACMMobiCom, 2009.[3] Y. Bejerano, “Simple and Efficient k -Coverage

Verification withoutLocation Information,” Proc. IEEEINFOCOM, 2008.

[4] C.-F. Huang and Y.-C. Tseng, “The CoverageProblem 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 ConnectivityConfiguration in Wireless sensor Networks,” Proc. ACMFirst Int’l Conf. Embedded Networked Sensor Systems

(SenSys), 2003.[6] T. Camp, J. Boleng, and V. Davies, “A Survey ofMobility Models for Ad Hoc Network Research,”Wireless Comm. and Mobile Computing, 2002.

[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 -Coveragein a Mostly Sleeping Sensor Network,” Proc. ACM

MobiCom, 2004.[9] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and

M. Srivastava, Coverage Problems in Wireless Ad-HocSensor Networks,”Proc. IEEE INFOCOM, 2001. [10] Yung-Chih Chen, Elisha Rosensweig, Jim Kurose

Don Towsley,”Group Detection in MobilityTraces”,2010




connectivity in autonomous mobile mesh networks using one-hop neighbor information update

Documents