The Journal of the Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회논문지)

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

Statistical Analysis for Path Break-Up Time of Mobile Wireless Networks

이동 무선망의 경로 붕괴시간에 대한 통계적 분석

  • 안홍영 (홍익대학교 컴퓨터정보통신공학과)
  • Received : 2015.09.04
  • Accepted : 2015.10.09
  • Published : 2015.10.31
Download PDF
⟨ Previous Next ⟩

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($r_0$) due to the mobility of the nodes. The set of total path break down time(${\bigcup}T_i$), 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.

이동 무선망은 통신기반 설치가 필요 없는 빠르고 쉬운 망 구성 등의 장점으로 미래의 통신망으로 많은 주목을 받고 있다. 이동 무선망에서 임의의 두 노드간의 통신 경로는 노드의 이동성으로 인해 어떤 링크에서는 전송 범위($r_0$)를 벗어나 경로 붕괴가 일어나고 통신이 불가능하게 된다. 모든 노드 쌍의 경로 붕괴 시간의 모음인 총 경로붕괴 시간 집합(${\bigcup}T_i$)은 이동 무선망의 동적인 연결 상태를 측정하는 좋은 척도가 될 수 있다. 본 논문에서는 총 경로붕괴 시간의 확률 밀도함수는 지수함수로 근사화 될 수 있음을 보이고 실험 데이터를 통해서 확인하였다. 경로붕괴 시간에 대한 통계적 특성을 알면 이동 무선망에서의 노드 간 지연, 패킷 손실률 등에 대한 정량적 예측을 할 수 있고 시뮬레이션 결과에 대한 확신을 더해 주게 된다.

Keywords

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. https://doi.org/10.1002/(SICI)1098-2418(199909)15:2<145::AID-RSA2>3.0.CO;2-G
  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. https://doi.org/10.1023/B:WINE.0000013081.09837.c0
  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. https://doi.org/10.1145/1089733.1089736
  13. N.A.C. Cressie, Statistics for spatial Data, John Wiley & Sons, 1991.