JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Statistical Analysis for Path Break-Up Time of Mobile Wireless Networks
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Statistical Analysis for Path Break-Up Time of Mobile Wireless Networks
Ahn, Hong-Young;
  PDF(new window)
 Abstract
Mobile wireless networks have received a lot of attention as a future wireless network due to its rapid deployment without communication infrastructure. In these networks communication path between two arbitrary nodes break down because some links in the path are beyond transmission range() due to the mobility of the nodes. The set of total path break down time(), which is the union of path break down time of every node pair, can be a good measure of the connectivity of the dynamic mobile wireless network. In this paper we show that the distribution of the total path break down time can be approximated as a exponential probability density function and confirms it through experimental data. Statistical knowledge of break down time enables quantitative prediction of delay, packet loss between two nodes, thus provides confidence in the simulation results of mobile wireless networks.
 Keywords
mobile wireless network;connectivity;break-up time;link failure;statistical analysis;
 Language
Korean
 Cited by
 References
1.
H.Y. Ahn, "Mobility Analysis Metric for Ad Hoc Network Using Pairwise Clustering," The J. of The Institute of Internet, Broadcasting & Comm., Vol. 10, No. 5, pp. 193-199, 2010

2.
H.Y. Ahn, "Impact of Mobility on the Ad Hoc Network Performance," The J. of The Institute of Internet, Broadcasting & Comm., Vol. 10, No. 5, pp. 201-208, 2010

3.
V. Devarapalli, R. Wakikawa, A. Petrescu, and P. Thubert, "NEtwork MObility (NEMO) basic support protocol," RFC 3963, Jan 2005.

4.
M. Penrose, "On k-connectivity for a geometric random graph", Random Structures and Algorithms. vol. 15, pp.145-164, 1999. crossref(new window)

5.
P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity", in Proc. IEEE Conf. Decision Control, Tampa, FL, Dec. 1998, pp. 1106-1110.

6.
L. E. Miller, "Probability of a two-hop connection in a random mobile network," in Proc. 35th Conf. Inf. Sci. Syst., Baltimore, MD, Mar. 2001.

7.
F. Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," ACM J. Wireless Netw., vol. 10, no. 2, pp. 169-181, Mar. 2004. crossref(new window)

8.
C. Bettstetter, "On the minimum node degree and connectivity of a wireless multihop network," in Proc. ACM Int. Symp. MobiHoc, Lausanne, Switzerland, Jun. 2002, pp. 80-91.

9.
H. Zhang and J. C. Hou, "On the critical total power for asymptotic k-connectivity in wireless networks,"" in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, pp. 466-476.

10.
G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis, "Minimum cut tree clustering," in Proc. 1st WAW, Vancouver, BC, Canada, 2002.

11.
O. Dousse, P. Thiran, and M. Hasler, "Connectivity in ad-hoc and hybrid networks," in Proc. INFOCOM, New York, Jun. 2002, pp. 1079-1088.

12.
P. Santi, "Topology control in wireless ad hoc and sensor network",. ACM Computing Surveys. vol. 37, pp.164-194, 2005. crossref(new window)

13.
N.A.C. Cressie, Statistics for spatial Data, John Wiley & Sons, 1991.