The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Minim um-collisions assignment (MCA), in a wireless network, is the distribution of a finite resource set, such that the number of neighbor cells which receive common elements is minimized. In classical operator deployed networks, resources are assigned centrally. Heterogeneous networks contain user deployed cells, therefore centralized assignment is problematic. MCA includes orthogonal frequency...
One of the important challenges in the large-scale networked systems is the evaluation of its optimal point of operation. The problem becomes essentially challenging in large-scale networks due to high-dimensionality of the problem, lack of global information, and uncertain and dynamic nature of the operation. The inadequacies of the traditional centralized optimization techniques in addressing these...
Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a scenario whereby selected nodes in a given network communicate with fixed routers and employ statistical physics methods to obtain optimal routing solutions subject to a generic cost. A distributive message-passing algorithm capable of optimizing...
Network-wide traffic measurement is important for various network management tasks, ranging from traffic accounting, traffic engineering, and network troubleshooting to security. Existing techniques for traffic measurement tend to be sub-optimal due to poor choice of monitor deployment location or due to constantly evolving monitoring objectives and traffic characteristics. It is not feasible to dynamically...
This work proposes a distributed algorithm for the energy optimal routing in wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming theory we use the dual decomposition theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without...
In this paper we address the problem of designing adaptive epidemic-style forwarding mechanisms for message delivery in Delay Tolerant Networks. Our approach is based on a new analytical framework for multi-agent optimization through distributed subgradient methods. We investigate how this framework can be adapted to the considered networking problem and perform a preliminary evaluation, which shows...
In this paper, we study the problem that finds optimal link weights for routing in communication networks with a target utilization for each link. Since the problem is known as NP-hard, we take a heuristic approach based on the simulated annealing method. However, to make the algorithm to be more robust and converge fast, we modify the basic simulated annealing method. Numerical results show that...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.