Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks

Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput

Broadcasting Protocol for Effective Data Dissemination in Vehicular Ad Hoc Networks

VANET topology is very dynamic due to frequent movements of the nodes. Using beacon information connected dominated set are formed and nodes further enhanced with neighbor elimination scheme. With acknowledgement the inter section issues are solve. A modified Broadcast Conquest and Delay De-synchronization mechanism address the broadcasting storm issues. Although data dissemination is possible in all direction, the performance of data dissemination in the opposite direction is investigated and compared against the existing protocols

A Performance Comparison of Virtual Backbone Formation Algorithms for Wireless Mesh Networks

Currently wireless networks are dominant by star topology paradigm. Its natural the evolution is towards wireless mesh multi-hop networks. This article compares the performance of several algorithms for virtual backbone formation in ad hoc mesh networks both theoretically and through simulations. Firstly, an overview of the algorithms is given. Next, the results of the algorithm simulations made with the program Dominating Set Simulation Suite (DSSS) are described and interpreted. We have been extended the simulator to simulate the Mobile Backbone Network Topology Synthesis Algorithm. The results show that this algorithm has the best combination of performance characteristics among the compared algorithms

Clustering and Hybrid Routing in Mobile Ad Hoc Networks

This dissertation focuses on clustering and hybrid routing in Mobile Ad Hoc Networks (MANET). Specifically, we study two different network-layer virtual infrastructures proposed for MANET: the explicit cluster infrastructure and the implicit zone infrastructure. In the first part of the dissertation, we propose a novel clustering scheme based on a number of properties of diameter-2 graphs to provide a general-purpose virtual infrastructure for MANET. Compared to virtual infrastructures with central nodes, our virtual infrastructure is more symmetric and stable, but still light-weight. In our clustering scheme, cluster initialization naturally blends into cluster maintenance, showing the unity between these two operations. We call our algorithm tree-based since cluster merge and split operations are performed based on a spanning tree maintained at some specific nodes. Extensive simulation results have shown the effectiveness of our clustering scheme when compared to other schemes proposed in the literature. In the second part of the dissertation, we propose TZRP (Two-Zone Routing Protocol) as a hybrid routing framework that can balance the tradeoffs between pure proactive, fuzzy proactive, and reactive routing approaches more effectively in a wide range of network conditions. In TZRP, each node maintains two zones: a Crisp Zone for proactive routing and efficient bordercasting, and a Fuzzy Zone for heuristic routing using imprecise locality information. The perimeter of the Crisp Zone is the boundary between pure proactive routing and fuzzy proactive routing, and the perimeter of the Fuzzy Zone is the boundary between proactive routing and reactive routing. By adjusting the sizes of these two zones, a reduced total routing control overhead can be achieved

Evaluation and improvement of CDS-based topology control for wireless sensor networks

The connected dominating set (CDS) principle has emerged as the predominant method for energy-efficient discovery and clustering of power-/location-unaware WSN nodes. While many CDS discovery protocols have been proposed recently, a one-to-one comparative evaluation of these protocols has not been performed on judicious metrics. In this paper, we perform a simulation-based evaluation of three prominent CDS based protocols (CDS Rule K, EECDS and A3) on the basis of message and energy overhead, residual energy, number of unconnected nodes, and convergence time. Our analysis shows that the protocols’ performances vary significantly with different maintenance techniques and none of the existing protocols can outperform the others on all metrics. Based on this result, we identify some performance-improving guidelines for CDS-based topology discovery and utilize them to propose a new protocol, clique-based CDS discovery (CCDS). We show that CCDS provides considerably better performance than existing protocols in most operational scenarios