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.
In this paper, we study the interference-aware broadcast scheduling problem, where all nodes in the Euclidean plane have a transmission range and an interference range equal to r and alphar for alphages1, respectively. Minimizing latency is known to be NP-hard even when alpha=1. The network radius D, the maximum graph distance from the source to any node, is also known to be a lower bound. We formulate...
We consider the problem of maximizing the lifetime of sensor networks with data aggregation, which was investigated by Kalpakis et al. (2003). They propose an exact polynomial-time algorithm, which however is very slow $O(n15log n), and faster heuristics. In this paper, we demonstrate an alternative approach based on the Garg-Konemann algorithm (1998) for packing linear programs, combined with the...
Optimizing the energy consumption in monitoring and communication protocols for wireless sensor networks has become the most important performance objective. We explore the problem of maximizing sensor network lifetime, i.e., time during which the set of targets is covered. We propose centralized algorithms for lifetime maximization with provable approximation ratio for the realistic model studied...
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.