• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.19-31
• /
• 2014

In this paper, a parallel backoff delay procedure on multiple IEEE 802.15.4 channels and a channel searching method considering the frequency spectrum of WiFi traffic are studied for IEEE 802.15.4 nodes to avoid the interference from WiFi traffic. In order to search the channels being occupied by WiFi traffic, we analyzed the methods measuring the powers of adjacent channels simultaneously, checking the duration of measured power levels greater than a threshold, and finding the same periodicity of sampled RSSI data as the beacon frame by signal processing. In an wireless channel overlapped with IEEE 802.11 network, the operation of CSMA-CA algorithm for IEEE 802.15.4 nodes is explained. A method to execute a parallel backoff procedure on multiples IEEE 802.15.4 channels by an IEEE 802.15.4 device is proposed with the description of its algorithm. When we analyze the data measured by the experimental system implemented with the proposed method, it is observed that medium access delay times increase at the same time in the associated IEEE 802.15.4 channels that are adjacent each other during the generation of WiFi traffic. A channel evaluation function to decide the interference from other traffic on an IEEE 802.15.4 channel is defined. A channel searching method considering the channel evaluations on the adjacent channels together is proposed in order to search the IEEE 802.15.4 channels interfered by WiFi, and the experimental results show that it correctly finds the channels interfered by WiFi traffic.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.46-55
• /
• 2009

In RFID field, when the neighboring readers try to occupy the same or adjacent channel simultaneously, there exists reader-to-reader interference; it calls reader collision. From the reader collision, the tags cannot response correctly query from the reader. Reader anti-collision schemes have been developed, and particularly, the Listen-Before-Talk(LBT) scheme is proposed to avoid reader collision in ETSI in multi channel environment. However, in ETSI, there is a drawback that the reader collision does not decreases effectively because the reader selects randomly a channel without considering the channel environment and readers try to occupy the channel concurrently. In this paper, we propose a algorithm based on LBT scheme considering multi channel environment as well as made up for the drawbacks of LBT The proposed algorithm applies random backoff, the collision avoidance mechanism. And it can reduce delay because of our proposed estimation mechanism Simulation using OPNET shows that the proposed algorithm achieves higher superiority than that of the simple algorithms in sparse and dense reader mode.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1225-1230
• /
• 2015

MAC protocol for WBAN performs CSMA/CA(:Carrier Sense Multiple Access with Collision Avoidance)algorithm that handles traffic which occurs in emergency with top priority in order to deal with variable data of sensor node for medicine. Emergency message that node sends undergoes collision and delay of transmission by retransmission of emergency message and waste of energy by retransmission. This paper suggests algorithm that minimizes loss of frame caused by collision and applies different backoff parameters by setting order of priority between MAC instruction frame and data frame in CSMA/CA algorithm case which applies order of priority queuing to improve aforementioned problem. According to performance evaluation, it has been found that using suggested MAC protocol showed lower collision probability, higher packet transmission processing ratio and lower packet loss compared with using IEEE 802.15.6.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.796-798
• /
• 2011

The IEEE 802.11 MAC uses DCF for media access among the participating network nodes. But DCF alone is neither capable nor suitable for fulfilling the QoS requirements of realtime applications. There are many ways in which QoS is provided by modifying DCF based MAC. This paper proposes (m,k)-collision scheme which is based on IEEE 802.11 and (m,k)-firm scheme tries to improve DCF functionality. The proposed scheme uses different Contention Window according to the number of collision in the node. The simulation result shows that the proposed scheme helps improve the throughput of the DCF.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.151-164
• /
• 2006

The DCF of IEEE 802.11 standard coordinates transmissions onto the shared communication channel based on CSMA/CA protocol. Currently, 802,11 is the most widely deployed wireless LAN standard. In this paper, for 802.11-based wireless LAN we propose a service differentiation scheme adopting different contention window sizes and retransmission schemes for two different types of data packets and we present a Markov model for the state of a given station under a finite load traffic condition. We then derive an algorithm to find the transmission probability and the throughput. The proposed model is validated through simulation under various system settings.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.11-19
• /
• 2008

To enhance the performance of the IEEE 802.16 broadband wireless access system, it is necessary to improve the efficiency of the radio link. The efficiency of the uplink can be improved by using more efficient random access method. As new random access methods, we propose a RA_NBRM method which is based on the number of bandwidth request messages and a RA_CRA method which is based on the conflict resolution algorithm. The simulation results show that the performance of the new methods is superior to that of the existing binary exponential backoff method.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.249-257
• /
• 2005

A Markov model for the IEEE 802.11 standard which is the most widely deployed wireless LAN protocol, is designed and the channel throughput is evaluated. The DCF of 802.11, which is based on CSMA/CA protocol, coordinates transmissions onto the shared communication channel. In this paper, under a finite load traffic condition and the assumption of packet loss after the final backoff stage. We present an algorithm to find the transmission probability and derive the formula for the channel throughput. The proposed model is validated through simulation and is compared with the case without packet losses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.98-106
• /
• 2006

In order to provide a realtime transmission over a wireless LAM, we here present a new jamming based retransmission mechanism. In a legacy wireless LAN system, all stations use the binary exponential backoff algorithm to avoid collisions among frames. It is well known that the backoff algorithm causes more collisions as the numbers of active stations increases. This makes transmission of real time traffic hard. In the proposed scheme, when each station senses collisions, it promptly allows to send a jamming signal during a unique jamming window period which is determined by its own channel access count database(CACDB). This jamming windows is chosen not to be overlapped each other by using of CACDB, and thus channel access of another station is prevented. Hereafter the station gets the ownership of the medium when the wireless medium becomes idle after sending the jamming signal and sensing carrier, and then sends frame in medium. In our proposal, repeating collisions is never happened. We here assume that real time traffic use a frame of fixed length in order to make the time for receiving its ACK frame same. Comparing the proposed jamming-based retransmission scheme with the the 802.11 and 802.11e MAC by simulation. one can find that the proposed scheme have advantages in terms of delay, average backoff time, and average number of collisions per frame. One can find that the proposed scheme might be practically applicable to several applications of realtime traffic transmission in wireless LAN systems.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.53-63
• /
• 2008

Reader collision may occur when neighboring RFID readers use the same channel at the same time. Especially when the readers are operated in dense mode, even though many channels are available, because of frequent reader collisions we can not guarantee the performance of RFID readers. Conventional solutions such as FH(Frequency Hopping) or LBT(Listen Before Talk) are not effective in this situation because they can not schedule RFID readers effectively when RFID readers are operated in multi-channel, dense reader mode, In this paper, we propose a new RFID reader anti-collision algorithm which employs LBT, random backoff before channel access, and probabilistic channel hopping at the same time. While LBT and Random backoff before channel access reduces collisions between competing readers, probabilistic channel hopping increases channel utilization by adaptively changing the hopping probability by reflecting the reader density and utilization. Simulation results shows that our algorithm outperforms conventional methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.493-501
• /
• 2007

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et at suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, the NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In NORA algorithm, EDF strategy is adopted in the optional scheduling. On the other hand, for the task system with 0/1 constraint, EDF_Scheduling may not be optimal in the sense that the total error is minimized. Furthermore, when the optional tasks are scheduled in the ascending order of their required processing times, NORA algorithm which EDF strategy is adopted may not produce minimum total error. Therefore, in this paper, an online algorithm is proposed to minimize total error for the imprecise task system with 0/1 constraint. Then, to compare the performance between the proposed algorithm and NORA algorithm, a series of experiments are performed. As a conseqence of the performance comparison between two algorithms, it has been concluded that the proposed algorithm can produce similar total error to NORA algorithm when the optional tasks are scheduled in the random order of their required processing times but, the proposed algorithm can produce less total error than NORA algorithm especially when the optional tasks are scheduled in the ascending order of their required processing times.