Performances of Ad Hoc Networks Under Deterministic and Probabilistic Channel Conditions : Cases for Single Path and Multipath Routing Protocols

@article{Tarique2018PerformancesOA,
  title={Performances of Ad Hoc Networks Under Deterministic and Probabilistic Channel Conditions : Cases for Single Path and Multipath Routing Protocols},
  author={Mohammed Tarique and Rumana Islam},
  journal={International journal of Computer Networks \& Communications},
  year={2018}
}
  • M. TariqueR. Islam
  • Published 30 July 2018
  • Computer Science, Business
  • International journal of Computer Networks & Communications
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the performance of an ad hoc network. A comprehensive investigation on this issue is yet to… 

Energy and Performance Evaluation of Reactive, Proactive, and Hybrid Routing Protocols in Wireless Mesh Network

From the results, AODV presents the lowest energy consumption and a better e-Throughput, and OLSR provides a best e-PDR in mobile scenarios, while the proactive mode of HWMP is more energy efficient than the reactive mode.

P ERFORMANCE EVALUATION OF REACTIVE , PROACTIVE , AND HYBRID ROUTING PROTOCOLS

From the results, AODV presents the lowest energy consumption and a better e-Throughput, and OLSR provides a best e-PDR in mobile scenarios, while the proactive mode of HWMP is more energy efficient than the reactive mode.

Energy-Efficient Routing Protocol for Node Lifetime Enhancement in Wireless Sensor Networks

  • A. K. Lodhi
  • Computer Science
    International Journal of Advanced Trends in Computer Science and Engineering
  • 2019
Thorough reproduction effects portray those vitality efficiency, throughput, and prolonged lifetime of the hubs under that impact of the suggested protocol.

WS-OLSR: M ULTIPOINT R ELAY S ELECTION IN VANET N ETWORKS USING A W INGSUIT F LYING S EARCH A LGORITHM

  • Computer Science
  • 2022
The enhanced MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of mobile nodes, increasing throughput, and decreasing topology control which mitigates broadcasting storm phenomenon in VANETs.

References

SHOWING 1-10 OF 24 REFERENCES

Performance comparison of two on-demand routing protocols for ad hoc networks

  • Samir R DasC. PerkinsE. Belding-Royer
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
It is demonstrated that even though DSR and AODV share a similar on-demand behavior the differences in the protocol mechanics can lead to significant performance differentials.

Shadowing Effects on Routing Protocol of Multihop Ad Hoc Networks

An analytical model has been presented in this paper to investigate the shadowing effects on the network performance and two solutions have been proposed to overcome the effects of shadowing.

Connectivity in the presence of shadowing in 802.11 ad hoc networks

An analytical model is concluded with an analytical model for the link probability in log-normal shadowing environments as a function of the number of nodes, network area, transmission range, path loss exponent and shadowing deviation.

Ad hoc on-demand multipath distance vector routing

Performance comparison of AOMDV with AODV using ns-2 simulations under varying node speeds shows that AomDV provides a factor of two improvement in delay and about 20% reduction in routing overhead, while having similar packet delivery fraction.

An analytical expression for k-connectivity probability of wireless ad hoc networks in presence of channel randomness

This paper work investigated the k-connectivity of a wireless multi hop network with homogeneous random node distribution. We derived an analytical expression which will support the theoretical

Connectivity in ad-hoc and hybrid networks

It is found that the introduction of a sparse network of base stations does significantly help in increasing the connectivity, but only when the node density is much larger in one dimension than in the other.

On the Connectivity of Ad Hoc Networks

This paper presents a framework for the calculation of stochastic connectivity properties of wireless multihop networks, and compute a tight approximation for the critical (r0 ,n )pairs that are required to keep the network connected with a probability close to one.

Connectivity of Wireless Multihop Networks in a Shadow Fading Environment

A tight lower bound for the minimum node density that is necessary to obtain an almost surely connected subnetwork on a bounded area of given size is given.

The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks

The critical transmitting range for connectivity in wireless ad hoc networks is analyzed and insight into how mobility affects connectivity is yielded and useful trade offs between communication capability and energy consumption are revealed.

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

This paper investigates modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP, to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks.