• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.11
• /
• pp.7541-7548
• /
• 2015

Wireless Sensor Networks is the technology which is used in explore role for military purposes, as well as various fields such as industrial equipment management, process management, and leverage available technologies by distributing node into various areas. but there are some limitations about energy, processing power, and memory storage capacity in wireless sensor networks environment, because of tiny hardware, so various routing protocols are proposed to overcome it. however existing routing protocols are very vulnerable in the intercommunication, because they focus on energy efficiency, and they can't use existing encryption for it, Because of sensor's limitations such like processing power and memory. Therefore, this paper propose mutual authentication scheme that prevent various security threats by using mutual authentication techniques and, Key generation and updating system as taking into account energy efficiency.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.29-42
• /
• 2011

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.640-648
• /
• 2017

Sensors have limited resources in sensor networks, so efficient use of energy is important. In order to use the energy of the sensor node efficiently, researches applying mobile sink to the sensor network have been actively carried out. The sink node moves the sensor network, collects data from each sensor node, which spread the energy concentrated around the sink node, thereby extending the entire life cycle of the network. But, when the sink node moves, it requires a reset of the data transmission path, which causes a lot of control messages and delays. In this paper, we propose a CMS(Cluster-based Mobile Sink) method to support the movement of mobile sink in a cluster sensor environment. The proposed scheme minimizes an amount of control messages without resetting the routing paths of entire sensor networks by supporting the sink mobility path using the neighbor cluster list. And, it simplifies the routing path setup process by setting a single hop path between clusters without a gateway. The experiment results show that the proposed scheme has superior energy efficiency in processing and network structure, compared with existing clustering and mesh routing protocols.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.61-69
• /
• 2009

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.529-546
• /
• 2010

Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local information to forward packets to the destination and does not have to maintain the routing table, and thus it takes small overhead and has excellent scalability. However, the signal intensity reduces exponentially with the distance in realistic wireless sensor network, and greedy forwarding consumes a lot of energy, since it forwards the packets to the neighbor node closest to the destination. Previous proposed greedy forwarding protocols are the sender-based greedy forwarding that a sender selects a neighbor node to forward packets as the forwarding node and hence they cannot guarantee energy efficient forwarding in unpredictable wireless environment. In this paper, we propose the receiver-based greedy forwarding called RGF where one of the neighbor nodes that received the packet forwards it by itself. In RGF, sender selects several energy efficient nodes as candidate forwarding nodes and decides forwarding priority of them in order to prevent unnecessary transmissions. The simulation results show that RGF improves delivery rate up to maximum 66.8% and energy efficiency, 60.9% compared with existing sender-based greedy forwarding.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5442-5463
• /
• 2016

Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.

• The Journal of the Korea Contents Association
• /
• v.6 no.5
• /
• pp.35-41
• /
• 2006

Conventional studies for SPIN protocols of wireless sensor networks are not enough to cover energy consumption and migration of sensor nodes. This study proposes a dynamic routing protocol based on the SPIN considering energy consumption and the migration, and also shows the effectiveness of the proposed routing protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2245-2266
• /
• 2016

The hop count routing metric is widely used in routing protocols of Wireless Sensor Networks (WSNs) due to its simplicity and effectiveness. With a lower hop count route, fewer transmissions are required to send a packet from the source to the destination. This can improve the throughput of a network because fewer transmissions results in less channel contention and interference. Despite this, the hop count routing metric may not be ideal for mobile scenarios where the topology of a network changes constantly and rapidly. In this paper, we propose to increase route stability in mobile WSNs by discovering paths that are more stable during route discoveries using routing metrics. Two routing metrics were proposed, the true beauty of these routing metrics lies in the fact that they can even be used even without specialized hardware such as GPS and other sensors. We implemented the proposed routing metrics in the AODV routing protocol and found that they are highly effective and outperform other stability-based routing metrics and the hop count routing metric.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.466-469
• /
• 2008

The existing routing protocols in USN environment, PEGASIS is more efficient than LEACH, which is a hierarchical routing protocol, for network configuration based on power consumption. Despite its merit that it can reduce energy consumption per node, however, the PEGASIS protocol also has a weakness that it is less responsive to frequent changes that occur in the configuration of sensor network due to BS nodes that keep changing, which is a typical characteristic of the sensor network. To address this problem, this paper proposes to select sub-cluster heads and have them serve as intermediate nodes. This paper presents and analyses that this method can resolve the aforementioned problem of the PEGASIS algorithm.