• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.263-264
• /
• 2008

고속 무선 PAN(Personal Area Networks)기술은 10m 이내의 짧은 거리에서 고속으로 대용량의 데이터를 전송하기 위한 기술로, 최근 무선 USB(Wireless Universal Serial Bus)나 HDTV(High Definition TV)와 같은 광대역 멀티미디어 응용 시장을 겨냥한 연구가 IEEE 802.15.3과 WiMedia를 중심으로 활발히 진행되고 있다. [1] 본 논문에서는 WiMedia Alliance에서 제안한 Distributed Medium Access Control (D-MAC)에서 다수 스트림의 QoS 요구를 만족시키는 신뢰성 있는 전송을 위해 데이터 시간 슬롯을 효율적으로 할당하는 알고리즘에 대해 연구하고자 한다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.59-68
• /
• 1996

In this paper, we propose two types of WDMA protocol for multi-wavelength optical networks that have a dedicated control channel. Protocol type I is designed for the case that the number of nimislots is less than the number of nodes (La${\ge}$M). Proposed protocols employ the aging scheme to guarantee a fairness in the process of channel allocation. The perfomrance of proposed protocols are evaluated in terms of throughput and delay with variations in offered load. Simulation results show that the proposed protocols have superior performance to conventional protocols.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.771-774
• /
• 1999

This paper presents a new timing structure for real time communications and its performance analysis. The cycle time consists of several "one time slot" which may be an interval defined by a synchronous traffic part followed by an asynchronous traffic part. If a station receives a token within a synchronous interval, it transmits its synchronous message if any, otherwise it may transmit an asynchronous message. This scheme is different from usual allocation schemes which divide one cycle into alternating synchronous and asynchronous subslots. This protocol is designed to prevent low priority messages from delaying too much due to lots of high priority messages. We propose the algorithm and show its justification by simulation.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.176-180
• /
• 2004

In this paper we introduce a bandwidth allocation algorithm and admission control policy for IEEE 802.16 broadband wireless access standard. The proposed mechanism is practical and compatible to the IEEE 802.16. Our scheme provides QoS support to high priority traffic and high throughput in low priority traffic. The simulation show that the proposed scheme includes QoS support for real-time traffic and we presented that BS determine a efficient contention mini-slot size. We have shown the relationship between traffic size and its QoS requirements and the network performance.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.7
• /
• pp.478-488
• /
• 2009

Using solar power in wireless sensor networks (WSNs) requires adaptation to a highly varying energy supply and to a battery constraint. From an application's perspective, however, it is often preferred to operate at a constant quality level as opposed to changing application behavior frequently. Reconciling the varying supply with the fixed demand requires good tools for allocating energy such that average of energy supply is computed and demand is fixed accordingly. In this paper, we propose a probabilistic observation-based model for harvested solar energy. Based on this model, we develop a time-slot-based energy allocation scheme to use the periodically harvested solar energy optimally, while minimizing the variance in energy allocation. We also implement the testbed and demonstrate the efficiency of the approach by using it.

• Journal of Internet Computing and Services
• /
• v.7 no.3
• /
• pp.41-51
• /
• 2006

In the case of CDMA-based packet data systems such as 1xEV-DO which are designed to support high rate services, BSs transmit data packets with a maximum power based on time multiplexing mode such that only one user can be serviced at a time. In this paper, we propose a joint power allocation and scheduling algorithm for 1xEV-DO-like systems in which we adopt a code division multiplexing (CDM) transmission method in the downlink common channel in order to utilize channel orthogonality such that we can serve more than one user at a time slot especially when there exist remaining resources after serving the firstly selected user by the scheduler. Simulation results demonstrate that the proposed scheme can improve the performances of conventional schemes such as the maximum rate and the proportional fair algorithms.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.370-376
• /
• 2020

In this study, we consider a group-based random access method for group connection and delivery by grouping devices when H2H devices and large-scale M2M devices coexist in a cell in NB-IoT environment. H2H devices perform individual random access, but M2M devices are grouped according to a NPRACH transmission period, and a leader of each group performs random access. The preamble is allocated using the variable preamble allocation algorithm of the Disjoint Allocation(DA) method. The proposed preamble allocation algorithm is an algorithm that preferentially allocates preambles that maximizes throughput of H2H to H2H devices and allocates the rest to M2M devices. The access distribution of H2H and M2M devices was set as Poisson distribution and Beta distribution, respectively, and throughput, collision probability and resource utilization were analyzed. As the random access transmission slot is repeated, the proposed preamble allocation algorithm decreases the collision probability from 0.93 to 0.83 and 0.79 when the number M2M device groups are 150. In addition, it was found that the amount of increase decreased to 33.7[%], 44.9[%], and 48.6[%] of resource used.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.75-83
• /
• 2016

In this paper, we propose a multi-channel medium access control (MAC) protocol, named underwater multi-channel MAC protocol (UMMAC), for underwater acoustic networks (UANs). UMMAC is a split phase and reservation based multi-channel MAC protocol which enables hosts to utilize multiple channels via a channel allocation and power control algorithm (CAPC). In UMMAC, channel information of neighboring nodes is gathered via exchange of control packets. With such information, UMMAC allows for as many parallel transmissions as possible while avoiding using extra time slot for channel negotiation. By running CAPC algorithm, which aims at maximizing the network's capacity, users can allocate their transmission power and channels in a distributed way. The advantages of the proposed protocol are threefold: 1) Only one transceiver is needed for each node; 2) based on CAPC, hosts are coordinated to negotiate the channels and control power in a distributed way; 3) comparing with existing RTS/CTS MAC protocols, UMMAC do not introduce new overhead for channel negotiation. Simulation results show that UMMAC outperforms Slotted floor acquisition multiple access (FAMA) and multi-channel MAC (MMAC) in terms of network goodput (50% and 17% respectively in a certain scenario). Furthermore, UMMAC can lower the end-to-end delay and achieves a lower energy consumption compared to Slotted FAMA and MMAC.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.45-56
• /
• 2011

WBAN is short range wireless communication technology which is consists of several small devices close to, attached to or implanted into the human body. WBAN is classified into between medical and non-medical by applications based on technology and medical data with periodic characteristics is used the GTS method for transmitting data to guarantee the QoS. In this paper we proposed algorithm that resolve lack of GTSs while data transmit GTS method in superframe structure of WBAN. Coordinator dynamically allocates GTSs according to the data rate of devices and make devices share GTSs when lack of GTSs. We compared delay bounds, throughput for performance evaluation of the proposed algorithm. In other words, we proposed algorithm adaptive WFQ scheduling that GTS allocation support differential data rate in environments of WBAN. The experiment results show the throughput increased and the maximum delay decreased compared with Round Robin scheduling.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.3-9
• /
• 2015

We investigate rate scheduling and power allocation problem for a delay constrained CDMA systems. Specifically, we determine an energy efficient scheduling policy, while each user maintains the short term (n time slots) average throughput. We consider a multirate CDMA system where multirate is achieved by multiple codes. Each code can be interpreted as a virtual user. The aim is to schedule the virtual users into each time slot, such that the sum of transmit energy in n time slots is minimized. We then show that the total energy minimization problem can be solved by a shortest path algorithm. We compare the performance of the optimum scheduling with that of TDMA-type scheduling.