Paper Info
Title
Asymptotic analysis of flooding in CSMA-based large scale ad-hoc wireless networks.
Abstract
In this article, we study the asymptotic behavior of flooding in large scale wireless networks. Specifically, we derive an upper bound on the coverage of flooding when the number of nodes n in the network goes to infinity. We consider two different regimes of transmission radii: first, the case of constant transmission radius r where the percentage of covered nodes scales as O ( n r 2 e − K S n r 2 ) Open image in new window for a constant K S > 0. In this case, as an important result, we observe that the percentage of covered nodes is upper bounded by a decreasing function, vanishing as the network size grows. Second, the case of vanishing r n (i.e., r decreases as n increases) is considered where it is shown in the literature that the minimum value of r n which maintains connectivity is log n / Π n Open image in new window. In this case, a coverage percentage of at most O ( n − K S ′ log n ) Open image in new window is expected for a constant value of K S ′ > 0 Open image in new window, leading to an infinite number of covered nodes. In such case, the rate at which the network coverage is decreased can be controlled and be considerably reduced by a proper choice of network parameters ( K S ′ Open image in new window). Consequently, this result shows that flooding is a suitable strategy even for large networks.
Year
DOI
Venue
2012
10.1186/1687-1499-2012-312
EURASIP J. Wireless Comm. and Networking
Keywords
Field
DocType
Asymptotic analysis, Scaling law, Wireless network
Network size,Wireless network,Binary logarithm,Upper and lower bounds,Computer network,Radius,Flooding (psychology),Asymptotic analysis,Mathematics,Bounded function
Journal
Volume
Issue
ISSN
2012
1
1687-1499
Citations 
PageRank 
References 
13
0.39
13
Authors
5
Name
Order
Citations
PageRank
Hamed Shah-mansouri1454.26
Babak Hossein Khalaj218135.96
Seyed Pooya Shariatpanahi36013.70
Javier Del Ser471287.90
Susana Perez-Sanchez5130.39