Sciweavers

255 search results - page 13 / 51
» infocom 2009
Sort
View
INFOCOM
2009
IEEE
15 years 5 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
INFOCOM
2009
IEEE
15 years 5 months ago
Robust Event Boundary Detection in Sensor Networks - A Mixture Model Based Approach
—Detecting event frontline or boundary sensors in a complex sensor network environment is one of the critical problems for sensor network applications. In this paper, we propose ...
Min Ding, Xiuzhen Cheng
81
Voted
INFOCOM
2009
IEEE
15 years 5 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
INFOCOM
2009
IEEE
15 years 5 months ago
Optimal Fast Hashing
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
Josef Kanizo, David Hay, Isaac Keslassy
81
Voted
INFOCOM
2009
IEEE
15 years 5 months ago
Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing
Abstract—Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metric with a ...
Yujun Li, Yaling Yang, Xianliang Lu