• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.189-198
• /
• 2001

In recent years, the predominant part in telecommunications is mobile communications. The next generation network is extending today's voice-only mobile networks to multi-service networks. ATM Network is possible to carry such multi-media traffic and it will be expect to use wireless ATM for the future mobile access network. One of manly important aspects for the performance of wireless ATM is the Medium Access Control (MAC) protocol. The MAC protocol must be able to satisfyingly handle the different ATM services (CBR, VBR, ABR and UBR) with their radically different performance requirements. Additionally, the MAC protocol must be able to cope with the complex radio environment where fading, multi-path propagation interference and burst-errors further complicate the situation. In this paper, a dynamic slot allocation algorithm in wireless ATM is proposed for an efficient channel sharing/media access at the MAC layer. We use equivalent capacity in the allocation of slots for VBR traffic which is variable along the time. It is simple and effective slot allocation method for VBR service. In particular, we consider the slot allocation of a session consisted of several connections for requirement of multimedia traffic. Simulation shows that the cell loss ratio is reduced by re-allocation of extra slots in Mobile Terminal (MT).

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.165-180
• /
• 2001

This study is on the design and performance evaluation of a multi medium access control(MAC) protocol for multimedia access in the wireless ATM network. In general, MAC protocols for multimedia data transmission are classified into the fixed slot allocation algorithm that allocates base-station slots equally over terminals, and the dynamic slot allocation algorithm that with flexible penetration. The conventional slot allocation algorithms assign slots based on the average bandwidths required for various services types. Although the algorithms have a wide bandwidth for real-time-variant services, the slots are being wasted due the service types. To improve the slot waste problem, this thesis proposes a method that minimizes the waste by assigning variable slots based on the most appropriate bandwidth after a base-station analyzes the service type requested from terminals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1004-1014
• /
• 1999

MAC protocols in wireless ATM has to increase and maintain the system throughput performance. To achieve these purposes, this paper proposes a dynamic control algorithm called DSPA (Dynamic Signalling Period Allocation) for wireless ATM MAC protocol. The proposed DSPA algorithm consists of the following three algorithms. First, a control slot generation algorithm which generates the control slots by utilizing static and dynamic parameters from the terminals, is proposed. Second, a dynamic signalling period allocation algorithm is proposed for a base station to dynamically determine each signalling period according to current terminal states, and thus allocates the optimal signalling periods. Finally, a dynamic slot allocation algorithm is proposed to dynamically determine priorities of the terminals whenever a slot is allocated. Simulation results indicates that DSPA algorithm decreases average packet delay of the terminals by dynamic allocation of signal periods based on the system utilization, and thus increases the limitation of allowable loads that quarantee quality of services. Also the proposed algorithm is shown to maintain stable throughput even in the case of traffic variations.

• 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 Positioning, Navigation, and Timing
• /
• v.6 no.3
• /
• pp.117-123
• /
• 2017

In this paper, we propose a performance index that can compare the position estimation performance according to the time slot allocation order, which is superior in the position estimation performance in the operation of the Link-16 based relative navigation system. In order to verify the validity of the performance index, a software-based Link-16 relative navigation system performance analysis platform composed of a signal generator, a signal reception and navigation algorithm execution unit, and a performance analysis unit was designed. Using the designed software platform, we analyzed the relationship between proposed performance index and position estimation performance according to time slot allocation order in the same position reference (PR) arrangement. The performance index of the proposed time slot allocation is expected to be utilized not only for the Link-16 system, but also for the Time Division Multiple Access (TDMA)-based navigation system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.11
• /
• pp.30-40
• /
• 2001

In this paper, we propose a dynamic slot allocation algorithm for efficient transmission of VBR services in wireless ATM networks. The proposed algorithm is based on a hybrid dynamic parameter(DP) control which combines the strength of in-band control and out-of-band control by considering the variation characteristics of buffer length in distributed mobile terminals. This algorithm consists of four sub-algorithms: dynamic parameter determination algorithm, dynamic parameter transmission algorithm, estimation algorithm of the number of request slots, and prorated-allocation algorithm. As the proposed allocation algorithm based on the hybrid DP control scheme can offer nearly precise MAC level estimations of the requirements for each VBR, the algorithm makes it possible to obtain ideal allocation efficiency. The allocation efficiency of the algorithm is shown by numerical analysis. Simulation results show that the proposed algorithm has better performance than conventional schemes in terms of allocation efficiency, delay and cell loss ratio under VBR traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7A
• /
• pp.540-547
• /
• 2009

In this paper, we work for the efficient use of the initial ranging contention slot in OFDMA based wireless mobile networks. Specially, the collision reduction method using an automatic adaptive optimal algorithm is studied for initial ranging contention slot used at initial connection of the mobile terminals. As a result, we propose the algorithm that achieves the collision minimization and the auto-dynamic slot arrangement of the initial ranging slots. To evaluate the proposed algorithm, we compare the simulation results of IEEE802.16e fixed initial ranging slot allocation method versus the proposed algorithm. The simulator is developed based on the IEEE802.16e standard MAC frame structure and processing procedures. As the simulation results, we can expect the proposed algorithm can be applied for the unmanned coastal base station because the proposed algorithm has the effect of minimizing administration cost for the base station.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.1-13
• /
• 1998

The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.

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