INFOCOM 2008 - PDF Preprint Papers

INFOCOM 2008 Annual Joint Conference of the IEEE Computer and Communications Societies

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed INFOCOM-2008 Paper

click to vote

INFOCOM
2008
IEEE

395views Communications» more INFOCOM 2008»

On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast

14 years 5 months ago

Download web.ics.purdue.edu

—Sleep-wake scheduling is an effective mechanism to prolong the lifetime of energy-constrained wireless sensor networks. However, it incurs an additional delay for packet deliver...

Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun S...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	395	On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast	claim
2	302	Robust Distributed Spectrum Sensing in Cognitive Radio Networks	claim
3	294	Inside the New Coolstreaming: Principles, Measurements and Performance Implications	claim
4	280	A Backup Route Aware Routing Protocol - Fast Recovery from Transient Routing Failures	claim
5	279	Attack-Tolerant Time-Synchronization in Wireless Sensor Networks	claim
6	240	AdapCode: Adaptive Network Coding for Code Updates in Wireless Sensor Networks	claim
7	221	Real-Time Video Multicast in WiMAX Networks	claim
8	217	The Inframetric Model for the Internet	claim
9	213	APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks	claim
10	211	BodyQoS: Adaptive and Radio-Agnostic QoS for Body Sensor Networks	claim
11	209	HERO: Online Real-Time Vehicle Tracking in Shanghai	claim
12	209	Design and Evaluation of a Routing-Informed Cooperative MAC Protocol for Ad Hoc Networks	claim
13	208	Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks	claim
14	207	Cross-Layer Quality of Service Support for UWB Wireless Multimedia Sensor Networks	claim
15	205	MPLOT: A Transport Protocol Exploiting Multipath Diversity Using Erasure Codes	claim
16	203	T-Lohi: A New Class of MAC Protocols for Underwater Acoustic Sensor Networks	claim
17	192	Dynamic Bandwidth Request-Allocation Algorithm for Real-Time Services in IEEE 802.16 Broadband Wireless Access Networks	claim
18	191	An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks	claim
19	187	A Novel Quantitative Approach For Measuring Network Security	claim
20	187	ALPACAS: A Large-Scale Privacy-Aware Collaborative Anti-Spam System	claim
21	185	Proportional Fairness in Multi-Rate Wireless LANs	claim
22	182	A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks	claim
23	181	A Distributed Optimization Algorithm for Multi-Hop Cognitive Radio Networks	claim
24	180	On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm	claim
25	179	Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks	claim
26	179	On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks	claim
27	178	All-Match Based Complete Redundancy Removal for Packet Classifiers in TCAMs	claim
28	177	Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements	claim
29	177	Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks	claim
30	176	Snoogle: A Search Engine for the Physical World	claim
31	171	Modeling Resource Sharing Dynamics of VoIP Users over a WLAN Using a Game-Theoretic Approach	claim
32	170	An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks	claim
33	170	Spatial Signatures for Lightweight Security in Wireless Sensor Networks	claim
34	169	Index Policies for Real-Time Multicast Scheduling for Wireless Broadcast Systems	claim
35	168	Globally Optimal Channel Assignment for Non-Cooperative Wireless Networks	claim
36	166	Underwater Localization in Sparse 3D Acoustic Sensor Networks	claim
37	165	HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space	claim
38	164	Sensor-Aided Overlay Deployment and Relocation for Vast-Scale Sensor Networks	claim
39	164	Cell Selection in 4G Cellular Networks	claim
40	163	Temporal Delay Tomography	claim
41	163	Self-Organizing Dynamic Fractional Frequency Reuse in OFDMA Systems	claim
42	162	Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks	claim
43	162	Towards Statistically Strong Source Anonymity for Sensor Networks	claim
44	160	A Practical SNR-Guided Rate Adaptation	claim
45	159	iBubble: Multi-Keyword Routing Protocol for Heterogeneous Wireless Sensor Networks	claim
46	159	Utility Max-Min Fair Congestion Control with Time-Varying Delays	claim
47	158	Adding Capacity Points to a Wireless Mesh Network Using Local Search	claim
48	157	Competitive Analysis of Opportunistic Spectrum Access Strategies	claim
49	155	A Scalable Method for Access Control in Location-Based Broadcast Services	claim
50	155	On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes	claim
51	155	BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks	claim
52	154	An Efficient Identity-Based Batch Verification Scheme for Vehicular Sensor Networks	claim
53	154	Detecting 802.11 MAC Layer Spoofing Using Received Signal Strength	claim
54	154	A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks	claim
55	154	Drive-By Localization of Roadside WiFi Networks	claim
56	153	Run-Time System for Scalable Network Services	claim
57	153	Analysis of Price Competition in a Slotted Resource Allocation Game	claim
58	152	A Practical and Flexible Key Management Mechanism For Trusted Collaborative Computing	claim
59	151	Measurement and Modeling of the Origins of Starvation in Congestion Controlled Mesh Networks	claim
60	150	Beyond TCAMs: An SRAM-Based Parallel Multi-Pipeline Architecture for Terabit IP Lookup	claim
61	150	Stable Peers: Existence, Importance, and Application in Peer-to-Peer Live Video Streaming	claim
62	149	Live Baiting for Service-Level DoS Attackers	claim
63	149	On the Levy-Walk Nature of Human Mobility	claim
64	148	Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks	claim
65	147	Network Routing Topology Inference from End-to-End Measurements	claim
66	147	Complex Network Measurements: Estimating the Relevance of Observed Properties	claim
67	147	CTU: Capturing Throughput Dependencies in UWB Networks	claim
68	147	DRIP: A Dynamic VoRonoi RegIons-Based Publish/Subscribe Protocol in Mobile Networks	claim
69	147	Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs	claim
70	146	Cross-Monotonic Multicast	claim
71	145	Making Large Scale Deployment of RCP Practical for Real Networks	claim
72	145	Improved Smoothed Round Robin Schedulers for High-Speed Packet Networks	claim
73	145	On Constructions of Optical Queues with a Limited Number of Recirculations	claim
74	145	Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks	claim
75	144	FLoD: A Framework for Peer-to-Peer 3D Streaming	claim
76	144	Decentralized Rate Regulation in Random Access Channels	claim
77	144	Dynamic Jamming Mitigation for Wireless Broadcast Networks	claim
78	144	Multi-Channel Live P2P Streaming: Refocusing on Servers	claim
79	143	Reducing Maximum Stretch in Compact Routing	claim
80	143	Optimal Sleep-Wake Scheduling for Quickest Intrusion Detection Using Wireless Sensor Networks	claim
81	143	MAC for Networks with Multipacket Reception Capability and Spatially Distributed Nodes	claim
82	143	Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?	claim
83	142	Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation	claim
84	142	Light-Weight Contour Tracking in Wireless Sensor Networks	claim
85	142	Achieving Honest Ratings with Reputation-Based Fines in Electronic Markets	claim
86	142	Multicast Tree Diameter for Dynamic Distributed Interactive Applications	claim
87	142	On the Design of Load Factor based Congestion Control Protocols for Next-Generation Networks	claim
88	141	Routing in Outer Space	claim
89	141	Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape	claim
90	141	Algorithms for Low-Latency Remote File Synchronization	claim
91	141	Designing a Fault-Tolerant Network Using Valiant Load-Balancing	claim
92	140	Non-Metric Coordinates for Predicting Network Proximity	claim
93	140	Bandwidth-Aware Routing in Overlay Networks	claim
94	139	Searching for Rare Objects Using Index Replication	claim
95	139	Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints	claim
96	138	Circular Sailing Routing for Wireless Networks	claim
97	138	On Survivable Access Network Design: Complexity and Algorithms	claim
98	137	QoS Performance Analysis of Cognitive Radio-Based Virtual Wireless Networks	claim
99	137	Fast and Distributed Computation of Schedules in Wireless Networks	claim
100	137	Essentia: Architecting Wireless Sensor Networks Asymmetrically	claim
101	136	Capacity of Asynchronous Random-Access Scheduling in Wireless Networks	claim
102	135	Throughput Anonymity Trade-off in Wireless Networks under Latency Constraints	claim
103	135	Diagnosing Wireless Packet Losses in 802.11: Separating Collision from Weak Signal	claim
104	135	Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks	claim
105	135	Wide-Area IP Network Mobility	claim
106	135	Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks	claim
107	135	Swarming on Optimized Graphs for n-Way Broadcast	claim
108	135	Design Guidelines for Routing Metrics in Multihop Wireless Networks	claim
109	135	CORD: Energy-Efficient Reliable Bulk Data Dissemination in Sensor Networks	claim
110	135	Feasible Rate Allocation in Wireless Networks	claim
111	135	Link Lifetimes and Randomized Neighbor Selection in DHTs	claim
112	135	End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks	claim
113	134	Probabilistic Approach to Provisioning Guaranteed QoS for Distributed Event Detection	claim
114	134	A Device-Independent Router Model	claim
115	133	Minimum Cost Data Aggregation with Localized Processing for Statistical Inference	claim
116	133	An Optimization Framework for Opportunistic Multipath Routing in Wireless Mesh Networks	claim
117	133	A Hybrid Rogue Access Point Protection Framework for Commodity Wi-Fi Networks	claim
118	132	Characterizing and Modelling Clustering Features in AS-Level Internet Topology	claim
119	131	Towards a Theory of Robust Localization Against Malicious Beacon Nodes	claim
120	131	Deploying Four-Connectivity and Full-Coverage Wireless Sensor Networks	claim
121	131	Minimum Cost Topology Construction for Rural Wireless Mesh Networks	claim
122	129	An Empirical Activity Model for WLAN Users	claim
123	129	Randomized 3D Geographic Routing	claim
124	128	A Measurement Study of Multiplicative Overhead Effects in Wireless Networks	claim
125	128	ECPP: Efficient Conditional Privacy Preservation Protocol for Secure Vehicular Communications	claim
126	128	Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators	claim
127	128	Scalable Localization with Mobility Prediction for Underwater Sensor Networks	claim
128	127	All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching	claim
129	127	Joint Effects of Radio Channels and Node Mobility on Link Dynamics in Wireless Networks	claim
130	127	Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception	claim
131	125	Power Awareness in Network Design and Routing	claim
132	125	On Wireless Social Community Networks	claim
133	125	Minerva: Learning to Infer Network Path Properties	claim
134	124	A Trust and Reputation based Anti-SPIM Method	claim
135	124	Asynchronous Sampling Benefits Wireless Sensor Networks	claim
136	124	Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering	claim
137	124	Accurate and Efficient Traffic Monitoring Using Adaptive Non-Linear Sampling Method	claim
138	124	Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications	claim
139	123	Area Avoidance Routing in Distance-Vector Networks	claim
140	123	Task Scheduling and Lightpath Establishment in Optical Grids	claim
141	123	A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing	claim
142	123	How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding	claim
143	122	On Maintaining Sensor-Actor Connectivity in Wireless Sensor and Actor Networks	claim
144	122	Delay Analysis for Maximal Scheduling in Wireless Networks with Bursty Traffic	claim
145	121	SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths	claim
146	121	Turbo King: Framework for Large-Scale Internet Delay Measurements	claim
147	121	Distributed Robust Optimization for Communication Networks	claim
148	120	The Meandering Current Mobility Model and its Impact on Underwater Mobile Sensor Networks	claim
149	120	Reliability Gain of Network Coding in Lossy Wireless Networks	claim
150	120	Opportunistic Spectrum Access in Cognitive Radio Networks	claim
151	120	Evaluating the Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks	claim
152	120	Capacity of Hybrid Cellular-Ad Hoc Data Networks	claim
153	120	Balanced Relay Allocation on Heterogeneous Unstructured Overlays	claim
154	119	Power-Adjusted Random Access to a Wireless Channel	claim
155	119	Delay Tolerant Collaborations among Campus-Wide Wireless Users	claim
156	118	On Reducing Mesh Delay for Peer-to-Peer Live Streaming	claim
157	118	Proxy Caching in Split TCP: Dynamics, Stability and Tail Asymptotics	claim
158	118	Utility-Driven Spatiotemporal Sampling Using Mobile Sensors	claim
159	116	Sampling Strategies for Epidemic-Style Information Dissemination	claim
160	115	Wireless Medium Access via Adaptive Backoff: Delay and Loss Minimization	claim
161	115	iPack: in-Network Packet Mixing for High Throughput Wireless Mesh Networks	claim
162	114	Maximizing Restorable Throughput in MPLS Networks	claim
163	114	Cyber-Fraud is One Typo Away	claim
164	114	Optimal Geographic Routing for Wireless Networks with Near-Arbitrary Holes and Traffic	claim
165	113	Online Energy Efficient Packet Scheduling with Delay Constraints in Wireless Networks	claim
166	113	Association Control in Mobile Wireless Networks	claim
167	113	Queueing Analysis of Loss Systems with Variable Optical Delay Lines	claim
168	112	Fair Scheduling through Packet Election	claim
169	112	Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking	claim
170	112	Window Flow Control: Macroscopic Properties from Microscopic Factors	claim
171	112	Optimization Based Rate Control for Communication Networks with Inter-Session Network Coding	claim
172	112	Resolving Anonymous Routers in Internet Topology Measurement Studies	claim
173	111	A New Channel Assignment Mechanism for Rural Wireless Mesh Networks	claim
174	111	Prioritized Repeated Eliminations Multiple Access: A Novel Protocol for Wireless Networks	claim
175	111	How Bad is Suboptimal Rate Allocation?	claim
176	110	An Energy Efficiency Evaluation for Sensor Nodes with Multiple Processors, Radios and Sensors	claim
177	110	Lightweight and Compromise-Resilient Message Authentication in Sensor Networks	claim
178	110	On the Feasibility of the Link Abstraction in (Rural) Mesh Networks	claim
179	110	Detecting Anomalies Using End-to-End Path Measurements	claim
180	110	A New ACK Policy To Mitigate the Effects of Coexisting IEEE 802.11/802.11e Devices	claim
181	109	On the Performance of IEEE 802.11 under Jamming	claim
182	108	iLOC: An invisible LOCalization Attack to Internet Threat Monitoring Systems	claim
183	108	An Explanation for Unexpected 802.11 Outdoor Link-level Measurement Results	claim
184	108	A Singlehop Collaborative Feedback Primitive for Wireless Sensor Networks	claim
185	107	Understanding Disconnection and Stabilization of Chord	claim
186	107	Maximum Coverage at Minimum Cost for Multi-Domain IP/MPLS Networks	claim
187	107	Firewall Compressor: An Algorithm for Minimizing Firewall Policies	claim
188	107	A Novel On-Demand Framework for Collaborative Object Detection in Sensor Networks	claim
189	106	Exploiting Multi-Channel Diversity in Spectrum-Agile Networks	claim
190	106	Call Admission Control in IEEE 802.11 WLANs Using QP-CAT	claim
191	105	A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification	claim
192	105	Using Transmit-Only Sensors to Reduce Deployment Cost of Wireless Sensor Networks	claim
193	104	ACK-Clocking Dynamics: Modelling the Interaction between Windows and the Network	claim
194	104	A Three-Stage Load-Balancing Switch	claim
195	104	Maximizing Resilient Throughput in Peer-to-Peer Network: A Generalized Flow Approach	claim
196	103	Design of a Channel Characteristics-Aware Routing Protocol	claim
197	103	On Optimal Sizing of Tiered Network Services	claim
198	103	Robust Planarization of Unlocalized Wireless Sensor Networks	claim
199	102	Is Random Network Coding Helpful in WiMAX?	claim
200	102	A New Perspective on Internet Security using Insurance	claim
201	102	Distance-1 Constrained Channel Assignment in Single Radio Wireless Mesh Networks	claim
202	101	GRE Encapsulated Multicast Probing: A Scalable Technique for Measuring One-Way Loss	claim
203	101	Spot Pricing of Secondary Spectrum Usage in Wireless Cellular Networks	claim
204	100	The Speed of Information Propagation in Large Wireless Networks	claim
205	98	Guaranteeing Quality of Service to Peering Traffic	claim
206	97	Border Effects, Fairness, and Phase Transition in Large Wireless Networks	claim
207	97	SVATS: A Sensor-Network-Based Vehicle Anti-Theft System	claim
208	97	Information Concealing Games	claim
209	96	The Power of One Move: Hashing Schemes for Hardware	claim
210	95	Vulnerability of Network Traffic under Node Capture Attacks Using Circuit Theoretic Analysis	claim
211	95	Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers	claim
212	95	Spatial-Temporal Characteristics of Internet Malicious Sources	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers