• 제목/요약/키워드: multihop

검색결과 126건 처리시간 0.026초

Gateway Strategies for VoIP Traffic over Wireless Multihop Networks

  • Kim, Kyung-Tae;Niculescu, Dragos;Hong, Sang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권1호
    • /
    • pp.24-51
    • /
    • 2011
  • When supporting both voice and TCP in a wireless multihop network, there are two conflicting goals: to protect the VoIP traffic, and to completely utilize the remaining capacity for TCP. We investigate the interaction between these two popular categories of traffic and find that conventional solution approaches, such as enhanced TCP variants, priority queues, bandwidth limitation, and traffic shaping do not always achieve the goals. TCP and VoIP traffic do not easily coexist because of TCP aggressiveness and data burstiness, and the (self-) interference nature of multihop traffic. We found that enhanced TCP variants fail to coexist with VoIP in the wireless multihop scenarios. Surprisingly, even priority schemes, including those built into the MAC such as RTS/CTS or 802.11e generally cannot protect voice, as they do not account for the interference outside communication range. We present VAGP (Voice Adaptive Gateway Pacer) - an adaptive bandwidth control algorithm at the access gateway that dynamically paces wired-to-wireless TCP data flows based on VoIP traffic status. VAGP continuously monitors the quality of VoIP flows at the gateway and controls the bandwidth used by TCP flows before entering the wireless multihop. To also maintain utilization and TCP performance, VAGP employs TCP specific mechanisms that suppress certain retransmissions across the wireless multihop. Compared to previous proposals for improving TCP over wireless multihop, we show that VAGP retains the end-to-end semantics of TCP, does not require modifications of endpoints, and works in a variety of conditions: different TCP variants, multiple flows, and internet delays, different patterns of interference, different multihop topologies, and different traffic patterns.

Novel Section-Based Joint Network Coding and Scheduling Scheme in WMNs: JNCS

  • Cha, Jae Ryong;Baek, Gwang Hun
    • ETRI Journal
    • /
    • 제37권2호
    • /
    • pp.380-386
    • /
    • 2015
  • Guaranteeing quality of service over a multihop wireless network is difficult because end-to-end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section-based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay-and energy-efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.

Performance Evaluation of Parallel Opportunistic Multihop Routing

  • Shin, Won-Yong
    • Journal of information and communication convergence engineering
    • /
    • 제12권3호
    • /
    • pp.135-139
    • /
    • 2014
  • Opportunistic routing was originally introduced in various multihop network environments to reduce the number of hops in such a way that, among the relays that decode the transmitted packet for the current hop, the one that is closest to the destination becomes the transmitter for the next hop. Unlike the conventional opportunistic routing case where there is a single active S-D pair, for an ad hoc network in the presence of fading, we investigate the performance of parallel opportunistic multihop routing that is simultaneously performed by many source-destination (S-D) pairs to maximize the opportunistic gain, thereby enabling us to obtain a logarithmic gain. We first analyze a cut-set upper bound on the throughput scaling law of the network. Second, computer simulations are performed to verify the performance of the existing opportunistic routing for finite network conditions and to show trends consistent with the analytical predictions in the scaling law. More specifically, we evaluate both power and delay with respect to the number of active S-D pairs and then, numerically show a net improvement in terms of the power-delay trade-off over the conventional multihop routing that does not consider the randomness of fading.

Multihop Vehicle-to-Infrastructure Routing Based on the Prediction of Valid Vertices for Vehicular Ad Hoc Networks

  • Shrestha, Raj K.;Moh, Sangman;Chung, IlYong;Shin, Heewook
    • 대한임베디드공학회논문지
    • /
    • 제5권4호
    • /
    • pp.243-253
    • /
    • 2010
  • Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

Underwater Acoustic Networks에서 협력적 다중홉 통신의 성능 향상을 위한 파운틴 code의 적용 (Application of Fountain code for Improved Performance of Cooperative Multihop Communication over Underwater Acoustic Networks)

  • 최민철;김창중;이호경
    • 대한전자공학회논문지TC
    • /
    • 제48권1호
    • /
    • pp.45-49
    • /
    • 2011
  • 협력적 다중 홉 통신은 열악한 무선 통선 환경인 수중 음향 네트워크 환경에서 보다 더 효율적인 통신을 제공한다. 그러나 이러한 협력적 다중 홉 통신은 초기 시간 구간에서 협력 노드 개수 부족으로 인하여 초기 노드에서 오류가 난 선호를 받을 확률이 높고, 오류 선호가 계속적으로 전송되므로 오류 확률증가가 예상된다. 이와같은 문제점을 해결하기 위하여 본 논문에서는 초기 시간 구간에서 파운틴 코드를 적용하여 성능을 개선시킬 수 있음을 모의실험을 통해 보인다. 또한 주파수와 거리에 따른 성능을 송신전력의 관점에서 보고 모의실험을 통해 성능을 보인다.

무선 전력공급 기반 협력적 멀티홉 전송 방법 (Wireless-Powered Cooperative Multihop Transmission Method)

  • 최현호
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2018년도 추계학술대회
    • /
    • pp.499-502
    • /
    • 2018
  • 선형 네트워크 토폴로지에서 노드간 협력을 이용한 무선 전력공급 기반 멀티홉 전송 방식을 제안한다. 제안 프로토콜은 멀티홉 경로의 생존시간의 최대화를 목적으로 멀티홉 노드의 생존시간을 동일하게 맞추어 주도록 노드별 에너지 전송 시간을 결정한다. 각 노드의 생존시간을 동일하게 만들기 위하여 새떼가 동일 속도로 날아다니는 행동양식을 모방한 flocking 알고리즘을 적용하여 노드의 생존시간을 지역적으로 분산 평균화 시킨다. 시뮬레이션을 통하여 제안 알고리즘이 각 노드의 생존시간을 모두 동일하게 만들어 전체 경로의 생존시간을 최대화할 수 있음을 보여준다.

  • PDF

Does Higher Datarate Perform Better in IEEE 802.11-based Multihop Ad Hoc Networks?

  • Li, Frank Y.;Hafslund, Andreas;Hauge, Mariann;Engelstad, Paal;Kure, Oivind;Spilling, Pal
    • Journal of Communications and Networks
    • /
    • 제9권3호
    • /
    • pp.282-295
    • /
    • 2007
  • Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by applying the highest datarate when the chain length is 6 hops or more. With node mobility in mesh topology, the benefit of using high datarate diminishes at even shorter number of hops. To explore the main reasons for this behavior, analyses on multihop end-to-end throughput and network k-connectivity have been conducted later in the paper, and correspondingly an auto-rate adaptation algorithm has been proposed.

Graph theoretical considerations of a channel assignment problem on multihop wireless networks

  • Tamura, Hiroshi;Watanabe, Kaoru;Sengoku, Masakazu;Shinoda, Shoji
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -2
    • /
    • pp.967-970
    • /
    • 2002
  • Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message from a terminal and send it to the other terminal. In this paper, we discuss edge coloring problems related to multihop wireless networks. We show some relations about the problems.

  • PDF

Wavelength Assignment Algorithms fora Multihop Lightwave Network

  • Seo, Jun-Bae;Seo, Hyun-Hwa;Lee, Hyong-Woo;Cho, Choong-Ho
    • 한국통신학회논문지
    • /
    • 제28권6B호
    • /
    • pp.523-532
    • /
    • 2003
  • GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.

Performance Analysis of Decode-and-Forward Relaying with Partial Relay Selection for Multihop Transmission over Rayleigh Fading Channels

  • Bao, Vo Nguyen Quoe;Kong, Hyung-Yun
    • Journal of Communications and Networks
    • /
    • 제12권5호
    • /
    • pp.433-441
    • /
    • 2010
  • Multihop transmission is a promising technique that helps in achieving broader coverage (excellent network connectivity) and preventing the impairment of wireless channels. This paper proposes a cluster-based multihop wireless network that makes use of the advantages of multihop relaying, i.e., path loss gain, and partial relay selection in each hop, i.e., spatial diversity. In this partial relay selection, the node with the maximum instantaneous channel gain will serve as the sender for the next hop. With the proposed protocol, the transmit power and spectral efficiency can be improved over those in the case of direct transmission and conventional multihop transmission. Moreover, at a high signal-to-noise ratio (SNR), the performance of the system with at least two nodes in each cluster is dependent only on the last hop and not on any of the intermediate hops. For a practically feasible decode-and-forward relay strategy, a compact expression for the probability density function of the end-to-end SNR at the destination is derived. This expression is then used to derive closed-form expressions for the outage probability, average symbol error rate, and average bit error rate for M-ary square quadrature amplitude modulation as well as to determine the spectral efficiency of the system. In addition, the probability of SNR gain over direct transmission is investigated for different environments. The mathematical analysis is verified by various simulation results for demonstrating the accuracy of the theoretical approach.