Transport layer is responsible for delivering data to the appropriate application process on the host computers. The two most popular transport layer protocols are Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). TCP is considered one of the most important protocols in the Internet. UDP is a minimal message-oriented Transport Layer protocol. In this paper we have compared the performance of TCP and UDP on the wired network. Network Simulator (NS2) has been used for performance Comparison since it is preferred by the networking research community. Constant bit rate (CBR) traffic used for both TCP and UDP protocols.

Cooperation spectrum sensing in cognitive radio networks has an analogy to a distributed decision in wireless sensor networks, where each sensor make local decision and those decision result are reported to a fusion center to give the final decision according to some fusion rules. In this paper the performance of cooperative spectrum sensing examines using new optimization strategy to find optimal weight and threshold curves that enables each secondary user senses the spectrum environment independently according to a floating threshold with respect to his local environment. Our proposed approach depends on proving the convexity of the famous optimization problem in cooperative spectrum sensing that stated maximizing the probability of detec

Experimental and theoretical investigations are presented on flocculation process in pulsator clarifier. Experimental system was designed to study the factors that affecting the performance of pulsator clarifier. These factors were water level in vacuum chamber which range from 60 to 150 cm , rising time of water in vacuum chamber which having times of 20,30 & 40 seconds , and sludge blanket height which having heights of 20,30 & 40 cm .The turbidity and pH of raw water used were 200 NTU and 8.13 respectively. According to the jar test, the alum dose required for this turbidity was 20 mg/l .The performance parameters of pulsator clarifier such as , turbidity ,total solid TS , shear rate , volume concentration of sludge blanket an

A new class of higher derivatives  for harmonic univalent functions defined by a generalized fractional integral operator inside an open unit disk E is the aim of this paper.

The study aimed to measure the concentration of some heavy metal elements and represented by (Pb, Cd,Cu) through the use of atomic absorption spectrometer Flame AAS-7000 type SHIMADZU underwent a process modeling to twelve samples from the soil of electricity Dezlat al Jadiriyah station in the Baghdad University compound at a depth of 30-60 cm from the surface and divided the samples into two groups first included six samples from inside the station while the second included six samples from outside the station. For the element of Pb was higher concentration reached by 29.32ppm and less concentration 17.56ppm. were elements Cd and Cu are growing and less and proportions of certain while the highest concentration of copper 9.69 ppm and le

The tax is a financial amount collected from the taxpayer for the account of the public treasury.. and is the cornerstone of the close bond between members of the community and the country in which they live , as income tax is imposed on the profits and revenues achieved by people and often the constitution of most contemporary countries stipulate that the legislator is obligated to determine the sources of revenues and profits subjected to tax. Because the tax has a serious impact on people’s money because it is exposed to that money through direct deduction . Therefore, we note that the applicable income Tax Law stipulated that in order income to be subject to tax , it must be derived from one or more of the income sources st

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