抽象的な

NEW ON-DEMAND ROUTING PROTOCOL FOR AD HOC NETWORKS

Marghny H.Mohamed, Mahmoud.A Mofaddel, Hamdy.H El-Sayed

Ad-hoc network is a collection of mobile nodes dynamically forming a temporary network without the use of any existing infrastructure or centralized administration. Building such a network poses many technical challenges such as routing, energy consumption, load balancing, and security. Routing in mobile ad-hoc network (MANETs) becomes more sophisticated issue especially when a certain quality of service (QOS) requirement is to be satisfied. In this paper, we address the problem of routing in mobile ad-hoc network under ad-hoc network characteristics. We concentrate on two parameter hop count and path distance changes with some ad-hoc network characteristics characteristics like topology changes, average number of neighbor nodes, number of nodes and transmission range. Different topologies are compared like circle, square and rectangle. Our results compared the effects of these characteristics on the Ad-Hoc On Demand Distance Vector (AODV) and our proposed algorithm Bee-Dijkstra Algorithm (BDA). Both of the path route and hop count in BDA and AODV is changed with the CTR (Critical Transmission Range) and this leads us that the CTR has clear effects on the network connectivity and the path routing.