Search

This research introduces a hybrid approach combining bio- and nature-inspired metaheuristic algorithms to enhance scheduling efficiency and minimize energy consumption in Underwater Acoustic Sensor Networks (UASNs). Five hybridized algorithms are designed to efficiently schedule nodes, reducing energy costs compared to existing methods, and addressing the challenge of unscheduled nodes within the communication network. The hybridization techniques such as Elephant Herding Optimization (EHO) with Genetic Algorithm (GA), Firefly Algorithm (FA), Levy Firefly Algorithm (LFA), Bacterial Foraging Algorithm (BFA), and Binary Particle Swarm Optimization (BPSO) are used for optimization. To implement these optimization techniques, the Scheduled Routing Algorithm for Localization (SRAL) is introduced, aiming to enhance node scheduling and localization. This framework is crucial for improving data delivery, optimizing Route REQuest (RREQ) and Routing Overhead (RO), while minimizing Average End-to-End (AE2E) delays and localization errors. The challenges of node localization, RREQ reconstruction at the beacon level, and increased RO, along with End-to-End delays and unreliable data forwarding, have a significant impact on overall communication in underwater environments. The proposed framework, along with the hybridized metaheuristic algorithms, show great potential in improving node localization, optimizing scheduling, reducing energy costs, and enhancing reliable data delivery in the Internet of Underwater Things (IoUT)-based network.

Network operations involve several decision-making tasks. Some of these tasks are related to operators, such as extending the footprint or upgrading the network capacity. Other decision tasks are related to network functions, such as traffic classifications, scheduling, capacity, coverage trade-offs, and policy enforcement. These decisions are often decentralized, and each network node makes its own decisions based on the preconfigured rules or policies. To ensure effectiveness, it is essential that planning and functional decisions are in harmony. However, human intervention-based decisions are subject to high costs, delays, and mistakes. On the other hand, machine learning has been used in different fields of life to automate decision processes intelligently. Similarly, future intelligent networks are also expected to see an intense use of machine learning and artificial intelligence techniques for functional and operational automation. This article investigates the current state-of-the-art methods for packet scheduling and related decision processes. Furthermore, it proposes a machine learning-based approach for packet scheduling for agile and cost-effective networks to address various issues and challenges. The analysis of the experimental results shows that the proposed deep learning-based approach can successfully address the challenges without compromising the network performance. For example, it has been seen that with mean absolute error from 6.38 to 8.41 using the proposed deep learning model, the packet scheduling can maintain 99.95% throughput, 99.97% delay, and 99.94% jitter, which are much better as compared to the statically configured traffic profiles.

With continuously rising trends in applications of information and communication technologies in diverse sectors of life, the networks are challenged to meet the stringent performance requirements. Increasing the bandwidth is one of the most common solutions to ensure that suitable resources are available to meet performance objectives such as sustained high data rates, minimal delays, and restricted delay variations. Guaranteed throughput, minimal latency, and the lowest probability of loss of the packets can ensure the quality of services over the networks. However, the traffic volumes that networks need to handle are not fixed and it changes with time, origin, and other factors. The traffic distributions generally follow some peak intervals and most of the time traffic remains on moderate levels. The network capacity determined by peak interval demands often requires higher capacities in comparison to the capacities required during the moderate intervals. Such an approach increases the cost of the network infrastructure and results in underutilized networks in moderate intervals. Suitable methods that can increase the network utilization in peak and moderate intervals can help the operators to contain the cost of network intrastate. This article proposes a novel technique to improve the network utilization and quality of services over networks by exploiting the packet scheduling-based erlang distribution of different serving areas. The experimental results show that significant improvement can be achieved in congested networks during the peak intervals with the proposed approach both in terms of utilization and quality of service in comparison to the traditional approaches of packet scheduling in the networks. Extensive experiments have been conducted to study the effects of the erlang-based packet scheduling in terms of packet-loss, end-to-end latency, delay variance and network utilization.

The cloud is a shared pool of systems that provides multiple resources through the Internet, users can access a lot of computing power using their computer. However, with the strong migration rate of multiple applications towards the cloud, more disks and servers are required to store huge data. Most of the cloud storage service providers are replicating full copies of data over multiple data centers to ensure data availability. Further, the replication is not only a costly process but also a wastage of energy resources. Furthermore, erasure codes reduce the storage cost by splitting data in n chunks and storing these chunks into n + k different data centers, to tolerate k failures. Moreover, it also needs extra computation cost to regenerate the data object. Cache-A Replica On Modification (CAROM) is a hybrid file system that gets combined benefits from both the replication and erasure codes to reduce access latency and bandwidth consumption. However, in the literature, no formal analysis of CAROM is available which can validate its performance. To address this issue, this research firstly presents a colored Petri net based formal model of CAROM. The research proceeds by presenting a formal analysis and simulation to validate the performance of the proposed system. This paper contributes towards the utilization of resources in clouds by presenting a comprehensive formal analysis of CAROM.

Internet of things grew swiftly and many services, software, sensors-embedded electronic devices and related protocols were developed and still in progress with full swing. Internet of things enabling physically existing things to see, hear, think and perform a notable task by allowing them to talk to each other and share useful information while making decision and caring-on/out their important tasks. Internet of things is greatly promoted by wireless sensor network as it becomes a perpetual layer for it. Wireless sensor network works as a base-stone for most of the Internet of things applications. There are severe general and specific threats and technical challenges to Internet of things–based sensor networks which must overcome to ensure adaptation and diffusion of it. Most of the limitations of wireless sensor networks are due to its resource constraint objects nature. The specified open research challenges in Internet of things–based sensor network are power consumption, network lifespan, network throughput, routing and network security. To overcome aforementioned problems, this work aimed to prolong network lifetime, improve throughput, decrease packet latency/packet loss and further improvise in encountering malicious nodes. To further tune the network lifetime in terms of energy, wireless harvesting energy is suggested in proposed three-layer cluster-based wireless sensor network routing protocol. The proposed mechanism is a three-tier clustering technique with implanted security mechanism to encounter malicious activities of sensor nodes and to slant them into blacklist. It is a centred-based clustering protocol, where selection of cluster head and grid head is carried out by sink node based on the value of its cost function. Moreover, hardware-based link quality estimators are used to check link effectiveness and to further improve routing efficiency. At the end, excessive experiments have been carried out to check efficacy of the proposed protocol. It outperforms most of its counterpart protocols such as fuzzy logic–based unequal clustering and ant colony optimization–based routing hybrid, Artificial Bee Colony-SD, enhanced three-layer hybrid clustering mechanism and energy aware multi-hop routing in terms of network lifetime, network throughput, average energy consumption and packet latency.

Software requirement artifacts such as manuals request for proposals, and software requirements specification (SRS) are commonly focused on functional requirements. In most SRS files, nonfunctional requirements do not formally encoded or encoded as a whole, not for an individual design problem. Moreover, these nonfunctional requirements are intermingled with functional requirements. Therefore, these nonfunctional requirements need special attention to understand for successful project development. These nonfunctional requirements have an impact on each other and optimal tradeoff is required for balanced nonfunctional requirements set. NFRs have a negative and positive tradeoff with each other such as increase confidentiality, decrease the availability, and enhance authenticity. So, an optimum tradeoff among these design problem within a module is required to have better design decisions. Instead of considering all nonfunctional requirements, the NFRs that have mutual tradeoff is considered. In this paper, we devised a novel document annotation scheme for SRS and extracted nonfunctional requirements from these annotated artifacts. In the next step, we classified NFRs into two classes security triad and performance triad, and the cost is assumed constant for each NFR. From the design problem, the tradeoff ratio is calculated among NFRs associated with it. Then, the production possibility graph is plotted to estimate the optimum tradeoff ratio within the module. For estimation economic optimum from a set of NFR, iso-cost graphs by assuming the constant cost. Some hypothetical variations in cost are also examined using 3D iso-cost graph. The reason to measure these tradeoff is to make design decision more empirical and helpful for the selection of design patterns, especially secure design patterns.

Today’s power systems are subject to the high penetration of dynamic load. Volatility and intermittency of the dynamic load demand need to be compensated through optimization and scheduling without compromising user comfort. This paper proposes a multi-agent-based multi-layered hierarchical control system for residential load management under real-time pricing environment. The major objectives are to reduce peak load demand, electricity cost, and user discomfort. In doing so, different types of agents, i.e., price agent $p_{a}$ , sensor agent $s_{a}$ , decision agent $d_{a}$ , load agent $l_{a}$ , and action agent $a_{a}$ , are developed to control residential loads, such as normal load (nl) and heavy load (hl). To handle price uncertainty, dynamically, optimal stopping rule (OSR) theory has been used. Two variants of OSR are proposed: 1) priority inversion logic-based OSR to subsidize the responsive consumers and 2) maximum energy consumption limit $Q$ -based OSR-Q to maximize the profit of energy retailers. Finally, the proposed mechanism is validated on a set of loads to show the applicability and proficiency under a dynamic environment.

Trends in networking are shifting from distributed to logically centralized networks. Software defined networking (SDN) is the key technology behind this shift. This new paradigm not only proves the ease of network management in wired networks but also results into graceful evolution of networking protocols. Moreover, wireless distributed networks (WDNs) and software defined radios (SDRs) are also shifting towards the centralized approach. However, due to distributed control nature of WDNs, already prevailing routing algorithms cannot cope the design principle of centralized routing algorithms. Hence, a new routing algorithm that incorporates SDN in WDNs is required. In this paper, we propose a logically centralized approach for WDNs called centralized approach to mobile ad hoc network (CATMAN). It is a self-healing and hybrid routing protocol. It combines distributed and logically centralized network control along with the flavors of reactive, proactive, and opportunistic routing protocols. CATMAN is designed to automatically switch between logically centralized routing protocol and distributed routing protocol based on the types of available network nodes. The protocol significantly reduces control overhead and hence improves bandwidth utilization. While route computations, this protocol deliberately avoids the nodes with weaker batteries, optimizing the effective life of whole network. The simulation results showed that the CATMAN protocol outperform better approach to mobile ad hoc network (BATMAN) protocol by signaling overhead reduction up to 570%.

A topological index is a quantity that is somehow calculated from a graph (molecular structure), which reflects relevant structural features of the underlying molecule. It is, in fact, a numerical value associated with the chemical constitution for the correlation of chemical structures with various physical properties, chemical reactivity, or biological activity. A large number of properties like physicochemical properties, thermodynamic properties, chemical activity, and biological activity can be determined with the help of various topological indices such as atom-bond connectivity indices, Randić index, and geometric arithmetic indices. In this paper, we investigate topological properties of two graphs (commuting and noncommuting) associated with an algebraic structure by determining their Randić index, geometric arithmetic indices, atomic bond connectivity indices, harmonic index, Wiener index, reciprocal complementary Wiener index, Schultz molecular topological index, and Harary index.