Network Coding in Heterogeneous Multicore IoT Nodes With DAG Scheduling of Parallel Matrix Block Operations

Current technology driven world is moving forward with massive implementation of smart objects. These smart objects or Internet of Things (IoT) nodes are involved in sensing of real time critical data from surroundings. Though these IoT nodes are involved in very specific task but their existence is very important for the complete system. Usually, in an IoT architecture, several heterogeneous nodes connect with a nearest gateway. The gateway itself connects with the world via Internet. IoT nodes need to flexible about connectivity as those may need to leave and join any gateway based on context (time, location etc.). To achieve flexibility, IoT components need a trust relationship between each other. In this paper, we have proposed a mechanism for integrating distributed trust management in IoT by using edge computing technology, considering the scalability and heterogeneous capability of IoT devices.

Maintaining adequate energy in low-powered Internet of Things (IoT) nodes is crucial for the development of several applications like smart homes, autonomous industries, etc. These IoT nodes exploit adaptive duty cycling techniques for the efficient utilization of energy resources. However, such adaptive duty cycling of IoT nodes results in their asynchronous operations thereby inducing energy holes in the network. These energy holes lead to information loss and poor quality of services of IoT networks. In this regard, energy harvesting using Mobile Energy Transmitters (MET) can improve the lifetime of an IoT network. In this work, we are introducing a metric named Age of Charging (AoC) metric to quantify the repetitive charging of power deficit IoT nodes. Energy-efficient scheduling of MET is proposed to minimize the expected average AoC such that the energy harvested by IoT nodes is maximized. In this regard, the optimization problem is first remodeled into a Markov decision process. Subsequently, a deep reinforcement learning algorithm is developed based upon the twin delayed deep deterministic policy gradient scheme for energy-efficient scheduling of MET in asynchronous IoT networks. The simulation results indicate that the proposed algorithm outperforms the conventional Deep Q-networks and soft-actor-critic algorithms. These results motivate the usage of MET-aided energy harvesting in self-sustaining IoT networks.

Designed as a specialized ad hoc network suitable for applications such as emergency responses, OppNets are considered as a sub-class of DTN where communication opportunities are intermittent, so an end-to-end path between the source and the destination may never exist. Existing networks have already brought connectivity to a broad range of devices, such as hand held devices, laptops, tablets, PC, etc. The Internet of Things (IoT) will extend the connectivity to devices beyond just mobile phones and laptops, but to buildings, wearable devices, cars, different things and objects. There are different issues for these networks. One of them is the selection of IoT nodes in order to carry out a task in opportunistic networks. In this work, we implement a Fuzzy-Based System for IoT node selection in opportunistic networks. For our proposed system, we use four input parameters: IoT Node’s Unique Encounters (NUE), IoT Node’s Free Buffer Space (NFBS), IoT Node’s Batter Level (NBL) and IoT Node Contact Duration (NCD). The output parameter is IoT Node Selection Decision (NSD). The results show that the proposed system makes a proper selection decision of IoT nodes in opportunistic networks. The IoT node selection is increased up to 25% and 11% by increasing NCD and NUE, respectively.

Recent research endeavours are capitalizing on state of the art technologies to build a scalable Internet of Things (IoT). Envisioned as a technology to integrate the best of Wireless Sensor Networks and RFID systems, there is much promise for a global network of objects that are identifiable, track-able, and harmoniously informing. However, the realization of an IoT framework is hindered by many factors, the most pressing of which is attributed to the integration of these heterogeneous nodes and devices. A considerable subset of these nodes undergoes movement and dynamically enters and leaves the network backbone/topology. Routing packets and inter-nodal communication has received little attention; mainly due to the sheer reliance on the Internet as a backbone. However, spatially correlated entities in the IoT, and those which most often interact, would pose a significant overhead of communication if all intermediate packets need to be routed over distant backhauls. In remedy, we present a Pruned Adaptive IoT Routing (PAIR) protocol that selectively establishes routes of communication between IoT nodes. Since nodes in the IoT belong to different owners, we also introduce a pricing model to cater for the exchange of monetary costs by intermediate nodes to utilize their relaying resources. We also establish a cap on inter-nodal routing to dynamically utilize the Internet backbone if the source to destination distance surpasses a preset (case optimized) threshold. The PAIR routing protocol is elaborated upon, building upon the detailed system model presented in this paper. We finally present a use case to demonstrate the utility and practicality of PAIR in the heterogeneous IoT as it scales.

Chapter 13 - WoX: Model-Driven Development of Web of Things Applications

Blockchain (BC) in the Internet of Things (IoT) is a novel technology that acts with decentralized, distributed, public and real-time ledger to store transactions among IoT nodes. A blockchain is a series of blocks, each block is linked to its previous blocks. Every block has the cryptographic hash code, previous block hash, and its data. The transactions in BC are the basic units that are used to transfer data between IoT nodes. The IoT nodes are different kind of physical but smart devices with embedded sensors, actuators, programs and able to communicate with other IoT nodes. The role of BC in IoT is to provide a procedure to process secured records of data through IoT nodes. BC is a secured technology that can be used publicly and openly. IoT requires this kind of technology to allow secure communication among IoT nodes in heterogeneous environment. The transactions in BC could be traced and explored through anyone who are authenticated to communicate within the IoT. The BC in IoT may help to improve the communication security. In this paper, I explored this approach, its opportunities and challenges.

Random linear network coding with ladder-shaped global coding matrix for robust video transmission

The Internet of Things (IoT) is one of the fastest-growing technologies in recent years. However, many IoT service providers design their IoT solutions with non-interoperable hard-ware, scenario-specific features, and unique architectures that make these deployments fragmented rather than collaborative. Collaborative IoT (C-IoT) systems are considered the natural evolution of the traditional IoT. Sharing the infrastructure is one of the main concepts that C-IoT depends on to create a collaborative environment between different applications. With the current fragmented IoT, these applications cannot share their infrastructure and data due to the lack of standards to organize the C-IoT space. In this paper, we introduced Unified Interoperable Driver for IoT (UIDI) nodes. UIDI uses a novel programming methodology that enables node interpreters to provide general-purpose firmware for IoT nodes. UIDI allows the users to configure IoT nodes according to their usage, preferences, and needs through the cloud. We developed a proof-of-concept prototype to demonstrate the feasibility and usability of the proposed UIDI using NodeMCU and Arduino-Uno. The performance of UIDI outperforms Firmata by 27%. In addition to that, the UIDI platform is a standalone node that connects directly to the cloud, whereas the Firmata node requires a host to be accessible from the cloud.

The network coding capacity of a single multicast traffic is characterized by the min-cut/max-flow (mcMF) theorem, which can be achieved by random linear network coding (RLNC). Nonetheless, the graph-theoretic characterization for multiple unicast/multicast traffic remains an open problem. This paper proposes and studies a new class of intersession-network-coding schemes: RLNC with selective cancelling (SC), which inherits the complexity advantage of RLNC once the set of selective cancelling edges is decided. A graph-theoretic characterization is provided for the achievable rates of RLNC with SC for the general multiple multicast setting. The findings contain most existing achievability results as special cases, including the mcMF theorem of the single multicast traffic and the existing characterization of pairwise intersession network coding. One prominent feature of the proposed approach is its focus on the achievability analysis with arbitrary network topology, arbitrary inter-session packet-mixing capability, and arbitrary traffic demands, which distinguishes the results from the special case analysis, capacity outer bound constructions, and the pattern-based (butterfly-based) superposition arguments.

Network error localizations uses end-to-end observations to localize random or adversarial glitches. For error localization under random linear network codes (RLNCs) the schemes proposed in previous literatures require the priori knowledge of the network topology. Moreover, adversarial error localization is proved computationally intractable under RLNCs. The goal of current paper is designing new network coding schemes to improve the error localization performance of RLNCs while maintaining the key advantages of RLNCs. To be concrete, we introduce Network Reed-Solomon codes (NRSCs), which have the following features: 1. NRSCs are low-complexity distributed linear network codes. 2. NRSCs achieve the network multicast capacity with high probability. 3. In adversarially faulty networks NRSCs enable the receiver to locate a maximum number of adversarial errors in a computationally efficient manner. Moreover, the error localization schemes under NRSCs do not need the priori knowledge of the network topology and thus are robust against dynamic network updating.

Passive network tomography uses end-to-end observations of network communication to characterize the network, for instance to estimate the network topology and to localize random or adversarial glitches. Under the setting of linear network coding this work provides a comprehensive study of passive network tomography in the presence of network (random or adversarial) glitches. To be concrete, this work is developed along two directions: 1. Tomographic upper and lower bounds (i.e., the most adverse conditions in each problem setting under which network tomography is possible, and corresponding schemes (computationally efficient, if possible) that achieve this performance) are presented for random linear network coding (RLNC). We consider RLNC designed with common randomness, i.e., the receiver knows the random code-books all nodes. (To justify this, we show an upper bound for the problem of topology estimation in networks using RLNC without common randomness.) In this setting we present the first set of algorithms that characterize the network topology exactly. Our algorithm for topology estimation with random network errors has time complexity that is polynomial in network parameters. For the problem of network error localization given the topology information, we present the first computationally tractable algorithm to localize random errors, and prove it is computationally intractable to localize adversarial errors. 2. New network coding schemes are designed that improve the tomographic performance of RLNC while maintaining the desirable low-complexity, throughput-optimal, distributed linear network coding properties of RLNC. In particular, we design network codes based on Reed-Solomon codes so that a maximal number of adversarial errors can be localized in a computationally efficient manner even without the information of network topology.

In a network application, channel coding alone is not sufficient to reliably transmit a message of finite length K from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure correcting schemes on a higher layer, such as a time-division multiple access (TDMA) system paired with automatic repeat request (ARQ) or random linear network coding (RLNC). We consider binary channel coding on a binary symmetric channel (BSC) and q-ary RLNC for erasure correction in a star network, where Y sources send messages to each other with the help of a central relay. In this scenario RLNC has been shown to have a throughput advantage over TDMA schemes as K→∞ and q→∞. In this paper we focus on finite block lengths and compare the expected throughputs of RLNC and TDMA. For a total message length of K bits, which can be subdivided into blocks of smaller size prior to channel coding, we obtain the channel code rate and the number of blocks that maximize the expected throughput of both RLNC and TDMA, and we find that TDMA is more throughput-efficient for small message lengths K and small q.

Secure three party node authentication and key establishment scheme for data exchange in the Internet of Things (IoT) applications enables two resourceconstrained nodes to establish a secure end-to-end communication channel with the help of a data server. Since node in IoT have constraints on resources such as power, memory space and computation ability. Thus may existing key establishment schemes are unable to run IoT applications and many researchers are already working on how to integrate new techniques and efficient approaches into the IoT environment. Recently, Nasiraee and Mohasefi proposed a highly efficient and novel key establishment scheme for Internet-Enable Sensor Networks (IESN) which was adapted to the IoT notion. Nasiraee-Mohasefi’s scheme presented a novel approach where a new node that joins the IoT network is responsible to aggregate interested neighbors’ information and to send a request to the trusted server to get required pairwise session keys. However, we found that Nasiraee- Mohasefi’s scheme has some security and efficiency shortcomings and this paper focuses on preventing the above-mentioned weaknesses of Nasiraee-Mohasefi’s scheme by proposing an improved three party node authentication and key establishment scheme. The results of security proof by BAN logic analysis confirms the proposed scheme provides a considerable gains in power saving while its security properties are ensured for the Internet of Things environment.

Aims: Internet of Things (IoT) is the evolution of the Internet designed to sense, collect, analyze and distribute the data via IoT devices that form its core component. An important aspect of pervasive IoT applications is its resource-constrained devices. Most of the real-time Edge-IoT applications generate a huge amount of data, which add to the resource consumption in these devices. To save resources in such applications, efficient node deployment and data aggregation techniques can be used. This paper presents the design and modeling of node deployment and data aggregation in Edge-IoT applications along with the homogeneous and heterogeneous network scenarios for smart agriculture. Objectives: To save resources in such applications, efficient node deployment and data aggregation techniques can be used. This paper presents the design and modeling of node deployment and data aggregation in Edge-IoT applications along with the homogeneous and heterogeneous network scenarios for smart agriculture. Methods: For heterogeneous scenarios, we propose a clustering approach, Superior Aggregator Resource Efficient Clustering (SAREC), to address the resource constraints in pervasive Edge-IoT applications. The comparison of homogeneous and heterogeneous networks is based on LEACH and SAREC protocols, respectively. Results: The results show that SAREC is 25% more efficient in energy utilization and network lifetime than LEACH. The results also show that SAREC is more efficient in terms of storage and processing time as compared to LEACH. Conclusion: Node deployment is an important aspect in determining the architecture, which plays an important role in resource management in pervasive applications of IoT. The IoT nodes are distributed in a selected geographical location and the topology of the network is pre-decided to form an Edge-IoT network. In such an environment, the nodes are deployed to sense, aggregate and analyze the data. This paper presents a pervasive Edge-IoT network along with the mathematical modeling consisting of deployment and aggregation models. An Edge-IoT network for smart agriculture has been deployed and analysis of resource utilization has been performed in homogeneous and heterogeneous scenarios of the network. The resource limitations in pervasive IoT network motivated us to develop a SAREC approach for such Edge-IoT applications that optimizes the use of resources. The comparison of the proposed SAREC protocol is made with respect to LEACH protocol on the basis of energy, network lifetime, number of alive nodes, storage and processing time. The results show that SAREC protocol is 25% more efficient in energy utilization and network lifetime than LEACH. It is also evident from the results that the SAREC is more efficient in terms of storage and processing time as compared to LEACH.

The requirements of low latency, low cost, less energy consumption, high flexibility, high network capacity, and high data safety are crucial challenges for future Internet of Things (IoT) wireless networks. Motivated by these challenges, this study deals with a novel design of green-cooperative IoT network, which employed coupled relays consisting of one IoT relay selected for forwarding signals to multiple IoT devices while another IoT relay transmitted jamming signals to an eavesdropper. For flexibility, all IoT nodes were powered by solar energy enough to sustain themselves, in order to consume less energy. To reach low latency, the study adopted the emerging non-orthogonal multiple access technique to serve multiple IoT devices simultaneously. Furthermore, the study adopted the simultaneous wireless information and power transfer technique which transmits wireless data for information processing and energy for energy harvesting. The study sketched a novel transmission block time period framework which plotted how a signal could travel via an individual IoT model. Maximizing the achievable bit-rate of IoT devices was considered to improve network capacity and data safety as well. Aiming at enhancing secrecy performance, a rest IoT relay played a role as a friendly jammer to transmit a jamming signal to an eavesdropper using energy harvested from the power splitting protocol. The results achieved in this study showed that the proposed model satisfied the requirements of future green IoT wireless networks. Derivatives leading to closed-form expressions are presented and verified by simulation results. The investigated results demonstrated that a friendly jammer based on radio frequency and energy harvesting strongly forces the intercept probability performance of the eavesdropper towards one, while outage probability performance of IoT devices towards zero showed that the signal to noise ratio tends to infinity.