DOI QR코드

DOI QR Code

Constructing κ-redundant Data Delivery Structure for Multicast in a Military Hybrid Network

군 하이브리드 네트워크에서 생존성 향상을 위한 다중 경로 멀티캐스팅

  • 방준호 (아주대학교 대학원 컴퓨터공학과) ;
  • 조영종 (아주대학교 대학원 컴퓨터공학과) ;
  • 강경란 (아주대학교 대학원 컴퓨터공학과)
  • Received : 2012.09.23
  • Accepted : 2012.11.23
  • Published : 2012.12.05

Abstract

In this paper, we propose a multi-path construction scheme to improve the survivability of a multicast session in military hybrid networks. A military hybrid network consists of a static backbone network and multiple mobile stub networks where some nodes are frequently susceptible to be disconnected due to link failure and node mobility. To improve the survivability of multicast sessions, we propose a construction scheme of ${\kappa}$ redundant multi-paths to each receiver. In order to take account of different characteristics of static and mobile networks, we propose quite different multi-path setup approaches for the backbone and stub networks, respectively, and combine them at the boundary point called gateway. We prove that our proposed scheme ensures that each receiver of a multicast session has ${\kappa}$ redundant paths to the common source. Through simulations, we evaluate the performance of the proposed schemes from three aspects : network survivability, recovery cost, and end-to-end delay.

Keywords

Acknowledgement

Supported by : 정보통신산업진흥원

References

  1. E. J. Kim, J. S. Lee, D. K. Kim, "An Architecture Information Assurance Model for TICN(Tactical Information Communication Network)", in MITA, pp. 289-292, 2009.
  2. R. Leung, J. Liu, E. Poon, Ah-Lot. Chan, B. Li., "MP-DSR : A QoS-Aware Multi-Path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks", In Proc. of 26th Annual IEEE Conference on Local Computer Networks, pp. 132-141, 2001.
  3. Z. Xie, H. Leng, Z. Chen, and J. Zhang, "Finding Arc and Vertex-Disjoint Paths in Networks", In Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, pp. 539-544, 2009.
  4. MT. Thai, N. Zhang, R. Tiwari, X. Xu, "On Approximation Algorithms of k-connected m-dominating Sets in Disk Graphs", Theoretical Computer Science, Vol. 385, No. 1-3, pp. 49-59, May 2007. https://doi.org/10.1016/j.tcs.2007.05.025
  5. Wu. Y, Wang. F, Thai. MT, Li. Y, "Constructing k-connected m-dominating Sets in Wireless Sensor Networks", In Military Communications Conference, pp. 1-7, 2007.
  6. Y. Li, Y. Wu, C. Ai, and R. Beyah, "On the Construction of k-connected m-dominating Sets in Wireless Networks", Journal of Combinatorial Optimization, Vol. 23, No. 1, pp. 118-139, Apr 2011.
  7. R. Leung, J. Liu, E. Poon, Ah-Lot. Chan, B. Li., "MP-DSR : A QoS-Aware Multi-Path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks", In Local Computer Networks, pp. 132-141, 2001.
  8. F. Dai, J. Wu, "On Constructing k-connected k-dominating Set in Wireless Ad Hoc and Sensor Networks", Journal of Parallel and Distributed Computing, Vol. 66, No. 7, pp. 947-958, Jul 2006. https://doi.org/10.1016/j.jpdc.2005.12.010
  9. I. F. Akyildiz, X. Wang, W. Wang, "Wireless Mesh Networks : A Survey," Computer Networks, Vol. 47 No. 4, pp. 445-487, Mar 2005. https://doi.org/10.1016/j.comnet.2004.12.001
  10. J. Luo, D. Ye, X. Liu, and M. Fan, "A Survey of Multicast Routing Protocols for Mobile Ad-Hoc Networks", IEEE Communications Surveys and Tutorials, Vol. 11, No. 1, pp. 78-91, Jan 2009.
  11. R. Diestel, Graph Theory, 4th Edition. Heidelberg, Germany : Springer-Verlag, pp. 35-71, 2010.
  12. P. Heegaard, K. S Trivedi, "Network Survivability Modeling", Computer Networks, Vol. 53, No. 9, pp. 1215-1234, Mar 2009. https://doi.org/10.1016/j.comnet.2009.02.014