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.
The problem of estimating node positions in sensor networks and multi agent formations has been extensively studied in the last decade for the purpose of enabling self-configurable and autonomous systems. A typical scenario involves the nodes to estimate their locations using relative measurements from neighbors. When full relative positions (coordinates or, equivalently, range and angle) between...
Multicast is important development of Ad hoc networks. But a route discovery is one of difficult problems of multicast routing protocol. Recently, many intelligent algorithms had been applied to find a route. Ant colony optimization routing algorithm (ACO) is typical one of them. However, ACO which is applied in the multicast has its limitation, which is the route to multiobjective can not be found...
This paper is concerned with fully distributed reputation-based mechanisms that improve security in MANETS. We introduce a number of optimisations to the current reputation schemes used in MANETs such as selective deviation tests and adaptive expiration timer that aim to deal with congestion and quick reputation convergence. We propose to use two different centrality measures for evaluation of the...
Finding the minimum MPR set is a NP-complete problem in OLSR protocol, and intelligent computing methods can be used to solve it. Based on analyzing the defects of the strategy of the greedy heuristic algorithm, ant colony algorithm is imported to solve the minimum set of MPR problem. Firstly, defining the out-degree and the in-degree of a node, and in accordance with the out-degree and in-degree...
In wireless ad-hoc networks, where nodes are often equipped with batteries, energy is a scarce resource. Therefore, power consumption of network operations is critical and subject to optimization. One of the fundamental problems in ad-hoc networks is multicasting. In this work we consider the so-called minimum energy multicast (MEM) problem, which can be stated as a combinatorial optimization problem...
Ant colony optimization is being used to solve problems in many scientific fields. In this paper we apply an ant routing algorithm to multi-radio and multi-channel wireless mesh networks. The proposed algorithm introduces ants encountering scheme to imitate the natural process of information sharing between the individuals of an intelligent swarm. Simulation of the routing shows that this new routing...
This paper deals with the problem of power allocation in heterogeneous wireless networks such as wireless ad hoc and mesh networks. We propose a general approach to power control, with the goal of optimizing some network performance metric subject general constraints at selected links, such as constraints on signal-to-interference ratio or restrictions on received power. Based on a novel construction...
In this paper, based on the inherent characteristic of the contention relation between flows in ad hoc networks, we introduce the notion of the link's interference set, extend the multipath utility maximization problem formulating the multipath congestion control problem in wireline networks to ad hoc networks. As the objective function is not strictly concave in the path rate, we apply the penalty...
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.