• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.933-937
• /
• 2007

대형 무선 센서 네트워크(WSNs)는 일반적으로 수백에서 수천 개의 센서 노드들로 구성되어 있다. 이러한 대형 WSNs에서는 네트워크의 수명연장을 위해서 비용 및 에너지를 고려한 에너지 효율성뿐만 아니라 네트워크의 유지 및 관리가 요구된다. 사용자는 효율적인 시스템을 통해서 사용자 수준의 센싱 서비스 품질이 제공받을 수 있어야 한다. 이 네트워크에서 사용자에게 제공되는 결과 데이터의 품질은 이벤트 검출에 관련된 센서들의 개수가 결정적인 역할을 한다. 그러므로 사용자 요구품질에 적합한 QoS를 제공할 수 있는 네트워크 프로토콜은 일부 센서 노드들에서 고장이 발생하더라고 전체 시스템 성능에 영향을 주지 않으면서, 동시에 에너지 소비가 최소화되도록 설계되어야 한다. 본 논문에서 제안된 프로토콜은 LEACH(Low Energy Adaptive Clustering Hierarchy) 프로토콜을 기반으로 하며, 지속적인 감시가 요구되는 대형 네트워크에 적합한 역할 기반의 자가 구성 프로토콜을 제안하였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.91-92
• /
• 2016

무선 센서 네트워크에서 무선통신기술을 활용한 저비용의 정밀 측위 기술은 교통상황, 의료, 생활정보 등의 다방면에서 활용되고 있다. RSSI를 기반으로 한 측위기법은 TOA, AOA, TDOA에 비해 추가적인 전력 또는 하드웨어가 필요하지 않아 비용 면에서 효율적이다. 하지만 RSSI 값의 패턴은 실제 환경에서 전파방해 요소가 존재하여 작은 움직임에도 크게 변하게 되는 문제점이 있다. 본 논문에서는 RSSI와 IEEE 802.15.4 표준에서 제공되는 정보인 LQI를 이용하여 타겟 노드의 실내 위치를 추정하는 기법을 제안한다. 제안하는 기법을 통해 실제 환경에서 보다 정확한 위치추정을 할 수 있음을 보여준다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.1
• /
• pp.15-26
• /
• 2013

IP-based Wireless Sensor Networks (IP-WSNs) are gaining importance for their broad range of applications in health-care, home automation, environmental monitoring, industrial control, vehicle telematics and agricultural monitoring. In all these applications, mobility in the sensor network with special attention to energy efficiency is a major issue to be addressed. Because of the energy inefficiency of networks-based mobility management protocols can be supported in IP-WSN. In this paper we propose a network based mobility supported IP-WSN protocol called Multicasting-based inter-Domain Mobility Management Scheme in Sensor-based Fast Proxy Mobile IPv6 Networks (mSFP). Based on [8,20], We present its network architecture and evaluate its performance by considering the signaling and mobility cost. Our analysis shows that the proposed scheme reduces the signaling cost, total cost, and mobility cost. With respect to the number of IP-WSN nodes, the proposed scheme reduces the signaling cost by 7% and the total cost by 3%. With respect to the number of hops, the proposed scheme reduces the signaling cost by 6.9%, the total cost by 2.5%, and the mobility cost by 1.5%. With respect to the number of IP-WSN nodes, the proposed scheme reduces the mobility cost by 1.6%.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.558-564
• /
• 2013

Wireless sensor networks (WSNs) contain limited energy resources and are left in open environments. Since these sensor nodes are self-operated, attacks such as sinkhole attacks are possible as they can be compromised by an adversary. The sinkhole attack may cause to change initially constructed routing paths, and capture of significant information at the compromised node. A localized encryption and authentication protocol (LEAP) has been proposed to authenticate packets and node states by using four types of keys against the sinkhole attack. Even though this novel approach can securely transmits the packets to a base station, the packets are forwarded along the constructed paths without checking the next hop node states. In this paper, we propose the next hop node selection method to cater this problem. Our proposed method evaluates the next hop node considering three factors (i.e., remaining energy level, number of shared keys, and number of filtered false packets). When the suitability criterion for next hop node selection is satisfied against a fix threshold value, the packet is forwarded to the next hop node. We aim to enhance energy efficiency and a detour of attacked areas to be effectively selected Experimental results demonstrate validity of the proposed method with up to 6% energy saving against the sinkhole attack as compared to the LEAP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.506-514
• /
• 2009

To minimize energy consumption, most of MAC Protocols in WSNs exploit low duty cycling. Among those, RMAC [4] allows a node to transmit a data packet for multiple hops in a single duty cycle, which is made possible by exploiting a control frame named Pioneer (PION) in setting up the path. In this paper, we present a MAC Protocol called Hop Extended MAC (HE-MAC) that transmits the data packet for more multiple hops in a single duty cycle. It employs an EXP (Explorer) frame to set up the multiple hop transmission, which contains the information of the maximum hop that a packet can be transmitted. With the use of the information in EXP and an internal state of Ready to Receive (RTR), HEMAC extends the relay of the packet beyond the termination of the data period by two more hops compared to RMAC. Along with our proposed adaptive sleeping method, it also reduces power consumption and handles heavy traffic efficiently without experiencing packet inversion observed in RMAC. We analytically obtain the packet delivery latency in HE-MAC and evaluate the performance through ns-2 simulations. Compared to RMAC, HE-MAC achieves 14% less power consumption and 20% less packet delay on average for a random topology of 300 nodes.

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

Broadcast of sink node is used for network management, data collection by query and synchronization in wireless sensor networks. Simple flooding scheme induces the broadcast storm problem. The MPR based broadcast schemes reduce redundant retransmission of broadcast packets. MPR is a set of one hop neighbor nodes which have to relay broadcast message to cover all two hop neighbors. Though MPR can reduce redundant retransmission remarkably, it still suffers from energy waste problem caused by collision and duplicate packets reception. This paper proposes a new MPR based sink broadcast scheme using 3-channel. The proposed scheme reduces energy consumption by avoiding duplicate packet reception, while increases reliability by reducing collision probability remarkably. The results of analysis and simulation show that the proposed scheme is more efficient in energy consumption compared to the MPR based scheme. The result also shows that the proposed scheme reduces delivery latency by evading a contention with other relay nodes and improves reliability of broadcast message delivery by reducing collision probability.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.49-59
• /
• 2014

Recently, wireless sensor networks(WSNs) are widely used for intrusion detection and ecology, environment, atmosphere, industry, traffic, fire monitoring. In this paper, an energy efficient clustering algorithm is proposed. The proposed algorithm forms clusters uniformly by selecting cluster head that optimally located based on receiving power. Besides, proposed algorithm can induce uniform energy consumption regardless of location of nodes by multi-hop transmission and MST formation with limited maximum depth. Through the above, proposed algorithm elongates network life time, reduces energy consumption of nodes and induces fair energy consumption compared to conventional LEACH and HEED. The results of simulation show that the proposed clustering algorithm elongates network life time through fair energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.1004-1010
• /
• 2012

In this paper, we propose the algorithm which considers applying recently proposed clock synchronization techniques with quite high accuracy in a few wireless sensor networks researches to time synchronization algorithm for multi-static radar system and especially overcomes the limitation of previous theory, cannot be applied between nodes in non-line of sight (NLOS). Proposed scheme estimates clock skew and clock offset using recursive robust least M-estimator with information of time stamp observations. And we improve the performance of algorithm by tracking and suppressing the time delays difference caused by NLOS system. Futhermore, this paper derive the mean square error (MSE) to present the performance of the proposed estimator and comparative analysis with previous methods.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.4
• /
• pp.83-88
• /
• 2020

In Solar-powered wireless sensor networks(SP-WSN), the battery is periodically charged, so the best use of harvested energy is more important, rather than minimizing energy consumption. Meanwhile, as is well known, the reliability of communication between sensor nodes is very limited due to the resource-constraint of sensor nodes. In this paper, we propose an advanced FEC (forward error correction) scheme which can give SP-WSN more reliability for communication. Firstly, the proposed scheme uses energy modeling to calculate the amount of surplus energy which can be utilized for extra operations, and then determines the number of additional parity bits according to this amount of surplus energy. At the same time, link quality modeling calculates the optimal parity bits for error recovery in the current data communication environment. Finally, by considering these two parity sizes, it is possible to determine the optimal parity size that can maximize the data reliability without affecting the node black out. Performance verification was performed by comparing the amount of data collected at the sink and the number of outage nodes with other schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.9-17
• /
• 2014

This paper proposes a binary particle swarm optimization (BPSO) algorithm for distributed node localization in wireless sensor networks (WSNs). Each unknown node performs localization using the value of the measured distances from three or more neighboring anchors, i.e., nodes that know their location information. The node that is localized during the localization process is then used as another anchor for remaining nodes. The performances of particle swarm optimization (PSO) and BPSO in terms of localization error and computation time are compared by using simulations in Matlab. The simulation results indicate that PSO-based localization is more accurate. In contrast, BPSO algorithm performs faster for finding the location of unknown nodes for distributed localization. In addition, the effects of transmission range and number of anchor nodes on the localization error and computation time are investigated.