Graph Theoretic Routing Algorithm (GTRA) for Mobile Ad-Hoc Networks (MANET)

Abstract

Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop paths between each source and destination pairs. For scalability, it is critical that for supporting network

A Novel Resource Efficient Dmms Approach for Network Monitoring and Controlling Functions

“…The routing type of application at the IP layer which sets up the paths across the network requires knowledge of nodes in the vicinity and their traffic conditions. The Position, Location and Tracking (PL&T) [11] algorithm allows real time computation of PL&T data for each moving target node at different instances of time which is sent to the Cluster Head that maps the network and broadcast the mapping data of all nodes, so that each node can use the data for any end user application. However, the user protocol layers may have to send this data in 7 terms of strings of X and Y coordinates using floating point function which occupies a lot of bandwidth, while exchanging the MIB elements reduces the bandwidth requirement significantly at the cost of computation of Cluster map at different nodes individually is increased.…”

“…In this paper, we are going to demonstrate the cost effective computation of the management entities at each user for monitoring the overall network such as user data throughput and delay, and real time network control functions where we have shown different management aspects for different multi-service applications such as Position, Location and Tracking (PL&T) system [11] and Graph Theoretical Routing application [12] with minimal use of bandwidth in the network for management functions. The remaining sections are organized as follows:…”

Modeling and Designing Resource Efficient Distributed MANET Management System (DMMS)

“…In our proposed Distributed Network Management (DNM), we can distribute management functions to cluster members or nodes to reduce the load of CH. By analyzing one of the graph theoretical routing protocols [11], we have discussed how DMMS can use in controlling purpose to manage CH's load.…”

“…If any routing is on going and some of the node's location has changed but the updated snapshots were not received from the CH, on that time routing can be failed. In Graph Theoretic Routing [11], receiving the updated or correct snapshots is very important for efficient routing. Management part acts as a big role for controlling the PL&T locations snapshots.…”

“…In [11], cluster head uses the Position Location and Tracking (PL&T) system [12] of all the nodes within the cluster and develops a snap shot of the cluster. The CH periodically broadcast the snap shots to ensure nodes know as and when PL&Ts of nodes have changed.…”