Related papers: Towards an accurate solution of wireless network d…
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes correspond to the state variable values and the network arcs…
We consider two optimization problems in which a planner aims to influence the average transient opinion in the Friedkin-Johnsen dynamics on a network by intervening on the agents' innate opinions. Solving these problems requires full…
The reconfigurable intelligent surface is an emerging technology for wireless communications. We model it as an inhomogeneous boundary of surface impedance, and consider various optimization problems that offer different tradeoffs in terms…
Wireless sensor networks consisting of great number of cheap and tiny sensor nodes which are used for military environment controlling, natural events recording, traffic monitoring, robot navigation, and etc. Such a networks encounter with…
Broadcasting problem is an important issue in the wireless networks, especially in dynamic wireless networks. In dynamic wireless networks the node density and mobility is high, due to several problems which arise during broadcasting. Two…
This paper provides a general mathematical optimization based framework to incorporate fairness measures from the facilities' perspective to Discrete and Continuous Maximal Covering Location Problems. The main ingredients to construct a…
We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on…
This paper presents Area coverage of homogenous wireless sensor network using computational geometry. The concepts related to both coverage wireless sensor network and computational geometry have been introduced. Then, the problem has been…
In this paper, we study wireless networks where nodes have two energy sources, namely a battery and radio frequency (RF) energy harvesting circuitry. We formulate two optimization problems with different objective functions, namely…
Networks analysis has been commonly used to study the interactions between units of complex systems. One problem of particular interest is learning the network's underlying connection pattern given a single and noisy instantiation. While…
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless communication. We argue that the problem is best formulated in…
Various types of communication networks are constantly emerging to improve the connectivity services and facilitate the interconnection of various types of devices. This involves the development of several technologies, such as…
One of the main pervasive problems Wireless Sensor Networks (WSN) encounter is to maintain flawless communication sharing and cooperative processing between sensors via radio links to ensure a reliable treatment of information. Many…
Network Utility Maximization (NUM) is often applied for the cross-layer design of wireless networks considering known wireless channels. However, realistic wireless channel capacities are stochastic bearing time-varying statistics,…
Fixed point algorithms play an important role to compute feasible solutions to the radio power control problems in wireless networks. Although these algorithms are shown to converge to the fixed points that give feasible problem solutions,…
This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is…
In many problems, the inputs arrive over time, and must be dealt with irrevocably when they arrive. Such problems are online problems. A common method of solving online problems is to first solve the corresponding linear program, and then…
In this work, the online printing shop scheduling problem is considered. This challenging real problem, that appears in the nowadays printing industry, can be seen as a flexible job shop scheduling problem with sequence flexibility in which…
Batched sparse (BATS) code is a promising technology for reliable data transmission in multi-hop wireless networks. As a BATS code consists of an outer code and an inner code that typically is a random linear network code, one main research…
We formulate an optimization problem for joint RU allocation and C-SR to maximize the throughput of a multi-AP coordinated WiFi system. The optimization problem is found to be a non-linear integer programming problem. We solve the problem…