Availability and Reliability in MEC-enabled UAVs for URLLC

Unmanned aerial vehicle (UAV) communication networks are key components of the fifth (5G) and beyond (B5G) wireless communication systems. This work aims to develop a dynamic resource provisioning framework to allocate computational resources in a UAV equipped with Multi-access Edge Computing resources (MEC-enabled UAV) that provides on demand communication capabilities to Ultra-reliable low-latency communication (URLLC) services. We propose a dynamic CTMC-based framework to analyze the overall node availability and reliability, while taking into account virtual host setup (repair) delays and failure events for mobile Virtual Network Functions (VNFs) hosted on MEC-enabled UAVs. Numerical results illustrate how virtual resource parameters can impact critical service communication.

Sustaining the Life of Wireless Sensor Node with Energy Harvesting

Wireless Sensor Networks (WSN) play a significant role in a number of sensing and monitoring applications. It has also become a key enabling technology for Internet of Things (IoT). Most of the earlier works were focused on extending the battery life by reducing the energy consumption of the wireless node. Availability of small footprint devices capable of ambient energy harvesting has triggered renewed interest in enhancing the performance of WSNs. In this paper we propose a novel method that can be applied to duty cycle based Media Access Control (MAC) protocols in energy harvesting WSNs to sustain the life of the node. Our approach takes into consideration the solar energy available at any instant of time so as to maximize the performance. We have conducted detailed measurements and analysis of solar energy harvested under different conditions. Our results show significant enhancement in throughput achieved while sustaining the life of the node.

Artificial Intelligence Based A* Optimization Routing in Mobile Ad Hoc Networks

A Mobile Ad Hoc Network (MANET) is a hotchpotch of nodes with mobility feature, the established network utilization is dynamically outlined based on temporary architecture. In MANETs, the challenging and vital role is played by the routing protocols performance factors under different condition and environments. The routing protocols are liable to handle many nodes with limited resources. There exits many routing protocols in MANETs, one of the main key note that has to be considered in designing a routing protocol is to observe that the designed routing protocol is having an proportionate effect on network performance. The existence of obstacles may lead to many geographical routing problems like excess consumption of power and congestion of data. The aim of this paper is to take the assistance of A* algorithm that finds the walk-able path avoiding the concave obstacle in the path relaying on the gaming-theory model[29]. This algorithm decreases the delays in packet transmission and in turn increases the success rate of transmission. We take into consideration path length, penalty for node availability as probability of forwarding criteria and processes effective packet transmission. The simulated results analyse the performance of our protocol over other conventional algorithms based on congestion cost, path length, node availability penalty, delay, packet loss, throughput.

Smart Routing with Segmental Routing Mechanism for Wireless Mesh Network (WMN)

The wireless mesh networks (WMN) are the growing mediums of connectivity for the purpose of internet or intranet connectivity. The routing among the WMN becomes a challenging task with the rise in the number of nodes across the network and the larger data volumes. In this paper, the work has been carried out on the growing WMNs with the dynamic number of nodes. The node availability aware neighbor formation and status tracking mechanism has been applied in this scheme in order to keep the network updated about the working nodes and to eliminate the non-functional nodes from the connected mesh network. The neighbor query process is utilized for the path building towards the base stations (BTS) or Sink node in the given WMN networks. Additionally; the routing information is collected from all of the neighboring nodes towards the destination paths using the desired mechanism for the path discovery under the segmental routing mechanism for WMN, which has been created with the capability of handling the network path failures dynamically in the local domain of the given network zone. The performance of the proposed model has been analyzed in the form of energy consumption, end-to-end delay and detailed energy & packet based analysis

Nodes Availability Analysis of NB-IoT Based Heterogeneous Wireless Sensor Networks under Malware Infection

The Narrowband Internet of Things (NB-IoT) is a main stream technology based on mobile communication system. The combination of NB-IoT and WSNs can active the application of WSNs. In order to evaluate the influence of node heterogeneity on malware propagation in NB-IoT based Heterogeneous Wireless Sensor Networks, we propose a node heterogeneity model based on node distribution and vulnerability differences, which can be used to analyze the availability of nodes. We then establish the node state transition model by epidemic theory and Markov chain. Further, we obtain the dynamic equations of the transition between nodes and the calculation formula of node availability. The simulation result is that when the degree of node is small and the node vulnerability function is a power function, the node availability is the highest; when the degree of node is large and the node vulnerability function satisfies the exponential function and the power function, the node availability is high. Therefore, when constructing a NBIOT-HWSNs network, node protection is implemented according to the degree of node, so that when the node vulnerability function satisfies the power function, all nodes can maintain high availability, thus making the entire network more stable.

Data Dispersal for Large Storage Systems

Data dispersal mechanism is a group of basic working protocols for oceans of data processing and it plays an important role in enhancing system error correction and avoiding storage device failure. The data recovery availability of the client is the main design goal of data dispersal algorithms. The system storage and computing costs are also important factors for a data dispersal algorithm. In this paper, we discussed how to disperse data with the special properties as well as with acceptable system costs. We developed a universal approach to measure storage node availability based on state variables. After analyzed the existing data processing algorithms, we presented a new hybrid data dispersal algorithm using the above approach in detail evaluation. Two redundancy policies are adapted to storage node with different node availability. According to our analysis, this algorithm has its advantages in system storing and communication bandwidth costs.

Node Availability for Distributed Systems considering processor and RAM utilization for Load Balancing

<p>Node-Availability is a new metric that based on processor utilization, free RAM and number of processes queued at a node, compares different workload levels of the nodes participating in a distributed system. Dynamic scheduling and Load-Balancing in distributed systems can be achieved through the Node-Availability metric as decision criterion, even without previously knowing the execution time of the processes, nor other information about them such as process communication requirements.<br /> This paper also presents a case study which shows that the metric is feasible to implement in conjunction with a dynamic Load-Balancing algorithm, obtaining an acceptable performance.</p>