A performance model of neighbor discovery in proactive routing protocols

Authors:
Andres Medina;Stephan Bohacek
Affiliations:
University of Delaware, Newark, DE, USA;University of Delaware, Newark, DE, USA
Venue:
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Year:
2010

Citing 8
Cited 2

Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Implementation experience with MANET routing protocols

ACM SIGCOMM Computer Communication Review
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Connectivity of wireless multihop networks in a shadow fading environment

Wireless Networks
Modeling of topology evolutions and implication on proactive routing overhead in MANETs

Computer Communications
A unified model for joint throughput-overhead analysis of mobile ad hoc networks

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Component based modeling for cross-layer analysis of 802.11 MAC and OLSR routing protocols in ad-hoc networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications

Mobility prediction based neighborhood discovery in mobile Ad Hoc networks

NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Analysis of link break detection using HELLO messages

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that neighbor discovery is a critical component of proactive routing protocols in wireless ad hoc networks. However there is no formal study on the performance of proposed neighbor discovery mechanisms. This paper provides a detailed model of key performance metrics of neighbor discovery algorithms, such as node degree and the distribution of the distance to symmetric neighbors. The model accounts for the dynamics of neighbor discovery as well as node density, mobility, radio and interference. The paper demonstrates a method for applying these models to the evaluation of global network metrics. In particular, it describes a model of network connectivity. Validation of the models shows that the degree estimate agrees, within 5% error, with simulations for the considered scenarios. The work presented in this paper serves as a basis for the performance evaluation of remaining performance metrics of routing protocols, vital for large scale deployment of ad-hoc networks.