• ETRI Journal
• /
• v.27 no.4
• /
• pp.465-468
• /
• 2005

This paper presents a new trust evaluation scheme in an ad hoc network. To overcome the limited information about unfamiliar nodes and to reduce the required memory space, we propose a cluster-based trust evaluation scheme, in which neighboring nodes form a cluster and select one node as a cluster head. The head issues a trust value certificate that can be referred to by its non-neighbor nodes. In this way, an evaluation of an unfamiliar node's trust can be done very efficiently and precisely. In this paper, we present a trust evaluation metric using this scheme and some operations for forming and managing a cluster. An analysis of the proposed scheme over some security problems is also presented.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.141-145
• /
• 2008

Wireless sensor network (WSN) is expected to be used in many applications. However, sensor nodes still have some secure problems to use them in the real applications. They are typically deployed on open, wide, and unattended environments. An adversary using these features can easily compromise the deployed sensor nodes and use compromised sensor nodes to inject fabricated data to the sensor network (false data injection attack). The injected fabricated data drains much energy of them and causes a false alarm. To detect and drop the injected fabricated data, a filtering-based security method and adaptive methods are proposed. The number of different partitions is important to make event report since they can make a correctness event report if the representative node does not receive message authentication codes made by the different partition keys. The proposed methods cannot guarantee the detection power since they do not consider the filtering scheme. We proposed clustering method for filtering-based secure methods. Our proposed method uses fuzzy system to enhance the detection power of a cluster.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.534-537
• /
• 2009

Clustering protocol of Wireless sensor networks(WSNs) can not only reduce the volume of inter-node communication by the nodes's data aggregation but also extend the nodes's sleep times by cluster head's TDMA-schedule coordination. In order to extend the network lifetime of WSNs, we propose CHS 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.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1108-1118
• /
• 2005

A mobile Ad Hoc network is a dynamic mobile wireless network that can be formed without the need for any pre-existing wired or wireless infrastructure. A mobile ad hoc node has limited battery capacity. Hence, Ad Hoc routing protocol ought to be energy conservative. Previous energy aware routing has limit in fairness among nodes and network wide power consumption. In this research, we propose a new routing protocol called Clustering Based Energy-Aware Routing(CBEAR) which can improve the problems. Simulation results show that the routing protocol improves fairness and network wide power consumption as well as life time of nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.123-134
• /
• 2008

In this paper, a routing algorithm for wireless sensor networks is proposed to improve the efficiency of energy consumption in sensor nodes. Each sensor node has the value called ‘Flooding Level’ obtained through the initial flooding from a sink node instead of sending beacon messages in multi-hop sensor field. This value can be used for guaranteeing the sensor nodes to connect with a sink node and determining the roles of cluster-head and cluster-gateway node efficiently and simply during the clustering. If different algorithms are added to our protocol, it will work better in the side of energyefficiency. This algorithm is evaluated through analysis and extensive simulations.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.164-172
• /
• 2013

We consider the problem of secure and robust clustering for quantized target tracking in wireless sensor networks (WSN) where the observed system is assumed to evolve according to a probabilistic state space model. We propose a new method for jointly activating the best group of candidate sensors that participate in data aggregation, detecting the malicious sensors and estimating the target position. Firstly, we select the appropriate group in order to balance the energy dissipation and to provide the required data of the target in the WSN. This selection is also based on the transmission power between a sensor node and a cluster head. Secondly, we detect the malicious sensor nodes based on the information relevance of their measurements. Then, we estimate the target position using quantized variational filtering (QVF) algorithm. The selection of the candidate sensors group is based on multi-criteria function, which is computed by using the predicted target position provided by the QVF algorithm, while the malicious sensor nodes detection is based on Kullback-Leibler distance between the current target position distribution and the predicted sensor observation. The performance of the proposed method is validated by simulation results in target tracking for WSN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2469-2490
• /
• 2019

A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT's Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs).

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.313-320
• /
• 2008

The dynamic clustering technique has some problems regarding energy consumption. In the cluster configuration aspect the cluster structure must be modified every time the head nodes are re-selected resulting in high energy consumption. Also, there is excessive energy consumption when a cluster head node receives identical data from adjacent cluster sources nodes. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects duster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. Furthermore, the issue of redundant data occurring at the cluster head node is dealt with by broadcasting metadata of the initially received data to prevent reception by a sensor node with identical data. A simulation experiment was performed to verify the validity of the proposed approach. The results of the simulation experiments were compared with the performances of two of the must widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 29.3% and 21.2% more efficient than LEACH and HEED, respectively.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.61-68
• /
• 2009

In this paper, we propose a Cluster-based Cooperative Routing using ARQ (CCRA) for supporting both reliability and transmitting efficient service in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main contributions and features of this paper are as follows. First, the clustering method which uses the position information of nodes as underlying structure for supporting reliable transmission services is used. Second, the cooperative data transmission method based on the underlying clustering informations is used to improve both reliability and data transmission efficiency. Third, the ARQ-based transmission is used to improve transmission reliability. Fourth, we consider a realistic approach, in the points of view of mobile ad-hoc wireless sensor networks, based on mobile sensor nodes as well as fixed sensor nodes in the sensor fields while the conventional research for sensor networks focus on mainly fixed sensor networks. The performance evaluation of proposed routing protocol implemented via simulation using Optimized Network Engineering Tool (OPNET) and theoretical analysis.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.105-111
• /
• 2009

The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.