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.
Admission control plays an important role in providing Quality of Service (QoS) guarantees for wireless mesh networks (WMNs). Multipath routing can improve network performance in reliability and load balancing. However, when the multipath routing are adopted in 802.11-based WMNs, the transmission with bandwidth assurance is facing rigorous challenges. In this paper, a novel joint design of multipath...
In this paper, we formulate coverage requirements of the sensor network as a minimum-cost connectivity guaranteed point k-coverage problem. An improved ant colony algorithm (EasiDesign) is proposed to achieve the approximate solution to this optimization problem. We made modifications in the convergence strategy and the ant state transition rule of the general ant colony optimization. Considering...
IEEE 802.15.4 multi-hop wireless networks are an important communication infrastructure for many applications, including industrial control, home automation, and smart grids. Existing analysis of the IEEE 802.15.4 medium access control (MAC) protocol are often based on assumptions of homogeneous traffic and ideal carrier sensing, which are far from the reality when predicting performance for multi-hop...
Data aggregation is an important issue in wireless sensor networks which gathers and routes information through a multi-hop network and processes data at intermediate nodes. This paper considers how to construct data aggregation tree in wireless sensor network where there are several source nodes and a single sink. Ant Colony Optimization algorithm is an effective distributed approach. It has been...
In this paper we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is defined as the time until the network becomes disconnected. The Fiedler value, which is the algebraic connectivity of a graph, is used as an indicator of the network health. The network maintenance problem is formulated as a...
In this paper, we study the maximization problem of network lifetime for answering a sequence of aggregate queries based on snapshot data. We build a series of nearly optimal representative routing trees for query evaluation, where a representative routing tree is such a tree rooted at the base station that each node in it represents a set of non-tree nodes by holding their historical data (snapshot...
This paper develops Ant Colony optimization (ACO) algorithm and applies it to energy control and congestion control on wireless sensor network route. The pheromone and the energy of the node are combined to affect the pheromone consent ration in optimization path, which can avoid network congestion and fast consume of energy of individual node. Then it can prolong the lifecycle of the whole network...
The problem of computing a route for a mobile agent to local regions or specified nodes in a distributed sensor network is considered, both in a single region or multi-region cases. With all specified nodes visited, this paper formulates the route computation problem in terms of minimizing an objective function, which is directly proportional to the energy consumption and path loss. Further, we propose...
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.