Abstract—In this work our focus is on the cover time analysis of an ad-hoc wireless network, when the nodes are allowed to move with in an compact space. We consider an ad-hoc network in 2-dimensional space, and a sequence Xn= {X1, X2 , Xn}, with n nodes distributed uniformly over a compact space2 CÌR. We derive a strong law result for the cover time of the network and show that for transmission radiuslogn rnp n= he critical cover time Cn isat most of order of 5/2 o(n ).
Index Terms—Ad-hoc networks, capacity, mobility, cover-time.
The author is with the Indian Institute of Information Technology, Design and Manufacturing -Jabalpur, India(e-mail:gupta.bhupendra@gmail.com, bhupen@iiitdmj.ac.in).
Cite: Bhupendra Gupta, "Cover Time Analysis of Ad-Hoc Wireless Network," International Journal of Future Computer and Communication vol. 1, no. 2, pp. 184-186, 2012.
Copyright © 2008-2024. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net