• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.9
• /
• pp.293-300
• /
• 2014

TDMA(Time Division Multiple Access) is a channel access scheme for shared medium networks. The shared frequency is divided into multiple time slots, some of which are assigned to a user for communication. Techniques for TDMA can be categorized into two classes: synchronous and asynchronous. Synchronization is not suitable for small scale networks because it is complicated and requires additional equipments. In contrast, in DESYNC, a biologically-inspired algorithm, the synchronization can be easily achieved without a global clock or other infrastructure overhead. However, DESYNC spends a great deal of time to complete synchronization and does not guarantee the maximum time to synch completion. In this paper, we propose a lightweight synchronization scheme, C-DESYNC, which counts the number of participating nodes with GP (Global Packet) signal including the information about the starting time of a period. The proposed algorithm is mush simpler than the existing synchronization TDMA techniques in terms of cost-effective method and guarantees the maximum time to synch completion. Our simulation results show that C-DESYNC guarantees the completion of the synchronization process within only 3 periods regardless of the number of nodes.

• 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.25 no.1A
• /
• pp.96-103
• /
• 2000

The voice traffic is one of the most important real-time objects in WATM(Wireless Asynchronous Transfer Mode) networks. In this paper, we propose a new MAC(Medium Access'Control) protocol for the efficienttransmission of voice traffic over WATM networks in the multimedia environment and compare the performanceto existing similar protocols. The new protocol separates the reservation slot period for voice and that for data toguarantee some level of QoS(Quality of Service) in voice traffic. This is denoted by a slot assignment functiondepending on the frame size. According to the characteristics of voice traffic which is repeatedly in silent states,the protocol allocates voice reservation request slots dynamically with respect to the number of silent(off state)voice sources and also sends the first block of talkspurt restarted after silent period with a reservation requestslot to reduce the access delay.The simulation results show that the proposed protocol has better performance than Slotted Aloha in bandwidthefficiency, and can serve a certain level of QoS by the given slot assignment function even when the number ofvoice terminals varies dynamically. This means we can observe that the new MAC protocol is much better thanthe NC-PRMA(None Collision-Packet Reservation Multiple Access) protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.5
• /
• pp.581-588
• /
• 2019

In this paper, I propose an modified back-off algorithm to improve the fairness for slotted ALOHA sensor networks. In hierarchical networks, the performance degradation of a specific node can cause degradation of the overall network performance in case the data transmitted by lower nodes is needed to be synthesized and processed by an upper node. Therefore it is important to ensure the fairness of transmission performance to all nodes. The proposed scheme choose a back-off time of a node considering the previous transmission results as well as the current transmission result. Moreover a node that failed to transmit consecutively is given gradually shorter back-off time but a node that is success to transmit consecutively is given gradually longer back-off time. Through simulations, I compare and analyze the performance of the proposed scheme with the binary exponential back-off algorithm(BEB). The results show that the proposed scheme reduces the throughput slightly compared to BEB but improves the fairness significantly.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.561-564
• /
• 2005

This paper proposes an access control algorithm for guaranteeing fair packet transmissions in CDMA-based slotted ALOHA systems. In the proposed algorithm, the base station calculates the packet transmission and retransmission probabilities based on the offered loads and then broadcasts these probabilities to all mobile stations. Mobile stations, which have a packet to transmit, attempt to transmit a packet with the received probabilities. Simulation results show that the proposed algorithm can offer better system throughput and average delay than the conventional algorithm. Results also show that the proposed algorithm can guarantee a good fairness among all mobile stations regardless of the offered loads.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.49-56
• /
• 2007

The IEEE 802.15.4 low rate wireless personal area network is a protocol suitable for wireless sensor networks. Thus there has been growing interest in the IEEE 802.15.4 protocol in the home automation networks. This paper proposes a scheduling scheme obtaining optimal parameters regarding the IEEE 802.15.4 frame and subframes in the home automation networks. Guaranteed time slots (GTS) are exploited for the delivery of real-time traffic. Given a set of the requirements for bandwidths and periods assigned to nodes in the network, the beacon interval and the active/inactive subframe duration satisfying the requirements are selected considering the low duty cycle by the proposed scheme. Based on these parameters, analytic results provide the way to efficient use of network resources including energy.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.530-540
• /
• 2015

Industrial WSNs need great performance and reliable communication. In industrial WSNs, cluster structure reduces the cost to form a network, and the reservation-based MAC is a more powerful and reliable protocol than the contention-based MAC. Depth-based TDMA assigns time slots to each sensor node in a cluster-based network and it works in a distributed manner. DB-TDMA is a type of depth-based TDMA and guarantees scalability and energy efficiency. However, it cannot allocate time slots in parallel and cannot perfectly avoid a collision because each node does not know the total network information. In this paper, we suggest an improved distributed algorithm to reduce the end-to-end delay of DB-TDMA, and the proposed algorithm is compared with DRAND and DB-TDMA.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.34-39
• /
• 2006

IEEE 802.11e 무선LAN 매체접근제어(MAC) 통신규약의 분산조정함수(DCF)의 성능은 경쟁노드수가 증가할수록 급격히 떨어진다. 이러한 문제점을 해결하기 위해서 채널의 유휴슬롯시간(Idle Time)을 측정해서 최소 경쟁윈도($CW_{min}$)를 조절하는 방식이 제시되었다. 이러한 방식을 각 부류별로 서비스 품질이 보장되는 IEEE 802.11e 네트워크로 확장하여 성능을 최대화하는 기법을 이 논문에서 다루겠다. 각 부류별로 서비스품질은 유지하면서 네트워크 전체의 성능을 높일 수 있는 최적의 경쟁윈도 크기를 찾아내는 기법을 보이도록 하겠다.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.169-180
• /
• 2009

With fixed sinks, the network stability could be improved while the network life time could be decreased by the rapid energy dissipation around the fixed sink because of the concentrated network traffic from sensor nodes to the fixed sink in wireless sensor network. To address this problem, mobile sinks, which decentralize the network traffic, has received a lot of attention from many researchers recently. Since a mobile sink has a limited period to communicate with each sensor nodes, it is necessary for a scheduling algorithm to provide the fairness of data collection from each sensor nodes. In the paper, we propose the new scheduling algorithm, ASF(Availability based Scheduling scheme for Fair data collection), for the fair data collection by a mobile in the sensor networks. The ASF takes account of the distance between each sensor nodes and the mobile sink as scheduling metric, as well as the amount of collected data from each sensor nodes. Experiment results shows that the ASF improves the fairness of data collection among the sensor nodes, comparing to existing algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.37-46
• /
• 2011

Time synchronization plays an important role in mobile communication systems, particularly, when an accurate time-division mechanism among the communication entities is required. We present a new time synchronization algorithm for a wireless mobile ad-hoc network assuming that communication link is managed by a time-slot reservation-based medium access control protocol. The central idea is to reduce time synchronization packet collisions by exploiting the advantages found in reference broadcasting. In addition, we adopt a sophisticated clock updating scheme to ensure the time synchronization convergence. To verify the performance of our algorithm, a set of network simulations has been performed under various mobile ad-hoc network scenarios using the OPNET. The results obtained from the simulations show that the proposed method outperforms the conventional TSF method in terms of synchronization accuracy and convergence time.