CFP last date
20 June 2024
Reseach Article

Distribution of the Maximum Waiting time of a Hello Message in Ad hoc Networks

by Karima Adel-aissanou, Djamil Aissani, Nathalia Djellab
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 14
Year of Publication: 2012
Authors: Karima Adel-aissanou, Djamil Aissani, Nathalia Djellab
10.5120/7253-0068

Karima Adel-aissanou, Djamil Aissani, Nathalia Djellab . Distribution of the Maximum Waiting time of a Hello Message in Ad hoc Networks. International Journal of Computer Applications. 47, 14 ( June 2012), 1-5. DOI=10.5120/7253-0068

@article{ 10.5120/7253-0068,
author = { Karima Adel-aissanou, Djamil Aissani, Nathalia Djellab },
title = { Distribution of the Maximum Waiting time of a Hello Message in Ad hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 14 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number14/7253-0068/ },
doi = { 10.5120/7253-0068 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:41:49.232611+05:30
%A Karima Adel-aissanou
%A Djamil Aissani
%A Nathalia Djellab
%T Distribution of the Maximum Waiting time of a Hello Message in Ad hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 14
%P 1-5
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper is a contribution to the mathematical modeling of an important element in Ad hoc networks: Hello message. A queuing system is introduced to model the hello message receptions at given node. Here, the customers are the Hello messages and the service is defined as the processing of these messages. The modeling in question allows us to study the maximum waiting time of Hello messages before their treatment in the reception node. Under the hypothesis that Hello messages arrive according to a Poisson process and by using the theory of random walks, we obtain the closed form expression of the maximum waiting time. We validate our approach by the simulation study.

References
  1. Basagni S. , Conti M. , Giordano S. , and Stojmenovi I. 2004. 'Mobile Ad Hoc Networking'. IEEE Press John Wiley.
  2. Moy J. 1994 'OSPF - Open Shortest Path First'. RFC 1583.
  3. Chakers I. D. and Beding-Royer E. M. 2002. 'The utility of hello messages for determining link connectivity'. Proceeding the 5th International Symposium on Wireless Personal Multimedia. Vol (2). 504-508.
  4. Ingelrest F. and Mitton N. and Simplot-Ryl D. 2007. 'A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks'. Proceeding of the 15th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 07). 9-14.
  5. Al Hanbali A. , Ibrahim M. , Simon V. , Varga E. , and Carreras I. 2008. 'A Survey of Message Diffusion Protocols in Mobile Ad hoc Networks'. Proceding of the 3rd International Conference on Performance Evaluation Methodologies and Tools.
  6. Groenevelt R. , Nain P. and Koole G. 2005. 'The message delay in Ad hoc networks'. Performance Evaluation Journal. Vol(62). N°1-4. 210-228.
  7. Al Hanbali A. and Nain P. and Altman E. 2008. 'Performance of ad hoc networks with two-hop relay routing and limited packet lifetime (extented version)'. Performance Evaluation Journal. Vol(65). 463-483.
  8. Diaz J. , Petit J. , and Serna M. 1998. 'Random geometric problems on [0, 1]2', Randomization and Approximation Techniques in Computer Science, vol. 1518 of Lecture Notes in Computer Science. 294–306. Springer-Verlag Berlin.
  9. Nemeth G. and Vattay G. 2002. 'Giant clusters in random ad hoc networks'. condmat/0211325.
  10. Newman M. E. J. , Strogatz S. H. , andWatts D. J. 2001. 'Random graphs with arbitrary degree distributions and their applications'. cond-mat/0007235.
  11. Gomez C. and Cuevas A. and Paradells J. 200). 'AHR: a two-state adaptive mechanism for link connectivity maintenance in AODV'. Proceeding of the 2nd international workshop on multi-hop mobile Ad Hoc networks: from theory to reality. 98-100.
  12. Giruka V. and Singhal M. 2005 Hello protocols for ad hoc networks : Overhead and accuracy trade-offs. Proceeding of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM'05). Vol (1). 354-361.
  13. Borovkov A. A. 1978 'Theory of probability'. Nauka. Moscow.
Index Terms

Computer Science
Information Sciences

Keywords

Ad Hoc Network Hello Message Random Walk Waiting Time Factorization Methods