Worst-Case Routing Performance Metrics for Sensor Networks

Routing packets in Underwater Sensor Networks (UWSNs) face different challenges, the most notable of which is perhaps how to deal with void communication areas. While this issue is not addressed in some underwater routing protocols, there exist some partially state-full protocols which can guarantee the delivery of packets using excessive communication overhead. However, there is no fully stateless underwater routing protocol, to the best of our knowledge, which can detect and bypass trapped nodes. A trapped node is a node which only leads packets to arrive finally at a void node. In this paper, we propose a Stateless Opportunistic Routing Protocol (SORP), in which the void and trapped nodes are locally detected in the different area of network topology to be excluded during the routing phase using a passive participation approach. SORP also uses a novel scheme to employ an adaptive forwarding area which can be resized and replaced according to the local density and placement of the candidate forwarding nodes to enhance the energy efficiency and reliability. We also make a theoretical analysis on the routing performance in case of considering the shadow zone and variable propagation delays. The results of our extensive simulation study indicate that SORP outperforms other protocols regarding the routing performance metrics.

Download Full-text

A Novel Static Path Planning Method for Mobile Anchor-Assisted Localization in Wireless Sensor Networks

International Journal of Sensors Wireless Communications and Control ◽

10.2174/2210327910999200723164502 ◽

2020 ◽

Vol 10 ◽

Author(s):

Abdelhady M. Naguib ◽

Shahzad Ali

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Path Planning ◽

Sensor Node ◽

Large Scale ◽

Performance Metrics ◽

Wireless Sensor ◽

Anchor Node ◽

Mobile Anchor ◽

Planning Methods

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Objectives: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.

Download Full-text

Wireless Sensor Networks for Smart Cities: Network Design, Implementation and Performance Evaluation

Electronics ◽

10.3390/electronics10020218 ◽

2021 ◽

Vol 10 (2) ◽

pp. 218

Author(s):

Ala’ Khalifeh ◽

Khalid A. Darabkh ◽

Ahmad M. Khasawneh ◽

Issa Alqaisieh ◽

Mohammad Salameh ◽

...

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Experimental Evaluation ◽

Large Scale ◽

Performance Metrics ◽

Smart Cities ◽

Field Tests ◽

Sensor Nodes ◽

Wireless Sensor ◽

Real Field

The advent of various wireless technologies has paved the way for the realization of new infrastructures and applications for smart cities. Wireless Sensor Networks (WSNs) are one of the most important among these technologies. WSNs are widely used in various applications in our daily lives. Due to their cost effectiveness and rapid deployment, WSNs can be used for securing smart cities by providing remote monitoring and sensing for many critical scenarios including hostile environments, battlefields, or areas subject to natural disasters such as earthquakes, volcano eruptions, and floods or to large-scale accidents such as nuclear plants explosions or chemical plumes. The purpose of this paper is to propose a new framework where WSNs are adopted for remote sensing and monitoring in smart city applications. We propose using Unmanned Aerial Vehicles to act as a data mule to offload the sensor nodes and transfer the monitoring data securely to the remote control center for further analysis and decision making. Furthermore, the paper provides insight about implementation challenges in the realization of the proposed framework. In addition, the paper provides an experimental evaluation of the proposed design in outdoor environments, in the presence of different types of obstacles, common to typical outdoor fields. The experimental evaluation revealed several inconsistencies between the performance metrics advertised in the hardware-specific data-sheets. In particular, we found mismatches between the advertised coverage distance and signal strength with our experimental measurements. Therefore, it is crucial that network designers and developers conduct field tests and device performance assessment before designing and implementing the WSN for application in a real field setting.

Download Full-text

A Low-Cost Jamming Detection Approach Using Performance Metrics in Cluster-Based Wireless Sensor Networks

Sensors ◽

10.3390/s21041179 ◽

2021 ◽

Vol 21 (4) ◽

pp. 1179

Author(s):

Carolina Del-Valle-Soto ◽

Carlos Mex-Perera ◽

Juan Arturo Nolazco-Flores ◽

Alma Rodríguez ◽

Julio C. Rosas-Caro ◽

...

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Routing Protocol ◽

Performance Metrics ◽

Low Cost ◽

Detection Algorithm ◽

Anomalous Behavior ◽

Wireless Sensor ◽

Jamming Detection ◽

Minimal Energy Expenditure

Wireless Sensor Networks constitute an important part of the Internet of Things, and in a similar way to other wireless technologies, seek competitiveness concerning savings in energy consumption and information availability. These devices (sensors) are typically battery operated and distributed throughout a scenario of particular interest. However, they are prone to interference attacks which we know as jamming. The detection of anomalous behavior in the network is a subject of study where the routing protocol and the nodes increase power consumption, which is detrimental to the network’s performance. In this work, a simple jamming detection algorithm is proposed based on an exhaustive study of performance metrics related to the routing protocol and a significant impact on node energy. With this approach, the proposed algorithm detects areas of affected nodes with minimal energy expenditure. Detection is evaluated for four known cluster-based protocols: PEGASIS, TEEN, LEACH, and HPAR. The experiments analyze the protocols’ performance through the metrics chosen for a jamming detection algorithm. Finally, we conducted real experimentation with the best performing wireless protocols currently used, such as Zigbee and LoRa.

Download Full-text

Block Design-Based Asynchronous Neighbor Discovery Protocol for Wireless Sensor Networks

Journal of Sensors ◽

10.1155/2015/951652 ◽

2015 ◽

Vol 2015 ◽

pp. 1-12 ◽

Cited By ~ 5

Author(s):

Sangil Choi ◽

Wooksik Lee ◽

Teukseob Song ◽

Jong-Hoon Youn

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Simulation Study ◽

Mathematical Proof ◽

Block Design ◽

Wireless Sensor ◽

Neighbor Discovery ◽

Block Designs ◽

Worst Case ◽

Neighbor Discovery Protocol

Neighbor discovery is a significant research topic in wireless sensor networks. After wireless sensor devices are deployed in specific areas, they attempt to determine neighbors within their communication range. This paper proposes a new Block design-based Asynchronous Neighbor Discovery protocol for sensor networks calledBAND. We borrow the concept of combinatorial block designs for neighbor discovery. First, we summarize a practical challenge and difficulty of using the original block designs. To address this challenge, we create a new block generation technique for neighbor discovery schedules and provide a mathematical proof of the proposed concept. A key aspect of the proposed protocol is that it combines two block designs in order to construct a new block for neighbor discovery. We analyze the worst-case neighbor discovery latency numerically between our protocol and some well-known protocols in the literature. Our protocol reveals that the worst-case latency is much lower than others. Finally, we evaluate the performance ofBANDand existing representative protocols through the simulation study. The results of our simulation study show that the average and maximum latency ofBANDis about 40% lower than that of existing protocols. Furthermore,BANDspends approximately 30% less energy than others during the neighbor discovery process.

Download Full-text

Performance metrics in wireless sensor networks :a survey and outlook

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i2.26.12527 ◽

2018 ◽

Vol 7 (2.26) ◽

pp. 25

Author(s):

E Ramya ◽

R Gobinath

Keyword(s):

Wireless Sensor Networks ◽

Quality Of Service ◽

Wireless Sensor Network ◽

Sensor Networks ◽

Sensor Network ◽

Performance Metrics ◽

Resource Constraints ◽

Sensor Data ◽

Wireless Sensor

Data mining plays an important role in analysis of data in modern sensor networks. A sensor network is greatly constrained by the various challenges facing a modern Wireless Sensor Network. This survey paper focuses on basic idea about the algorithms and measurements taken by the Researchers in the area of Wireless Sensor Network with Health Care. This survey also catego-ries various constraints in Wireless Body Area Sensor Networks data and finds the best suitable techniques for analysing the Sensor Data. Due to resource constraints and dynamic topology, the quality of service is facing a challenging issue in Wireless Sensor Networks. In this paper, we review the quality of service parameters with respect to protocols, algorithms and Simulations.

Download Full-text

Dynamic Daylight Metrics for Electricity Savings in Offices: Window Size and Climate Smart Lighting Management

Energies ◽

10.3390/en11113143 ◽

2018 ◽

Vol 11 (11) ◽

pp. 3143 ◽

Cited By ~ 6

Author(s):

Ignacio Acosta ◽

Miguel Ángel Campano ◽

Samuel Domínguez-Amarillo ◽

Carmen Muñoz

Keyword(s):

Energy Efficiency ◽

Net Present Value ◽

Energy Savings ◽

Performance Metrics ◽

Control Strategies ◽

Window Size ◽

Weather Conditions ◽

Worst Case ◽

Daylight Performance ◽

Dynamic Metrics

Daylight performance metrics provide a promising approach for the design and optimization of lighting strategies in buildings and their management. Smart controls for electric lighting can reduce power consumption and promote visual comfort using different control strategies, based on affordable technologies and low building impact. The aim of this research is to assess the energy efficiency of these smart controls by means of dynamic daylight performance metrics, to determine suitable solutions based on the geometry of the architecture and the weather conditions. The analysis considers different room dimensions, with variable window size and two mean surface reflectance values. DaySim 3.1 lighting software provides the simulations for the study, determining the necessary quantification of dynamic metrics to evaluate the usefulness of the proposed smart controls and their impact on energy efficiency. The validation of dynamic metrics is carried out by monitoring a mesh of illuminance-meters in test cells throughout one year. The results showed that, for most rooms more than 3.00 m deep, smart controls achieve worthwhile energy savings and a low payback period, regardless of weather conditions and for worst-case situations. It is also concluded that dimming systems provide a higher net present value and allow the use of smaller window size than other control solutions.

Download Full-text

A Novel Framework to Secure CBWSNS Against the Selfishness Problem

Science & Technology Journal ◽

10.22232/stj.2019.07.02.01 ◽

2019 ◽

Vol 7 (2) ◽

pp. 7-16

Author(s):

Poonam Mittal ◽

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Defense Mechanism ◽

Cluster Head ◽

Base Station ◽

Wireless Sensor ◽

Security Level ◽

Stochastic Algorithm ◽

Worst Case ◽

Cluster Heads

Dynamic and cooperative nature of sensor nodes in Wireless Sensor Networks raises question on security. Various researchers work in this direction to spot malicious, selfish and compromised nodes. Various mechanisms followed are uniqueness of clustering, reputation system and an operation at specific nodes. LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink). Each node uses a stochastic algorithm at each round to determine whether it will become a cluster head in this round. Clustering process carried out in two stages takes the role of the reputation scheme and reveals specific operation at CH, IN and MNs beside their usual activities in cluster based wireless sensor networks. This paper mentioned the final structure of the security framework, corresponding attacks and defense mechanism of the model. It also discusses various security level processes of wireless sensor networks. Results implies that in a cluster-based protocol such as LEACH in which optimally 5% of the nodes are cluster heads it is likely that a significant portion of the network can be paralyzed or the entire network disabled, in the worst-case scenario, if these cluster heads are compromised. Our main contribution in this paper is our novel approach in maintaining trusted clusters through a trust-based decision-making cluster head election algorithm.

Download Full-text

Online peak-aware energy scheduling with untrusted advice

ACM SIGEnergy Energy Informatics Review ◽

10.1145/3508467.3508473 ◽

2021 ◽

Vol 1 (1) ◽

pp. 59-77

Author(s):

Russell Lee ◽

Jessica Maghakian ◽

Mohammad Hajiesmaili ◽

Jian Li ◽

Ramesh Sitaraman ◽

...

Keyword(s):

Competitive Ratio ◽

Energy Demand ◽

Large Scale ◽

Performance Metrics ◽

Randomized Algorithm ◽

Deterministic Algorithm ◽

Pareto Optimal ◽

Energy Prices ◽

Worst Case ◽

Cost Of Energy

This paper studies the online energy scheduling problem in a hybrid model where the cost of energy is proportional to both the volume and peak usage, and where energy can be either locally generated or drawn from the grid. Inspired by recent advances in online algorithms with Machine Learned (ML) advice, we develop parameterized deterministic and randomized algorithms for this problem such that the level of reliance on the advice can be adjusted by a trust parameter. We then analyze the performance of the proposed algorithms using two performance metrics: robustness that measures the competitive ratio as a function of the trust parameter when the advice is inaccurate, and consistency for competitive ratio when the advice is accurate. Since the competitive ratio is analyzed in two different regimes, we further investigate the Pareto optimality of the proposed algorithms. Our results show that the proposed deterministic algorithm is Pareto-optimal, in the sense that no other online deterministic algorithms can dominate the robustness and consistency of our algorithm. Furthermore, we show that the proposed randomized algorithm dominates the Pareto-optimal deterministic algorithm. Our large-scale empirical evaluations using real traces of energy demand, energy prices, and renewable energy generations highlight that the proposed algorithms outperform worst-case optimized algorithms and fully data-driven algorithms.

Download Full-text