• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.11
• /
• pp.2022-2028
• /
• 2017

Recently, the energy shortage of sensors and the leakage of private information are considered as serious problems as the number of sensors is increasing due to the technological advance in Internet-of-Things. RF energy harvesting, in which sensors collect energy from external RF signals, and physical layer security become increasingly important to solve these problems. In this paper, we propose a time switching-based network analog coding for improving information security in wireless networks where the relay can harvest energy from source signals. We formulate 2-hop relay networks where an eavesdropper tries to overhear source signals, and find an optimal time switching ratio for maximizing the minimum required secrecy capacity using mathematical analysis. Through simulations under various environments, it is shown that the proposed scheme improves the minimum required secrecy capacity significantly, compared to the conventional scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1437-1459
• /
• 2020

Wireless Sensor Networks (WSN) is a distributed Sensor network whose terminals are sensors that can sense and check the environment. Sensors are typically battery-powered and deployed in where the batteries are difficult to replace. Therefore, maximize the consumption of node energy and extend the network's life cycle are the problems that must to face. Low-energy adaptive clustering hierarchy (LEACH) protocol is an adaptive clustering topology algorithm, which can make the nodes in the network consume energy in a relatively balanced way and prolong the network lifetime. In this paper, the novel multi-objective LEACH protocol is proposed, in order to solve the proposed protocol, we design a multi-objective coupling algorithm based on bat algorithm (BA), glowworm swarm optimization algorithm (GSO) and bacterial foraging optimization algorithm (BFO). The advantages of BA, GSO and BFO are inherited in the multi-objective coupling algorithm (MBGF), which is tested on ZDT and SCH benchmarks, the results are shown the MBGF is superior. Then the multi-objective coupling algorithm is applied in the multi-objective LEACH protocol, experimental results show that the multi-objective LEACH protocol can greatly reduce the energy consumption of the node and prolong the network life cycle.

• Journal of Korea Multimedia Society
• /
• v.22 no.6
• /
• pp.676-683
• /
• 2019

Wireless Sensor Networks (WSNs) consist of multiple tiny and power constrained sensors which use radio frequencies to carry out sensing in a designated sensor area. To effectively design and implement reliable WSN, it is critical to consider models, protocols, and algorithms that can optimize energy consumption of all the sensor nodes with optimal amount of packet delivery. It has been observed that deploying a single sink node comes with numerous challenges especially in a situation with high node density and congestion. Sensor nodes close to a single sink node receive more transmission traffic load compared to other sensors, thus causing quick depletion of energy which finally leads to an energy hole and sink hole problems. In this paper, we proposed the use of multiple energy efficient sink nodes with brute force technique under optimized parameters to improve on the number of packets delivered within a given time. Simulation results not only depict that, deploying N sink nodes in a sensor area has a maximum limit to offer a justifiable improvement in terms of packet delivery ratio but also offers a reduction in End to End delay and reliability in case of failure of a single sink node, and an improvement in the network lifetime rather than deploying a single static sink node.

• International Journal of Computer Science & Network Security
• /
• v.24 no.10
• /
• pp.32-42
• /
• 2024

For many sensor network applications, minimizing the energy consumed as well as extending the network lifetime are the most important objectives to be achieved, these objectives have pushed the scientific community to propose new solutions to minimize the total energy consumed by the sensors without degrading the network performances, amongst the proposed solutions, the clustering techniques. In this work we focus on hierarchical routing protocols, more precisely clustering in wireless sensor networks. We propose an energy-efficient hierarchical routing protocol for WSNs called EEV-LEACH (Energy Efficient Vice Low Adaptive Clustering Hierarchy), which represents a new variant of the LEACH protocol. Our energy-efficient protocol aims to maximize the lifetime of the network, by minimizing the energy consumption of each sensors nodes and cluster-heads. Minimizing the wasted energy by each sensor node is achieved by minimizing the periodic selection of CHs in each round. Minimizing the periodic selection of CHs allows decreasing the association messages exchanged between the CH and the nodes, so the consumed energy and overhead are minimized. EEV-LEACH aims also to minimize the energy consumed by the cluster-heads (CHs) by using vice CHs , which will share the workload with the CHs in an alternative way. The performances of our protocol EEV-LEACH is compared to, LEACH, LEACH-S and TL-LEACH by using MATLAB simulator, the results show that EEV-LEACH protocol extend the network lifetime and it minimizes the overall overhead versus LEACH, LEACH-S and TL-LEACH protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8C
• /
• pp.489-496
• /
• 2011

Energy efficiency in wireless sensor networks is a principal issue to prolong applications to track the movement of the large-scale phenomena. It is a selective wakeup approach that is an effective way to save energy in the networks. However, most previous studies with the selective wakeup scheme are concentrated on individual objects such as intruders and tanks, and thus cannot be applied for tracking continuous objects such as wild fire and poison gas. This is because the continuous object is pretty flexible and volatile due to its sensitiveness to surrounding circumferences so that movable area cannot be estimated by the just spatiotemporal mechanism. Therefore, we propose a cluster-based algorithm for applying the efficient and more accurate technique to the continuous object tracking in enough dense sensor networks. Proposed algorithm wakes up the sensors in unit cluster where target objects may be diffused or shrunken. Moreover, our scheme is asynchronous because it does not need to calculate the next area at the same time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.72-79
• /
• 2013

In wireless sensor networks, the selective wakeup scheme is one of the energy saving mechanisms, that is used for an object detecting or tracking. Recently, many protocols are proposed using the selective wakeup scheme for the continuous objects tracking such as forest fires and poison gas. They predict the future shape of continuous objects and activate only sensors in the predicted boundary area of the objects. It works correctly in a uniformly deployed wireless sensor networks. However, it cannot be directly applied to a randomly deployed sensor networks with voids. When the predicted area is in the void area, the activation message cannot reach and the predicted area cannot be activated at the right time. It leads to many detection errors for continuous object. Moreover, if a sensor is once foiled in a activation control then the next activation control might be continuously failed. The detection errors can be result in serious harm to people. In this paper, we propose a chaining selective wakeup scheme for robust continuous object tracking in wireless sensor networks. In our protocol, we collect the information of a void area during the network configuration time; if the next boundary area is in the void area, we activate the chained area surrounding the void area with activation control message.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.495-504
• /
• 2009

Wireless sensor networks (WSN) consisting of a largenumber of sensors aims to gather data in a variety of environments and is beingused and applied in many different fields. The sensor nodes composing a sensornetwork operate on battery of limited power and as a result, high energyefficiency and long network lifetime are major goals of research in the WSN. Inthis paper we propose a novel cluster-based local multi-hop routing protocolthat enhances the overall energy efficiency and guarantees reliability in thesystem. The proposed protocol minimizes energy consumption for datatransmission among sensor nodes by forming a multi-hop in the cluster.Moreover, through local cluster head rotation scheme, it efficiently manageswaste of energy caused by frequent formation of clusters which was an issue inthe existing methods. Simulation results show that our scheme enhances energyefficiency and ensure longer network time in the sensor network as comparedwith existing schemes such as LEACH, LEACH-C and PEACH.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.23-32
• /
• 2007

We propose a group-based security scheme for hierarchical wireless sensor networks. We model the network for secure routing with 3-tier sensor network comprised of three types of nodes: Base Station, Group Dominator and ordinary Sensor Nodes. Group-based deployment is performed using Gaussian (normal) distribution and show that more than 85% network connectivity can be achieved with the proposed model. The small groups with pre-shared secrets form the secure groups where group dominators form the backbone of the entire network. The scheme is devised for dealing with sensory data aggregated by groups of collocated sensors; i.e., local sensed data are collected by the dominating nodes and sent an aggregated packet to the base station via other group dominators. The scheme is shown to be light-weight, and it offers a stronger defense against node capture attacks. Analysis and simulation results are presented to defend our proposal. Analysis shows that robustness can significantly be improved by increasing the deployment density using both the dominating and/or ordinary sensor nodes.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.599-606
• /
• 2009

For many mission-critical related wireless sensor network applications such as military and homeland security, user's access restriction is necessary to be enforced by access control mechanisms for different access rights. Public key-based access control schemes are more attractive than symmetric-key based approaches due to high scalability, low memory requirement, easy key-addition/revocation for a new node, and no key predistribution requirement. Although Wang et al. recently introduced a promising access control scheme based on elliptic curve cryptography (ECC), it is still burdensome for sensors and has several security limitations (it does not provide mutual authentication and is strictly vulnerable to denial-of-service (DoS) attacks). This paper presents an energy-efficient access control scheme based on ECC to overcome these problems and more importantly to provide dominant energy-efficiency. Through analysis and simulation based evaluations, we show that the proposed scheme overcomes the security problems and has far better energy-efficiency compared to current scheme proposed byWang et al.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.74-80
• /
• 2007

Advances in electronic and computer technologies have paved the way for the proliferation of WSN(wireless sensor networks). Accordingly, necessity of anti-collusion and authentication technology is increasing on the sensor network system. Some of the algorithm developed for the anti-collision sensor network can be easily adopted to wireless sensor network platforms and in the same time they can meet the requirements for sensor networks like: simple parallel distributed computation, distributed storage, data robustness and auto-classification of sensor readings. To achieve security in wireless sensor networks, it is important to be able to establish safely channel among sensor nodes. In this paper, we proposed the USN(Ubiquitous Sensor Network) channel establishment algorithm for sensor's authentication and anti-collision. Two different data aggregation architectures will be presented, with algorithms which use wavelet filter to establish channels among sensor nodes and BIBD (Balanced Incomplete Block Design) which use anti-collision methods of the sensors. As a result, the proposed algorithm based on BIBD and wavelet filter was made for 98% collision detection rate on the ideal environment.