The search functionality is under construction.

Author Search Result

[Author] Suhua TANG(9hit)

1-9hit
  • A Link Heterogeneity-Aware On-Demand Routing (LHAOR) Protocol Utilizing Local Update and RSSI Information

    Suhua TANG  Bing ZHANG  Masahiro WATANABE  Shinsuke TANAKA  

     
    PAPER

      Vol:
    E88-B No:9
      Page(s):
    3588-3597

    Many routing protocols have been proposed for mobile ad hoc networks. Among these protocols, the on-demand routing protocols are very attractive because they have low routing overhead. However, few of the existing on-demand routing protocols have considered the link heterogeneity, such as the different communication rate, different Packet Error Ratio (PER). As a result, the routes tend to have the shortest hop count and contain weak links, which usually provide low performance and are susceptible to breaks in the presence of mobility. In this paper, we analyze the existing on-demand routing protocols and propose a Link Heterogeneity Aware On-demand Routing (LHAOR) protocol, where the link quality and mobility are considered. Specifically, the Local Update (LU) is proposed and the link metric is inversely related with the Received Signal Strength Indicator (RSSI). By using the LU method and RSSI information, the routes adapt to the topology variation and link quality changes, and reach the local optimum quickly, which contains strong links and has a small metric. Simulation and experiment results show that our LHAOR protocol achieves much higher performance than the classical on-demand routing protocols.

  • Mobility Prediction Progressive Routing (MP2R), a Cross-Layer Design for Inter-Vehicle Communication

    Suhua TANG  Naoto KADOWAKI  Sadao OBANA  

     
    PAPER-Network

      Vol:
    E91-B No:1
      Page(s):
    221-231

    In this paper we analyze the characteristics of vehicle mobility and propose a novel Mobility Prediction Progressive Routing (MP2R) protocol for Inter-Vehicle Communication (IVC) that is based on cross-layer design. MP2R utilizes the additional gain provided by the directional antennas to improve link quality and connectivity; interference is reduced by the directional transmission. Each node learns its own position and speed and that of other nodes, and performs position prediction. (i) With the predicted progress and link quality, the forwarding decision of a packet is locally made, just before the packet is actually transmitted. In addition the load at the forwarder is considered in order to avoid congestion. (ii) The predicted geographic direction is used to control the beam of the directional antenna. The proposed MP2R protocol is especially suitable for forwarding burst traffic in highly mobile environments. Simulation results show that MP2R effectively reduces Packet Error Ratio (PER) compared with both topology-based routing (AODV [1], FSR [2]) and normal progressive routing (NADV [18]) in the IVC scenarios.

  • Reliable Cut-Through Forwarding for Inter-Vehicle Networks

    Oyunchimeg SHAGDAR  Mehdad. N. SHIRAZI  Suhua TANG  Ryutaro SUZUKI  Sadao OBANA  

     
    PAPER-Applications

      Vol:
    E91-B No:9
      Page(s):
    2864-2872

    In inter-vehicle networks, it is required that collision warning messages be distributed over multiple hops with significantly short delay. Cut-through packet forwarding is known to be an effective method to reduce forwarding latency. However, it suffers from the reliability issue, which is especially severe in highly mobile scenario, due to multi-path fading. This paper tries to establish a reliable cut-through forwarding scheme by applying diversity combining method to collision warning messages. By exploiting the nature of the multi-hop forwarding of a broadcast packet in CDMA wireless networks, the diversity combining scheme does not incur any additional communication overhead or delay. The simulation results show that diversity combining schemes, especially Maximal Ratio Combining (MRC), can effectively reduce BER by orders of magnitude.

  • Joint Channel and Network Decoding for XOR-Based Relay in Multi-Access Channel

    Suhua TANG  Jun CHENG  Chen SUN  Ryu MIURA  Sadao OBANA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E92-B No:11
      Page(s):
    3470-3477

    In this paper network coding based relay for multi-access channel is studied. In the system, two nodes send messages to a common access point (AP). A relay assists the two nodes by forwarding a network coded version of the messages. The AP performs joint channel and network decoding to recover the two original messages from three received signals. Two schemes, soft network coding (SoftNC) and turbo network coding (TurboNC), both focusing on bitwise exclusive or (XOR) based network coding, are proposed to salvage messages from erroneous signals. SoftNC is simple and backward compatible with existing protocol stack of wireless networks, and reduces packet errors by maximal ratio combining (MRC). TurboNC improves channel efficiency by letting the relay node transmit only parity check bits of the interleaved XORed message, where reliability is retained by iterative decoding. Simulation results show that compared with the network-layer path diversity scheme, both SoftNC and TurboNC greatly improve the reliability, and TurboNC also achieves a much higher throughput. The proposed schemes are suitable for improving the performance of wireless local area networks (WLAN).

  • Fast Algorithm for Symbol Rate Estimation

    Suhua TANG  Yi YU  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E88-B No:4
      Page(s):
    1649-1652

    The cyclic autocorrelation of common digital modulation is researched, and the relationship between the cyclic autocorrelation and the delay, corresponding to the symbol rate, is deduced, then a searching algorithm for the symbol rate is proposed. Theoretical analyses and simulation results show that this method has less computation complexity and is also quite accurate. The estimation result is almost immune to the stationary noise. It's of practical value to modulation recognition and blind demodulation.

  • Channel Estimation and Achievable Rate of Massive MU-MIMO Systems with IQ Imbalance Open Access

    Nana ZHANG  Huarui YIN  Weidong WANG  Suhua TANG  

     
    PAPER

      Pubricized:
    2019/02/20
      Vol:
    E102-B No:8
      Page(s):
    1512-1525

    In-phase and quadrature-phase imbalance (IQI) at transceivers is one of the serious hardware impairments degrading system performance. In this paper, we study the overall performance of massive multi-user multi-input multi-output (MU-MIMO) systems with IQI at both the base station (BS) and user equipments (UEs), including the estimation of channel state information, required at the BS for the precoding design. We also adopt a widely-linear precoding based on the real-valued channel model to make better use of the image components of the received signal created by IQI. Of particular importance, we propose estimators of the real-valued channel and derive the closed-form expression of the achievable downlink rate. Both the analytical and simulation results show that IQI at the UEs limits the dowlink rate to finite ceilings even when an infinite number of BS antennas is available, and the results also prove that the widely-linear precoding based on the proposed channel estimation method can improve the overall performance of massive MU-MIMO systems with IQI.

  • Delay-Based Priority Control over Multi-Hop Wireless Mesh Networks

    Bing ZHANG  Oyunchimeg SHAGDAR  Suhua TANG  Youiti KADO  Masanori NOZAKI  Mehdad N. SHIRAZI  

     
    PAPER-Network

      Vol:
    E90-B No:11
      Page(s):
    3124-3132

    Wireless mesh networks are attracting more and more attention as a promising technology for the next generation access infrastructure. QoS support is a unavoidable task given the rising popularity of multimedia applications, and also a challenging task for multi-hop wireless mesh networks. Among the numerous QoS factors, end-to-end delay is one of the most critical and important issues, especially for the real time applications. Over multi-hop wireless mesh networks, end-to-end delay of a flow is highly dependant on the number of hops as well as congestion condition of the hop nodes that the flow traverses through. In this paper, we propose QoS priority control schemes based on the end-to-end QoS delay metrics in order to increase traffic accommodation, i.e., the numbers of real-time flows which satisfy the requirements of end-to-end delay and packet delivery ratio over multi-hop wireless mesh networks. The first scheme enables source and forwarding nodes to perform priority control based on the number of hops of routes. The second scheme enables nodes to perform priority control based on the congestion condition of the hop nodes, where the flow traverses through. The effectiveness of the proposed schemes is investigated with NS-2 network simulator for voice and video traffics over multi-hop wireless mesh networks. Simulation results show that the scheme greatly improves the traffic accommodation for voice and video applications in multi-hop wireless mesh networks.

  • An Opportunistic Forwarding Scheme Exploiting both Long Progress and Adaptive Rate in Wireless Networks

    Suhua TANG  Mehdad N. SHIRAZI  Oyunchimeg SHAGDAR  Ryutaro SUZUKI  Sadao OBANA  

     
    PAPER-Network

      Vol:
    E91-B No:10
      Page(s):
    3241-3250

    In Mobile Ad hoc Networks (MANET) geographic routing is characterized by local forwarding decision. Links with a long progress are preferred under the greedy forwarding rule. However in a real system long links tend to have a high packet loss rate due to multipath fading. A sub-optimal solution may separately exploit path diversity or rate adaptation. In this paper we study channel efficiency of multi-hop forwarding and try to jointly optimize rate adaptation and forwarder selection in geographic routing by the tradeoff between progress and instantaneous rate. We define a new metric -- Bit Transfer Speed (BTS) -- as the ratio of the progress made towards the destination to the equivalent time taken to transfer a payload bit. This metric takes overhead, rate and progress into account. Then we propose a packet forwarding scheme that Opportunistically exploits both long Progress and Adaptive Rate (OPAR) by a cross-layer design of routing and MAC. In OPAR each node selects for a packet the forwarder with the highest BTS. The forwarder changes as local topology (progress), packet size (overhead ratio) or channel state (data rate) varies. Simulation results show that compared with the normalized advance (NADV) [7] scheme and contention-based forwarding (CBF) [17] scheme, OPAR has lower packet loss and can effectively reduce channel occupation time by over 30% in the scenario with moderate mobility speeds.

  • A Reservation-Based Enhancement of IEEE 802.11 DCF Protocol

    Mehdad N. SHIRAZI  Oyunchimeg SHAGDAR  Suhua TANG  Masanori NOZAKI  Youiti KADO  Bing ZHANG  

     
    PAPER-Network

      Vol:
    E90-B No:3
      Page(s):
    538-548

    IEEE 802.11 DCF is an asynchronous and distributed MAC protocol which does not require the existence of a central controller for medium access coordination. This flexibility, which is due to DCF's contention-based nature, comes at the expense of the overhead associated with contention resolution. The overhead consists of frame collision time and channel idle time, which is particularly severe when channel is saturated. In this paper, we present an enhancement of DCF which aims at reducing its contention resolution overhead by equipping it with a distributed reservation mechanism. The proposed reservation mechanism enhances collision avoidance mechanism of DCF by enforcing a partially ordered medium access through an implicit agreement between neighboring nodes. Simulation results, using ns-2 network simulator, show that the added reservation scheme 1) effectively reduces DCF's overhead and improves channel utilization particularly when node density and traffic load is high, 2) significantly enhance DCF's fairness.