• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.35-40
• /
• 2011

In this paper, we compare and analyze data aggregation methods based on event area in wireless sensor networks. Data aggregation methods consist of two methods: the direct transmission method and the aggregation node method. The direct aggregation method has some problems that are data redundancy and increasing network traffic as all nodes transmit own data to neighbor nodes regardless of same data. On the other hand the aggregation node method which aggregate neighbor's data can prevent the data redundancy and reduce the data. This method is based on location of nodes. This means that the aggregation node can be selected the nearest node from a sink or the centered node of event area. So, we describe the benefits of data aggregation methods that make up for the weak points of direct data dissemination of sensor nodes. We measure energy consumption of the existing ways on data aggregation selection by increasing event area. To achieve this, we calculated the distance between an event node and the aggregation node and the distance between the aggregation node and a sink node. And we defined the equations for distance. Using these equations with energy model for sensor networks, we could find the energy consumption of each method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6B
• /
• pp.342-349
• /
• 2007

Clustering protocol of Wireless sensor networks(WSNs) not only reducing the volume of inter-node communication by the nodes's data aggreation but also extending the nodes's sleep times by cluster head's TDMA-schedule coordination. In order to extend network lifetime of WSNs, we propose ECS algorithm to select cluster-head using three variables. It consists of initial and current energy of nodes, round information and total numbers which have been selected as cluster head until current round.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1529-1547
• /
• 2015

Establishment of trust is important in wireless sensor networks for security enhancement and successful collaboration. Basically, a node establishes trust with other nodes by estimating a trust value based on monitored behavior of the other nodes. Since a malicious/misbehaving node might launch different attack strategies and might demonstrate random misbehavior, a trust estimation method should be robust against such attacks and misbehavior. Otherwise, the operation of trust establishment will be meaningless, and performance of an application that runs on top of trust establishment will degrade. In this paper, we propose a robust and novel trust estimation method. Unlike traditional trust estimation methods, we consider not only the weight of misbehavior but also the frequency of misbehavior. The frequency-of-misbehavior component explicitly demonstrates how frequently a node misbehaves during a certain observed time period, and it tracks the behavior of nodes more efficiently, which is a main factor in deriving an accurate trust value. In addition, the weight of misbehavior is comprehensively measured to mitigate the effect of an on-off attack. Frequency and weight of misbehavior are comprehensively combined to obtain the trust value. Evaluation results show that the proposed method outperforms other trust estimation methods under different attacks and types of misbehavior.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2992-3007
• /
• 2012

Recently there has been an increasing interest in exploring the radio irregularity research problem in Wireless Sensor Networks (WSNs). Measurements on real test-beds provide insights and fundamental information for a radio irregularity model. In our previous work "LMAT", we solved the path planning problem of the mobile anchor node without taking into account the radio irregularity model. This paper further studies how the localization performance is affected by radio irregularity. There is high probability that unknown nodes cannot receive sufficient location messages under the radio irregularity model. Therefore, we dynamically adjust the anchor node's radio range to guarantee that all the unknown nodes can receive sufficient localization information. In order to improve localization accuracy, we propose a new 2-hop localization scheme. Furthermore, we point out the relationship between degree of irregularity (DOI) and communication distance, and the impact of radio irregularity on message receiving probability. Finally, simulations show that, compared with 1-hop localization scheme, the 2-hop localization scheme with the radio irregularity model reduces the average localization error by about 20.51%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.6
• /
• pp.1496-1501
• /
• 2013

IEEE 802.11 has become the main technology in wireless network. However, performance anomalies, especially in terms of fairness, arise in its use in ad hoc networks. Two independent emitters nodes can easily monopolize the medium, preventing other nodes to send packets. This paper proposes the modified (m,k)-firm scheme which is based on T-MAC to improve fairness. The basic idea is to assign higher priorities to nodes that are closer to a dynamic failure so as to improve their chances of meeting their deadlines. The simulation result shows that the proposed scheduling scheme helps improve the fairness of the DCF.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.4
• /
• pp.234-242
• /
• 2010

Two-way ranging methods such as TWR and SDS-TWR have been considered for many ranging systems because these methods are useful in the absence of synchronization. To estimate the location of a mobile node, complicated ranging procedures consisting of ranging frames between an anchor node and the mobile node are performed. Supporting multiple mobile nodes such as a few hundreds or thousands and several anchor nodes, the ranging procedures have the fatal disadvantage of processing delay and inefficient traffic bandwidth. On the other hand, the one-way ranging method is simple and fast, but susceptible to network synchronization. In this paper, we propose a method to modify asynchronous ranging equations to establish exact frequency or frequency offset, a method to estimate frequencies or frequency offsets, and a method to establish post-facto synchronization with anchor nodes. The synchronization for a node pair is adapted using instantaneous time information and corresponding difference of distances can be determined. We evaluate the performance of TWR, SDS-TWR and proposed ranging algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.507-509
• /
• 2010

To manage a sensing information such as temperature, humidity efficiently, it's highly recommended suitable application protocol. In this reasons, IETF WG proposed a CoAP protocol, and it's on Internet draft. If it is possible to work on a specific protocol, sensor end nodes and network devices will be managed efficiently. However, end nodes have constrained resources, it is hard to apply a CoAP protocol. In this paper, we analyse a CoAP protocol for USN, and propose a applying method for CoAP over USN nodes.

• Journal of Computing Science and Engineering
• /
• v.2 no.4
• /
• pp.412-427
• /
• 2008

We propose ID-exchange protocol for Connectionless Location-Awareness Service (CLAS) to locate mobile nodes in indoor sensor network. When adapting location-awareness service to sensor network, the target system must be designed in accordance with various metrics which reflect the system requirement. We especially consider sustainability of the existing service which has been provided for its original purpose, such as environmental monitoring. The detailed meaning of sustainability here is that, even if location-awareness service is newly added to the existing service, the system must be assured to retain a stable network condition, and to deal with newly caused traffic properly. The CLAS ID-exchange protocol is especially designed for fixture and mobile nodes communication to achieve these properties. The protocol operates on 802.15.4 MAC layer to make mobile node work independently of the procedure to build routing table of fixture node, so a stable routing condition can be achieved even if there are many mobile nodes. Moreover, the dedicated frequency channel is assigned only for this protocol, so that traffic caused by location-awareness service can be distributed to another channel. A real system adapting the protocol was implemented to monitor fire and authorities' positions. We verified the overhead and elapsed time for location-awareness. The result shows the proposed protocol has a high performance in detecting speed, traffic distribution, and stability of overall network.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.71-77
• /
• 2015

This paper suggested dynamic application framework based data collecting and monitoring technique using wireless sensor network. The development of application for wireless measurement node firmware program integrates with various sensors and performs control. Collecting data of the user application is downloaded from the node onboard process wirelessly. In addition, the user application can change the temperature initial value of the nodes, which enables dynamic sampling of the measurement nodes. Therefore, dynamic sampling control of the nodes can reduce the power consumptions of sensors compared to existing wired data monitoring.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.268-277
• /
• 2016

Load balancing is a significant technique to prolong a network's lifetime in sensor network. This paper introduces a hybrid approach named as Load Distributing Hybrid Routing Protocol (LDHRP) composed with a border node routing protocol (BDRP) and greedy forwarding (GF) strategy which will make the routing effective, especially in mobility scenarios. In an existing solution, because of the high network complexity, the data delivery latency increases. To overcome this limitation, a new approach is proposed in which the source node transmits the data to its respective destination via border nodes or greedily until the complete data is transmitted. In this way, the whole load of a network is evenly distributed among the participating nodes. However, border node is mainly responsible in aggregating data from the source and further forwards it to mobile sink; so there will be fewer chances of energy expenditure in the network. In addition to this, number of hop counts while transmitting the data will be reduced as compared to the existing solutions HRLBP and ZRP. From the simulation results, we conclude that proposed approach outperforms well than existing solutions in terms including end-to-end delay, packet loss rate and so on and thus guarantees enhancement in lifetime.