• Title/Summary/Keyword: multihop networks

Search Result 91, Processing Time 0.018 seconds

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
    • /
    • v.9 no.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
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • 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

Reducing Transmit Power and Extending Network Lifetime via User Cooperation in the Next Generation Wireless Multihop Networks

  • Catovic, Amer;Tekinay, Sirin;Otsu, Toru
    • Journal of Communications and Networks
    • /
    • v.4 no.4
    • /
    • pp.351-362
    • /
    • 2002
  • In this paper, we introduce a new approach to the minimum energy routing (MER) for next generation (NG) multihop wireless networks. We remove the widely used assumption of deterministic, distance-based channel model is removed, and analyze the potentials of MER within the context of the realistic channel model, accounting for shadowing and fading. Rather than adopting the conventional unrealistic assumption of perfect power control in a distributed multihop environment, we propose to exploit inherent spatial diversity of mobile terminals (MT) in NG multihop networks and to combat fading using transmit diversity. We propose the cooperation among MTs, whereby couples of MTs cooperate with each other in order to transmit the signal using two MTs as two transmit antennas. We provide the analytical framework for the performance analysis of this scheme in terms of the feasibility and achievable transmit power reduction. Our simulation result indicate that significant gains can be achieved in terms of the reduction of total transmit power and extension of network lifetime. These gains are in the range of 20-100% for the total transmit power, and 25-90% for the network lifetime, depending on the desired error probability. We show that our analytical results provide excellent match with our simulation results. The messaging load generated by our scheme is moderate, and can be further optimized. Our approach opens the way to a new family of channel-aware routing schemes for multihopNG wireless networks in fading channels. It is particularly suitable for delivering multicast/ geocast services in these networks.

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
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.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.

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)
    • /
    • v.5 no.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.

A Multichannel TDMA MAC Protocol to Reduce End-to-End Delay in Wireless Mesh Networks

  • Trung, Tran Minh;Mo, Jeong-Hoon
    • ETRI Journal
    • /
    • v.32 no.5
    • /
    • pp.819-822
    • /
    • 2010
  • Supporting QoS over multihop wireless mesh networks is difficult because end-to-end delay increases quickly with the increasing number of hops. This paper introduces a novel multichannel time-division multiple-access media access control (McTMAC) protocol that can help to efficiently reduce delay over multihop networks. Performance evaluation results demonstrate that McTMAC outperforms existing alternative protocols. The max-delay can be reduced by as much as 60% by using McTMAC.

Is the Store-and-Forward Delivery Still the Best in Ad Hoc Networks?

  • Park, Jiwon;Moh, Sangman
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.8 no.6
    • /
    • pp.329-337
    • /
    • 2013
  • In multihop routed ad hoc networks, the conventional store-and-forward delivery has been used. However, we may ask a question: "Is the store-and-forward delivery still the best?" This paper presents a pipeline-through MAC (PT-MAC) protocol for ad hoc networks, in which nodes have two 3-channel interfaces in order to use limited radio resources efficiently and improve network performance. The proposed protocol reduces end-to-end delay significantly in multihop routed transmission by exploiting a novel pipeline-through technique rather than using the conventional store-and-forward. This results in improved network performance without increasing control overhead. Our extensive performance study shows that the proposed PT-MAC shows 20-40 percent shorter end-to-end delay and 25-55 percent better goodput compared to the IEEE 802.11 DCF with two 3-channel interfaces.

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

  • Cha, Jae Ryong;Baek, Gwang Hun
    • ETRI Journal
    • /
    • v.37 no.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.

Opportunistic Data Relay Scheme for Narrowband Multihop Combat Radio Networks (협대역 다중홉 전투무선망에서 기회적 데이터 중계 기법)

  • Lee, Jongkwan
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.25 no.1
    • /
    • pp.65-71
    • /
    • 2022
  • In this paper, we propose an opportunistic data relay scheme in narrowband multihop combat radio networks. Narrowband networks have physical restrictions on high-speed transmission. Furthermore, the topology changes dynamically due to the jamming of the enemy, signal interference between friendly forces, and movement of network entities. Therefore, the traditional relay scheme that collects topology information and calculates a relay path before transmission is unsuitable for such networks. Our proposed scheme does not collect topology information and transmits data opportunistically. The scheme can cause unnecessary data relaying that is not related to data delivery to the destination node. However, for small networks, the effect of increasing network throughput by not gathering topology information is much greater than the effect of reducing throughput by unnecessary data relays. We demonstrate the performance superiority of the proposed scheme through simulation in the worst case of network topology.

Analysis of Resource Assignment for Directional Multihop Communications in mm-Wave WPANs

  • Kim, Meejoung;Hong, Seung-Eun;Kim, Yongsun;Kim, Jinkyeong
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.120-130
    • /
    • 2013
  • This paper presents an analysis of resource assignment for multihop communications in millimeter-wave (mm-wave) wireless personal area networks. The purpose of this paper is to figure out the effect of using directional antennas and relaying devices (DEVs) in communications. The analysis is performed based on a grouping algorithm, categorization of the flows, and the relaying DEV selection policy. Three schemes are compared: direct and relaying concurrent transmission (DRCT), direct concurrent transmission (DCT), and direct nonconcurrent transmission (DNCT). Numerical results show that DRCT is better than DCT and DCT is better than DNCT for any antenna beamwidths under the proposed algorithm and policy. The results also show that using relaying DEVs increases the throughput up to 30% and that there is an optimal beamwidth that maximizes spatial reuse and depends on parameters such as the number of flows in the networks. This analysis can provide guidelines for improving the performance of mm-wave band communications with relaying DEVs.