147 search results - page 13 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
119
click to vote
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—In-network aggregation has become a promising technique for improving the energy efficiency of wireless sensor networks. Aggregating data at various nodes in the network result...
126
click to vote
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
113
click to vote
CAAN
2006
Springer
15 years 5 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
120
click to vote
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
115
Voted
COMCOM
2004
15 years 1 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...