• Title/Summary/Keyword: Mobile Relay

Search Result 233, Processing Time 0.029 seconds

A Conflict-Avoided Resource Reservation using Reservation Diversity for UWB WPAN with Distributed MAC Protocol

  • Joo, Yang-Ick;Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.4
    • /
    • pp.405-410
    • /
    • 2011
  • In this paper, a conflict-avoided resource reservation scheme for UWB (Ultra Wide Band) WPAN (Wireless Personal Area Network) with D-MAC (Distributed Medium Access Control) is proposed. Since distributed characteristic of the WiMedia D-MAC supporting DRP (Distributed Reservation Protocol) scheme may cause lots of conflicts, overall performances of the WiMedia D-MAC can be deteriorated. In addition, once a DRP conflict occurs, only one of the DRP reservations involved in that DRP conflict maintains the reserved MASs, while the other DRP reservation must be terminated and DRP negotiations for them have to be re-started. Such DRP termination and renegotiation time delays due to the DRP conflicts can be a critical problem to the mobile devices transceiving real-time QoS traffic streams. Therefore, we propose a mechanism to avoid DRP conflicts by providing a kind of path diversity using relay transmission scheme and demonstrate its performance improvements via simulation results.

A Study on the Recent Trends and Prospects of Maritime Mobile Communication (선박통신의 현황과 전망에 대한 고찰)

  • 김규환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.3 no.1
    • /
    • pp.35-39
    • /
    • 1978
  • Present system of maritime mobile communication is depend upon HF Band mostly. Due to the range of technical development activities for HF Band has reached to uppermost limit, it is going to be hard to meet the requirements of communication which would be increased in the future, by utilization of HF Band. Studying difficulties of realizing communication function and the uppermost limit of HF Band system, in order to seek more smooth communications under present system, I have been studying remedy of problems in using of HF Band system with examples of relay of free-charge telegrams for the group of an ocean-going vessels of our country, and analized and studied of future prospects of maritime mobile communication.

  • PDF

JXTA Based P2P Services for Mobile Devices

  • Park, Hae-Woo;Jung, Hun;Seo, Yeung-Su;Yu, Chun-Gun;Lee, Jun-Hyuk;Kang, Byung-Wook
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.195-198
    • /
    • 2008
  • The JXTA was made in order to solve the problem of being generated with the computer platform suggested with the P2P(Peer-to-peer) method in the distributed computing. JXTA makes a communication between the various network and the devices is connected to a network which possible. It was designed to the client having the minimum computing ability could attend in the peer-to-peer network. However, for smoothly applying JXTA in the wireless environment, there is a limit with the limited resource of the Mobile Device. By using the Relay of the JXTA based for the Mobile Device, this paper implemented the P2P service which is flexibly effective in the wireless network environment.

  • PDF

Performance Analysis of IDF Relaying M2M Cooperative Networks over N-Nakagami Fading Channels

  • Xu, Lingwei;Zhang, Hao;Gulliver, T. Aaron
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3983-4001
    • /
    • 2015
  • Exact average bit error probability (BEP) expressions for mobile-relay-based mobile-to-mobile (M2M) cooperative networks with incremental decode-and-forward (IDF) relaying over N-Nakagami fading channels are derived in this paper. The average BEP performance under different conditions is evaluated numerically to confirm the accuracy of the analysis. Results are presented which show that the fading coefficient, the number of cascaded components, the relative geometrical gain, and the power allocation parameter have a significant influence on the average BEP performance.

Handover Scheme Considering for Signaling Time in Mobile Networks (무선 네트워크 망에서 시그널링 시간을 고려한 핸드오버 기법)

  • 김도연;한정안;김병기;박상준;김관중
    • Journal of the Korea Society for Simulation
    • /
    • v.11 no.1
    • /
    • pp.45-58
    • /
    • 2002
  • In the wireless communication systems of the next generation, the hard handover may frequent]y occur between the existing 2G(2nd generation) and the 3(1(3rd generation). When it occurs between the 2G and the 3G, the call setup procedure will be added to MT(Mobile Terminal), the relay bases in 2G and 3G, and the switches. It causes total time to handle the hangover to increase. Therefore, the forced termination probability may be increased since relative time decreases. In this paper, we propose a method to decrease the forced termination. The method execute the handover procedure with speed and direction of the MT preestimated in the inner cell when MT enters the boundary cell.

  • PDF

Network Coding Technologies for Wireless Bidirectional Asymmetric Relay (무선 양방향 비대칭 상호중계를 위한 네트워크 코딩 기법)

  • Bongseop Song;Sangpill Lee;Choong-Hee Lee;Inho Lee;In-Joong Nam
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.29 no.5
    • /
    • pp.1-9
    • /
    • 2024
  • With the emergence of various next-generation wireless networks, the traditional store and forward(SF) method at network nodes has faced limitations in efficiently utilizing network capacity. To overcome these limitations, various network coding techniques based on the decode and forward(DF) method have been proposed. However, these techniques have primarily focused on traffic environments with asymmetric packet lengths between relay nodes, limiting their applicability when different modulation and coding schemes(MCS) are applied to relay nodes. This paper proposes a relay network coding scheme that supports high frequency efficiency while simultaneously enabling bidirectional relaying using DF, considering asymmetric MCS traffic that reflects different transmission data and wireless channel conditions between individual nodes for efficient utilization of wireless network capacity. Additionally, this paper demonstrates the possibility of cooperative communication at the relay and examines the effect of increased communication distance. Subsequently, computer simulations are conducted to verify the performance gains of the proposed technique in terms of network coding for each source node with asymmetric information lengths. This proposed technique shows additional bit error rate(BER) performance gains by adopting an incremental redundancy(IR) scheme that follows network coding, even in mobile node environments where direct link transmission between source nodes is possible.

A Message Broadcast Scheme using Contention Window in Vehicular Ad-hoc Network (차량 애드혹 네트워크에서 경쟁윈도우를 이용한 메시지 브로드캐스트 기법)

  • Kim, Tae-Hwan;Hong, Won-Kee;Kim, Hie-Cheol
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.423-434
    • /
    • 2007
  • Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

Efficient Relay Node Selection in Stochastic DTN Model (확률적 DTN 모델에서 효율적인 중계 노드 선택 방법)

  • Dho, Yoon-Hyng;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.367-370
    • /
    • 2017
  • This paper proposes a method for selecting efficient relay nodes in stochastic DTN model. Delay Tolerant Network (DTN) uses the Carry and Forward method, which creates a bundle layer for efficient communication, selects relay nodes between different networks and heterogeneous networks, and forwards messages. DTN is basically composed of mobile nodes so DTN has no fixed routing route and it has long latency due to intermittent connection. Therefore, the nodes constituting the DTN necessarily have the characteristics to store the messages, and the capacity of the stored messages and nodes affects the performance of the network. Stochastic DTN model proposed a Markov model that changes randomly over time to analyze the performance of DTN. In this paper, we use stochastic message distribution and node contact probabilities using contact time analyzed through message generation and extinction in order to select efficient relay nodes in stochastic DTN model.

  • PDF

Enhanced Throughput and QoS Fairness for Two-Hop IEEE 802.16j Relay Networks

  • Kim, Sang-Won;Sung, Won-Jin;Jang, Ju-Wook
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.32-42
    • /
    • 2011
  • Frequency reuse among relay stations (RSs) in a down-link access zone is widely adopted for throughput enhancement in IEEE 802.16j relay networks. Since the areas covered by the RSs or the base station (BS) may overlap, some mobile stations (MSs) at the border between two neighboring transmitting stations (RS or BS) using an identical frequency band may suffer severe interference or outage. This co-channel interference within the cell degrades the quality of service (QoS) fairness among the MSs as well as the system throughput. Exclusive use of a frequency band division (orthogonal resource allocation) among RSs can solve this problem but would cause degradation of the system throughput. We observe a trade-off between system throughput and QoS fairness in the previously reported schemes based on frequency reuse. In this paper, we propose a new frequency reuse scheme that achieves high system throughput with a high fairness level in QoS, positioning our scheme far above the trade-off curve formed by previous schemes. We claim that our scheme is beneficial for applications in which a high QoS level is required even for the MSs at the border. Exploiting the features of a directional antenna in the BS, we create a new zone in the frame structure. In the new zone, the RSs can serve the subordinate MSs at the border and prone to interference. In a 3-RS topology, where the RSs are located at points $120^{\circ}$ apart from one another, the throughput and Jain fairness index are 10.64 Mbps and 0.62, respectively. On the other hand, the throughput for the previously reported overlapped and orthogonal allocation schemes is 8.22 Mbps (fairness: 0.48) and 3.99 Mbps (fairness: 0.80), respectively. For a 6-RS topology, our scheme achieves a throughput of 18.38 Mbps with a fairness of 0.68; however, previous schemes with frequency reuse factors of 1, 2, 3, and 6 achieve a throughput of 15.24 Mbps (fairness: 0.53), 12.42 Mbps (fairness: 0.71),8.84 Mbps (fairness: 0.88), and 4.57 Mbps (fairness: 0.88), respectively.

Interference Aware Downlink Channel Allocation Algorithm to Improve Throughput on OFDMA Cellular Multihop Networks with Random Topology (임의의 토폴로지를 갖는 OFDMA 다중홉 셀룰러 네트워크의 하향링크 간섭 완화를 위한 채널 할당 방법)

  • Lim, Sunggook;Lee, Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.1
    • /
    • pp.43-51
    • /
    • 2015
  • Upcoming cellular networks such as LTE-advanced and IEEE 802.16m are enhanced by relay stations to support high data rate multimedia services and minimize the shadow zone with low cost. Enhancing the relay stations, however, divides the multihop cellular network into smaller microcells and the distance between microcells is closer, which intends large intra-cell and inter-cell interference. Especially the access link on downlink in the OFDMA cellular network is the throughput bottleneck due to the severe interference caused by base stations and relay stations transmitting large data to mobile stations simultaneously. In this paper, we present interference aware channel allocation algorithm to avoid severe interference on multihop cellular networks with random topology. Proposed algorithm increases SINR(signal to interference plus noise ratio) and decreases number of required control messages for channel allocation, so that increases overall throughput on the networks.