• 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.

• The Korean Journal of Air & Space Law and Policy
• /
• v.29 no.1
• /
• pp.199-236
• /
• 2014

This paper analyses from the perspective of distributive justice the legal mechanisms for international allocation of orbital slots, which are of co-owned nature and thereby limited natural resources in outer space. The allocative function is delegated to the International Telecommunication Union. The Radio Regulation, amongst such other legal instruments as the Constitution and Convention, by which the ITU and contracting States thereof abides, dictates how the orbital positions are distributed. Thus, the RR is thoroughly reviewed in the essay. The mechanisms are in a broad sense categorized into two systems: 'a posteriori system' where the 'first come, first served' principle prevails; and 'a priori system' designed to foster the utilisation of the slots by those who lack space resources and are, in especial, likely to be marginalised under the former system. The argument proceeds on the premise that a posteriori system places the under-resourced States in unfavourable positions in the securement of the slots. In contrast with this notion, seven factors were instantiated for an assertion that the degradation of the distributive justice derived from the 'first come, first served' rule, which lays the foundation for the system, could be either mitigated or counterbalanced by the alleged exceptions to the rule. However, the author of this essay argues for counterevidences against the factors and thereby demonstrating that the principle still remains as an overwhelming doctrine, posing a threat to the pursuit of fair allocation. The elements he set forth are as in the following: 1) that the 'first come, first served' principle only applies to assignments capable of causing harmful interferences; 2) the interoperability of the principle with the 'rule of conformity' with the all the ITU instruments; 3) the viability of alternative registrations, as an exception of the application of the principle, on the condition of provisional and informational purposes; 4) another reference that matters in deciding the priority: the types of services in the TFA; 5) the Rule of Procedure H40 proclaiming a ban on taking advantage of coming first to the Register; 6) the technical factors and equity-oriented norms under international and municipal laws along with; 7) the changes of 'basic characteristics' of registered assignments. The second half of this essay illustrates by examining the relevant Annexes to the Regulation that the planned allocation, i.e., a priori system, bear the structured flaws that hinder the fulfillment of the original purpose of the system. The Broadcasting and Fixed Satellite Systems are the reviewed Plans in which the 'first come, first served' principle re-emerges in the end as a determining factor to grant the 'right to international recognition' to administrations including those who has not the allotted portions in the Plan.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.16-23
• /
• 2009

In this paper, we propose a new distributed Alamouti space-time block coding scheme using cooperative relay system composed of one source node, three relay nodes and one destination node. The source node is assumed to be equipped with two antennas which respectively use a 2-beam array to communicate with two nodes selected from the three relay nodes. During the first time slot, the two signals which respectively were transmitted by one antenna at the source, are selected by one relay node, added, amplified, and forwarded to the destination. During the second time slot, the other two relay nodes implement the conjugate and minusconjugate operations to the two received signals, respectively, each in turn is amplified and forwarded to the destination node. This transmission scheme represents a new distributed Alamouti space-time block code that can be constructed at the relay-destination channel. Through an equivalent matrix expression of symbols, we analyze the performance of this proposed space-time block code in terms of the chernoff upper bound pairwise error probability (PEP). In addition, we evaluate the effect of the coefficient $\alpha$ ($0{\leq}{\alpha}{\leq}1$) determined by power allocation between the two antennas at the source on the received signal performance. Through computer simulation, we show that the received signals at the three relays have same variance only when the value of $\alpha$ is equal to $\frac{2}{3}$, as a consequence, a better performance is obtained at the destination. These analysis results show that the proposed scheme outperforms conventional proposed schemes in terms of diversity gain, PEP and the complexity of relay nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.111-121
• /
• 2014

In this paper, we propose tree-based hybrid query tree architecture utilizing time slot. 4-Bit Pattern Slot Allocation(4-SL) has a 8-ary tree structure and when tag ID responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to extract the location and the number of collided bits. Also, this algorithm can recognize multiple Tags by single query using 4 fixed time slots. The architecture allows the reader to identify 8 tags at the same time by responding 4 time slots utilizing the first bit($[prefix+1]^{th}$, F ${\in}$ {'0' or '1'}) and bit pattern from second ~ third bits($[prefix+2]^{th}{\sim}[prefix+3]^{th}$, $B_2{\in}$ {"00" or "11"}, $B_1{\in}$ {"01" or "10"}) in tag ID. we analyze worst case of the number of query nodes(prefix) in algorithm to extract delay time for recognizing multiple tags. The identification delay time of the proposed algorithm was based on the number of query-responses and query bits, and was calculated by each algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.692-700
• /
• 2012

The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC) protocol based on UWB for high speed wireless home networks and Wireless USB. In this paper, firstly, the fair SoQ-based Distributed Reservation Protocol (DRP) for D-MAC is analyzed. And a novel SoQ-based relay transmission protocol is proposed to overcome DRP conflicts fast. In the proposed protocol, each device executes the Satisfaction of QoS (SoQ) time slot allocation algorithm independently. And, in order to give the loser device due to DRP conflicts another chance to maintain QoS resources, the proposed relay transmission protocol helps the device reserve another indirect link maintaining the required QoS resources via a relay node.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.34-42
• /
• 2008

MAC(Medium Access Control) is demanded to provide end-to-end QoS(Quality of Service) for a variety of traffic in the wireless networks. When all the traffic is integrated in the channel, the main difficulty of the MAC protocol is how to efficiently support multi-class traffic in the limited bandwidth wireless channel. In this paper, we proposed the dynamic bandwidth slot method for improving QoS of the real time traffics. In this paper, we used in-band scheme to send dynamic parameter and considering buffer size and delay variation, we enabled 2 state bits to send to base station in mobile station. The proposed algorithm is to guarantee QoS of real time traffic and maximize transfer efficiency in wireless networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.6
• /
• pp.1324-1329
• /
• 2013

The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC) protocol based on UWB for high speed wireless home networks and WPANs. In this paper, firstly, the fair SoQ-based Distributed Reservation Protocol (DRP) for D-MAC is analyzed. And a novel SoQ-based relay transmission protocol is proposed to overcome DRP conflicts fast. In the proposed protocol, each device executes the Satisfaction of QoS (SoQ) time slot allocation algorithm independently. And, in order to give the loser device due to DRP conflicts another chance to maintain QoS resources, the proposed relay transmission protocol helps the device reserve another indirect link maintaining the required QoS resources via a relay node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.467-476
• /
• 2003

In this paper, we propose an efficient MAC scheduling algorithm for supporting Bluetooth scatternet operations. Our proposed algorithm improves overall performances of scatter mode［2, 3] and considers QoS requirements of each link of the bridge node of a scatternet. Scatter mode is based on time division scheduling and provides every links of a scatternet with fair service opportunities. However, since each Bluetooth devices has various traffic characteristics. fair allocation of service opportunities is not efficient and may cause extravagance of wireless resources. Therefore, we propose a new efficient inter-piconet scheduling algorithm compliant with the current Bluetooth specification［1］, and demonstrate its improved performances via computer simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.899-906
• /
• 2003

In this paper, a channel access control algorithm and a slot allocation algorithm are proposed as MAC protocol for multimedia services in TDMA/TDD-based wireless ATM networks. In the proposed protocol, VBR terminals that require real-time services transmit a reservation request through a random access minislot. VBR terminals, which are successfully transmitted the reservation request, transmits the dynamic parameters through a dynamic parameter minislot without contention. On the other hand, ABR terminals transmit a reservation request with contention basis whenever a non-real-time traffic burst is generated. Based on the received dynamic parameters and the number of requested slots, the base station scheduler allocates a dynamic parameter minislot as well as uplink data slots into VBR terminals. Also the scheduler allocates uplink data slots into ABR terminals in proportion to the number of requested slots.

• 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.