SSFSCE: Design of a Sleep Scheduling based Fan Shaped Clustering Model to enhance working Energy Efficiency of WSN

To enhance energy level in WSN is a research requirement, which assists in improving their lifetime over a series of communications. To achieve this target, a various variety of clustering & sleep scheduling models are discussed by researchers. Most of these models deploy static clustering & sleep scheduling operations, which limits their applicability & scalability levels. Moreover, dynamic clustering & scheduling models are highly complex, which reduces temporal QoS performance under real-time use cases. In order to reduce the probability of these issues, this text discusses design of the proposed Sleep Scheduling based Fan Shaped Clustering Model to enhance working Energy Efficiency of WSN. The proposed model initially deploys a Grey Wolf Optimization (GWO) Method for dynamic sleep scheduling via temporal performance analysis. The GWO Method models a fitness function that combines temporal usage levels, temporal Quality of Service (QoS), and temporal energy levels. Based on this modelling process, nodes were categorized into wake & sleep nodes, which were further clustered via destination-aware Fan Shaped Clustering (FSC), that assisted in improving QoS performance under multiple scenarios. The FSC Model was combined with a QoS-aware routing model, that assisted in selection of routing paths that can achieve low delay, high throughput, and high packet delivery with higher energy efficiency levels. Efficiency of the model was tested on node & network conditions, and its QoS performance was checked in terms of communication delay, consumption of energy, level of throughput, and Packet Delivery Ratio (PDR) levels. On the basis of these comparative evaluations, it is observed that the new proposed model is able to enhance end-to-end delay by 8.5%, reduce level of energy by 15.5%, while increasing throughput by 8.3%, and PDR by 1.5%, thus making it useful for a different real-time conditions

Network Path Optimization Strategy using Collaborative Cache for Delay Tolerant Networks

The data transmissions over Delay Tolerant Networks (DTN) and Social-based Opportunistic networks have increased in the last few years due to a higher demand for remote transmissions. The wide applications of DTN have significantly motivated the researchers to focus on finding optimized routing strategies by optimizing various parameters such as energy, cost and congestion. Nonetheless, these parallel research outcomes have reported few further bottlenecks to improve the strategies. Henceforth, this work proposes a novel approach to optimize the routing paths using the cache collaboration method. This proposed method identifies the data-sharing strategies and subsequently identifies the sub-set of the paths between the source and destinations. Further optimizes the path using standard measures such as cost, transmission speed, and the network traffic conditions; lastly Data-Centric and Cost Optimized Routing Path is Identification. This work results in a nearly 20% reduction in the distance between the nodes, a 15% reduction of time in path identification and a nearly 50% reduction in cache allocation demand over multiple iterations compared to the existing models

Machine Learning in Wireless Sensor Networks for Smart Cities:A Survey

Artificial intelligence (AI) and machine learning (ML) techniques have huge potential to efficiently manage the automated operation of the internet of things (IoT) nodes deployed in smart cities. In smart cities, the major IoT applications are smart traffic monitoring, smart waste management, smart buildings and patient healthcare monitoring. The small size IoT nodes based on low power Bluetooth (IEEE 802.15.1) standard and wireless sensor networks (WSN) (IEEE 802.15.4) standard are generally used for transmission of data to a remote location using gateways. The WSN based IoT (WSN-IoT) design problems include network coverage and connectivity issues, energy consumption, bandwidth requirement, network lifetime maximization, communication protocols and state of the art infrastructure. In this paper, the authors propose machine learning methods as an optimization tool for regular WSN-IoT nodes deployed in smart city applications. As per the author’s knowledge, this is the first in-depth literature survey of all ML techniques in the field of low power consumption WSN-IoT for smart cities. The results of this unique survey article show that the supervised learning algorithms have been most widely used (61%) as compared to reinforcement learning (27%) and unsupervised learning (12%) for smart city applications

Resource Management in Multi-Access Edge Computing (MEC)

This PhD thesis investigates the effective ways of managing the resources of a Multi-Access Edge Computing Platform (MEC) in 5th Generation Mobile Communication (5G) networks. The main characteristics of MEC include distributed nature, proximity to users, and high availability. Based on these key features, solutions have been proposed for effective resource management. In this research, two aspects of resource management in MEC have been addressed. They are the computational resource and the caching resource which corresponds to the services provided by the MEC. MEC is a new 5G enabling technology proposed to reduce latency by bringing cloud computing capability closer to end-user Internet of Things (IoT) and mobile devices. MEC would support latency-critical user applications such as driverless cars and e-health. These applications will depend on resources and services provided by the MEC. However, MEC has limited computational and storage resources compared to the cloud. Therefore, it is important to ensure a reliable MEC network communication during resource provisioning by eradicating the chances of deadlock. Deadlock may occur due to a huge number of devices contending for a limited amount of resources if adequate measures are not put in place. It is crucial to eradicate deadlock while scheduling and provisioning resources on MEC to achieve a highly reliable and readily available system to support latency-critical applications. In this research, a deadlock avoidance resource provisioning algorithm has been proposed for industrial IoT devices using MEC platforms to ensure higher reliability of network interactions. The proposed scheme incorporates Banker’s resource-request algorithm using Software Defined Networking (SDN) to reduce communication overhead. Simulation and experimental results have shown that system deadlock can be prevented by applying the proposed algorithm which ultimately leads to a more reliable network interaction between mobile stations and MEC platforms. Additionally, this research explores the use of MEC as a caching platform as it is proclaimed as a key technology for reducing service processing delays in 5G networks. Caching on MEC decreases service latency and improve data content access by allowing direct content delivery through the edge without fetching data from the remote server. Caching on MEC is also deemed as an effective approach that guarantees more reachability due to proximity to endusers. In this regard, a novel hybrid content caching algorithm has been proposed for MEC platforms to increase their caching efficiency. The proposed algorithm is a unification of a modified Belady’s algorithm and a distributed cooperative caching algorithm to improve data access while reducing latency. A polynomial fit algorithm with Lagrange interpolation is employed to predict future request references for Belady’s algorithm. Experimental results show that the proposed algorithm obtains 4% more cache hits due to its selective caching approach when compared with case study algorithms. Results also show that the use of a cooperative algorithm can improve the total cache hits up to 80%. Furthermore, this thesis has also explored another predictive caching scheme to further improve caching efficiency. The motivation was to investigate another predictive caching approach as an improvement to the formal. A Predictive Collaborative Replacement (PCR) caching framework has been proposed as a result which consists of three schemes. Each of the schemes addresses a particular problem. The proactive predictive scheme has been proposed to address the problem of continuous change in cache popularity trends. The collaborative scheme addresses the problem of cache redundancy in the collaborative space. Finally, the replacement scheme is a solution to evict cold cache blocks and increase hit ratio. Simulation experiment has shown that the replacement scheme achieves 3% more cache hits than existing replacement algorithms such as Least Recently Used, Multi Queue and Frequency-based replacement. PCR algorithm has been tested using a real dataset (MovieLens20M dataset) and compared with an existing contemporary predictive algorithm. Results show that PCR performs better with a 25% increase in hit ratio and a 10% CPU utilization overhead