RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재

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

    한글로보기

    https://www.riss.kr/link?id=A101886508

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
    • 오류접수

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    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.
    번역하기

    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 ...

    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.

    더보기

    목차 (Table of Contents)

    • Abstract
    • 1. Introduction and Motivation
    • 2. Related works
    • 3. Problem Formulation
    • 4. Proposed Algorithm
    • Abstract
    • 1. Introduction and Motivation
    • 2. Related works
    • 3. Problem Formulation
    • 4. Proposed Algorithm
    • 5. Simulation Results
    • 6. Conclusion and Discussion
    • References
    더보기

    참고문헌 (Reference)

    1 Akyildiz, I.F., "Wireless mesh networks:a survey" 47 (47): 445-487, 2005

    2 Koch, T., "Solving Steiner tree problems in graphs to optimality" 32 (32): 207-232, 1998

    3 Biradar, R.C., "Ring Mesh Based Multicast Routing Scheme in MANET Using Bandwidth Delay Product" 66 (66): 117-146, 2012

    4 Lee, S.I., "On-Demand Multicast Routing Protocol" 1298-1302, 1999

    5 Wieselthier, J.E., "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks" 585-594, 2000

    6 Rouskas, G.N., "Multicast routing with end-to-end delay and delay variation constraints" 15 (15): 346-356, 1997

    7 Royer, E., "Multicast operation of the ad-hoc on-demand distance vector routing Protocol" 207-218, 1999

    8 Nguyen, U.T., "Multicast Routing in Wireless Mesh Networks:Minimum Cost Trees or Shortest Path Trees?" 45 (45): 72-77, 2007

    9 Zeng, G., "Multicast Algorithms for Multi-Channel Wireless Mesh Networks" 1-10, 2007

    10 Wan, P.J., "Minimum-power multicast routing in static ad hoc wireless networks" 12 (12): 507-514, 2004

    1 Akyildiz, I.F., "Wireless mesh networks:a survey" 47 (47): 445-487, 2005

    2 Koch, T., "Solving Steiner tree problems in graphs to optimality" 32 (32): 207-232, 1998

    3 Biradar, R.C., "Ring Mesh Based Multicast Routing Scheme in MANET Using Bandwidth Delay Product" 66 (66): 117-146, 2012

    4 Lee, S.I., "On-Demand Multicast Routing Protocol" 1298-1302, 1999

    5 Wieselthier, J.E., "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks" 585-594, 2000

    6 Rouskas, G.N., "Multicast routing with end-to-end delay and delay variation constraints" 15 (15): 346-356, 1997

    7 Royer, E., "Multicast operation of the ad-hoc on-demand distance vector routing Protocol" 207-218, 1999

    8 Nguyen, U.T., "Multicast Routing in Wireless Mesh Networks:Minimum Cost Trees or Shortest Path Trees?" 45 (45): 72-77, 2007

    9 Zeng, G., "Multicast Algorithms for Multi-Channel Wireless Mesh Networks" 1-10, 2007

    10 Wan, P.J., "Minimum-power multicast routing in static ad hoc wireless networks" 12 (12): 507-514, 2004

    11 Yuan, D., "Minimum-energy broadcast and multicast in wireless networks:An integer programming approach and improved heuristic algorithms" 6 (6): 696-717, 2008

    12 Alicherry, M., "Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks" 24 (24): 1960-1971, 2006

    13 Even, S., "Graph Algorithms" Computer Science Press 204-209, 1979

    14 Chuah, S.-P., "Energy-Efficient Resource Allocation and Scheduling for Multicast of Scalable Video Over Wireless Networks" 14 (14): 1324-1336, 2012

    15 Sharangi, S., "Energy-Efficient Multicating of Scalable Video Streams Over WiMAX Networks" 13 (13): 102-115, 2011

    16 Kun, Z., "Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem" 19 (19): 554-564, 2006

    17 Sanchez, J.A., "Bandwidth-Efficient Geographic Multicast Routing Protocol for Wireless Sensor Networks" 7 (7): 627-636, 2007

    18 Ruiz, P.M., "Approximating Optimal Multicast Trees in Wireless Multihop Networks" 686-691, 2005

    더보기

    동일학술지(권/호) 다른 논문

    동일학술지 더보기

    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2026 평가 재인증평가 신청대상 (재인증)
    2020-01-01 등재 등재학술지 유지 (재인증) KCI등재
    2017-01-01 등재 등재학술지 유지 (계속평가) KCI등재
    2013-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2010-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2008-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2006-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2004-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2001-01-01 등재 등재학술지 선정 (등재후보2차) KCI등재
    1998-07-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.66 0.66 0.69
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.69 0.66 1.157 0.2
    더보기

    이 자료와 함께 이용한 RISS 자료

    나만을 위한 추천자료

    해외이동버튼