Network-on-chip (NoC) is evolving as a better substitute for incorporating a large number of cores on a single system-on-chip (SoC). The dependency on multi-core systems to accomplish the high-performance constraints of composite embedded applications is on the rise. This leads to the realization of efficient mapping approaches for such complex applications. The significance of efficient application mapping approaches has increased ever since the embedded applications have become more complex and performance-oriented. This paper presents the detailed comparative analysis and categorization of application mapping approaches with current trends in NoC design implementation. These approaches target to improve the performance of the whole system by optimizing communication cost, energy, power consumption, and latency. Apart from the categorization of the discussed approaches, comparison of communication cost, power, energy, and latency of the NoC system carried out on real applications like VOPD and MPEG4. Moreover, the best technique identified in each category based on the evaluation of performance results.
12 April 2022 in IEEE Transactions on Computational Social Systems
Edge infrastructure and Industry 4.0 required services are offered by edge-servers (ESs) with different computation capabilities to run social application's workload based on a leased-price method. The usage of Social Internet of Things (SIoT) applications increases day-to-day, which makes social platforms very popular and simultaneously requires an effective computation system to achieve high service reliability. In this regard, offloading high required computational social service requests (SRs) in a time slot based on directed acyclic graph (DAG) is an NP-complete problem. Most state-of-art methods concentrate on the energy preservation of networks but neglect the resource sharing cost and dynamic subservice execution time (SET) during the computation and resource sharing. This article proposes a two-step deep reinforcement learning (DRL)-based service offloading (DSO) approach to diminish edge server costs through a DRL influenced resource and SET analysis (RSA) model. In the first level, the service and edge server cost is considered during service offloading. In the second level, the R-retaliation method evaluates resource factors to optimize resource sharing and SET fluctuations. The simulation results show that the proposed DSO approach achieves low execution costs by streamlining dynamic service completion and transmission time, server cost, and deadline violation rate attributes. Compared to the state-of-art approaches, our proposed method has achieved high resource usage with low energy consumption.
The next generation of the Internet of Things (IoT) networks is expected to handle a massive scale of sensor deployment with radically heterogeneous traffic applications, which leads to a congested network, calling for new mechanisms to improve network efficiency. Existing protocols are based on simple heuristics mechanisms, whereas the probability of collision is still one of the significant challenges of future IoT networks. The medium access control layer of IEEE 802.15.4 uses a distributed coordination function to determine the efficiency of accessing wireless channels in IoT networks. Similarly, the network layer uses a ranking mechanism to route the packets. The objective of this study was to intelligently utilize the cooperation of multiple communication layers in an IoT network. Recently, Q-learning (QL), a machine learning algorithm, has emerged to solve learning problems in energy and computational-constrained sensor devices. Therefore, we present a QL-based intelligent collision probability inference algorithm to optimize the performance of sensor nodes by utilizing channel collision probability and network layer ranking states with the help of an accumulated reward function. The simulation results showed that the proposed scheme achieved a higher packet reception ratio, produces significantly lower control overheads, and consumed less energy compared to current state-of-the-art mechanisms.
The healthcare Internet of Things (H-IoT) is an interconnection of devices capable of sensing and transmitting information that conveys the status of an individual’s health. The continuous monitoring of an individual’s health for disease diagnosis and early detection is an important application of H-IoT. Ambient assisted living (AAL) entails monitoring a patient’s health to ensure their well-being. However, ensuring a limit on transmission delays is an essential requirement of such monitoring systems. The uplink (UL) transmission during the orthogonal frequency division multiple access (OFDMA) in the wireless local area networks (WLANs) can incur a delay which may not be acceptable for delay-sensitive applications such as H-IoT due to their random nature. Therefore, we propose a UL OFDMA scheduler for the next Wireless Fidelity (Wi-Fi) standard, the IEEE 802.11be, that is compliant with the latency requirements for healthcare applications. The scheduler allocates the channel resources for UL transmission taking into consideration the traffic class or access category. The results demonstrate that the proposed scheduler can achieve the required latency for H-IoT applications. Additionally, the performance in terms of fairness and throughput is also superior to state-of-the-art schedulers.
Scalability is a significant issue in system-on-a-chip architectures because of the rapid increase in numerous on-chip resources. Moreover, hybrid processing elements demand diverse communication requirements, which system-on-a-chip architectures are unable to handle gracefully. Network-on-a-chip architectures have been proposed to address the scalability, contention, reusability, and congestion-related problems of current system-on-a-chip architectures. The reliability appears to be a challenging aspect of network-on-a-chip architectures because of the physical faults introduced in post-manufacturing processes. Therefore, to overcome such failures in network-on-a-chip architectures, fault-tolerant routing is critical. In this article, a network adaptive fault-tolerant routing algorithm is proposed, where the proposed algorithm enhances an efficient dynamic and adaptive routing algorithm. The proposed algorithm avoids livelocks because of its ability to select an alternate outport. It also manages to bypass congested regions of the network and balances the traffic load between outports that have an equal number of hop counts to its destination. Simulation results verified that in a fault-free scenario, the proposed solution outperformed a fault-tolerant XY by achieving a lower latency. At the same time, it attained a higher flit delivery ratio compared to the efficient dynamic and adaptive routing algorithm. Meanwhile, in the situation of a faulty network, the proposed algorithm could reach a higher flit delivery ratio of up to 18% while still consuming less power compared to the efficient dynamic and adaptive routing algorithm.
Future generation Internet of Things (IoT) communication infrastructure is expected to pave the path for innovative applications like smart cities, smart grids, smart industries, and smart healthcare. To support these diverse applications, the communication protocols are required to be adaptive and intelligent. At the network layer, an efficient and lightweight algorithm known as trickle-timer is designed to perform the route updates and it utilizes control messages to share the updated route information between IoT nodes. Trickle-timer tends to generate higher control overhead ratio and achieves lower reliability. Therefore, this article aims to propose an RL-based Intelligent Adaptive Trickle-Timer Algorithm (RIATA). The proposed algorithm performs three-fold optimization of the trickle-timer algorithm. Firstly, the RIATA assigns higher probability to control message transmission to nodes that have received an inconsistent control message in the past intervals. Secondly, the RIATA utilizes RL to learn the optimal policy to transmit or suppress a control message in the current network environment. Lastly, the RIATA selects an adaptive redundancy constant value to avoid unnecessary transmissions of control messages. Simulation results show that RIATA outperforms the other state-of-the-art mechanisms in terms of reducing control overhead ratio by an average of 21%, decreasing the average total power consumption by 10%, and increasing the packet delivery ratio by 4% on an average.