Wireless Sensor Networks (WSNs), in recent times, have become one of the most promising network solutions with a wide variety of applications in the areas of agriculture, environment, healthcare and the military. Notwithstanding these promising applications, sensor nodes in WSNs are vulnerable to different security attacks due to their deployment in hostile and unattended areas and their resource constraints. One of such attacks is the DoS jamming attack that interferes and disrupts the normal functions of sensor nodes in a WSN by emitting radio frequency signals to jam legitimate signals to cause a denial of service. In this work we propose a step-wise approach using a statistical process control technique to detect these attacks. We deploy an exponentially weighted moving average (EWMA) to detect anomalous changes in the intensity of a jamming attack event by using the packet inter-arrival feature of the received packets from the sensor nodes. Results obtained from a trace-driven simulation show that the proposed solution can efficiently and accurately detect jamming attacks in WSNs with little or no overhead.

Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision variables defined in the routing algorithm. The strengths and weaknesses of the choice of the decision variables used in the design of these energy-efficient and energy-balanced routing protocols are emphasised. Finally, we suggest possible research directions in order to optimize the energy consumption in sensor networks.

In this paper, we study radio resource allocation for multicasting in OFDMA based high altitude platforms (HAPs). We formulate and solve an optimization problem that finds the best allocation of HAP resources such as radio power, sub-channels, and time slots. The problem also finds the best possible frequency reuse across the cells that constitute the service area of the HAP. The objective is to maximize the number of user terminals that receive the requested multicast streams in the HAP service area in a given OFDMA frame. A bounding subroutine in a branch and bound algorithm can be obtained by decomposing it into two easier subproblems, due to its high complexity, and solving them iteratively. Subproblem 1 turns out to be a binary integer linear program of no explicitly noticeable structure and therefore Lagrangian relaxation is used to dualize some constraints to get a structure that is easy to solve. Subproblem 2 turns out to be a linear program with a continuous knapsack problem structure. Hence a greedy algorithm is proposed to solve subproblem 2 to optimality. The subgradient method is used to solve for the dual variables in the dual problem to get the tightest bounds.

Blockchain and cloud-edge computing techniques are promising technologies for next-generation, secure, and privacy-preserving data-sharing systems. By integrating these technologies, the data demands of many data users, such as research institutes, hospitals, manufacturers, etc., can be met. Despite this promising integration, it is yet to be understood how the vulnerability and uncertainties of wireless communication links between the data producers, blockchain systems, cloud-edge computing-based platforms, and data users, as well as unstable validation parameters can affect the overall performance of such blockchain-enabled data-sharing systems. In this article, we considered a collaborative data-sharing scheme, where multiple data providers and data users collaborate to accomplish data-sharing tasks through the proposed blockchain and cloud-edge computing schemes. We considered the spatial distribution of data providers and data users to follow the independent homogeneous Poisson point process, while the transactions generation rate at each node was also modeled using an independent Bernoulli process. We then obtained analyses for some selected performance metrics of interest and evaluate the performance of the system. The obtained results showed that the proposed analyses can be useful in investigating the performance of any blockchain-enabled data-sharing system. This will aid successful deployments of effective data-sharing systems.

This paper presents a multi-user, multi-class and multi-layer edge computing-based framework for effective task offloading and computation processes. Important system requirements that were not captured in the existing multi-layer solutions such as offloading, computations and deadline requirements were captured in the system modeling, while both wireless communications and task computation constraints were considered. We considered three layers system, where each device offloads its generated tasks in each time slot to any selected layer for computation. On its arrival at such a selected layer, the task is only accepted if the queue size is below the pre-defined threshold, otherwise, such a task is offloaded to the next layer. Tasks were classified into class 1 and class 2 tasks following tasks’ quality of service requirements. We adopted stochastic geometry, parallel computing and queueing theory techniques to model the performance of the considered integrated edge-fog-cloud computing environment and obtained analysis for various performance metrics of interest. The obtained analyses demonstrate the importance of multi-layer and multi-class edge computing systems towards improving the experience of both delay-sensitive and mission-critical applications in any task offloading environment.