This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain the shortest paths for the nodes to balance the flowing traffic within the network and increase its lifetime. However, the optimal link cost values and the maximum achievable lifetime are…
Category: M.TECH PROJECT IN OMNET
Asymptotic Deployment Gain: A Simple Approach to Characterize the SINR Distribution in General Cellular Networks
In cellular network models, the base stations are usually assumed to form a lattice or a Poisson point process (PPP). In reality, however, they are deployed neither fully regularly nor completely randomly. Accordingly, in this paper, we consider the very general class of motion-invariant models and analyze the behavior of the outage probability (the probability…
Delay Optimal Buffered Decode-and-Forward for Two-Hop Networks With Random Link Connectivity
Delay optimal control of multi-hop networks remains a challenging problem even in the simplest scenarios. In this paper, we consider delay optimal control of a two-hop half-duplex network with independent identically distributed ON-OFF fading. Both the source node and the relay node are equipped with infinite buffers and have exogenous bit arrivals. We focus on…
Optimal Approach for Reliability Assessment in Radial Distribution Networks
This paper proposes a new methodology for the evaluation of reliability in radial distribution networks through the identification of new investments in this kind of networks, in order to reduce the repair time and the failure rate, which leads to a reduction of the forced outage rate and, consequently, to an increase of reliability. The…
From Feedforward to Recurrent LSTM Neural Networks for Language Modeling
Language models have traditionally been estimated based on relative frequencies, using count statistics that can be extracted from huge amounts of text data. More recently, it has been found that neural networks are particularly powerful at estimating probability distributions over word sequences, giving substantial improvements over state-of-the-art count models. However, the performance of neural network…
A survey on distributed techniques for detection of node clones in Wireless Sensor Networks
Wireless Sensor Networks consists of sensor nodes which are placed in harsh and hostile surrounding where an adversary may capture the nodes, replicate them and use it for its own purpose. If the clone nodes remain undetected, it can disrupt the network functions making it vulnerable to attacks. Hence false data can be injected or…
Multiple-Loop Self-Triggered Model Predictive Control for Network Scheduling and Control
We present an algorithm for controlling and scheduling multiple linear time-invariant processes on a shared bandwidth-limited communication network using adaptive sampling intervals. The controller is centralized and not only computes at every sampling instant the new control command for a process but also decides the time interval to wait until taking the next sample.The approach…
Priority-Driven Swapping-Based Scheduling of Aperiodic Real-Time Messages Over EtherCAT Networks
Real-time Ethernet (RTE) technologies are becoming increasingly popular, as they provide high bandwidth and are able to meet the requirements of industrial real-time communications. Among RTE protocols, the EtherCAT standard is suitable for motion control and closed-loop control applications, which require very short cycle times. As EtherCAT was specifically devised for periodic traffic, aperiodic real-time…
Sherlock Is Around: Detecting Network Failures with Local Evidence Fusion
Traditional approaches for wireless sensor network diagnosis are mainly sink-based. They actively collect global evidences from sensor nodes to the sink so as to conduct centralized analysis at the powerful back-end. On the one hand, long distance proactive information retrieval incurs huge transmission overhead; On the other hand, due to the coupling effect between diagnosis…
Bidirectional Buffer-Aided Relay Networks With Fixed Rate Transmission—Part I: Delay-Unconstrained Case
In this paper, we consider bidirectional relay networks in which two users exchange information only via a relay node, i.e., a direct link between both users is not present. We assume that channel state information at the transmitter is not available and/or only one coding and modulation scheme is used due to complexity constraints. Thus,…