Sciweavers

INFOCOM
2009
IEEE
13 years 10 months ago
Event Recognition in Sensor Networks by Means of Grammatical Inference
Abstract—Modern military and civilian surveillance applications should provide end users with the high level representation of events observed by sensors rather than with the raw...
Sahin Cem Geyik, Boleslaw K. Szymanski
INFOCOM
2009
IEEE
13 years 10 months ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...
INFOCOM
2009
IEEE
13 years 10 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
INFOCOM
2009
IEEE
13 years 10 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
13 years 10 months ago
CASE: Connectivity-Based Skeleton Extraction in Wireless Sensor Networks
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
Hongbo Jiang, Wenping Liu, Dan Wang, Chen Tian, Xi...
INFOCOM
2009
IEEE
13 years 10 months ago
Exploiting Internet Delay Space Properties for Selecting Distinct Network Locations
—Recent studies have discovered that the Internet delay space has many interesting properties such as triangle inequality violations (TIV), clustering structures and constrained ...
Bo Zhang, T. S. Eugene Ng
INFOCOM
2009
IEEE
13 years 10 months ago
Sensor Network Localization Using Sensor Perturbation
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston
INFOCOM
2009
IEEE
13 years 10 months ago
Quantifying the Importance of Vantage Points Distribution in Internet Topology Measurements
—The topology of the Internet has been extensively studied in recent years, driving a need for increasingly complex measurement infrastructures. These measurements have produced ...
Yuval Shavitt, Udi Weinsberg
INFOCOM
2009
IEEE
13 years 10 months ago
Optimal Sensing-Transmission Structure for Dynamic Spectrum Access
—In cognitive wireless networks where secondary users (SUs) opportunistically access spectral white spaces of primary users (PUs), there exists an inherent tradeoff between sensi...
Senhua Huang, Xin Liu, Zhi Ding
INFOCOM
2009
IEEE
13 years 10 months ago
Opportunistic Routing Algebra and its Applications
Abstract—Opportunistic routing (OR) has received much attention as a new routing paradigm due to its efficient utilization of broadcasting and spacial diversity of the wireless ...
Mingming Lu, Jie Wu