A Novel Algorithm for Maximizing the Lifetime of Sensor Networks and the Use of an m²-Mote to Refresh Battery Power On-the-Fly

2009 ◽  
Author(s):  
Olufemi Adeluyi ◽  
Sangman Moh ◽  
Jeong-A Lee
Keyword(s):  
Sensor Networks ◽  
Battery Power ◽  
Novel Algorithm

scholarly journals Link-delay-aware Reinforcement Scheduling for Data Aggregation in Massive IoT

2021 ◽  
Author(s):  
Van-Vi Vo ◽  
Tien-Dung Nguyen ◽  
Duc-Tai Le ◽  
Moonseong Kim ◽  
Hyunseung Choo
Keyword(s):  
Sensor Networks ◽  
Data Aggregation ◽  
Dominating Set ◽  
Independent Set ◽  
Maximal Independent Set ◽  
Problem Of Time ◽  
The Past ◽  
Battery Power ◽  
Efficient Data ◽  
And Performance

<div>Over the past few years, the use of wireless sensor networks in a range of Internet of Things (IoT) scenarios has grown in popularity. Since IoT sensor devices have restricted battery power, a proper IoT data aggregation approach is crucial to prolong the network lifetime. To this end, current approaches typically form a virtual aggregation backbone based on a connected dominating set or maximal independent set to utilize independent transmissions of dominators. However, they usually have a fairly long aggregation delay because the dominators become bottlenecks for receiving data from all dominatees. The problem of time-efficient data aggregation in multichannel duty-cycled IoT sensor networks is analyzed in this paper. We propose a novel aggregation approach, named LInk-delay-aware REinforcement (LIRE), leveraging active slots of sensors to explore a routing structure with pipeline links, then scheduling all transmissions in a bottom-up manner. The reinforcement schedule accelerates the aggregation by exploiting unused channels and time slots left off at every scheduling round. LIRE is evaluated in a variety of simulation scenarios through theoretical analysis and performance comparisons with a state-of-the-art scheme. The simulation results show that LIRE reduces more than 80% aggregation delay compared to the existing scheme.</div>

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 A Dynamic ID Assignment Mechanism to Defend Against Node Replication Attack in Static Wireless Sensor Networks

2018 ◽  
Vol 3 (1) ◽  
Author(s):  
Mojtaba Jamshidi ◽  
Abdusalam Abdulla Shaltooki ◽  
Zahra Dagal Zadeh ◽  
Aso Mohammad Darwesh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Tree Architecture ◽  
Wireless Sensor ◽  
Dynamic Id ◽  
Comparison Results ◽  
Exchange Information ◽  
Shared Key ◽  
Static Wireless Sensor Networks ◽  
Novel Algorithm

One of the known dangerous attacks against wireless sensor networks (WSNs) is node replica. In this attack, adversary captures one or more normal nodes of the network, generates copies of them (replicas) and deploy them in the network. These copied nodes are controlled by the adversary which can establish a shared key with other nodes of the network easily and exchange information. In this paper, a novel algorithm is proposed to defend against this attack in static sensor networks. The proposed algorithm employs a multi-tree architecture to assign ID to the nodes dynamically and prevent attachment of the injected replica nodes to the network by the adversary. The efficiency of the proposed algorithm is evaluated in terms of memory, communication, and computation overheads and the results are compared with other existing algorithms. Comparison results indicate the superiority of the proposed algorithm in terms of mentioned measures. In addition, the proposed algorithm is simulated and its efficiency is evaluated in terms of probability of detecting replica nodes. Experiment results show that the proposed algorithm has favorable performance in detection of replica nodes.

Sensor Localization in Three-Dimensional Space

2017 ◽  
pp. 120-144
Author(s):  
Habib M. Ammari ◽  
Angela J. Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Wireless Sensor ◽  
Two Dimensional ◽  
Localization Problem ◽  
Sensor Localization ◽  
Battery Power ◽  
Three Dimensional Space

Thanks to key advances in wireless communication and electronics, sensors have emerged as an appealing technology for several interesting applications, such as civilian (health and environment monitoring), natural (disaster detection), military (battlefield surveillance), and agricultural (precision agriculture) applications, to name a few. When grouped together, these sensors form a network to measure and gather data of the surrounding environment with respect to a specific phenomenon. The sensors are battery-powered, tiny devices that possess all the characteristics of a traditional computer, including storage, processing, and communication capabilities. In addition, these sensors are capable of sensing the environment and collecting data regarding several parameters, such as temperature, light, sound, vibration, etc. Unfortunately, all the sensors' capabilities are limited due to their physical size. In particular, the sensors have limited battery power as usually they are equipped with AA/AAA batteries whose lifetime is short. Therefore, the main challenge in the design of this type of network is the sensors' battery power (or energy), which is a critical component for the operation of the whole network. Moreover, these sensors communicate (possibly) wirelessly with each other to collect sensed data and accomplish the goals of their missions. To this end, the sensors are required to know their locations and those of their neighbors. Therefore, sensor localization is a crucial aspect for the design and development of wireless sensor networks. Various algorithms and protocols have been developed for sensor localization in both two-dimensional and three- dimensional wireless sensor networks. However, the problem of sensor localization in a three-dimensional space has not been investigated in the literature as extensively as its counterpart in a two-dimensional space. In this book chapter, we propose to study the sensor localization problem in three-dimensional wireless sensor networks. More precisely, this book chapter's sole focus will be on three-dimensional sensor deployment, and it aims to provide an overview of the existing solutions to the localization problem in a three-dimensional space. Basically, it proposes a classification of localization algorithms, and discusses different three-dimensional sensor localization approaches along with their motivation and evaluation.

scholarly journals ACO-Based Sweep Coverage Scheme in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Peng Huang ◽  
Feng Lin ◽  
Chang Liu ◽  
Jian Gao ◽  
Ji-liu Zhou
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sensors ◽  
Wireless Sensor ◽  
Data Delivery ◽  
Network Coverage ◽  
Coverage Problem ◽  
Points Of Interest ◽  
Novel Algorithm

Coverage problem is one of the major issues in wireless sensor networks (WSN). In order to optimize the network coverage, different coverage formulations have been proposed. Recently, a newly emerging coverage scheme in wireless sensor networks, sweep coverage, which uses mobile sensors to monitor certain points of interest (POIs), is proposed. However, the data delivery to sink, an important problem in WSN, is not considered in original sweep coverage and many of the existing works did not consider it yet. In this work, a novel algorithm named ACOSC (ACO-based sweep coverage) to solve the sweep coverage problem considering periodical coverage of POIs and delivery of data simultaneously is proposed. The evaluation results show that our algorithm has better performance than existing schemes.

Sign in / Sign up

Export Citation Format

Share Document