Πλοήγηση ανά Θέμα "Distributed algorithms"
Αποτελέσματα 1-6 από 6
-
The d-hop k-data coverage query problem in wireless sensor networks
(2008)The task of querying wireless sensor network (WSN) to retrieve data of interest is very significant and a wealth of query types have been proposed in the context of WSNs. This article describes the d-hop k-data coverage ... -
Distributed Online Algorithms for the Agent Migration Problem in WSNs
(2013)The mobile agent paradigm has been adopted by several systems in the area of wireless sensor networks as it enables a flexible distribution and placement of application components on nodes, at runtime. Most agent placement ... -
Joint beamforming and channel selection for multicast IEEE 802.11n WLANs
(2008)Multicast transmission over WLANs is becoming a popular application. IEEE 802.11n technology is developed due to the ever increasing demand for higher data rate and Quality of Service (QoS). However, there is an unmanaged ... -
Joint QoS multicast power / admission control and base station assignment: A geometric programming approach
(2008)The joint power control and base station (BS) assignment problem is considered under Quality-of-Service (QoS) constraints. If a feasible solution exists, the problem can be efficiently solved using existing distributed ... -
Optimal distributed kalman and lainiotis filters: Optimal uniform distribution of measurements into local processors
(2009)A method to implement the optimal distributed Kalman and Lainiotis filters is proposed. The method is based on the a-priori determination of the optimal uniform distribution of the measurements into parallel processors, ... -
Tight bounds for black hole search with scattered agents in synchronous rings
(2013)We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole is a harmful stationary process residing in a node of the ...