• Title/Summary/Keyword: QoS based routing

Search Result 203, Processing Time 0.03 seconds

QoS Routing for WiMedia-Based Wireless Mesh Networks (WiMedia 기반 무선 메쉬 네트워크에서 QoS를 고려한 경로 설정)

  • Park, Sung-Woo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.3
    • /
    • pp.317-324
    • /
    • 2016
  • WiMedia provides the data rate of up to 1Gbps, but the transmission range is restricted to approximately 10 meters. When constructing a multi-hop WiMedia network to extend its coverage, conventional hop-based routing may not guarantee satisfactorily the required QoS. We propose two QoS routing techniques for the WiMedia-based wireless mesh network. The proopsed QoS routing reflects the characteristics of TDMA-based WiMedia MAC and develops QoS extensions separately for on-demand routing and table-driven routing. Through simulations, we identify that the QoS routing shows better performance than the hop-based routing. It also turns out that the QoS on-demand routing and the QoS table-driven routing show conflicting performance results depending on the transmission power.

A Routing Protocol supporting QoS in WiMAX based Wireless Mesh Networks (WiMAX 기반의 무선 메쉬 네트워크에서 QoS를 지원하는 라우팅 프로토콜)

  • Kim, Min;Kim, Hwa-Sung
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.1
    • /
    • pp.1-11
    • /
    • 2009
  • In this paper, we propose a QoS routing protocol for WiMAX based wireless mesh networks. The proposed routing protocol is a proactive hop-by-hop QoS routing protocol. It can find an optimal route that satisfies QoS requirements using bandwidth and delay as QoS parameters. In this paper, we first present a network model for WIMAX based wireless mesh networks and explain why QoS routing protocol is the most appropriate for WiMAX based wireless mesh networks. Then, we propose a proactive hop-by-hop QoS routing protocol that meets QoS requirements of traffic flowing between mesh client and the gateway. The simulation results show that the proposed routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

A Survey of QoS Based Routing Protocols for Wireless Sensor Networks

  • Sumathi, R.;Srinivas, M.G.
    • Journal of Information Processing Systems
    • /
    • v.8 no.4
    • /
    • pp.589-602
    • /
    • 2012
  • With the increasing demand for real time applications in the Wireless Senor Network (WSN), real time critical events anticipate an efficient quality-of-service (QoS) based routing for data delivery from the network infrastructure. Designing such QoS based routing protocol to meet the reliability and delay guarantee of critical events while preserving the energy efficiency is a challenging task. Considerable research has been focused on developing robust energy efficient QoS based routing protocols. In this paper, we present the state of the research by summarizing the work on QoS based routing protocols that has already been published and by highlighting the QoS issues that are being addressed. The performance comparison of QoS based routing protocols such as SAR, MMSPEED, MCMP, MCBR, and EQSR has also been analyzed using ns-2 for various parameters.

Path Selection Algorithms for Localized QoS Routing (로컬 QoS 라우팅을 위한 경로선택 알고리즘)

  • 서경용
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.38-45
    • /
    • 2003
  • Recently, localized QoS routing scheme was recently proposed for overcome drawbacks of global state QoS routing schemes. Localized QoS routing dose not exchange QoS states among routers, but use virtual capacity based routing scheme instead. In localized QoS routing, to archive good performance, a set of candidate paths must be selected between the source and the destination effectively. In this paper we propose a few heuristics for effective path selection and develop path selection algorithms based on the heuristics. More detail analysis of the proposed algorithm is presented with simulation results which demonstrate that the path selection method can very affect the performance of localized QoS routing.

QoS Mesh Routing Protocol for IEEE 802.16 based Wireless Mesh Networks (IEEE 802.16 기반의 무선 메쉬 네트워크를 위한 QoS 메쉬 라우팅 프로토콜)

  • Kim, Min;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1226-1237
    • /
    • 2007
  • This paper proposes QoS mesh routing protocol for IEEE 802.16 based wireless mesh networks. QoS mesh routing protocol proposed in this paper is a proactive hop-by-hop QoS routing protocol. The goal of our routing protocol is not only to find a route from a source to a destination, but also optimal route that satisfies QoS requirements, given in terms of bandwidth and delay as default QoS parameters. In this paper, we first analyze possible types of routing protocols that have been studied for MANET and show proactive hop-by-hop routing protocols are the most appropriate for wireless mesh networks. Then, we present a network model for IEEE 802.16 based wireless mesh networks and propose a proactive hop-by-hop QoS routing protocol. Through our simulation, we represent that our routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

QoS-based RWA Algorithm for providing QoS Services in the Next Generation Internet based on DWDM (DWDM 기반의 차세대 인터넷에서 QoS서비스 제공을 위한 QoS-based RWA 알고리즘)

  • 배정현;송현수;김성운;김영부;조기성;이현진
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.27-37
    • /
    • 2003
  • In the next generation Internet(NGI) based on dense wavelength division multiplexing(DWDM) technology, QoS RWA considering various QoS parameters of DWDM networks is regard as one of the key issues in providing real-time multimedia services. However, finding a qualified path meeting multi-constraints is generally NP-complete problem. It is insufficient for QoS RWA researches in DWDM networks that must consider QoS parameter as well as wavelength-continuity constraint. This paper proposes qualified path routing (QPR) algorithm with minimum computation and implementation complexity based on flooding method to accomplish QoS routing and wavelength assignment (RWA). We also introduce a QoS-based RWA mechanism considering multi-constraint such as optical signal quality attributes, survivability and wavelength-continuity constraint combined with proposed routing algorithm. Simulation results show superior efficiency of the proposed algorithms in terms of blocking probability, routing overhead and survivability ratio.

A Server Based Routing Mechanism Providing QoS Routing with Efficient Support of Best Effort Traffic (QoS 라우팅과 함께 효율적인 최선트래픽 라우팅을 지원하는 서버 기반 라우팅 기법)

  • Choe, Mi-Ra;Kim, Sung-Ha;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.10C no.2
    • /
    • pp.217-232
    • /
    • 2003
  • QoS routing can improve network performance while providing support for QoS guarantees. These benefits, however, comes with additional routing costs such as more complex and frequent route computation and the protocol overheads to exchange dynamic network state information. Moreover, little has been done to mininize the impact of the QoS traffic to the best effort traffic or to enhance the routine Performance of the best effort traffic when QoS routing is deployed. In this paper, it is proposed that a sewer based routing mechanism, which supports the QoS routing without incurring the QoS routing protocol overhead for the network state update exchanges and enhances the performance of the best effort traffic without affecting the performance of QoS routing. Simulation results show that the proposed scheme enhances the routing performance for the QoS traffic while reducing the routing protocol overhead. The routing performance of the best traffic is also improved with virtually no impact to the routine performance of the QoS traffic. The proposed scheme is shown to be especially effective when the ratio of QoS traffic is high, that is, when the impact of the QoS traffic to the performance of best effort traffic is significant.

Flow Holding Time based Advanced Hybrid QoS Routing Link State Update in QoS Routing

  • Cho, Kang Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.4
    • /
    • pp.17-24
    • /
    • 2016
  • In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

SNMP Information Based Hierarchical Routing Mechanism for QoS Improvement of Smooth Handoff in Mobile IP (모바일 IP에서 Smooth Handoff의 QoS 향상을 위한 SNMP 정보 기반의 계층 라우팅 메카니즘)

  • 유상훈;박수현;이이섭;백두권
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2003.06a
    • /
    • pp.61-66
    • /
    • 2003
  • Mobile IP has been designed only to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method simulations we carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

  • PDF

A Cluster-based QoS Multicast Routing Protocol for Scalable MANETs

  • Qabajeh, Mohammad M.;Adballa, Aisha H.;Khalifa, Othman O.;Qabajeh, Liana K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.741-762
    • /
    • 2011
  • Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.