Realizing the full potential of wireless sensor networks (WSNs) highlights many design issues, particularly the trade-offs concerning multiple conflicting improvements such as maximizing the route overlapping for efficient data aggregation and minimizing the total link cost. While the issues of data aggregation routing protocols and link cost function in a WSNs have been comprehensively considered in the literature, a trade-off improvement between these two has not yet been addressed. In this paper, a comprehensive weight for trade-off between different objectives has been employed, the so-called weighted data aggregation routing strategy (WDARS) which aims to maximize the overlap routes for efficient data aggregation and link cost issues in cluster-based WSNs simultaneously. The proposed methodology is evaluated for energy consumption, network lifetime, throughput, and packet delivery ratio and compared with the InFRA and DRINA. These protocols are cluster-based routing protocols which only aim to maximize the overlap routes for efficient data aggregation. Analysis and simulation results revealed that the WDARS delivered a longer network lifetime with more proficient and reliable performance over other methods.
In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f
... Show MoreRouting is the process of delivering a packet from a source to a destination in the network using a routing algorithm that tries to create an efficient path. The path should be created with minimum overhead and bandwidth consumption. In literature, routing protocols in VANET were categorized in many ways, according to different aspects. In the present study, we prefer the classification based on the number of hops to reach the destination node. In literature, these are single-hop and multi-hops protocols. We first discuss the two types and then compare the MDDV (multi-hops protocol) with VADD (single-hop protocol). The comparison is theoretically and experimentally implemented by providing a network environment consisting of SUMO, VIENS and
... Show MoreTransportation networks impact millions of people daily. Their efficiency immediately affects travel time, safety, and environmental sustainability. Unfortunately, various issues hinder the expected performance and efficiency of these networks. Traffic congestion is an up-to-date issue in the urban environment. Fuel consumption is high because travel time has increased, which has a passive environmental impact. Extensive research has been conducted to progress the intelligent transportation systems installed on communication networks and information to treat this congestion. However, there is a significant amount of affront residue in combining real-time data, estimation analytics, and 5G abilities effectively. This paper offers a n
... Show MoreRouting protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and Quality of Service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile ad hoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyz
... Show MoreThe prediction process of time series for some time-related phenomena, in particular, the autoregressive integrated moving average(ARIMA) models is one of the important topics in the theory of time series analysis in the applied statistics. Perhaps its importance lies in the basic stages in analyzing of the structure or modeling and the conditions that must be provided in the stochastic process. This paper deals with two methods of predicting the first was a special case of autoregressive integrated moving average which is ARIMA (0,1,1) if the value of the parameter equal to zero, then it is called Random Walk model, the second was the exponential weighted moving average (EWMA). It was implemented in the data of the monthly traff
... Show MoreThe aggregation capacity of human reb blood cells lies between that of the non- aggregated arythrocyte and the remarkably full sedimentation. As the ability to aggregate is atributed to many factors such as the availability of macromolecules and plasma lipids, the role of plasm lipid profile on RBC aggregation and sedimentation changes in normal and diabetic patients is studied.Also serum lipid profile measurement (Total cholesterol, Triglyceride, HDL, LDL, VLDL) in normal and diabetic subjects were made. The principle of measurement includes detecting the transmitted laser light through a suspension of 10% diluted red blood cells in plasma. In all diabetics, the raulux formation and sedimentation rate is enhanced.
Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show MoreTo evaluate the cost-effectiveness of emicizumab compared to recombinant activated factor VII (rFVIIa) in Iraqi patients with hemophilia A and inhibitors.
A retrospective cost-effectiveness analysis was conducted on 46 male patients with hemophilia A and inhibitors treated at a public children’s hospital in Baghdad. Data collection was conducted between November 2024 and March 2025. Clinical and economic data were retrospectively collected for a 12-m