AEECA for Reliable Communication to Enhance the Network Life Time for WSN

Nowadays,wireless sensor networks play a vital role in our day to day life.Wireless communication is preferred for many sensing applications due its convenience,flexibility and effectiveness.The sensors to sense the environmental factor are versatile and send sensed data to central station wirelessly.The cluster based protocols are provided an optimal solution for enhancing the lifetime of the sensor networks.In this paper,modified K-means++algorithm is used to form the cluster and cluster head in an efficient way and the Advanced Energy-Efficient Cluster head selection Algorithm(AEECA)is used to calculate the weighted fac-tor of the transmission path and effective data collection using gateway node.The experimental results show the proposed algorithm outperforms the existing routing algorithms.

Balance energy-efficient and real-time with reliable communication protocol for wireless sensor network

In many wireless sensor network applications, it should be considered that how to trade off the inherent conflict between energy efficient communication and desired quality of service such as real-time and reliability of transportation. In this paper, a novel routing protocols named balance energy-efficient and real-time with reliable communication （BERR） for wireless sensor networks （WSNs） are proposed, which considers the joint performances of real-time, energy efficiency and reliability. In BERR, a node, which is preparing to transmit data packets to sink node, estimates the energy cost, hop count value to sink node and reliability using local information gained from neighbor nodes. BERR considers not only each sender＇ energy level but also that of its neighbor nodes, so that the better energy conditions a node has, the more probability it will be to be chosen as the next relay node. To enhance real-time delivery, it will choose the node with smaller hop count value to sink node as the possible relay candidate. To improve reliability, it adopts retransmission mechanism. Simulation results show that BERR has better performances in term of energy consumption, network lifetime, reliability and small transmitting delay.

Reliable Communication on Cube-Based Multicomputers

We consider a distributed unicasting algorithm for hypercubes with faulty nodes (including disconnected hypercubes) using the safety level concept. The safety level of each node in an n-dimensional hypercube is an approximated measure of the number and distribution of faulty nodes in the neighborhood and it can be easily calculated through n - 1 rounds of information exchange among neighboring nodes. Optimal unicasting between two nodes is guaranteed if the safety level of the source node is no less than the Hamming distance between the source and the destination. The feasibility of an optimal or suboptimal unicasting can be easily determined at the source node by comparing its safety level, together with its neighbors' safety levels, with the Hamming distance between the source and the destination. The proposed scheme is also the first attempt to address the unicasting problem in disconnected hypercubes. The safety level concept is also extended to be used in hypercubes with both faulty nodes and links and in generalized hypercubes.

Reliability Evaluation of Mobile Communication Networks

A new reliability evaluation measure, global clustering reliability (GCR), is proposed. Firstly, the common measures used in invulnerability and survivability evaluation of mobile communication networks are discussed, and the shortcomings of these measures are pointed out. Then a new reliability evaluation measure, GCR, which is applicable to mobile communication networks, is proposed. And some properties and theorem about this measure are put forward. Finally, simulation calculation of reliability evaluation that uses this measure to 12 kinds of topological networks is accomplished. And the comparison between this measure and link connected factor (LCF) measure is also given. The results proved that the design of GCR is reasonable, its computation is rapid, moreover, it can take into account of invalidation of both nodes and links, and it has good physical meanings

A Collaborative Machine Learning Scheme for Traffic Allocation and Load Balancing for URLLC Service in 5G and Beyond

Key challenges for 5G and Beyond networks relate with the requirements for exceptionally low latency, high reliability, and extremely high data rates. The Ultra-Reliable Low Latency Communication (URLLC) use case is the trickiest to support and current research is focused on physical or MAC layer solutions, while proposals focused on the network layer using Machine Learning (ML) and Artificial Intelligence (AI) algorithms running on base stations and User Equipment (UE) or Internet of Things (IoT) devices are in early stages. In this paper, we describe the operation rationale of the most recent relevant ML algorithms and techniques, and we propose and validate ML algorithms running on both cells (base stations/gNBs) and UEs or IoT devices to handle URLLC service control. One ML algorithm runs on base stations to evaluate latency demands and offload traffic in case of need, while another lightweight algorithm runs on UEs and IoT devices to rank cells with the best URLLC service in real-time to indicate the best one cell for a UE or IoT device to camp. We show that the interplay of these algorithms leads to good service control and eventually optimal load allocation, under slow load mobility. .

Reliable and Energy Efficient Protocol for Wireless Sensor Network

Low-power design is one of the most important issues in wireless sensor networks (WSNs) , while reliable information transmitting should be ensured as well. Transmitting power (TP) control is a simple method to make the power consumption down, but excessive interferences from potential adjacent operating links and communication reliability between nodes should be considered. In this paper, a reliable and energy efficient protocol is presented, which adopts adaptive rate control based on an optimal TP. A mathematical model considering average interference and network connectivity was used to predict the optimal TP. Then for the optimal TP, active nodes adaptively chose the data rate with the change of bit-error–rate(BER) performance. The efficiency of the new strategy was validated by mathematical analysis and simulations. Compared with 802.11 DCF which uses maximum unified TP and BASIC protocol, it is shown that the higher average throughput can achieve while the energy consumption per useful bit can be reduced according to the results.

Improving the Reliability of Computer Communication Networks

For networks that are directed or can be represented by a directed network,reversing one or more of the uni-directional links may provide the ability to reconnect a network that has been disconnected by link failure, In this paper,a new approach to reconfigure such networks is proposed.We develop a linear time algorithm which,when reachability has been destroyed by the removal of a single link,optimally restores teachability through the reversal of selected links.Multi-link failure reconnectability is discussed and an algorithm with polynomial complexity is given which provides a nearly optimum solution to reconnect the network.We show that the reliability of a network that allows reversals is at least twice more than that in which reversals are not permitted.Unfortunately,the reconnection of some networks cannot be established.Therefore,we discuss the maximization of reachability of such networks so that each node can reach maximum number of the other nodes.