Wireless sensor network (WSN) is assortment of sensor nodes proficient in environmental information sensing, refining it and transmitting it to base station in sovereign manner. The minute sensors communicate themselves to sense and monitor the environment. The main challenges are limited power, short communication range, low bandwidth and limited processing. The power source of these sensor nodes are the main hurdle in design of energy efficient network. The main objective of the proposed clustering and data transmission algorithm is to augment network performance by using swarm intelligence approach. This technique is based on K-mean based clustering, data rate optimization using firefly optimization algorithm and Ant colony optimization based data forwarding. The KFOA is divided in three parts: (1) Clustering of sensor nodes using K-mean technique and (2) data rate optimization for controlling congestion and (3) using shortest path for data transmission based on Ant colony optimization (ACO) technique. The performance is analyzed based on two scenarios as with rate optimization and without rate optimization. The first scenario consists of two operations as kmean clustering and ACO based routing. The second scenario consists of three operations as mentioned in KFOA. The performance is evaluated in terms of throughput, packet delivery ratio, energy dissipation and residual energy analysis. The simulation results show improvement in performance by using with rate optimization technique.

A wireless sensor system is an essential aspect in many fields. It consists of a great deal of sensor nodes. These sensor networks carry out a number of tasks, including interaction, distribution, recognition, and power supply. Data is transmitted from source to destination and plays an important role. Congestion may occur during data transmission from one node to another and also at cluster head locations. Congestion will arise as a result of either traffic division or resource allocation. Energy will be wasted due to traffic division congestion, which causes packet loss and retransmission of removed packets. As a result, it must be simplified; hence there are a few Wireless sensor networks with various protocols that will handle Congestion Control. The Deterministic Energy Efficient Clustering (DEC) protocol, which is fully based on residual energy and the token bucket method, is being investigated as a way to increase the energy efficiency. In the event of congestion, our proposal provides a way to cope with it and solves it using this method to improve lifespan of the sensor networks. Experiments in simulation show that the proposed strategy can significantly enhance lifetime, energy, throughput, and packet loss.

We consider the downlink of an orthogonal frequency division multiplexing (OFDM) based cell that accommodates calls from different service-classes with different resource requirements. We assume that calls arrive in the cell according to a quasi-random process, i.e., calls are generated by a finite number of sources. To calculate the most important performance metrics in this OFDM-based cell, i.e., congestion probabilities and resource utilization, we model it as a multirate loss model, show that the steady-state probabilities have a product form solution (PFS) and propose recursive formulas which reduce the complexity of the calculations. In addition, we study the bandwidth reservation (BR) policy which can be used in order to reserve subcarriers in favor of calls with high subcarrier requirements. The existence of the BR policy destroys the PFS of the steady-state probabilities. However, it is shown that there are recursive formulas for the determination of the various performance measures. The accuracy of the proposed formulas is verified via simulation and found to be satisfactory.

This paper presents the nodal nature of park spaces in New York City in the context of the variant use of forms of traditional and alternative mobility in the city. Using comparative analysis of thematic maps and plans of mass and individual transportation, a review of planning documents and in-situ observations in the city area, it was demonstrated that New York parks have become efficient transportation channels for daily migrations within the dense urban fabric. The phenomenal plasticity of park areas in terms of the formation of and adaptation to new uses and the growing scale of the issue prompt a deeper analysis of the phenomenon.

In the article, a validation module, being a component of an integrated system supporting routing in software defined networks (SDNRoute), is proposed and thoroughly examined. The module allows for the verification of the results provided by the optimization module before these results are deployed in the production network. Routing policies are validated for their impact on the network quality parameters and against the threat of overloading (congestion).

Establishing the proper values of controller parameters is the most important thing to design in active queue management (AQM) for achieving excellent performance in handling network congestion. For example, the first well known AQM, the random early detection (RED) method, has a lack of proper parameter values to perform under most the network conditions. This paper applies a Nelder-Mead simplex method based on the integral of time-weighted absolute error (ITAE) for a proportional integral (PI) controller using active queue management (AQM). A TCP flow and PI AQM system were analyzed with a control theory approach. A numerical optimization algorithm based on the ITAE index was run with Matlab/Simulink tools to find the controller parameters with PI tuned by Hollot (PI) as initial parameter input. Compared with PI and PI tuned by Ustebay (PIU) via experimental simulation in Network Simulator Version 2 (NS2) in five scenario network conditions, our proposed method was more robust. It provided stable performance to handle congestion in a dynamic network.

The article proposes a model in which Diffusion Approximation is used to analyse the TCP/AQM transmission mechanism in a multinode computer network. In order to prevent traffic congestion, routers implement AQM (Active Queue Management) algorithms. We investigate the influence of using RED-based AQM mechanisms and the fractional controller PI^γ on the transport layer. Additionally, we examine the cases in which the TCP and the UDP flows occur and analyse their mutual influence. Both transport protocols used are independent and work simultaneously. We compare our solution with the Fluid Flow approximation, demonstrating the advantages of Diffusion Approximation.