One of the crucial problems in Industry 4.0 is how to strengthen the performance of mobile communication within mobile ad-hoc networks (MANETs) and mobile computational grids (MCGs). In communication, Industry 4.0 needs dynamic network connectivity with higher amounts of speed and bandwidth. In order to support multiple users for video calling or conferencing with high-speed transmission rates and low packet loss, 4G technology was introduced by the 3G Partnership Program (3GPP). 4G LTE is a type of 4G technology in which LTE stands for Long Term Evolution, followed to achieve 4G speeds. 4G LTE supports multiple users for downlink with higher-order modulation up to 64 quadrature amplitude modulation (QAM). With wide coverage, high reliability and large capacity, LTE networks are widely used in Industry 4.0. However, there are many kinds of equipment with different quality of service (QoS) requirements. In the existing LTE scheduling methods, the scheduler in frequency domain packet scheduling exploits the spatial, frequency, and multi-user diversity to achieve larger MIMO for the required QoS level. On the contrary, time-frequency LTE scheduling pays attention to temporal and utility fairness. It is desirable to have a new solution that combines both the time and frequency domains for real-time applications with fairness among users. In this paper, we propose a channel-aware Integrated Time and Frequency-based Downlink LTE Scheduling (ITFDS) algorithm, which is suitable for both real-time and non-real-time applications. Firstly, it calculates the channel capacity and quality using the channel quality indicator (CQI). Additionally, data broadcasting is maintained by using the dynamic class-based establishment (DCE). In the time domain, we calculate the queue length before transmitting the next packets. In the frequency domain, we use the largest weight delay first (LWDF) scheduling algorithm to allocate resources to all users. All the allocations would be taken placed in the same transmission time interval (TTI). The new method is compared against the largest weighted delay first (LWDF), proportional fair (PF), maximum throughput (MT), and exponential/proportional fair (EXP/PF) methods. Experimental results show that the performance improves by around 12% compared with those other algorithms.
In recent year, the number of cell phones in the society has increased drastically and they are getting popular due to their computational ability and adaptability. Resource provisioning is an important, but still remains NP hard problem in mobile computational grid. Once the jobs are assigned to the mobile computational grid, the main challenge is how to identify the correct resource according to the job’s requirement and use them to execute the sub-jobs. The heuristic methods such as Min-Min, Max-Min and HEFT can be used to select appropriate resources from Mobile computational grid that is assigned for job execution. Since the computational nodes are static and mobile in nature, the performance of such heuristics is not as expected. Such heuristics suffers from the low throughput and low speedup. The process of localization is used in wireless sensor network with good results. The proposed model uses heuristics and localization process for optimizing the quality of service parameter localization, normalized speedup and throughput in MCG with the concept of grid nodes available in mobile computational grid. The observation shows significant improvement in quality of service parameter localization, normalized speedup and throughput in MCG. The proposed model HGLA and MIN-MIN, MAX-MIN, and HEFT are compared with respect to localization, speedup and throughput. The results reveal that proposed model shows better performance over MIN-MIN, MAX-MIN and HEFT.
11 August 2021 in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Data acquisition problem on large distributed wireless sensor networks (WSNs) is considered as a challenge in the growth of Internet of Things (IoT). Recently, the combination of compressive sensing (CS) and routing techniques has attracted much attention of researchers. An open question of this combination is how to integrate these techniques effectively for specific tasks. On the other hand, CS data reconstruction process is considered as one of the CS challenges because it requires to recover N data from only M measurement where M< <N. Through this paper, we propose a new scheme for data gathering in IoT based heterogeneous WSN that includes a new effective Deterministic Clustering using CS technique (DCCS) to handle the data acquisition problem. DCCS reduces the total overhead computational cost needed to self-organize WSN using a simple approach and then uses CS at each sensor node to decrease the overall energy consumption and increase the network lifetime. The proposed scheme includes also an effective CS reconstruction algorithm called Random Selection Matching Pursuit (RSMP) to improve the recovery process at the base station (BS). RSMP adds a random selection process during the forward step to give the opportunity for more columns to be selected as an estimated solution in each iteration. The simulation results show that the proposed scheme succeeds to minimize the overall network power consumption and prolong the network lifetime beside provide better performance in CS data reconstruction.