Subscribe Now Subscribe Today
Science Alert Home Journals at Science Alert For Authors For Subscribers Contact Us
   
Journal of Applied Sciences
  Year: 2008 | Volume: 8 | Issue: 8 | Page No.: 1462-1470
DOI: 10.3923/jas.2008.1462.1470
Connectivity Graph Approximation Using Modified Manhattan Distance in Mobile Ad Hoc Networks
Ali Peiravi and Hossein Tolooei Kheibari

Abstract:
In this study, we focus on dynamic networks, where moving agents produce varying connectivity graphs in time. We use the velocity information of every agent to develop a fast algorithm to approximate the connectivity graph of dynamic networks. Also we used mean degree distribution instead of degree distribution to investigate congestion/interference of network when approximate method is used. We introduced a modification factor for connectivity distance, R in Manhattan measure to increase the accuracy in a wide range of R. The results for two random distributions of agents based on Monte Carlo simulation are compared to the present real connectivity method to show the superiority of our approach.
 [Fulltext PDF]   [Fulltext HTML]   [XML: Abstract + References]   [References]   [View Citation]  [Report Citation]
How to cite this article:

Ali Peiravi and Hossein Tolooei Kheibari, 2008. Connectivity Graph Approximation Using Modified Manhattan Distance in Mobile Ad Hoc Networks. Journal of Applied Sciences, 8: 1462-1470.

DOI: 10.3923/jas.2008.1462.1470

URL: http://scialert.net/abstract/?doi=jas.2008.1462.1470

 
COMMENT ON THIS PAPER
.
 
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 
 
 
 
 
 
 

                 home       |       journals        |       for authors       |       for subscribers       |       asci
          © Science Alert. All Rights Reserved