• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1288-1290
• /
• 2007

Congestion in WSN increases energy dissipation rates of sensor nodes as well as loss of packets and thereby hinders fair and reliable event detections. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic media access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control. Our proposed mechanism ensures load adaptive media access to the nodes and thus achieves fairness in event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio with retry limit 1, even under bursty traffic condition which is good enough for reliable event perception.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.151-161
• /
• 2009

In this paper, we propose an adaptive multiview video coding scheme based on spatiotemporal correlation analyses using hierarchical B picture (AMVC-HBP) for the integrative encoding performances, including high compression efficiency, low complexity, fast random access, and view scalability, by integrating multiple prediction structures. We also propose an in-coding mode-switching algorithm that enables AMVC-HBP to adaptively select a better prediction structure in the encoding process without any additional complexity. Experimental results show that AMVC-HBP outperforms the previous multiview video coding scheme based on H.264/MPEG-4 AVC using the hierarchical B picture (MVC-HBP) on low complexity for 21.5%, on fast random access for about 20%, and on view scalability for 11% to 15% on average. In addition, distinct coding gain can be achieved by AMVC-HBP for dense and fast-moving sequences compared with MVC-HBP.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.28-33
• /
• 2006

The initial research of Task Computing in the ubiquitous computing (UbiComp) environment revealed the need for access control of services. Context-awareness of service requests in ubiquitous computing necessitates a well-designed model to enable effective and adaptive invocation. However, nowadays little work is being undertaken on service access control under the UbiComp environment, which makes the exposed service suffer from the problem of ill-use. One of the research focuses is how to handle the access to the resources over the network. Policy-Based Access Control is an access control method. It adopts a security policy to evaluate requests for resources but has a light-weight combination of the resources. Motivated by the problem above, we propose a universal model and an algorithm to enhance service access control in UbiComp. We detail the architecture of the model and present the access control implementation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.11
• /
• pp.9-14
• /
• 2008

In this paper, we propose a collision avoidance scheduling to increase the multiuser diversity gains in the adaptive orthogonal frequency division multiple access (OFDMA) system. The scheduling policy is based on the minimum collision criterion which investigates the differences of user channels. The paper includes the derivation of capacity expressions for the adaptive OFDMA system with the proposed scheduling. The analysis shows that the capacity of the system depends on the number of collisions between the selected users to be simultaneously served. Numerical results show that the proposed scheduling provides improved capacity performance over existing ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.325-339
• /
• 2018

In this paper, we propose a joint adaptive combining and variable tap-length multiuser detector (MUD) for amplify-and-forward (AF) underwater acoustic cooperative interleave-division multiple access (IDMA) communication system. The proposed MUD jointly realizes tap-length adjustment, adaptive combining, and multiuser detection. In contrast to the existing methods, the proposed detector can adaptively combine the received signals from different nodes at destination, and does not need the assumption that full and perfect channel state information (CSI) of all the links at the receiver is known. Moreover, the proposed detector can adaptively adjust the tap coefficient vector and tap-length of each branch according to the specific channel profile of each branch. Simulation results validate the feasibility and show the advantages of the proposed detector against existing counterparts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3B
• /
• pp.259-266
• /
• 2002

In the CDMA system, the Multiple access interference(MAI) causes system performance and capacity degradation. One of the MAI cancel method is a feedback detector that orthogonal decision-feedback detector(ODFD) and Deocrrelating decision-feedback detector(DDFD) have been studied by now. In this paper, we propose a blind adaptive ODFD(BA-ODFD) with blind equalizer combined ODFD, Also we simulate the operation of BA-ODFD in AWGN channel and Rayleigh (tiding channel. and compare blind adaptive ODFD with blind adaptive DDFD.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.425-427
• /
• 2009

CDMA has been used widely in communication standards like IS-95, WCDMA, and Korea-Japan Satellite-DMB. Since CDMA has a multiple access interference (MAI) problem, a CDMA receiver requires an interference cancellation scheme like prefilter, a kind of adaptive filter. This paper proposed a memory-based prefilter architecture to reduce the area of a prefilter. An adaptive filter is usually implemented with registers for area reduction, but memory-based architecture leads to a less area for a prefilter due to its functional characteristics. Experimental results show that memory-based architecture reduces the area by around 10% in common prefilters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.687-708
• /
• 2017

The machine-to-machine (M2M) communication is featured by tremendous number of devices, small data transmission, and large uplink to downlink traffic ratio. The massive access requests generated by M2M devices would result in the current medium access control (MAC) protocol in LTE/LTE-A networks suffering from physical random access channel (PRACH) overload, high signaling overhead, and resource underutilization. As such, fairness should be carefully considered when M2M traffic coexists with human-to-human (H2H) traffic. To tackle these problems, we propose an adaptive Slotted ALOHA (S-ALOHA) and time division multiple access (TDMA) hybrid protocol. In particular, the proposed hybrid protocol divides the reserved uplink resource blocks (RBs) in a transmission cycle into the S-ALOHA part for M2M traffic with small-size packets and the TDMA part for H2H traffic with large-size packets. Adaptive resource allocation and access class barring (ACB) are exploited and optimized to maximize the channel utility with fairness constraint. Moreover, an upper performance bound for the proposed hybrid protocol is provided by performing the system equilibrium analysis. Simulation results demonstrate that, compared with pure S-ALOHA and pure TDMA protocol under a target fairness constraint of 0.9, our proposed hybrid protocol can improve the capacity by at least 9.44% when ${\lambda}_1:{\lambda}_2=1:1$and by at least 20.53% when ${\lambda}_1:{\lambda}_2=10:1$, where ${\lambda}_1,{\lambda}_2$ are traffic arrival rates of M2M and H2H traffic, respectively.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1669-1679
• /
• 1996

In this paper, we address the problem of how to replace huffers in multimedia database systems with time-varying skewed data access. The access pattern in the multimedia database system to support audio-on-demand and video-on-demand services is generally skewed with a few popular objects. In addition the access pattem of the skewed objects has a time-varying property. In such situations, our analysis indicates that conventional LRU(least Recently Used) and LFU(Least Frequently Used) schemes for buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural suited. We propose a new buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural Networks)using a neural network for multimedia database systems with time-varying skewed data access. The major role of our neural network classifies multimedia objects into two classes:a hot set frequently accessed with great popularity and a cold set randomly accessed with low populsrity. For the classification, the inter-arrival time values of sample objects are employed to train the neural network.Our algorithm partitions buffers into two regions to combine the best roperties of LRU and LFU.One region, which contains the 핫셋 objects, is managed by LFU replacement and the other region , which contains the cold set objects , is managed by LRUreplacement.We performed simulation experiments in an actual environment with time-varying skewed data accsee to compare our algorithm to LRU, LFU, and LRU-k which is a variation of LRU. Simulation resuults indicate that our proposed algorthm provides better performance as compared to the other algorithms. Good performance of the neural network-based replacement scheme means that this new approach can be also suited as an alternative to the existing page replacement and prefetching algorithms in virtual memory systems.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.89-92
• /
• 2001

In this paper, adaptive multi-stage parallel interference cancellation (PIC) receiver is considered for a multi-rate DS-CDMA system. In each stage of the adaptive multi-stage PIC receiver, multiple access interference (MAI) estimates are obtained using the sub-bit estimates from the Previous stage and the adaptive weights for the sub-bit estimates. The adaptive weights are obtained by minimizing the mean squared error between the received signal and its estimate through a least mean square (LMS) algorithm. It is shown that the adaptive multi- stage PIC receiver achieves smaller BER than the matched filter receiver, multi-stage PIC receiver, and multi-stage partial PIC receiver for the multi-rate DS-CDMA system in a Rayleigh fading channel.