Sciweavers

298 search results - page 11 / 60
» Minimizing Flow Time in the Wireless Gathering Problem
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Protecting Receiver-Location Privacy in Wireless Sensor Networks
—Due to the open nature of a sensor network, it is relatively easy for an adversary to eavesdrop and trace packet movement in the network in order to capture the receiver physica...
Ying Jian, Shigang Chen, Zhan Zhang, Liang Zhang
DAM
2008
72views more  DAM 2008»
13 years 6 months ago
Minimization of circuit registers: Retiming revisited
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
Bruno Gaujal, Jean Mairesse
ICC
2009
IEEE
196views Communications» more  ICC 2009»
14 years 1 months ago
Joint Flow Control, Routing and Medium Access Control in Random Access Multi-Hop Wireless Networks
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framewor...
Sucha Supittayapornpong, Poompat Saengudomlert
INFOCOM
2007
IEEE
14 years 1 months ago
Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
Michele Rossi, Nicola Bui, Michele Zorzi
DISOPT
2010
138views more  DISOPT 2010»
13 years 6 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...