scholarly journals Distributed Reliable and Efficient Transmission Task Assignment for WSNs

Sensors ◽  
2019 ◽  
Vol 19 (22) ◽  
pp. 5028 ◽  
Author(s):  
Xiaojuan Zhu ◽  
Kuan-Ching Li ◽  
Jinwei Zhang ◽  
Shunxiang Zhang

Task assignment is a crucial problem in wireless sensor networks (WSNs) that may affect the completion quality of sensing tasks. From the perspective of global optimization, a transmission-oriented reliable and energy-efficient task allocation (TRETA) is proposed, which is based on a comprehensive multi-level view of the network and an evaluation model for transmission in WSNs. To deliver better fault tolerance, TRETA dynamically adjusts in event-driven mode. Aiming to solve the reliable and efficient distributed task allocation problem in WSNs, two distributed task assignments for WSNs based on TRETA are proposed. In the former, the sink assigns reliability to all cluster heads according to the reliability requirements, so the cluster head performs local task allocation according to the assigned phase target reliability constraints. Simulation results show the reduction of the communication cost and latency of task allocation compared to centralized task assignments. Like the latter, the global view is obtained by fetching local views from multiple sink nodes, as well as multiple sinks having a consistent comprehensive view for global optimization. The way to respond to local task allocation requirements without the need to communicate with remote nodes overcomes the disadvantages of centralized task allocation in large-scale sensor networks with significant communication overheads and considerable delay, and has better scalability.

2021 ◽  
Vol 14 (1) ◽  
pp. 270-280
Author(s):  
Abhijit Halkai ◽  
◽  
Sujatha Terdal ◽  

A sensor network operates wirelessly and transmits detected information to the base station. The sensor is a small sized device, it is battery-powered with some electrical components, and the protocols should operate efficiently in such least resource availability. Here, we propose a novel improved framework in large scale applications where the huge numbers of sensors are distributed over an area. The designed protocol will address the issues that arise during its communication and give a consistent seamless communication system. The process of reasoning and learning in cognitive sensors guarantees data delivery in the network. Localization in Scarce and dense sensor networks is achieved by efficient cluster head election and route selection which are indeed based on cognition, improved Particle Swarm Optimization, and improved Ant Colony Optimization algorithms. Factors such as mobility, use of sensor buffer, power management, and defects in channels have been identified and solutions are presented in this research to build an accurate path based on the network context. The achieved results in extensive simulation prove that the proposed scheme outperforms ESNA, NETCRP, and GAECH algorithms in terms of Delay, Network lifetime, Energy consumption.


2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Zeba Ishaq ◽  
Seongjin Park ◽  
Younghwan Yoo

Over the last few decades, Cluster-Based Wireless Sensor Networks (CBWSNs) have played a crucial role in handling various challenges (load balancing, routing, network lifetime, etc.) of large scale Wireless Sensor Networks (WSNs). However, the security becomes a big problem for CBWSNs, especially when nodes in the cluster selfishly behave, e.g., not forwarding other nodes’ data, to save their limited resources. This may make the cluster obsolete, even destroying the network. Thus, a way to guarantee the secure and consistent clusters is needed for proper working of CBWSNs. We showed that the selfishness attack, i.e., passive attack or insider attack, in CBWSNs can cause severe performance disaster, when particularly a cluster head node becomes selfish. In order to prevent this situation, this paper proposes a security framework that involves a novel clustering technique as well as a reputation system at nodes for controlling selfishness, making them cooperative and honest. The novelty of the clustering comes from the existence of inspector node (IN) to monitor the cluster head (CH) and its special working style. The experimental results showed that the proposed security framework can control the selfishness and improve the security of the clusters.


2021 ◽  
Vol 23 (05) ◽  
pp. 694-707
Author(s):  
Dr. D. I. George Amalarethinam ◽  
◽  
Ms. P. Mercy ◽  

The Internet of Things (IoT) is a network that includes physical things capable of aggregating and communicating electronic information. With the advancement in wireless sensor networks, IoT provides highly efficient communication for various real-time applications. IoT networks are large-scale networks where routing can be improved by focusing on the Quality of Service (QoS) Parameter. Network coverage can be enhanced by hierarchical clustering of the nodes which increases the network lifetime. The proposed algorithm Enhanced Fuzzy Based Clustering and Routing Algorithm (EFCRA) performs distance and energy-based cluster head selection to find a new path from source to destination. The algorithm uses Fuzzy c-means clustering to provide optimization in forming cluster centers. The cluster head (CH) is identified based on the minimum distance and maximum energy of the sensor node. The cluster head is updated when its energy is lesser than the threshold value. The distance between sensor nodes and its CH node and then to the destination is computed using Dijkstra’s algorithm. The proposed routing strategy provides improved network coverage and throughput which extends the lifetime of the IoT network.


2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Jie Chen ◽  
Kai Xiao ◽  
Kai You ◽  
Xianguo Qing ◽  
Fang Ye ◽  
...  

For the large-scale search and rescue (S&R) scenarios, the centralized and distributed multi-UAV multitask assignment algorithms for multi-UAV systems have the problems of heavy computational load and massive communication burden, which make it hard to guarantee the effectiveness and convergence speed of their task assignment results. To address this issue, this paper proposes a hierarchical task assignment strategy. Firstly, a model decoupling algorithm based on density clustering and negotiation mechanism is raised to decompose the large-scale task assignment problem into several nonintersection and complete small-scale task assignment problems, which effectively reduces the required computational amount and communication cost. Then, a cluster head selection method based on multiattribute decision is put forward to select the cluster head for each UAV team. These cluster heads will communicate with the central control station about the latest assignment information to guarantee the completion of S&R mission. At last, considering that a few targets cannot be effectively allocated due to UAVs’ limited and unbalanced resources, an auction-based task sharing scheme among UAV teams is presented to guarantee the mission coverage of the multi-UAV system. Simulation results and analyses comprehensively verify the feasibility and effectiveness of the proposed hierarchical task assignment strategy in large-scale S&R scenarios with dispersed clustering targets.


2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Parvinder Singh ◽  
Rajeshwar Singh

A wireless sensor network consists of numerous low-power microsensor devices that can be deployed in a geographical area for remote sensing, surveillance, control, and monitoring applications. The advancements of wireless devices in terms of user-friendly interface, size, and deployment cost have given rise to many smart applications of wireless sensor networks (WSNs). However, certain issues like energy efficiency, long lifetime, and communication reliability restrict their large scale utilization. In WSNs, the cluster-based routing protocols assist nodes to collect, aggregate, and forward sensed data from event regions towards the sink node through minimum cost links. A clustering method helps to improve data transmission efficiency by dividing the sensor nodes into small groups. However, improper cluster head (CH) selection may affect the network lifetime, average network energy, and other quality of service (QoS) parameters. In this paper, a multiobjective clustering strategy is proposed to optimize the energy consumption, network lifetime, network throughput, and network delay. A fitness function has been formulated for heterogenous and homogenous wireless sensor networks. This fitness function is utilized to select an optimum CH for energy minimization and load balancing of cluster heads. A new hybrid clustered routing protocol is proposed based on fitness function. The simulation results conclude that the proposed protocol achieves better efficiency in increasing the network lifetime by 63%, 26%, and 10% compared with three well-known heterogeneous protocols: DEEC, EDDEEC, and ATEER, respectively. The proposed strategy also attains better network stability than a homogenous LEACH protocol.


2020 ◽  
Vol 16 (10) ◽  
pp. 155014772096804
Author(s):  
Inam Ul Haq ◽  
Qaisar Javaid ◽  
Zahid Ullah ◽  
Zafar Zaheer ◽  
Mohsin Raza ◽  
...  

Internet of things have emerged enough due to its applications in a wide range of fields such as governance, industry, healthcare, and smart environments (home, smart, cities, and so on). Internet of things–based networks connect smart devices ubiquitously. In such scenario, the role of wireless sensor networks becomes vital in order to enhance the ubiquity of the Internet of things devices with lower cost and easy deployment. The sensor nodes are limited in terms of energy storage, processing, and data storage capabilities, while their radio frequencies are very sensitive to noise and interference. These factors consequently threaten the energy consumption, lifetime, and throughput of network. One way to cope with energy consumption issue is energy harvesting techniques used in wireless sensor network–based Internet of things. However, some recent studies addressed the problems of clustering and routing in energy harvesting wireless sensor networks which either concentrate on energy efficiency or quality of service. There is a need of an adequate approach that can perform efficiently in terms of energy utilization as well as to ensure the quality of service. In this article, a novel protocol named energy-efficient multi-attribute-based clustering scheme (E2-MACH) is proposed which addresses the energy efficiency and communication reliability. It uses selection criteria of reliable cluster head based on a weighted function defined by multiple attributes such as link statistics, neighborhood density, current residual energy, and the rate of energy harvesting of nodes. The consideration of such parameters in cluster head selection helps to preserve the node’s energy and reduce its consumption by sending data over links possessing better signal-to-noise ratio and hence ensure minimum packet loss. The minimized packet loss ratio contributes toward enhanced network throughput, energy consumption, and lifetime with better service availability for Internet of things applications. A set of experiments using network simulator 2 revealed that our proposed approach outperforms the state-of-the-art low-energy adaptive clustering hierarchy and other recent protocols in terms of first-node death, overall energy consumption, and network throughput.


2020 ◽  
Vol 2020 ◽  
pp. 1-21 ◽  
Author(s):  
Adil Hilmani ◽  
Abderrahim Maizate ◽  
Larbi Hassouni

With the increasing number of vehicles, the management of parking spaces in cities is becoming increasingly important in improving the quality of life and combating air pollution. Indeed, finding a parking space at peak times and in congested areas of the population becomes a huge challenge for drivers. To remedy this problem, most modern cities have smart parking. The equipment of these smart parking is mainly based on the implementation of wireless sensor networks (WSN) to monitor, track, and collect real-time information on the occupancy status of each parking space. This information is then made available to drivers who are looking for an available parking space. However, sensor nodes have limitations in terms of energy and communication that affect the performance and quality of the wireless sensor network. Therefore, the design of a self-organization protocol for WSN that minimizes power consumption and maximizes the longevity of the WSN network must be taken into account when implementing and developing a sustainable and viable intelligent parking system. In this paper, we propose a protocol for self-organization of wireless sensor networks (WSN) for the management of parking spaces in outdoor and urban car parks. This protocol is based on building clusters using ZigBee transmission technology for multihop communication. Each sensor node will be installed in the ground of each parking space to monitor its availability by sending the empty or busy state of that space to the gateway using cluster head nodes (CHs). This approach has a robust and efficient self-organizing algorithm that minimizes energy dissipation and increases the lifetime of sensor nodes and the WSN network. The simulation results show that parking management systems in outdoor and urban car parks using the self-organization protocol presented are efficient and sustainable in terms of energy consumption, reliability of data transmission, and the longevity of the WSN network compared to other existing parking systems that use different self-organizing protocols for wireless sensor networks.


2021 ◽  
Vol 2074 (1) ◽  
pp. 012030
Author(s):  
Jing Luo ◽  
Xiaoxu Xiao ◽  
Rongxia Wang

Abstract The topology control of sensor sensor network was studied based on fuzzy control algorithm. Aiming at the dynamic changes of the topology of large-scale and heterogeneous artificial intelligence sensor networks and the incomplete information between nodes, a smart network-based congestion control algorithm for sensor networks was proposed and the performance of fuzzy control algorithms was analyzed. Based on this, a fuzzy control algorithm was designed. The algorithm fully considered the residual energy of nodes and the distribution of nodes in the network. Therefore, the reasonable election of the cluster head can be realized through the game between nodes, which effectively avoided energy holes, made the network energy consumption more uniform, prolonged the network life cycle, and optimized the network topology.


Sign in / Sign up

Export Citation Format

Share Document