Blocking Expanding Ring Search Research Articles

Minimizing Delay Using Dynamic Blocking Expanding Ring Search Technique for Ad Hoc Networks

Minimizing Delay Using Dynamic Blocking Expanding Ring Search Technique for Ad Hoc Networks

Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks

We propose a new strategy for reducing the amount of latency and energy consumption in Blocking Expanding Ring Search (BERS) and enhanced Blocking Expanding Ring Search (BERS*) for mobile ad hoc networks (MANETs). BERS and BERS* are respectively energy and energy–time efficient route discovery protocols for MANETs as compared to conventional Expanding Ring Search (ERS). In this study, we identify unnecessary waiting time caused by a STOP/END instruction in BERS/BERS* and explore the potential of further improvement of their time efficiency. This leads to tBERS and tBERS*, the improved BERS and BERS* respectively. In tBERS/tBERS*, a route node may also issue the STOP/END instruction to terminate flooding. We implement this idea in algorithms, conduct analysis, and achieve further latency reduction in both tBERS and tBERS* as well as the energy saving in tBERS*.

Optimized and Reliable AODV for MANET

recent years, mobile and wireless networks have witnessed a tremendous rise in technological advancement. Due to dynamic changing environment of MANET, it is desirable to design effective routing algorithms that can adapt its behavior to rapid and frequent changes in the network. In this paper, we propose an Optimized Reliable Ad hoc On-demand Distance Vector (ORAODV) scheme that offers quick adoption to dynamic link conditions, low processing and low network utilization in ad hoc network. By implementing Blocking Expanding Ring Search (Blocking-ERS) and retransmission of data packet in ORAODV, it provides satisfactory performance in term of packet delivery ratio (PDR), normalizing routing load (NRL) and delay for different network density in term of number of node, various mobility rates.

Analytical Studies of Energy–Time Efficiency of Blocking Expanding Ring Search

This paper investigates the energy–time efficiency of the Blocking Expanding Ring Search algorithms (BERS) using an extended graph model. BERS is an energy efficient alternative that was developed recently based on the Expanding Ring Search (ERS). ERS is widely applied in reactive routing protocols for mobile ad hoc networks. Most studies in this area focus on minimising either energy consumption or search latency, but few look into the strong correlation between the energy saving and the increased latency incurred. We analyse, in this study, the concurrency mechanism of BERS and have developed BERS*, an enhanced scheme based on BERS. Our results show that, among the three schemes (BERS*, BERS and ERS), BERS* incurs the least latency when the hop number of the route nodes is greater than 3, and has achieved the best performance in terms of energy–time efficiency when the hop number of the route nodes is greater than 7. We have also discovered the conditions that allow collective optimisation of BERS* and ERS.