• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.3
• /
• pp.501-508
• /
• 2011

In this paper, we propose a channel allocation algorithm of MSAP(Mobile Subscriber Access Point) and data delivery scheme exploiting the symbol level network coding. The network is comprised of TS(Tactical Switch) as a backbone node, MSAPs, and TMFTs(Tactical Multi-Function Terminal). The TS performs the channel allocation considering the communication range overlapping between the neighboring MSAPs and applies the symbol level network coding, if necessary, depending on the position of the TMFTs. Assuming the number of available antennas of TMFT and MSAP will be extended to two from one, we propose two schemes: single mode and dual mode. Through the simulation, we show that the proposed delivery scheme provides higher delivery ratio and lower delivery delay compared with the legacy store-and-forward scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.6
• /
• pp.1-10
• /
• 2015

In this paper, we propose a spectral efficient orthogonal frequency division multiple access(OFDMA) transmission system using multiple relays for a shadow area. The performance of the proposed OFDMA system in a shadow area can be improved by applying space-frequency(SF) block code over relaying multi-path channels. A simple channel cyclicity restoration method is also added in the proposed OFDMA system without cyclic prefix(CP) to recover the destruction of channel cyclicity due to the lack of CP. Simulation results show that the proposed OFDMA system without CP is almost same as that of the conventional OFDMA system with sufficient CP, which increases the spectral efficiency of the system.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.143-147
• /
• 2014

In this paper, a novel MDI(Multiplex Distribution Interface) analyzer is designed in Ethernet-mode for DRM(Digital Radio Mondiale), and DRM+(Digital Radio Mondiale Plus) systems. The proposed MDI analyzer can reduce the overload of MDI packets by using memory sharing techniques into a common module block. In consequence, it verifies the received MDI packets by composition information of IP(Internet Protocol) and FAC(Fast Access Channel)/SDC(Service Description Channel) in DRM/DRM+ systems for the next generation digital radio broadcasting systems.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.287-296
• /
• 2008

The IEEE 802.11 wireless standard uses the carrier sense multiple access with collision avoidance (CSMA/CA) as its MAC protocol (during the distributed coordination function period). This protocol is an adaptation of the CSMA/CD of the wired networks. CSMA/CA mechanism cannot guarantee quality of service (QoS) required by the application because orits random access method. In this study, we propose a new MAC protocol that considers different types of traffic (e.g., voice and data) and for each traffic type different priority levels are assigned. To improve the QoS of IEEE 802.11 MAC protocols over a multi-channel CSMA/CA, we have developed a new admission policy for both voice and data traffics. This protocol can be performed in direct sequence spread spectrum (DSSS) or frequency hopping spread spectrum (FHSS). For voice traffic we reserve a channel, while for data traffic the access is random using a CSMA/CA mechanism, and in this case a selective reject and push-out mechanism is added to meet the quality of service required by data traffic. To study the performance of the proposed protocol and to show the benefits of our design, a mathematical model is built based on Markov chains. The system could be represented by a Markov chain which is difficult to solve as the state-space is too large. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a smaller state-space that allows performance measures to be computed easily. We have used stochastic comparisons of Markov chains to prove that the proposed access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without admission policy and selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.653-660
• /
• 2013

This paper deals with the problem of unfairness among uplink TCP (Transmission Control Protocol) flows associated with frame aggregation employed in IEEE 802.11n WLANs (Wireless Local Area Networks). When multiple stations have uplink TCP flows and transmit TCP data packets to an AP (Access Point), the AP has to compete for channel access with stations for the transmission of TCP ACK (acknowledgement) packets to the stations. Due to this contention-based channel access, TCP ACKs tend to be accumulated in the AP's downlink buffer. We show that the frame aggregation in the MAC (Medium Access Control) layer increases TCP ACK losses in the AP and leads to the serious unfair operation of TCP congestion control. To resolve this problem, we propose the TAC (TCP ACK Compression) mechanism operating at the top of the AP's interface queue. By exploiting the properties of cumulative TCP ACK and frame aggregation, TAC serves only the representative TCP ACK without serving redundant TCP ACKs. Therefore, TAC reduces queue occupancy and prevents ACK losses due to buffer overflow, which significantly contributes to fairness among uplink TCP flows. Also, TAC enhances the channel efficiency by not transmitting unnecessary TCP ACKs. The simulation results show that TAC tightly assures fairness under various network conditions while increasing the aggregate throughput, compared to the existing schemes.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.313-324
• /
• 2005

The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.1
• /
• pp.50-61
• /
• 2014

Operating small cell with existing macro cell is of interest in wireless communication technology to enhance network capacity. Closed-access small cell allows the access of users registered in it and causes severe interference to nearby users connected to macrocell. We propose a dynamic channel allocation for small cells in the same building that first aim to minimize call-drop of the nearby macrocell users, and then want to reduce interferences between the small cells. Since the interference effect of small cells on the nearby macrocell users mainly depends on the small cells' position, the proposed algorithm includes a self-configuration to flexibly allocate frequency channels according to the variation of downlink quality of the macrocell users. Furthermore the algorithm is very simple and practical, which is main contribution of this paper. We observe that the proposed algorithm provides 82-94% of maximum achievable throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.534-541
• /
• 2018

The number of stations existing in the same wireless channel is increasing due to the spread of the wireless LAN devices. CSMA/CA, a conventional wireless LAN protocol, uses a random backoff method. In the random backoff scheme, collision between stations is frequent in a dense region where the number of stations existing in the same channel is several tens or more, and the performance of the performance degradation of such a protocol, the IEEE 802.11ah standard proposed a Restricted Access Window(RAW) wireless access method. RAW improves performance by limiting the number of concurrent access stations by dividing the stations into several groups. In this paper, we propose a method to improve the performance of channel connection by using new group creation, group removal and group relocation algorithm according to traffic change by improving existing RAW method.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.3 s.55
• /
• pp.48-60
• /
• 2005

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1985.10a
• /
• pp.206-209
• /
• 1985