• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.3
• /
• pp.223-233
• /
• 2014

As a broadcast message authentication method in wireless sensor networks, ${\mu}$TESLA enables sensor nodes efficiently authenticate message from base station (BS). However, if we use ${\mu}$TESLA that has very short length of key slot in unattended wireless sensor network (UWSN), sensors may calculate a huge amount of hashs at once in order to verify the revealed secret key. In contrast, if we set the length of ${\mu}$TESLA's key slot too long in order to reduce the amount of hashs to calculate, BS should wait out the long slot time to release key. In this paper, we suggest variable key slot ${\mu}$TESLA in order to mitigate the problem. As showing experiment results, we prove that our suggestion improve sensor node's response time and decrease of number of hash function calculation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.35-42
• /
• 2011

Link quality assessment is a crucial part of sensor network formation to stably operate large-scale wireless sensor networks (WSNs). A stability of path consisting of several nodes strongly depends on all link quality between pair of consecutive nodes. Thus it is very important to assess the link quality on the stage of building a routing path. In this paper, we present a link quality assessment method, Hybrid Link Quality Metric (HQLM), which uses both of LQI and RSSI from RF chip of sensor nodes to minimize set-up time and energy consumption for network formation. The HQLM not only reduces the time and energy consumption, but also provides complementary cooperation of LQI and RSSI. In order to evaluate the validity and efficiency of the proposed method, we measure PDR (Packet Delivery Rate) by exchanging multiple messages and then, compare PDR to the result of HQLM for evaluation. From the research being carried out, we can conclude that the HQLM performs better than either LQI- or RSSI-based metric in terms of recall, precision, and matching on link quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.867-874
• /
• 2010

Since high packet losses occur in multi-hop transmission of wireless sensor networks, reliable data transmission is required. Especially, in case of event-driven data, a loss recovery mechanism should be provided for lost packets. Because retransmission for lost packets is requested to a node that caches the packets, the caching node should maintains all of data for transmission in its buffer. However, nodes of wireless sensor networks have limited resources. Thus, both a loss recovery mechanism and a buffer management technique are provided for reliable data transmission in wireless sensor networks. In this paper, we propose a buffer management technique at a caching position determined by a loss recovery mechanism. The caching position of data is determined according to desirable reliability for the data. In addition, we validate the performance of the proposed method through computer simulations.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.597-602
• /
• 2007

In conventional cooperative communication data rate is 1/2 than non cooperative protocols. In this paper, we propose a full data rate DF (Decode and Forward) cooperative transmission scheme. Proposed scheme is based on time division multiplexing (TDM) channel access. When DF protocol has full data rate, it can not obtain diversity gain under the pairwise error probability (PEP) view point. If it increases time slot to obtain diversity gain, then data rate is reduced. The proposed algorithm uses orthogonal frequency and constellation rotation to obtain both full data rate and diversity order 2. Moreover, performance is analyzed according to distance and optimized components that affect the system performance by using computer simulation. The simulation results revealed that the cooperation can save the network power up to 7dB over direct transmission and 5dB over multi-hop transmission at BER of $10^{-2}$. Besides, it can improve date rate of system compared with the conventional DF protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.981-987
• /
• 2009

Recently, the study on wireless body area network for providing ubiquitous healthcare services has been actively done, including the standardization of the IEEE and others. Wireless body area network is usually configured in tree format using multi-hop communication mode due to the power limitation and the characteristics of human body. In this case, differently from existing sensor network, the wireless body area network tends to be disconnected due to the frequent movement of human body. The number of connections which can be supported at each node has some limitations due to the constraint imposed on power consumption. In this paper, we have proposed a heuristic algorithm for optimal selection of parent node with guaranteed QoS for a disconnected node, which considers the priority on packet transmission. Simulation has been performed to evaluate the performance of the proposed algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.89-98
• /
• 2012

In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. In a 16-bit address space and the network size of a few thousands, it is very unlikely to suffer from frequent address collisions. In response, we propose an elegant (x, y, z) coordinate axes addressing scheme from divided address space of 16 bit and its routing algorithm. One of disadvantages of (x, y) coordinate axes addressing, however, is that any router may not hold as many children as proposed, since sensor nodes tend to be connected to a geographically nearby router. We also present an adaptive routing algorithm for location-aware routing algorithms, using our addressing scheme. As a result, each node was reduced not only bitwise but also multi hop using the coordinate axes while routing and the effective address assignment and routing is to minimize the average energy consumption of each node in the network.