• Journal of information and communication convergence engineering
• /
• v.14 no.1
• /
• pp.21-25
• /
• 2016

N-screen is a promising technology to improve support for multimedia multicasting, content sharing, content mobility, media scalability, and seamless mobility. In this paper, the WiMedia distributed-MAC (D-MAC) protocol is adopted for development of a seamless N-screen wireless service. Furthermore, to provide a multi-hop, one source multi-use N-screen service through point to point streaming in a seamless D-MAC protocol, a dynamic multi-frame transmission technology is proposed. In this technology, a dynamic time slot allocation scheme and a multi-hop resource reservation scheme are combined. In the proposed dynamic time slot allocation scheme, two thresholds, a hard threshold and a soft threshold, are included to satisfy the power consumption and delay requirements. A multi-frame DRP reservation scheme is proposed to minimize end-to-end delay during the multi-hop transmissions between N-screen devices. The proposed dynamic multi-frame transmission scheme enhances N-screen performance in terms of the multi-hop link establishment success rate and link establishment time compared to the conventional WiMedia D-MAC system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.502-510
• /
• 2011

In this paper, we propose a slot scheduling algorithm for balancing power consumption in tree-based sensor networks. In this type of networks, nodes with lower depths tend to consume more energy than those with higher depths, thereby reducing the life time of the network. The proposed algorithm allocates a series of receiving slots first and then a series of sending slots. This way of slot allocation eases packet aggregation and filtering, and thus reduces traffic load on nodes near a sink. We compare the proposed algorithm and the frame-slot allocation algorithm employed in the TreeMAC by resorting to simulation. The simulation results showed that the proposed approach well achieves the balancing of power consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.119-126
• /
• 2011

When ZigBee network supports beacon transmission mechanism, ZigBee devices have the restriction of the transmission range from the coordinator. On the contrary, when it does not support beacon transmission, it is not easy to save the energy through turning into sleep mode. This paper proposes active slot allocation method that allocates a transmission time and does not use the beacon transmission mechanism. It is based on the ZigBee's distributed address assignment mechanism and supports the scalability. This paper explains the active slot structure and the allocation order and describes the operation of ZigBee devices. We verify the proposed mechanism through the simulation and show the performance evaluation. It can be useful on the industrial automation and the environmental surveillance.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.14-18
• /
• 2014

A recent major development in computer technology is the advent of wearable computer systems. Wearable computer systems employ a wireless universal serial bus (WUSB), which refers to a combination of USB with the WiMedia wireless technical specifications. In this study, we focus on an integrated system of WUSB over wireless body area networks (WBANs) for wireless wearable computer systems. However, current WBAN MACs do not have well-defined quality of service (QoS) mapping and resource allocation mechanisms to support multimedia streams with the requested QoS parameters. To solve this problem, we propose a novel QoS-aware time slot allocation method. The proposed method provides fair and adaptive QoS provisioning to isochronous streams according to current traffic loads and their requested QoS parameters by executing a QoS satisfaction algorithm at the WUSB/WBAN host. The simulation results show that the proposed method improves the efficiency of time slot utilization while maximizing QoS provisioning.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.129-132
• /
• 2001

Broadband Integrated Services Digital Network(B-lSDN) supports multimedia information in real time. This can be accomplished by using Asynchronous Transfer Mode(ATM) technology. In addition, ATM networks can provide not only bandwidth reservation, but also Quality of Service(QoS) guarantees. In this paper, we propose a efficient cell scheduling algorithm considering ABR service in ATM networks. The proposed algorithm can support ABR service more efficiently than existing fixed cell slot allocation method and priority cell slot allocation method algorithm. proposed algorithm dynamically schedules cells in a real time by considering the current traffic buffer conditions. Throughout the computer simulation, evaluates the performance of the proposed algorithm.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.24-28
• /
• 2008

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. Among the existing anti-collision algorithms, static framed slot allocation algorithm is very simple. But when the number of tags is variable, its performance degrades because of the fixed frame size. This paper proposes an optimal frame size allocation scheme that determines the frame size. The proposed scheme is based on the number of collision slots at every frame. According to the simulation results, the tag identification time is faster that of SFSA.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.25-33
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the 4-Bit Pattern Slot Allocation(4-BPSA) algorithm for the high-speed identification of the multiple tags. The proposed algorithm is based on the tree algorithm using the time slot and identify the tag quickly and efficiently through accurate prediction using the a slot as a 4-bit pattern according to the slot allocation scheme. Through mathematical performance analysis, We proved that the 4-BPSA is an O(n) algorithm by analyzing the worst-case time complexity and the performance of the 4-BPSA is improved compared to existing algorithms. In addition, we verified that the 4-BPSA is performed the average 0.7 times the query per the Tag through MATLAB simulation experiments with performance evaluation of the algorithm and the 4-BPSA ensure stable performance regardless of the number of the tags.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.73-78
• /
• 2002

In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of 'buffer full state'to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to 'low (more than threshold)' and 'abrupt increase' it generates 'buffer full' state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2160-2179
• /
• 2015

In many Radio Frequency Identification (RFID) applications, the reader recognizes the tags within its scope repeatedly. For these applications, some algorithms such as the adaptive query splitting algorithm (AQS) and the novel semi-blocking AQS (SBA) were proposed. In these algorithms, a staying tag retransmits its ID to the reader to be identified, even though the ID of the tag is stored in the reader's memory. When the length of tag ID is long, the reader consumes a long time to identify the staying tags. To overcome this deficiency, we propose a slot allocated blocking anti-collision algorithm (SABA). In SABA, the reader assigns a unique slot to each tag in its range by using a slot allocation mechanism. Based on the allocated slot, each staying tag only replies a short data to the reader in the identification process. As a result, the amount of data transmitted by the staying tags is reduced greatly and the identification rate of the reader is improved effectively. The identification rate and the data amount transmitted by tags of SABA are analyzed theoretically and verified by various simulations. The simulation and analysis results show that the performance of SABA is superior to the existing algorithms significantly.