Efficient Routing Mechanism Using Cycle Based Network and K-Hop Security in Ad-Hoc Networks

摘要

In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited informationregarding intra cluster connectivity without revealing detailed topology information. Nodes are groupedinto the cluster. Every cluster has border nodes, which is used for data transmission between source anddestination. The K-hop security can be used for the purpose of securing the data communication. Thetopologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, deliverydelay and to increase throughput and packet delivery ratio. The shortest path can be found usingBhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm forestablish the second path in the network . These topologies are compared to demonstrate the advantage offinding shortest path using Bhandari’s algorithm.