• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.310-317
• /
• 2008

Data collision in LR-WPAN(Low Rate Wireless Personal Area Network) causes retransmission of which energy consumption may reduce life of the entire network. Furthermore LR-WPAN is very sensitive to collision as it has relatively fewer frequencies of backoff retries. LCS(Limited Contention Scheme) suggested in this study is a way to transmit data by certain groups of the total nodes so that it can reduce possibilities of data collision and retransmission by decreasing the number of competing nodes. As a result LCS can increase a throughput and the life of the entire network. As using LCS in designing LR-WPAN in the future can extend battery life, LCS can be useful in any application that requires low energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.455-462
• /
• 2007

The GTS(Guaranteed Time Slot) of IEEE802.15.4 standard, which is the contention free access mechanism, has some problems such as the limited number of deployed devices, the low channel utilization and the service confirm delay. The proposed Cyclic-CFA(Contention Free Access) scheme is a modified polling algorithm that allows a large number of devices to be served Contention Free Access without polling packets. The Cyclic-CFA scheme improves the channel utilization dramatically and also reduces service delay time.

• KIISE Transactions on Computing Practices
• /
• v.24 no.1
• /
• pp.10-16
• /
• 2018

The task of consolidating server workloads is critical for the efficiency of a datacenter in terms of reducing costs. However, as a greater number of workloads are consolidated in a single server, the performance of workloads might be degraded due to their contention to the limited shared resources. To reduce the performance degradation, scheduling for mitigating the contention of shared resources is necessary. In this paper, we present the Dynamic Voltage Frequency Scaling (DVFS) based memory-contention aware scheduling method for multi-threaded workloads. The proposed method uses two approaches: running memory-intensive threads on the limited cores to avoid concurrent memory accesses, and reducing the frequencies of the cores that run memory-intensive threads. With the proposed algorithm, we increased performance by 43% and reduced power consumption by 38% compared to the Completely Fair Scheduler(CFS), the default scheduler of Linux.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5835-5854
• /
• 2017

The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient's data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient's data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.316-318
• /
• 2006

본 논문에서는 차세대 지능형 교통시스템인 UTIS(Urban Traffic Information System)의 빠른 접속 요구 조건을 만족하기 위한 DLC(Dynamic Limited Contention) 알고리즘을 제안한다. UTIS 네트워크는 고속으로 이동하는 차량에 설치된 모바일 노드와 도로 변에 설치된 노변 기지국으로 구성되며, 이 네트워크를 통해서 IP 데이터 그램의 전송 서비스, 방송 데이터를 실시간으로 전송하는 실시간 전송 서비스 그리고 차량의 위치를 계속적으로 알려 주는 위치 탐색 서비스를 지원한다. 이러한 전송 서비스를 지원하기 위해서 UTIS는 물리 계층과 MAC 계층으로 구성된다. 그러나 UTIS에서는 차량의 고속 이동으로 인해서 셀(cell)간의 핸드오프가 빈번히 발생하고 또한 위치 추적과 방송 서비스와 같은 실시간 전송 서비스를 지원해야 하기 때문에 기존의 802.11 MAC을 사용할 수 없다. 즉 UTIS에서의 빠른 등록 요구 조건을 충족시키기 위해 기존의 802.11에서 사용하는 경쟁(contention) 방식은 비효율적이다. 본 논문에서는 셀 내에 도착하는 노드 수에 따라 경쟁을 하는 그룹의 크기를 동적으로 조절하는 DLC 알고리즘을 제안한다. 기존의 UTIS에서는 그룹 크기를 정적으로 결정하고 모바일 노드는 자신의 주소에 이 정적 그룹 크기로 modulo하여 자신의 속한 그룹을 초기에 계산한다. 기지국이 접속해야하는 그룹을 폴링 메시지로 지정할 때 그 그룹에 속한 모바일 노드들만이 제한적으로 경쟁하게 된다. 이러한 정적인 그룹 크기는 셀 내에의 노드의 숫자와 그룹 크기의 분포를 고려하지 않는 방식으로 비효율적이다. 본 DLC 알고리즘에서는 전 폴링 주기 동안에 경쟁하는 노드의 빈도수를 계속적으로 추적하여 등록 시점에 경쟁하는 그룹의 개수를 동적으로 조절하게 된다. 이러한 방식은 UTIS와 같이 접속 시간이 제한적이고 접속하려는 노드 수가 빠르게 변화하는 환경 하에서 기존의 802.11 MAC 프로토콜과 정적인 그룹 크기 방식에 비해 효율적이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1811-1813
• /
• 2016

DCF (Distributed Coordination Function) resolves the channel contention problem in a distributed manner by forcing nodes to randomly choose a waiting time in a contention window. However, since the size of a contention is limited, the collision probability increases with the number of sending nodes. To resolve the problem, in this paper, we propose a transmission control method based on the minority game (MG). Each node can determine autonomously whether to send or not without message exchanges with other nodes to maximize its profit. Through simulation studies, we verify that the proposed method can improves the performance of DCF in terms of collision probability in a congestion situation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2755-2773
• /
• 2015

Cooperative spectrum sensing increases the detection performance in a cognitive radio network, based on the number of sensing nodes. However, as the number of sensing nodes increases, the reporting overhead linearly increases. This paper proposes two kinds of cooperative spectrum sensing with limited reporting in a centralized cognitive radio network, a soft combination with threshold-based reporting (SC-TR) and a soft combination with contention-based reporting (SC-CR). In the proposed SC-TR scheme, each sensing node reports its sensing result to the fusion center through its own reporting channel only if the observed energy value is higher than a decision threshold. In the proposed SC-CR scheme, sensing nodes compete to report their sensing results via shared reporting channels. The simulation results show that the proposed schemes significantly reduce the reporting overhead without sacrificing the detection performance too much.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.171-177
• /
• 2009

Optical packet switching(OPS) is a strong candidate for the next-generation internet, since it has a fine switching granularity at the packet level for providing flexible bandwidth, and provides seamless integration between WDM layer and IP layer. Optical packet switching have been studied in two categories: OPS in synchronous and OPS in asynchronous networks. In this article we are focused on contention resolution of OPS in asynchronous networks. The hybrid buffer have been addressed, to reduce packet loss further as one of the alternative buffer structures for contention resolution of asynchronous and variable length packets, which consists of the FDL buffer and the electronic buffer. The OPS design issue for the limited number of TWCs and internal wavelengths is important in the aspect of switch cost and resource efficiency. Therefore, an hybrid buffer structured optical packet switch and its scheduling algorithm is presented for considering the limited number of TWCs and internal wavelengths, for contention resolution of asynchronous and variable length packets. The proposed algorithm could lead to the packet loss improvement compared to the legacy LAUC-VF algorithm with only the FDL buffer.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.42-49
• /
• 2010

Because sensor nodes operate with the limited power based on battery which cannot be easily replaced, energy efficiency is a fundamental issue pervading the design of communication protocols developed for wireless sensor networks. In wireless networks, energy efficient MAC protocols can usually be described as being either a contention-based protocol or a schedule-based protocol. It is suitable to use combination of both contention-based protocol and schedule-based protocol, because the strengths and weaknesses of these protocols are contrary to each other. In this paper, in order to minimize energy consumption of sensor nodes and maximize network lifetime, we propose a new MAC protocol called "Tiered-MAC" The Tiered-MAC uses a schedule-based TDMA inside maximum transmission range of sink node and a contention-based CSMA otherwise. Therefore, by efficiently managing the congested traffic area, the Tiered-MAC reduces the unnecessary energy consumption. Based on the ns-2 simulation result, we prove that the Tiered-MAC improves the energy-efficiency of sensor network nodes.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.81-91
• /
• 2014

This paper proposes hidden-node aware grouping (HAG) algorithm to enhance the performance of institute of electrical and electronics engineers (IEEE) 802.15.4 networks when they undergo either severe collisions or frequent interferences by hidden nodes. According to the degree of measured collisions and interferences, HAG algorithm dynamically transforms IEEE 802.15.4 protocol between a contention algorithm and a contention-limited one. As a way to reduce the degree of contentions, it organizes nodes into some number of groups and assigns each group an exclusive per-group time slot during which only its member nodes compete to grab the channel. To eliminate harmful disruptions by hidden nodes, especially, it identifies hidden nodes by analyzing the received signal powers that each node reports and then places them into distinct groups. For load balancing, finally it flexibly adapts each per-group time according to the periodic average collision rate of each group. This paper also extends a conventional Markov chain model of IEEE 802.15.4 by including the deferment technique and a traffic source to more accurately evaluate the throughput of HAG algorithm under both saturated and unsaturated environments. This mathematical model and corresponding simulations predict with 6%discrepancy that HAG algorithm can improve the performance of the legacy IEEE 802.15.4 protocol, for example, even by 95% in a network that contains two hidden nodes, resulting in creation of three groups.