한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)

  • 제41권2호
  • /
  • Pages.53-65
  • /
  • 2016
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지
DOI QR코드

DOI QR Code

다중 홉 무선 네트�p에서 지연을 고려한 멀티케스트 루팅

Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks

  • 손희석 (한국과학기술원 산업공학과) ;
  • 이채영 (한국과학기술원 산업공학과)
  • Sohn, Hee-Seok (Department of Industrial and Systems Engineering, KAIST) ;
  • Lee, Chae Y. (Department of Industrial and Systems Engineering, KAIST)
  • 투고 : 2015.11.04
  • 심사 : 2016.01.19
  • 발행 : 2016.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

키워드

참고문헌

  1. Akyildiz, I.F., X. Wang, and W. Wang, "Wireless mesh networks:a survey," Computer Networks and ISDN Systems, Vol.47, No.4(2005), pp.445-487.
  2. Alicherry, M., R. Bhatia, and L. Li, "Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks," IEEE Journal on Selected Areas in Communications, Vol.24, No. 11(2006), pp.1960-1971. https://doi.org/10.1109/JSAC.2006.881641
  3. Biradar, R.C. and S.S. Manvi, "Ring Mesh Based Multicast Routing Scheme in MANET Using Bandwidth Delay Product," Wireless Personal Communications, Vol.66, No.1 (2012), pp.117-146. https://doi.org/10.1007/s11277-011-0329-0
  4. Chuah, S.-P., Z. Chen, and Y.-P. Tan, "Energy-Efficient Resource Allocation and Scheduling for Multicast of Scalable Video Over Wireless Networks," IEEE Trans. Multimedia, Vol.14, No.4(2012), pp.1324-1336. https://doi.org/10.1109/TMM.2012.2193560
  5. Even, S., "Graph Algorithms," Computer Science Press, (1979), pp.204-209.
  6. Koch, T. and A. Martin, "Solving Steiner tree problems in graphs to optimality," Networks, Vol.32, No.3(1998), pp.207-232. https://doi.org/10.1002/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O
  7. Kun, Z., Q. Yong, and Z. Hong, "Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem," Knowledge-Based Systems, Vol.19, No.7(2006), pp.554-564. https://doi.org/10.1016/j.knosys.2006.04.012
  8. Lee, S.I., M. Gerla, and C.C. Chiang, "On-Demand Multicast Routing Protocol," Proceedings of IEEE WCNC, (1999), pp.1298-1302.
  9. Nguyen, U.T. and J. Xu, "Multicast Routing in Wireless Mesh Networks:Minimum Cost Trees or Shortest Path Trees?," IEEE Communications Magazine, Vol.45, No.11(2007), pp.72-77. https://doi.org/10.1109/MCOM.2007.4378324
  10. Rouskas, G.N. and I. Baldine, "Multicast routing with end-to-end delay and delay variation constraints," IEEE Journal on Selected Areas in Communications, Vol.15, No.3(1997), pp.346-356. https://doi.org/10.1109/49.564133
  11. Royer, E. and C.E. Perkins, "Multicast operation of the ad-hoc on-demand distance vector routing Protocol," Proc. of the 5th ACM/IEEE Annual Conf. on Mobile Computing and Networking, (1999), pp.207-218.
  12. Ruiz, P.M. and A.F. Gomez-Skarmeta, "Approximating Optimal Multicast Trees in Wireless Multihop Networks," 10th IEEE Symposium Comp. and Communication, (2005), pp.686-691.
  13. Sanchez, J.A., P.M. Ruiz, J. Liu, and I. Stojmenovic, "Bandwidth-Efficient Geographic Multicast Routing Protocol for Wireless Sensor Networks," IEEE Sensors Journal, Vol.7, No.5(2007), pp.627-636. https://doi.org/10.1109/JSEN.2007.894149
  14. Sharangi, S., R. Krishnamurti, and M. Hefeeda, "Energy-Efficient Multicating of Scalable Video Streams Over WiMAX Networks," IEEE Trans. Multimedia, Vol.13, No.1(2011), pp.102-115. https://doi.org/10.1109/TMM.2010.2076799
  15. Wan, P.J., G. Calinescu, and C.W. Yi, "Minimum-power multicast routing in static ad hoc wireless networks," IEEE/ACM Transactions on Networking(TON), Vol.12, No.3(2004), pp.507-514. https://doi.org/10.1109/TNET.2004.828940
  16. Wieselthier, J.E., G.D. Nguyen, et al., "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," IEEE INFOCOM, (2000), pp.585-594.
  17. Yuan, D., J. Bauer, and D. Haugland, "Minimum-energy broadcast and multicast in wireless networks:An integer programming approach and improved heuristic algorithms," Ad Hoc Networks, Vol.6, No.5 (2008), pp.696-717. https://doi.org/10.1016/j.adhoc.2007.06.006
  18. Zeng, G., B. Wang, Y. Ding, L. Xiao, and M. Mutka, "Multicast Algorithms for Multi-Channel Wireless Mesh Networks," ICNP, Network Protocols, IEEE International Conference on, (2007), pp.1-10.