Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject area is the optimal self-organized service placement. In this paper a heuristic-based algorithm for service placement in future networks was presented. This algorithm achieves the ideal placement of services replicas by monitoring the load within the server and its neighborhood, choosing the node that contributes with the highest received load, and finally replicating or migrating the service to it based on specific criteria, so that the distance of requests coming from clients becomes as small as possible because of placing services within nearby locations. It was proved that our proposed algorithm achieves an improved performance by meeting the services within a shorter time, a smaller bandwidth, and thus a lower communication cost. It was compared with the traditional client-server approach and the random placement algorithm. Experimental results showed that the heuristic algorithm outperforms other approaches and meets the optimal performance with different network sizes and varying load scenarios.
Recently, the increasing demand to transfer data through the Internet has pushed the Internet infrastructure to the nal edge of the ability of these networks. This high demand causes a deciency of rapid response to emergencies and disasters to control or reduce the devastating effects of these disasters. As one of the main cornerstones to address the data trafc forwarding issue, the Internet networks need to impose the highest priority on the special networks: Security, Health, and Emergency (SHE) data trafc. These networks work in closed and private domains to serve a group of users for specic tasks. Our novel proposed network ow priority management based on ML and SDN fullls high control to give the required ow priority to SHE dat
... Show MoreThe objective of this research is employ the special cases of function trapezoid in the composition of fuzzy sets to make decision within the framework of the theory of games traditional to determine the best strategy for the mobile phone networks in the province of Baghdad and Basra, has been the adoption of different periods of the functions belonging to see the change happening in the matrix matches and the impact that the strategies and decision-making available to each player and the impact on societ
... Show MoreLet/. It :0 ---0 G be any two self maps of a compact connected oriented Lie group G. In this paper, for each positive integer k , we associate an integer with fk,hi . We relate this number with Lefschetz coincidence number. We deduce that for any two differentiable maps f, there exists a positive integer k such that k 5.2+1 , and there is a point x C G such that ft (x) = (x) , where A is the rank of G . Introduction Let G be an n-dimensional com -pact connected Lie group with multip-lication p ( .e 44:0 xG--+G such that p ( x , y) = x.y ) and unit e . Let [G, G] be the set of homotopy classes of maps G G . Given two maps f , f G ---• Jollowing [3], we write f. f 'to denote the map G-.Gdefined by 01.11® =A/WO= fiat® ,sea Given a point g
... Show MoreThe current study presents the simulative study and evaluation of MANET mobility models over UDP traffic pattern to determine the effects of this traffic pattern on mobility models in MANET which is implemented in NS-2.35 according to various performance metri (Throughput, AED (Average End-2-end Delay), drop packets, NRL (Normalize Routing Load) and PDF (Packet Delivery Fraction)) with various parameters such as different velocities, different environment areas, different number of nodes, different traffic rates, different traffic sources, different pause times and different simulation times . A routing protocol.…was exploited AODV(Adhoc On demand Distance Vector) and RWP (Random Waypoint), GMM (Gauss Markov Model), RPGM (Refere
... Show MoreThe rapid advancements in wireless technology and digital electronics have led to the widespread adoption of compact, intelligent devices in various aspects of daily life. These advanced systems possess the capability to sense environmental changes, process data, and communicate seamlessly within interconnected networks. Typically, such devices integrate low-power radio transmitters and multiple smart sensors, hence enabling efficient functionality across wide ranges of applications. Alongside these technological developments, the concept of the IoT has emerged as a transformative paradigm, facilitating the interconnection of uniquely identifiable devices through internet-based networks. This paper aims to provide a comprehensive ex
... Show MoreReliable data transfer and energy efficiency are the essential considerations for network performance in resource-constrained underwater environments. One of the efficient approaches for data routing in underwater wireless sensor networks (UWSNs) is clustering, in which the data packets are transferred from sensor nodes to the cluster head (CH). Data packets are then forwarded to a sink node in a single or multiple hops manners, which can possibly increase energy depletion of the CH as compared to other nodes. While several mechanisms have been proposed for cluster formation and CH selection to ensure efficient delivery of data packets, less attention has been given to massive data co