scholarly journals A Swarm Intelligent Algorithm Based Route Maintaining Protocol for Mobile Sink Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Xiaoming Wu ◽  
Yinglong Wang ◽  
Yifan Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Network Resources ◽  
Intelligent Algorithm ◽  
Bee Colony ◽  
Alternative Routing

Recent studies have shown that mobile sink can be a solution to solve the problem that energy consumption of sensor nodes is not balanced in wireless sensor networks (WSNs). Caused by the sink mobility, the paths between the sensor nodes and the sink change frequently and have profound influence on the lifetime of WSN. It is necessary to design a protocol that can find efficient routings between the mobile sink and nodes but does not consume too many network resources. In this paper, we propose a swarm intelligent algorithm based route maintaining protocol to resolve this issue. The protocol utilizes the concentric ring mechanism to guide the route researching direction and adopts the optimal routing selection to maintain the data delivery route in mobile sink WSN. Using the immune based artificial bee colony (IABC) algorithm to optimize the forwarding path, the routing maintaining protocol could find an alternative routing path quickly and efficiently when the coordinate of sink is changed in WSN. The results of our extensive experiments demonstrate that our proposed route maintaining protocol is able to balance the network traffic load and prolong the network lifetime.

scholarly journals Communication Availability-Based Scheduling for Fair Data Collection with Path-Constrained Mobile Sink in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Youngtae Jo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Data Transmission ◽  
Sensor Node ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Sink Node

To effectively transfer sensing data to a sink node, system designers should consider the characteristic of wireless sensor networks in the way of data transmission. In particular, sensor nodes surrounding a fixed sink node have routinely suffered from concentrated network traffic so that their battery energy is rapidly exhausted. The lifetime of wireless sensor networks decreases due to the rapid power consumption of these sensor nodes. To address the problem, a mobile sink model has recently been chosen for traffic load distribution among sensor nodes. However, since a mobile sink continuously changes its location in sensor networks, it has a time limitation to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, fair and stable data collection policy between a mobile sink and sensor nodes is necessary in this circumstance. In this paper, we propose a new scheduling policy to support fair and stable data collection for a mobile sink in wireless sensor networks. The proposed policy performs data collection scheduling based on the communication availability of data transmission between sensor nodes and a mobile sink.

A Novel Nature Instilled Moving Sink Architecture for Data Gathering in Wireless Sensor Networks

2020 ◽  
Vol 11 (1) ◽  
pp. 36-48
Author(s):  
Amiya Bhusan Bagjadab ◽  
Sushree Bibhuprada B. Priyadarshini
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Mobile Sink ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Battery Power ◽  
Communication Distance

Wireless sensor networks are commonly used to monitor certain regions and to collect data for several application domains. Generally, in wireless sensor networks, data are routed in a multi-hop fashion towards a static sink. In this scenario, the nodes closer to the sink become heavily involved in packet forwarding, and their battery power is exhausted rapidly. This article proposes that a special node (i.e., mobile sink) will move in the specified region and collect the data from the sensors and transmit it to the base station such that the communication distance of the sensors will be reduced. The aim is to provide a track for the sink such that it covers maximum sensor nodes. Here, the authors compared two tracks theoretically and in the future will try to simulate the two tracks for the sink movement so as to identify the better one.

scholarly journals LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771876760 ◽  
Author(s):  
Muhammad K Shahzad ◽  
Dang Tu Nguyen ◽  
Vyacheslav Zalyubovskiy ◽  
Hyunseung Choo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Performance Improvements ◽  
Novel Approach ◽  
Minimum Latency ◽  
Latency Interval

Wireless sensor networks are composed of low-energy, small-size, and low-range unattended sensor nodes. Recently, it has been observed that by periodically turning on and off the sensing and communication capabilities of sensor nodes, we can significantly reduce the active time and thus prolong network lifetime. However, this duty cycling may result in high network latency, routing overhead, and neighbor discovery delays due to asynchronous sleep and wake-up scheduling. These limitations call for a countermeasure for duty-cycled wireless sensor networks which should minimize routing information, routing traffic load, and energy consumption. In this article, we propose a lightweight non-increasing delivery-latency interval routing referred as LNDIR. This scheme can discover minimum latency routes at each non-increasing delivery-latency interval instead of each time slot. Simulation experiments demonstrated the validity of this novel approach in minimizing routing information stored at each sensor. Furthermore, this novel routing can also guarantee the minimum delivery latency from each source to the sink. Performance improvements of up to 12-fold and 11-fold are observed in terms of routing traffic load reduction and energy efficiency, respectively, as compared to existing schemes.

scholarly journals Reducing Energy Consumption of the SEECH Algorithm in Wireless Sensor Networks Using a Mobile Sink and Honey Bee Colony Algorithm

2018 ◽  
Vol 10 (1) ◽  
pp. 185-200
Author(s):  
Mohammad Sedighimanesh ◽  
Ali Sedighimanesh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Data Dissemination ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Bee Colony ◽  
Honeybee Colony ◽  
Reduce Energy Consumption

Purpose – Clustering, routing, and data dissemination are an important issue in wireless sensor networks. The basic functions of wireless sensor networks are phenomena controlling in the physical environment, and the reporting of sensed data to the central node called sink, in which more operations can be done on the data. The most important limitation of wireless sensor networks is energy consumption. There are several ways to increase the lifetime of these networks, that one of the most important is the using proper clustering method. The aim of this study is to reduce energy consumption using an effective clustering algorithm and for this purpose, the honeybee colony metaheuristic method was used for cluster heads selection. Methodology/approach/design – The simulation in this paper was done using MATLAB software and the proposed method is compared with the LEACH and SEED approach. Findings – The results of simulations in this research indicate that the research has significantly reduced the energy consumption in the network than LEACH and SEED algorithms. Originality/value – Given the energy constraints in the wireless sensor network, providing such solutions and using metaheuristic algorithms can dramatically reduce energy consumption and, consequently increase network lifetime.

scholarly journals Security and Privacy Challenges in Cognitive Wireless Sensor Networks

2013 ◽  
pp. 194-232 ◽  
Author(s):  
Jaydip Sen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Defense Mechanisms ◽  
Sensor Nodes ◽  
Security And Privacy ◽  
Wireless Sensor ◽  
Network Resources ◽  
Practical Applications ◽  
Potential Applicability ◽  
Cognitive Wireless Sensor Networks

Wireless sensor networks (WSNs) have attracted a lot of interest in the research community due to their potential applicability in a wide range of real-world practical applications. However, due to the distributed nature and their deployments in critical applications without human interventions and sensitivity and criticality of data communicated, these networks are vulnerable to numerous security and privacy threats that can adversely affect their performance. These issues become even more critical in cognitive wireless sensor networks (CWSNs) in which the sensor nodes have the capabilities of changing their transmission and reception parameters according to the radio environment under which they operate in order to achieve reliable and efficient communication and optimum utilization of the network resources. This chapter presents a comprehensive discussion on the security and privacy issues in CWSNs by identifying various security threats in these networks and various defense mechanisms to counter these vulnerabilities. Various types of attacks on CWSNs are categorized under different classes based on their natures and targets, and corresponding to each attack class, appropriate security mechanisms are also discussed. Some critical research issues on security and privacy in CWSNs are also identified.

scholarly journals Energy Efficient Data Aggregation in Wireless Sensor Networks using Mobile Sink Node

2019 ◽  
Vol 9 (2) ◽  
pp. 2750-2753
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Resource ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Efficient Data ◽  
Reduce Energy Consumption ◽  
Computational Resources

The wireless sensor networks consist of numerous small nodes which are also called as energy resource-constrained sensor nodes. The communication of these nodes can be done in a various way. There is also the processing of signal tasks which is done through the various computational resources provided by the networks. The energy of the sensor nodes gets consumed when transmit the data or receive data from the network. To reduce energy consumption of the network various techniques has been proposed which are known as clustering techniques. In the proposed work the mobile sink is deployed in the network which reduces overhead in the network. Experimental results shows that the proposed work outperforms the existing one in terms of reduced energy consumption of the network, increased throughput of the network, reduced delay in the network.

scholarly journals Efficient Location Service for a Mobile Sink in Solar-Powered Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 272 ◽  
Author(s):  
Minjae Kang ◽  
Ikjune Yoon ◽  
Dong Noh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Position Information ◽  
Location Service ◽  
Surplus Energy ◽  
Solar Powered

By utilizing mobile sinks in wireless sensor networks (WSNs), WSNs can be deployed in more challenging environments that cannot connect with the Internet, such as those that are isolated or dangerous, and can also achieve a balanced energy consumption among sensors which leads to prolonging the network lifetime. However, an additional overhead is required to check the current location of the sink in order for a node to transmit data to the mobile sink, and the size of the overhead is proportional to that of the network. Meanwhile, WSNs composed of solar-powered nodes have recently been actively studied for the perpetual operation of a network. This study addresses both of these research topics simultaneously, and proposes a method to support an efficient location service for a mobile sink utilizing the surplus energy of a solar-powered WSN. In this scheme, nodes that have a sufficient energy budget can constitute rings, and the nodes belonging to these rings (which are called ring nodes) maintain up-to-date location information on the mobile sink node and serve this information to the other sensor nodes. Because each ring node only uses surplus energy to serve location information, this does not affect the performance of a node’s general operations (e.g., sensing, processing, and data delivery). Moreover, because multiple rings can exist simultaneously in the proposed scheme, the overhead for acquiring the position information of the sink can be significantly reduced, and also hardly increases even if the network size becomes larger.

An Adaptable Security Framework for Wireless Sensor Networks

2014 ◽  
Vol 13 (9) ◽  
pp. 4898-4906
Author(s):  
Hesham A. El Zouka
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Security Protocols ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Resources ◽  
Battery Lifetime ◽  
Memory Time ◽  
Management Schemes

The design of secure and survivable nodes is one of the most vital issues in designing energy-efficient protocols for wireless sensor network where the energy, memory and computational power of sensor nodes are limited. In this paper, some of the challenges facing the wireless sensor networks are discussed in attempting to prolong the battery lifetime of the nodes, and to secure the communication channel. While most of these attacks can be dealt with through cryptographic security protocols provided by key management schemes, there are always a few that manage to really cause problems. One such attack that is most common and significant in WSNs is cloning attack. In clone attack, the intruder tries to capture and compromise some nodes and inject them into several locations throughout the network in order to conduct other types of attacks. Moreover, if this attack is not detected early, then these replicated injected nodes will consume a large amount of the network resources. Several possible approaches are suggested to improve the security, authentication protocols, and key management schemes in WSNs.  Furthermore, utilizing the existing security protocols in wireless sensor networks has led us to propose a secure framework which incorporates security protocols in a way that minimizes the energy consumption of the sensor nodes. Our algorithm ensures data confidentiality, node authentication, and data integrity while remaining within acceptable memory, time and energy constrains.

Sensor Localization in Wireless Sensor Networks Using Cultural Algorithm

2020 ◽  
Vol 11 (4) ◽  
pp. 106-122
Author(s):  
Vaishali Raghavendra Kulkarni ◽  
Veena Desai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Particle Swarm Optimization Algorithm ◽  
Computing Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cultural Algorithm ◽  
Sensor Localization ◽  
Bee Colony ◽  
Multi Stage

Evolutionary computing-based cultural algorithm (CA) has been developed for anchor-assisted, range-based, multi-stage localization of sensor nodes of wireless sensor networks (WSNs). The results of CA-based localization have been compared with those of swarm intelligence-based algorithms, namely the artificial bee colony algorithm and the particle swarm optimization algorithm. The algorithms have been compared in terms of mean localization error and computing time. The simulation results show that the CA performs the localization in a more accurate manner and at a higher speed than the other two algorithms.

scholarly journals Swarm Intelligence-based Partitioned Recovery in Wireless Sensor Networks

2018 ◽  
Vol 3 ◽  
pp. 70-81
Author(s):  
Gaurav Kumar ◽  
Virender Ranga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Grey Wolf ◽  
Relay Nodes ◽  
Network Partition ◽  
Heterogeneous Wireless Sensor Networks

The failure rate of sensor nodes in Heterogeneous Wireless Sensor Networks is high due to the use of low battery-powered sensor nodes in a hostile environment. Networks of this kind become non-operational and turn into disjoint segmented networks due to large-scale failures of sensor nodes. This may require the placement of additional highpower relay nodes. In this paper, we propose a network partition recovery solution called Grey Wolf, which is an optimizer algorithm for repairing segmented heterogeneous wireless sensor networks. The proposed solution provides not only strong bi-connectivity in the damaged area, but also distributes traffic load among the multiple deployed nodes to enhance the repaired network’s lifetime. The experiment results show that the Grey Wolf algorithm offers a considerable performance advantage over other state-of-the-art approaches.

Sign in / Sign up

Export Citation Format

Share Document