| dc.description.abstract | The development and use of Wireless Network (WN) is currently very rapid, especially for human life. Cloud-based solutions are efficient because there are no time delays, despite high power consumption, security and privacy issues caused by billions of connected wireless devices and typically billions of bytes of data generated on the network. Advanced computing combinations can optimally shift computing servers. closer to network developments, providing support for advanced internet-based applications such as data surveillance, video/audio and personal recommendation systems by enabling intelligent computational decision-making at the point where data is most needed, and distributed connections with the potential to deliver data transmission large centralized cloud-based system.
The location of nodes with a single assignment is a matter of finding optimal points to minimize system development costs across networks. Hotspots are special nodes that route traffic in a communications or transportation network. Given a set of terminals (user nodes) and a traffic matrix, the node location problem consists of selecting a subset of terminals to find hotspots and assigning terminals to other terminal nodes to cost-effectively optimize the most optimal node assignments. This dissertation discusses how to model the polyhedral nature of the problem and develop a proper neighborhood search method to solve the model | en_US |
