In this thesis we will consider three of them: algorithms and data structures for problems involving distances in networks (in particular compact routing schemes, distance labels, and distance oracles), algorit
Computer science Development of energy-efficient algorithms for wireless sensor networks KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS (SAUDI ARABIA) Tarek Sheltami AkhlaqMuhammadWireless sensor networks (WSNs) require very efficient algorithms for data processing, compression and routing due to the ...
The wireless mesh networksare considered as one of the vital elements in today's converged networks,providing high bandwidth and connectivity over large geographical areas. Mesh routers equipped with multiple radios can significantly overcome the capacity problem and increase the aggregate throughput of ...
wireless ad‐hoc networksenergy efficiencyreliableThis book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the ...
sum‐rate capacityIn this paper, we propose two novel user selection algorithms for multiuser multiple-input and multiple-output downlink wireless systems, in which both a base station (BS) and mobile stations (MSs) are equipped with multiple antennas. Linear transmit beamforming at the BS and ...
We have also found that the capacity of an agent impacts the choice of heuristics. For fast moving agents, the SCP algorithm is faster in total restoration time, and for slow speed moving agent, the IP algorithm will be faster. In the remainder of the paper, we discuss research background...
for such a problem giving deep neural networks the concept of memory via the hidden state. Different RNN types (RNN, GRU, and LSTM) was adopted by Benzekri et al.[13]to detect forest fires at their early stages from wireless sensor network mounted on the ground achieving remarkable accuracy...
Routing and scheduling act important roles in improving capacity and throughput in wireless mesh networks. In this paper, Cayley graph model is suggested for wireless Mesh Networks (WMN) with MIMO channels for efficient routing and fair scheduling. The model is based on the multiple interfaces, dir...
Every edge has unit capacity. The maximum bipartite graph problem itself has many useful applications in the field of EDA. For example, technology mapping can be modeled as a bipartite graph. The functional modules to be mapped are modeled as vertices on one side, and all cell libraries of ...
Paper tables with annotated results for On Improving the Capacity of Solving Large-scale Wireless Network Design Problems by Genetic Algorithms