• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1210-1220
• /
• 2016

As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2005.11a
• /
• pp.121-124
• /
• 2005

The High Rate Wireless Personal Area Networks (WPAN) is mainly targeted to consumer electronics and portable communication devices which need high rates and QoS. To achieve these goals, the WPAN provides data rates up to 1Gbps and adopts a Time Division Multiple Access (TDMA) MAC protocol. Since IEEE 802.15.3 MAC is based on TDMA scheme, it has good performance in dealing with real traffics. But it does not give better results for dynamic traffic. For dynamic traffic, IEEE 802.15.3 MAC needs a kind of request and response policy that brings about the degradation of performance in order to adapt to network changes. To overcome this problem and enhance the data throughput, this paper proposes a superframe structure which uses the Enhanced Contention Access Period (ECAP) to transmit data during sleep-CTA in PM mode.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.415-417
• /
• 2005

Core operations (e.9. TDMA scheduler, synchronized sleep period, data aggregation) of many proposed protocols for different layer of sensor network necessitate clock synchronization. Our Paper mingles the scheme of dynamic clustering and diffusion based asynchronous averaging algorithm for clock synchronization in sensor network. Our proposed algorithm takes the advantage of dynamic clustering and then applies asynchronous averaging algorithm for synchronization to reduce number of rounds and operations required for converging time which in turn save energy significantly than energy required in diffusion based asynchronous averaging algorithm.

• Journal of Digital Contents Society
• /
• v.12 no.3
• /
• pp.347-353
• /
• 2011

In HIPERLAN/2, the radio channels are assigned by AP(Access Point) that is centrally operated and the MAC protocol is based on TDMA/TDD. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Hence the number of RCH should be allocated properly according to traffic. From these point, this paper proposes an scheme that dynamically assigned the number of RCH which is based on the number of success and collision of message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.229-231
• /
• 1998

본 논문에서 제안하는 매체접근제어 프로토콜은 활성 단말의 개수를 통계적 특성에 의하여 예측하고 이를 상향 요구 슬롯의 액세스 확률에 적용하여 요구슬롯의 수율(Throughput)을 높이도록 하였으며, 단말에세 슬롯을 할당하는 방식으로 고정할당법과 동적 할당법을 동시에 사용하였다. 고정 할당법은 모든 단말에게 최송한 제공될 수 있는 서비스 품질(QoQ: Quality of Server)을 보장하는 방식이며 동적할당법은 음성 단말에 대하여 버퍼의 상태에 따라 지정된 서비스 품질을 제공하기 위하여 각 단말에게 동적으로 슬롯을 할당하는 방법이다. 제안된 프로토콜에 대해 시뮬레이션을 통하여 음성 및 데이터 단말의 수율과 패킷 전송 지연을 구하고 음성 단말의 패킷 손실률을 분석하여 동적 할당법의 효율에 대하여 알아본다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1138-1147
• /
• 2012

In this paper, an efficient power control based MF-TDMA resource allocation scheme is proposed for next generation military satellite communication systems. The proposed scheme has the flexibility is used to support heterogeneous terminals with differ in transmission capabilities. The method can be divided into two parts : burst size calculation and burst structure determination. At first, we estimate the link budget taken into account a dynamic satellite link state variation. Then, applicable ACM level and burst size is chosen. In burst structure determination phase, we reorganize the burst structure in time-frequency domain by controlling limited power, bandwidth, time resources. In particular, we compensate the power spectral density among different terminals to integrate them in same transponder, Furthermore, we increase the packing efficiency by controlling the ACM level of the burst in applicable power spectral density range. Simulation results show that the method increase the spectral efficiency and burst packing efficiency. In addition, slot allocation rejection ratio is successfully reduced.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.156-166
• /
• 2005

Ethernet passive optical network is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON, the next generation access network, is based on TDMA(Time Division Multiple Access) basically. In this thesis, we addressed the problem of dynamic bandwidth allocation in QoS based Ethernet PONs. We augmented the bandwidth allocation to support QoS in a differentiated services framework. Our differentiated bandwidth guarantee allocation(DBGA) allocates effectively and fairly bandwidths among end users. Moreover, we showed that DBGA that perform weighted bandwidth allocation for high priority packets result in better performance in terms of average and maximum packet delay, as well as network throughput compared with existing dynamic bandwidth allocations. We used simulation experiments to study the performance and validate the effectiveness of the proposed bandwidth allocations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.58-64
• /
• 2009

In this paper, we propose an dynamic random channel allocation scheme increasing probability of channel acquisition and reducing delay by limiting the number of minimum RCHs(Random CHannels) as an optimal factor $\beta$. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and MT(Mobile Terminal) can obtain chance of traffic transmission through channel competition in RCH period. And AP(Access Point) can dynamically schedule the number of RCHs based on the number of the collision in each RCH of the previous frame. Therefore, the proposed scheme increases a probability of channel acquisition and reduces delay by means of guaranteeing the number of minimum RCHs. With a practical Internet traffic, it is concluded that by the proposed scheme the delay reduction of the order of 19% and slightly better throughput are obtained compared to the conventional algorithm.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.35-38
• /
• 2004

The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and AP (Access Point) can dynamically allocate the number of RCHs (Random CHannels). We propose a dynamic random channel allocation scheme improved by limiting the number of minimum RCHs. On a simulated scenario adopted practical Internet traffic, the proposed scheme is shown to achieve over $19\%$ lower delay than previously studied algorithm. This study will be a first step towards designing scope of RCHs for high-performance wireless packet network