• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.3
• /
• pp.131-138
• /
• 2017

QR/NFC tags have been utilized in various fields like exhibition, museum, and so on, but they have a drawback that they are read-only fundamentally. We devise a novel device called a smart memory tag (below mem-tag) which is supplemented with the write function through combining a flash memory into a NFC tag. A mem-tag is composed of an NFC tag, an MCU, a flash memory, a bluetooth module, and a battery, and is inter-operating with smartphones via bluetooth communication. It can be used in a bulletin board to support writing replies and in a check-in service to verify the presence of the site. What matters is that users' inter-operations are borne to be asynchronous, which leads to the energy consumption to wait for users' actions. Sleep mechanisms and asynchronous MAC protocols used in ubiquotous sensor networks cannot avoid the consumption of battery. In this paper, we propose a touch and play scheme for minimizing the consumption of battery that the MCU wakes up and PLAY when a user TOUCH the mem-tag. We implemented the system to show that our scheme lets the mem-tag work 50 times longer than the sleep and wake-up scheme.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.75-89
• /
• 2003

Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2B
• /
• pp.148-158
• /
• 2011

Stationary nodes and mobile nodes co-exist wireless sensor network(WSN) can provide variety of new services. The stationary sensor node acts not only the gathering the environmental sensing data but also a access point to bidirectional communication with numerous mobile sensor nodes(mobile node), and the mobile sensor nodes are installed inside mobile objects and identify the location in real-time and monitor the internal status of the object. However, only using the legacy WSN protocol, it is impossible to set up the stable network due to the several reasons caused by the free-mobility of the mobile nodes. In this paper, we suggest three methods to increase the hit-ratio of the asynchronous message delivery(AMD) among mobile nodes. We verified the performance of the suggested methods under the stationary-mobile co-existed WSN testbed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.118-127
• /
• 2006

The wireless transmission medium inherently broadcasts a signal to all neighbor nodes in the transmission range. Existing asynchronous MAC protocols do not provide a concrete solution for reliable broadcast in link layer. This mainly comes from that an omnidirectional broadcasting causes to reduce the network performance due to the explosive collisions and contentions. This paper proposes a directional broadcast protocol by using neighborhood information in the link layer based o,1 directional antennas, named MNDB (MAC protocol with Neighborhood for reliable Directional Broadcast). This protocol makes use of neighborhood information and DMACA (Directional Multiple Access and Collision Avoidance) scheme through 4-way handshake to support a reliable directional broadcast. To analyze its performance, MNDB protocol si compared with $RMDB^{[1]}$, the protocol 2 of reference [3], and IEEE 802.11 $protocol^{[9]}$, in terms of the number of collisions, the number of dropped packets, the number of redundant packets, and broadcast delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1380-1385
• /
• 2006

A Pipelined Tone Wakeup(PTW) scheme(1) was proposed to support energy saving and end-to-end delay for sensor networks by providing an asynchronous wakeup pipeline to overlap the wakeup procedures with the packet transmission. But the scheme uses two radios and assumes error-free environments. In this paper, we propose a modified PTW scheme for wireless sensor networks. The proposed scheme is based on the PTW. The difference is that next hop information will be included in the ack packet from receiver node to sender node, So all the other neighbor nodes can stay in sleep mode long enough to save energy. Also ore get enhanced delay performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.1078-1088
• /
• 2001

ATM-PON (Asynchronous Transfer Mode Passive Optical Network)에는 두 가지 핵심 기술이 있는데 ranging 프로토콜과 MAC (Medium Access Control) 프로토콜이 그것이다. Ranging 프로토콜은 시간 분할 다중화(Time Division Multiple Access, TDMA) 방식을 사용하는 ATM-PON에서 상향으로 액세스할 때 타임 슬롯의 동기를 유지하게 하기 위해 ONU (Optical Network Unit)를 가상적으로 동일한 거리에 놓는 기술이다. 본 논문에서는 FSAN (Full Service Access Network)과 ITU-T를 중심으로 표준화된 G.983.1의 ranging 프로토콜에 관하여 연구하고 성능분석과 모의실험을 수행한다. 이를 통하여 ranging을 하는데 걸리는 소요시간이 표준안의 권고사항을 만족시키기 위한 필요조건을 도출할 수 있다. 특히 ranging을 할 때 윈도우의 길이를 줄일 수 있는 새로운 방식을 적용하여, 이미 서비스 중에 있는 ONU의 서비스 품질이 저하되는 것을 막을 수 있음을 보여준다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1249-1259
• /
• 1998

This paper proposes an efficient channel assignment method for real-time service in the IEEE 802.11 Wireless LAN system, and analyzes the supportability to real-time service and the channel utilzation of that through computer simulations. The improved MAC(Medium Access Control) protocol employing the proposed channel assignment method achieved good throughput over contention period as well as contention-free period by making real-time terminals transmit the information about their desiring value before starts of data transmissions. For performance evaluation of the proposed method, a simulation analyzing the variation of allocated bandwidths to terminals using real-time service and their buffer sizes wasexecuted. Real-time data traffics was modeled s 7-stae transition VBR sources, and asynchronous data traffics modeled as Poisson processes. In the simulation, the proposed method showed smaller variation of the bandwidth of each terminal and samller buffer size than the existing method, and also recorded good throughput over contention period.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.41-52
• /
• 2005

In wireless networks there are various errors, caused by multi-path fading and interference between devices which lower the network Performance. Especially, performance of IEEE 802.IS.3 High-Rate WPAN (Wireless Personal Area Network) which is operated in ISM unlicensed frequency band is easily affected by channel errors. In this paper, we propose a scheduling algorithm which takes channel errors into consideration in scheduling asynchronous data traffic. The proposed scheduling algorithm can allocate CTA(Channel Time Allocation) proportionally in accordance with the requested channel time of each device. It also prevents waste of channel time by allocating CTA of the channel-error devices to other channel-error free devices. After recovering from the channel error, the devices are compensated as much as they conceded during channel error status. Simulation results show that the proposed scheduling algorithm is superior to the existing SRPT(Shortest Remain Processing Time) and RR(Round Robin) in throughput and fairness aspects.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.691-694
• /
• 2003

This paper describes how to use Profibus networks to support real-time industrial communications, that is, how to ensure the transmission of real-time messages within a maximum bound time. Profibus is based on a simplified timed token protocol, which is a well-proved solution for the real-time communication systems. However, Profibus differs from the timed token protocol, thus the usual timed token protocol has to be modified in order to be applied in Profibus. In fact, the real-time solutions for networks based on the timed token protocol rely on the possibility of allocating specific bandwidth for the real-time traffic. This means that a minimum amount of time to transmit the real-time messages is always guaranteed whenever each token is arrived. In other words, with the Profibus protocol, at least, one real-time message should be transmitted per every token visit in the worst case. It is required to control medium access properly to satisfy the message deadlines. In this paper, we have presented how to obtain the optimal network parameter for the Profibus protocol. The selected network parameter is valid regardless of the behavior of asynchronous messages.