Sciweavers

INFOCOM
2012
IEEE
12 years 2 months ago
Scalable routing in 3D high genus sensor networks using graph embedding
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
Xiaokang Yu, Xiaotian Yin, Wei Han, Jie Gao, Xianf...
INFOCOM
2012
IEEE
12 years 2 months ago
Physical layer security from inter-session interference in large wireless networks
—Physical layer secrecy in wireless networks in the presence of eavesdroppers of unknown location is considered. In contrast to prior schemes, which have expended energy in the f...
Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pis...
INFOCOM
2012
IEEE
12 years 2 months ago
Fine-grained private matching for proximity-based mobile social networking
—Proximity-based mobile social networking (PMSN) refers to the social interaction among physically proximate mobile users directly through the Bluetooth/WiFi interfaces on their ...
Rui Zhang 0007, Yanchao Zhang, Jinyuan Sun, Guanhu...
INFOCOM
2012
IEEE
12 years 2 months ago
Extensive analysis and large-scale empirical evaluation of tor bridge discovery
Abstract—Tor is a well-known low-latency anonymous communication system that is able to bypass Internet censorship. However, publicly announced Tor routers are being blocked by v...
Zhen Ling, Junzhou Luo, Wei Yu, Ming Yang, Xinwen ...
INFOCOM
2012
IEEE
12 years 2 months ago
Data centers power reduction: A two time scale approach for delay tolerant workloads
—In this work we focus on a stochastic optimization based approach to make distributed routing and server management decisions in the context of large-scale, geographically distr...
Yuan Yao, Longbo Huang, Abhishek Sharma, Leana Gol...
INFOCOM
2012
IEEE
12 years 2 months ago
NSDMiner: Automated discovery of Network Service Dependencies
—Enterprise networks today host a wide variety of network services, which often depend on each other to provide and support network-based services and applications. Understanding...
Arun Natarajan, Peng Ning, Yao Liu, Sushil Jajodia...
INFOCOM
2012
IEEE
12 years 2 months ago
Squeezing the most out of interference: An optimization framework for joint interference exploitation and avoidance
—There is a growing interest in exploiting interference (rather than avoiding it) to increase network throughput. In particular, the so-called successive interference cancellatio...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou,...
INFOCOM
2012
IEEE
12 years 2 months ago
Pssst, over here: Communicating without fixed infrastructure
—This paper discusses a way to communicate without relying on fixed infrastructure at some central hub. This can be useful for bootstrapping loosely connected peer-to-peer syste...
Tom Callahan, Mark Allman, Michael Rabinovich
INFOCOM
2012
IEEE
12 years 2 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
INFOCOM
2012
IEEE
12 years 2 months ago
Estimators also need shared values to grow together
—Network management applications require large numbers of counters in order to collect traffic characteristics for each network flow. However, these counters often barely fit ...
Erez Tsidon, Iddo Hanniel, Isaac Keslassy