• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.753-760
• /
• 2017

In this paper, we propose a new method to improve the performance of a Quorum-based NDP (Neighbor Discovery Protocol) in heterogeneous wireless sensor networks. It creates a new set of discovery schedules by combining two different Quorum-based matrices. The original Quorum-based schedule guarantees only two overlapping active slots with a cycle, but the newly created matrix greatly increases the chance of neighbor discovery. Therefore, although the size of the combined matrix of the proposed method increases, the number of discovery chances with neighboring nodes considerably increases, and the new approach is superior to the original Quorum-based neighbor node discovery protocol. In this study, we compares the performance of the proposed method to the Quorum-based protocols such as SearchLight and Hedis using TOSSIM. We assume all sensor nodes operates in a different duty cycle in the experiment. The experimental results show that the proposed algorithm is superior to other Quorum-based methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.205-207
• /
• 2005

유비쿼터스 컴퓨팅 응용으로 위치 추적 서비스, 산업용 제어 핀 관리 시스템, 홈 자동화 시스템 등 다양한 서비스들이 이미 사용되고 있거나 개발되고 있다. 물류 환경에서의 화물 컨테이너 관리 시스템은 선적하는 컨테이너의 안전을 보장하고 선적 경로와 현재의 위치 등을 제공하여 수출입업자에게 경제적인 이점을 제공할 수 있다. 본 논문에서는 유비쿼터스 물류환경에서 화물 컨테이너의 현재 위치를 확인할 수 있는 시스템을 설계하고 구현하였다. 컨테이너 위치 확인 시스템은 DV-hop 기법을 바탕으로 리더와 태그간의 홉 수를 계산하고 이를 이용하여 컨테이너의 정확한 위치를 결정한다. 시뮬레이션은 TOSSIM을 이용하여 리더와 태그의 정보 수집을 하였고, 서버 프로그램의 정보 분석 과정을 거쳐 태그의 위치를 계산하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.343-345
• /
• 2006

본 연구는 센서 네트워크용 운영체제인 TinyOS의 메시지 길이를 효율적으로 관리하여 저전 손실을 줄인 센서 네트워크의 연구이다. 센서 네트워크에서 가장 큰 전력 손실을 가져오는 부분은 RF통신 부분이라 할 수 있다. 메시지의 길이에 따라 길이가 길면 더욱더 통신 시간이 길어지므로 전력 손실은 커질 것이다. 이와 같은 토픽에 따라 메시지의 길이를 줄여 줌으로써 RF통신에 이용되는 전력을 줄여 보고자 하는 것이다. 사용된 시뮬레이터는 TinyOS에서 자체 제공 되는 TOSSIM을 이용 하였으며 MCU가 데이터를 처리하는데 소모되는 전력과 RF 통신에 따라 소모되는 전력을 나타내었다. 시뮬레이션을 통해 메시지의 길이가 줄어들면 전력 소모가 줄어드는 것을 확인 할 수 있었다. 더 나아가 거리간의 차이에 의한 전력 소모량도 연구 되어야 할 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1195-1198
• /
• 2007

In this paper we study the problem of real time support in wireless sensor networks and propose a Real time Geographic Routing Protocol (ReGeo) which routes a packet towards the destination based on a compromise between distance and queue count to reduce traffic concentration wherever it has been determined to be too high and uses Gradient Table to store the route satisfying the delay constraints. We describe our prototype implementation of ReGeo Routing in TOSSIM - a TinyOS mote simulator. The simulation results show that the proposed routing protocol not only increases the packet delivery ratio but also keeps overall End to End Delay under a bounded value.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.23-29
• /
• 2006

It is difficult to apply conventional security algorithms to the wireless sensor networks composed of nodes that have resource constraints such as memory, computing, power resources limitation. Generally, shared key based algorithms with low resource consumption and short key length are used for broadcast packets in authentication of base station. But it is not suitable that all the nodes hold the same shared key only for packet authentication. Recently, broadcast authentication algorithm for sensor network is proposed, which uses key chain generation by one-way hash function, Message Authentication Code generation by each keys of the key chains and delayed key disclosure. It provides suitable authentication method for wireless sensor networks but may leads to inefficient consequence with respect to network conditions such as broadcast ratio, key chain level, and so on. In this paper, we propose an improved broadcast authentication algorithm that uses key chain link and periodical key disclosure. We evaluated the performance of proposed algorithm using TOSSIM(TinyOS Simulator) in TinyOS. The results show that the proposed algorithm ensures low authentication delay, uses memory and computing resource of receiving nodes efficiently and reduces the amount of packet transmitting/receiving.

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

ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2769-2792
• /
• 2013

In this paper, we propose an authenticated key agreement scheme, TinyIBAK, based on the identity-based cryptography and bilinear paring, for large scale sensor networks. We prove the security of our proposal in the random oracle model. According to the formal security validation using AVISPA, the proposed scheme is strongly secure against the passive and active attacks, such as replay, man-in-the middle and node compromise attacks, etc. We implemented our proposal for TinyOS-2.1, analyzed the memory occupation, and evaluated the time and energy performance on the MICAz motes using the Avrora toolkits. Moreover, we deployed our proposal within the TOSSIM simulation framework, and investigated the effect of node density on the performance of our scheme. Experimental results indicate that our proposal consumes an acceptable amount of resources, and is feasible for infrequent key distribution and rekeying in large scale sensor networks. Compared with other ID-based key agreement approaches, TinyIBAK is much more efficient or comparable in performance but provides rekeying. Compared with the traditional key pre-distribution schemes, TinyIBAK achieves significant improvements in terms of security strength, key connectivity, scalability, communication and storage overhead, and enables efficient secure rekeying.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.901-923
• /
• 2017

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.840-845
• /
• 2007

In a wireless sensor network, a middleware used to support efficient processing and fast delivering of sensing data should handle the data loss problem at an intermediate sensor node caused by unexpected sudden data burst. In his paper, it proposes a Delta-Average method for enhancing the efficiency of data aggregation and correctness where the sensed data should be delivered only with the limited computing power and energy resource. With the proposed method, unnecessary data transfer of the duplicate data is eliminated and data correctness is enhanced by using the proposed averaging and data differentiating scheme when an instantaneous data burst is occurred. Finally, with the TOSSTM simulation results on TinyDB, we verify that the correctness of the transferred data is enhanced.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.531-536
• /
• 2006

Recently, many of researchers have been studied in data processing oriented middleware for wireless sensor networks with the rapid advances on sensor and wireless communication technologies. In a wireless sensor network, a middleware should handle the data loss problem at an intermediate sensor node caused by instantaneous data burstness to support efficient processing and fast delivering of the sensing data. To handle this problem, a simple data discarding or data compressing policy for reducing the total amount of data to be transferred is typically used. But, data discarding policy decreases the correctness of a collected data, in other hand, data compressing policy requires additional processing overhead with the high complexity of the given algorithm. In this paper, it proposes a data-average method for enhancing the efficiency of data aggregation and correctness where the sensed data should be delivered only with the limited computing power and energy resource. With the proposed method, unnecessary data transfer of the overlapped data is eliminated and data correctness is enhanced by using the proposed averaging scheme when an instantaneous data burstness is occurred. Finally, with the TOSSTM simulation results on TinyBB, we show that the correctness of the transferred data is enhanced.