The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] packet collision(4hit)

1-4hit
  • HARQ Using Hierarchical Tree-Structured Random Access Identifiers in NOMA-Based Random Access Open Access

    Megumi ASADA  Nobuhide NONAKA  Kenichi HIGUCHI  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2023/02/21
      Vol:
    E106-B No:8
      Page(s):
    696-704

    We propose an efficient hybrid automatic repeat request (HARQ) method that simultaneously achieves packet combining and resolution of the collisions of random access identifiers (RAIDs) during retransmission in a non-orthogonal multiple access (NOMA)-based random access system. Here, the RAID functions as a separator for simultaneously received packets that use the same channel in NOMA. An example of this is a scrambling code used in 4G and 5G systems. Since users independently select a RAID from the candidate set prepared by the system, the decoding of received packets fails when multiple users select the same RAID. Random RAID reselection by each user when attempting retransmission can resolve a RAID collision; however, packet combining between the previous and retransmitted packets is not possible in this case because the base station receiver does not know the relationship between the RAID of the previously transmitted packet and that of the retransmitted packet. To address this problem, we propose a HARQ method that employs novel hierarchical tree-structured RAID groups in which the RAID for the previous packet transmission has a one-to-one relationship with the set of RAIDs for retransmission. The proposed method resolves RAID collisions at retransmission by randomly reselecting for each user a RAID from the dedicated RAID set from the previous transmission. Since the relationship between the RAIDs at the previous transmission and retransmission is known at the base station, packet combining is achieved simultaneously. Computer simulation results show the effectiveness of the proposed method.

  • Multicast Transmission Access Control Methods for Various Wireless LAN Applications

    Toshiyuki OGAWA  Takefumi HIRAGURI  Kentaro NISHIMORI  Hideaki YOSHINO  Kenya JIN'NO  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Vol:
    E97-B No:11
      Page(s):
    2534-2542

    In this paper, we propose an access control protocol method that maintains the communication quality of various applications and reduces packet loss of multicasts in wireless local area networks. Multicast transmission may facilitate effective bandwidth use because packets are simultaneously delivered to more than one mobile station by a single transmission. However, because multicast transmissions does not have a retransmission function, communication quality deteriorates because of packet collisions and interference waves from other systems. Moreover, although multicasts are not considered, the communication quality of each application is guaranteed by a priority control method known as enhanced distributed channel access in IEEE802.11e. The proposed method avoids both these issues. Specifically, because the proposed method first transmits the clear-to-send-to-self frame, the multicast packet avoids collision with the unicast packet. We validate the proposed method by computer simulation in an environment with traffic congestion and interference waves. The results show a reduction in multicast packet loss of approximately 20% and a higher multicast throughput improvement compared to conventional methods. Moreover, the proposed method can assure improve multicast communication quality without affecting other applications.

  • Hidden Node Problem Aware Routing Metrics for WLAN Mesh Networks

    Jaturong SANGIAMWONG  Kengo YAGYU  Toshihiro SUZUKI  

     
    PAPER

      Vol:
    E91-B No:10
      Page(s):
    3113-3121

    This paper proposes two novel hidden node problem aware routing metrics for wireless local area network (WLAN) mesh networks. To select the path that is least affected by the serious hidden node problem, we propose two routing metrics, MNn and MPCP, that take into account the number of neighboring nodes (Nn) and the packet collision probability (PCP), respectively. The PCP is estimated from neighbor information that is periodically gathered as state announcement packets, which include the transmission time ratio and the neighbor list. Simulation results show that the first proposed MNn routing metric tends to be less effective as the number of WLAN nodes increases, i.e., the mesh network becomes denser. On the other hand, with an acceptable increased in the control overhead in the mesh network due to the neighbor information, the second proposed MPCP routing metric improves the number of allowable concurrent voice over Internet Protocol (VoIP) calls and the user datagram protocol (UDP) data throughput compared to the MNn metric. The MPCP also provides better performance than the other conventional routing metrics, the hop count, and the Airtime proposed in IEEE 802.11s.

  • Approximation Method for Deriving Transmission Efficiency in Direct-Sequence Spread ALOHA Communications System Using a Unified Spread Code

    Tohru KIKUTA  Fumihito SASAMORI  Fumio TAKAHATA  

     
    PAPER

      Vol:
    E80-A No:12
      Page(s):
    2500-2508

    Considering that the application of the direct-sequence slotted spread ALOHA communications system to access/control channel is effective in communications systems with traffic channels operating at CDMA mode, the spread ALOHA communications system is discussed in terms of the system configuration and transmission efficiency. The transmission efficiency of the spread ALOHA communications system using a unified spread code is derived by means of two methods. One is based on the simulation of demodulation algorithm, and the other is based on the approximation by modeling. It becomes obvious from quantitative evaluation in terms of the probability of packet success and the throughput performance that the approximated results coincide with the simulated results, and that the modeling is very effective to estimate the transmission efficiency of the spread ALOHA communications system.