An overview of DoSL Attacks in IoT Networks

Many methodologies has been discovered to lower the power consumption in the devices, which is connected to the network in recent years. Many medium access control protocols have been used for low power lossy networks (LLNs).The major goal of introducing this methods is to improve the energy efficiency and to increase the fastness of the communication in the network or the data transmission. The Low power lossy networks is used in many real time scenarios nowadays. These methods use battery-powered devices, which makes transmission easier over lossy links. A particular node generally switches off radio interfaces when no traffic is sent. These devices are made to keep the radio interfaces in ON thus it makes exhausting of batteries causing Denial of sleep attacks. Here, we are going to use time division and channel hoping techniques to get a impact on jamming attacks. We will look on the impacts of such attacks by the ideas got through attacker and to which level the protection allows jamming attacks at upper layers.

Adaptive Decrease Window for BALIA (ADW-BALIA): Congestion Control Algorithm for Throughput Improvement in Nonshared Bottlenecks

The main design goals of the multipath transmission control protocol (MPTCP) are to improve the throughput and share a common bottleneck link fairly with a single-path transmission control protocol (TCP). The existing MPTCP congestion control algorithms achieve the goal of fairness with single-path TCP flows in a shared bottleneck, but they cannot maximize the throughput in nonshared bottlenecks, where multiple subflows traverse different bottleneck links. This is because the MPTCP is designed not to exceed the throughput of a single-path TCP competing in the bottleneck. Therefore, we believe that MPTCP congestion control should have different congestion window control mechanisms, depending on the bottleneck type. In this paper, we propose an adaptive decrease window (ADW) balanced linked adaptation (BALIA) congestion control algorithm that adaptively adjusts the congestion window decrease in order to achieve better throughput in nonshared bottlenecks while maintaining fairness with the single-path TCP flows in shared bottlenecks. The ADW-BALIA algorithm detects shared and nonshared bottlenecks based on delay fluctuations and it uses different congestion window decrease methods for the two types of bottleneck. When the delay fluctuations of the MPTCP subflows are similar, the ADW-BALIA algorithm behaves the same as the existing BALIA congestion control algorithm. If the delay fluctuations are dissimilar, then the ADW-BALIA algorithm adaptively modulates the congestion window reduction. We implement the ADW-BALIA algorithm in the Linux kernel and perform an emulation experiment that is based on various topologies. ADW-BALIA improves the aggregate MPTCP throughput by 20% in the nonshared bottleneck scenario, while maintaining fairness with the single-path TCP in the shared bottleneck scenario. Even in a triple bottleneck topology, where both types of bottlenecks exist together, the throughput increases significantly. We confirmed that the ADW-BALIA algorithm works stably for different delay paths, in competition with CUBIC flows, and with lossy links.

A Green Routing Protocol with Wireless Power Transfer for Internet of Things

The usually constrained resources and lossy links scenarios of Internet of Things (IoT) applications require specific protocol suite, as the IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL). Due to its flexibility, RPL can support efficiently vertical applications such as environmental monitoring, smart city and Industry 4.0. In this paper, we propose a new Objective Function (OF) for RPL based on a composite metric considering jointly the residual energy of a node (parent) together with the energy that a neighbor node (child) can transfer to the parent according to the Wireless Power Transfer (WPT) concept. Specifically, we consider simultaneous wireless information and power transfer (SWIPT) technique, which enables both the energy harvesting and information decoding from the same radio frequency (RF) signal, in order to influence the selection of the best path according to the proposed energy efficient metric in RPL. Performance evaluation on a realistic scenario pointed out a remarkable energy saving to prolong the network lifetime, by selecting the best path toward the sink node, with respect to the OFs usually considered in the literature.

Throughput Maximization for full-duplex two-way relay with finite buffers

<div>Optimal queueing control of multi-hop networks remains a challenging problem, e</div><div>specially in two-way relaying systems, even in the most straightforward scenarios.</div><div>In this paper, we explore two-way relaying having a full-duplex decode-and-forward</div><div>relay with two fifinite buffers. Principally, we propose a novel concept based on the</div><div>multi-agent reinforcement learning (that maximizes the cumulative network through</div><div>put) based on the combination of the buffer states and the lossy links; a decision is</div><div>generated as to whether it can transmit, receive or even simultaneously receive and</div><div>transmit information. Towards this objective, chieflfly, based on the queue state transi</div><div>tion and the lossy links, an analytic Markov decision process is proposed to analyze</div><div>this scheme, and the throughput and queueing delay are derived. Our numerical results</div><div>reveal exciting insights. First, artifificial intelligence based on reinforcement learning</div><div>is optimal when the length of the buffer is superior to a certain threshold. Second, we</div><div>demonstrate that reinforcement learning can boost transmission effificiency and prevent</div><div>buffer overflflow.</div>

Robust Communication Protocol Over Lossy Network

A computer network is the infrastructure that allows two or more computers (called hosts) to communicate with each other. The network achieves this by providing a set of rules for communication, called protocols, which should be observed by all participating hosts. The need for a protocol should be obvious: it allows different computers from different vendors and with different operating characteristics to ‘speak the same language’. Communication protocols are formal descriptions of digital message formats and rules. They are required to exchange messages in or between computing systems and are required in telecommunications When two computer system (server and client) communicate with each other they may encounter data loss due to many obstructions like thick walls,jammers etc. these may cause the data packets to be lost while transmission. We used a protocol to minimize or avoid this loss. This can be done by intelligently routing the data packets via paths that are not jammed and time effective as well.If the messages or data packets are not delivered to the receiver the protocol will resend the data packet. If there is traffic means data packets are delayed due to some obstacles then the server will choose feasible route to deliver the data packets. We use random linear network coding (RLNC) based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultra-reliability and low latency. A sliding window version of RLNC is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths. The packets are scheduled in the paths in a round robin fashion proportional to the data rates. We use finite encoding and decoding window size and do not rely on feedback for closing the sliding window. Our implementation of two paths with LTE and WiFi characteristics shows that the proposed sliding window scheme achieves better latency compared to the block RLNC code. It is also shown that the proposed scheme achieves low latency communication through multiple paths compared to the individual paths for bursty traffic by translating the throughput on both the paths into latency gain.