INFOCOM 2007 - PDF Preprint Papers

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

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed INFOCOM-2007 Paper

click to vote

INFOCOM
2007
IEEE

368views Communications» more INFOCOM 2007»

Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks

14 years 5 months ago

Download www.ee.washington.edu

Abstract— We consider a scenario where a sophisticated jammer jams an area in a single-channel wireless sensor network. The jammer controls the probability of jamming and transmi...

Mingyan Li, Iordanis Koutsopoulos, Radha Poovendra...

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	368	Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks	claim
2	317	Network Coding for Distributed Storage Systems	claim
3	271	Multivariate Online Anomaly Detection Using Kernel Recursive Least Squares	claim
4	270	Bandwidth Balancing in Multi-Channel IEEE 802.16 Wireless Mesh Networks	claim
5	263	Aloha-Based MAC Protocols with Collision Avoidance for Underwater Acoustic Networks	claim
6	262	Analysis of A Loss-Resilient Proactive Data Transmission Protocol in Wireless Sensor Networks	claim
7	251	Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks	claim
8	248	Broadcast Flooding Revisited: Survivability and Latency	claim
9	247	Analysis of the Reliability of a Nationwide Short Message Service	claim
10	235	Distributed Relay Selection and Power Control for Multiuser Cooperative Communication Networks Using Buyer/Seller Game	claim
11	208	Connectivity-Aware Routing (CAR) in Vehicular Ad-hoc Networks	claim
12	203	PDA: Privacy-Preserving Data Aggregation in Wireless Sensor Networks	claim
13	198	Insider Attacker Detection in Wireless Sensor Networks	claim
14	196	pDCS: Security and Privacy Support for Data-Centric Sensor Networks	claim
15	194	A Cross-Layer Architecture to Exploit Multi-Channel Diversity with a Single Transceiver	claim
16	194	Measuring Network-Aware Worm Spreading Ability	claim
17	194	Joint Multi-Channel Link Layer and Multi-Path Routing Design for Wireless Mesh Networks	claim
18	189	Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks	claim
19	187	Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks	claim
20	185	Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information	claim
21	185	Two-Tier Load Balancing in OSPF Wireless Back-Hauls	claim
22	185	Cooperating with Smartness: Using Heterogeneous Smart Antennas in Ad-Hoc Networks	claim
23	185	Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks	claim
24	184	An Open and Scalable Emulation Infrastructure for Large-Scale Real-Time Network Simulations	claim
25	181	Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks	claim
26	180	Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks	claim
27	178	Multicast Scheduling in Cellular Data Networks	claim
28	177	On the Routing Problem in Disconnected Vehicular Ad-hoc Networks	claim
29	177	Face Tracing Based Geographic Routing in Nonplanar Wireless Networks	claim
30	176	Cross-Layer Analysis of Rate Adaptation, DCF and TCP in Multi-Rate WLANs	claim
31	175	The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization	claim
32	173	Millimeter Wave WPAN: Cross-Layer Modeling and Multi-Hop Architecture	claim
33	172	Tradeoff Between Lifetime and Rate Allocation in Wireless Sensor Networks: A Cross Layer Approach	claim
34	172	An Accurate Link Model and Its Application to Stability Analysis of FAST TCP	claim
35	169	SPREAD: Foiling Smart Jammers Using Multi-Layer Agility	claim
36	169	Packet Loss Characterization in WiFi-Based Long Distance Networks	claim
37	168	Low-Power Distributed Event Detection in Wireless Sensor Networks	claim
38	166	Mesh or Multiple-Tree: A Comparative Study of Live P2P Streaming Approaches	claim
39	164	RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks	claim
40	162	Randomized k-Coverage Algorithms For Dense Sensor Networks	claim
41	161	Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks	claim
42	160	Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks
43	160	A Localization-Based Anti-Sensor Network System	claim
44	159	Protecting Receiver-Location Privacy in Wireless Sensor Networks	claim
45	158	Service Charge and Energy-Aware Vertical Handoff in Integrated IEEE 802.16e/802.11 Networks	claim
46	158	An Optimal Algorithm for Minimizing Energy Consumption while Limiting Maximum Delay in a Mesh Sensor Network	claim
47	157	A Graph-Based Model for Disconnected Ad Hoc Networks	claim
48	156	Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks	claim
49	155	On the Detection of Signaling DoS Attacks on 3G Wireless Networks	claim
50	155	Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks	claim
51	155	Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks	claim
52	155	Load Balancing in Large-Scale RFID Systems	claim
53	155	End-to-End Routing for Dual-Radio Sensor Networks	claim
54	154	Throughput-Optimal Scheduling in Multichannel Access Point Networks Under Infrequent Channel Measurements	claim
55	154	On Optimal MAC Scheduling With Physical Interference	claim
56	154	Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks	claim
57	154	TriBiCa: Trie Bitmap Content Analyzer for High-Speed Network Intrusion Detection	claim
58	154	Empirical Evaluation of Techniques for Measuring Available Bandwidth	claim
59	153	Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks	claim
60	153	Disjoint Multipath Routing to Two Distinct Drains in a Multi-Drain Sensor Network	claim
61	152	A Multipath Background Network Architecture	claim
62	151	Joint Congestion Control and Distributed Scheduling for Throughput Guarantees in Wireless Networks	claim
63	151	Separability and Topology Control of Quasi Unit Disk Graphs	claim
64	151	Finding Self-Similarities in Opportunistic People Networks	claim
65	150	Software TDMA for VoIP Applications Over IEEE802.11 Wireless LAN	claim
66	150	Joint Channel Allocation, Interface Assignment and MAC Design for Multi-Channel Wireless Mesh Networks	claim
67	149	VoIP on Wireless Meshes: Models, Algorithms and Evaluation	claim
68	148	Optimal Provisioning of Elastic Service Availability	claim
69	147	Dynamic Cross-Layer Association in 802.11-Based Mesh Networks	claim
70	147	Modeling Time-Variant User Mobility in Wireless Mobile Networks	claim
71	147	The Power Balancing Problem in Energy Constrained Multi-Hop Wireless Networks	claim
72	147	Balancing Interruption Frequency and Buffering Penalties in VBR Video Streaming	claim
73	146	Congestion Control in Distributed Media Streaming	claim
74	146	Rate-Adaptive Framing for Interfered Wireless Networks	claim
75	146	Transmit Power Distribution of Wireless Ad Hoc Networks with Topology Control	claim
76	146	Finding Minimum-Cost Paths with Minimum Sharability	claim
77	145	Distributed Scheduling and Active Queue Management in Wireless Networks	claim
78	145	Reduction of Quality (RoQ) Attacks on Dynamic Load Balancers: Vulnerability Assessment and Design Tradeoffs	claim
79	144	Toward Optimal Data Aggregation in Random Wireless Sensor Networks	claim
80	144	RFID-Based 3-D Positioning Schemes	claim
81	144	Routing and Channel Allocation in Rural Wireless Mesh Networks	claim
82	142	Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing	claim
83	141	Modeling the Effect of Transmit Power and Physical Carrier Sense in Multi-Hop Wireless Networks	claim
84	141	Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes	claim
85	140	Modelling and Optimization of Stochastic Routing for Wireless Multi-Hop Networks	claim
86	140	A New Search Algorithm using Autonomous and Cooperative Multiple Sensor Nodes	claim
87	138	Understanding BGP Session Failures in a Large ISP	claim
88	138	A Performance Study of Deployment Factors in Wireless Mesh Networks	claim
89	137	Shape Segmentation and Applications in Sensor Networks	claim
90	137	Evolutionary Approaches To Minimizing Network Coding Resources	claim
91	137	Combining Multihoming with Overlay Routing (or, How to Be a Better ISP without Owning a Network)	claim
92	136	On Scalability of Proximity-Aware Peer-to-Peer Streaming	claim
93	135	Exploring VoD in P2P Swarming Systems	claim
94	135	On the Extreme Parallelism Inside Next-Generation Network Processors	claim
95	134	Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks	claim
96	134	Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks	claim
97	133	Addressing Click Fraud in Content Delivery Systems	claim
98	132	Diagnosing Link-Level Anomalies Using Passive Probes	claim
99	132	Blocking in Reconfigurable Optical Networks	claim
100	131	On the Optimality and Interconnection of Valiant Load-Balancing Networks	claim
101	131	Anonymous Tracking Using RFID Tags	claim
102	131	Robust Geo-Routing on Embeddings of Dynamic Wireless Networks	claim
103	131	Experimental Measurement of the Capacity for VoIP Traffic in IEEE 802.11 WLANs	claim
104	130	On the Performance Analysis of Network-Coded Cooperation in Wireless Networks	claim
105	130	Availability in BitTorrent Systems	claim
106	130	Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts	claim
107	130	Acyclic Type of Relationships Between Autonomous Systems	claim
108	130	DEFT: Distributed Exponentially-Weighted Flow Splitting	claim
109	130	QoS-Driven Power Allocation Over Parallel Fading Channels With Imperfect Channel Estimations in Wireless Networks	claim
110	130	Optimal Pricing in a Free Market Wireless Network	claim
111	129	Geographic Routing Using Hyperbolic Space	claim
112	129	An Experimental Evaluation of Voice Quality Over the Datagram Congestion Control Protocol	claim
113	129	Mobility Reduces Uncertainty in MANETs	claim
114	129	Modeling Malware Propagation in Networks of Smart Cell Phones with Spatial Dynamics	claim
115	128	A Framework for Tiered Service in MPLS Networks	claim
116	128	Proactive Scan: Fast Handoff with Smart Triggers for 802.11 Wireless LAN	claim
117	128	Randomized Decentralized Broadcasting Algorithms	claim
118	128	Oblivious Routing with Mobile Fusion Centers over a Sensor Network	claim
119	127	CR Switch: A Load-Balanced Switch with Contention and Reservation	claim
120	127	A Framework for Multi-Objective SLA Compliance Monitoring	claim
121	126	Can Retransmissions of Superexponential Documents Cause Subexponential Delays?	claim
122	126	Using Low-Power Modes for Energy Conservation in Ethernet LANs	claim
123	126	Who Said That? Privacy at Link Layer	claim
124	125	Network Coding-Based Broadcast in Mobile Ad-hoc Networks	claim
125	125	Information Survival Threshold in Sensor and P2P Networks	claim
126	125	Hierarchical Cooperation Achieves Linear Capacity Scaling in Ad Hoc Networks	claim
127	124	On Unstructured File Sharing Networks	claim
128	124	Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming	claim
129	124	Optimal Rate-Reliability-Delay Tradeoff in Networks with Composite Links	claim
130	124	Distributed Placement of Service Facilities in Large-Scale Networks	claim
131	123	Revenue Focused Protection for VOD in DWDM Rings	claim
132	122	Detection and Localization of Network Black Holes	claim
133	122	On Optimal Physical Carrier Sensing: Theoretical Analysis and Protocol Design	claim
134	122	Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks	claim
135	122	Border Games in Cellular Networks	claim
136	121	Reliable Broadcast in Wireless Networks with Probabilistic Failures	claim
137	121	A Framework for Measuring and Predicting the Impact of Routing Changes	claim
138	121	Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks	claim
139	121	EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks	claim
140	121	Malicious Users in Unstructured Networks	claim
141	121	Iterative Scheduling Algorithms	claim
142	121	Optimizing File Availability in Peer-to-Peer Content Distribution	claim
143	120	A Cost-Based Evaluation of End-to-End Network Measurements in Overlay Multicast	claim
144	120	The Cache Inference Problem and its Application to Content and Request Routing	claim
145	120	Optimal-Complexity Optical Router	claim
146	119	Network Coding in a Multicast Switch	claim
147	119	Understanding VoIP from Backbone Measurements	claim
148	118	Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms	claim
149	118	Connectivity and Capacity of Multi-Channel Wireless Networks with Channel Switching Constraints	claim
150	118	Achievable Capacity Under the Interference Temperature Model	claim
151	118	Stream: Low Overhead Wireless Reprogramming for Sensor Networks	claim
152	117	Tree, Segment Table, and Route Bucket: A Multi-Stage Algorithm for IPv6 Routing Table Lookup	claim
153	117	Non-Cooperative Scheduling of Multiple Bag-of-Task Applications	claim
154	117	Toward Optimal Network Fault Correction via End-to-End Inference	claim
155	116	Routing with a Markovian Metric to Promote Local Mixing	claim
156	116	Multimodal Congestion Control for Low Stable-State Queuing	claim
157	116	Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks	claim
158	116	Limiting Sybil Attacks in Structured P2P Networks	claim
159	116	On the Performance of Multiple-Tree-Based Peer-to-Peer Live Streaming	claim
160	116	Bounds on the Gain of Network Coding and Broadcasting in Wireless Networks	claim
161	115	The Causal Factors Behind Internet Power-Law Connectivity	claim
162	115	Experimental Assessment of the Backoff Behavior of Commercial IEEE 802.11b Network Cards	claim
163	115	Attack Detection in Wireless Localization	claim
164	115	Target-Oriented Scheduling in Directional Sensor Networks	claim
165	114	Detecting Phantom Nodes in Wireless Sensor Networks	claim
166	114	Cooperative Strategies and Optimal Scheduling for Tree Networks	claim
167	113	G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay	claim
168	113	Stochastic Fluid Theory for P2P Streaming Systems	claim
169	113	On the Stability-Scalability Tradeoff of DHT Deployment	claim
170	113	Resilient Network Coding in the Presence of Byzantine Adversaries	claim
171	113	A Min-Plus System Interpretation of Bandwidth Estimation	claim
172	112	Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks	claim
173	112	Scalable Secure Bidirectional Group Communication	claim
174	112	End-to-End Inference of Router Packet Forwarding Priority	claim
175	111	Optimization Based Rate Control for Multicast with Network Coding	claim
176	111	Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations	claim
177	110	End-to-End Flow Fairness Over IEEE 802.11-Based Wireless Mesh Networks	claim
178	109	Routing, Anycast, and Multicast for Mesh and Sensor Networks	claim
179	109	A Proxy View of Quality of Domain Name Service	claim
180	108	How Optimal are Wireless Scheduling Protocols?	claim
181	108	Realistic Sensing Area Modeling	claim
182	108	Efficient, Fully Local Algorithms for CIOQ Switches	claim
183	107	Statistical Multiplexing Over DSL Networks	claim
184	107	Self-Adaptive On Demand Geographic Routing Protocols for Mobile Ad-hoc Networks	claim
185	107	Towards Topology Aware Networks	claim
186	106	On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic	claim
187	106	Lexicographic Fairness in WDM Optical Cross-Connects	claim
188	105	On Node Isolation Under Churn in Unstructured P2P Networks with Heavy-Tailed Lifetimes	claim
189	105	Gossiping with Multiple Messages	claim
190	104	Using Channel Hopping to Increase 802.11 Resilience to Jamming Attacks	claim
191	104	A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks	claim
192	104	A Distributed Policy Scheduling for Wireless Sensor Networks	claim
193	104	Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup	claim
194	103	When TCP Friendliness Becomes Harmful	claim
195	102	Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications	claim
196	102	Many-to-Many Communication: A New Approach for Collaboration in MANETs	claim
197	102	Mutual Anonymous Communications: A New Covert Channel Based on Splitting Tree MAC	claim
198	102	Ranking-Based Optimal Resource Allocation in Peer-to-Peer Networks	claim
199	102	Capacity Deficit in Mobile Wireless Ad Hoc Networks Due to Geographic Routing Overheads	claim
200	102	Scalability of Routing Tables in Wireless Networks	claim
201	99	Stochastic Analysis and Improvement of the Reliability of DHT-Based Multicast	claim
202	99	Queuing Delays in Randomized Load Balanced Networks	claim
203	98	Ad-hoc Localization in Urban District	claim
204	98	Path Selection and Multipath Congestion Control	claim
205	98	Fairness in Capacitated Networks: A Polyhedral Approach	claim
206	97	Neighborhood Watch for Internet Routing: Can We Improve the Robustness of Internet Routing Today?	claim
207	96	Stochastic Ordering for Internet Congestion Control and its Applications	claim
208	96	Toward Tractable Computation of the Capacity of Multi-Hop Wireless Networks	claim
209	96	Scalable and Reliable Sensor Network Routing: Performance Study from Field Deployment	claim
210	96	Multiple-Choice Random Network for Server Load Balancing	claim
211	95	Min-Cost Multicast of Selfish Information Flows	claim
212	95	Performance Evaluation of Scalable Congestion Control Schemes for Elastic Traffic in Cellular Networks with Power Control	claim
213	95	Constructions of Fault Tolerant Linear Compressors and Linear Decompressors	claim
214	95	Performance Comparison of Detection Schemes for MAC Layer Misbehavior	claim
215	94	Joint Optimal Channel Probing and Transmission in Collocated Wireless Networks	claim
216	94	Heavy-Traffic Delay Minimization in Bandwidth-Sharing Networks	claim
217	94	SmartTunnel: Achieving Reliability in the Internet	claim
218	94	PRIME: Peer-to-Peer Receiver-drIven MEsh-Based Streaming	claim
219	93	Congestion Control for Small Buffer High Speed Networks	claim
220	93	Point-Casting Service in Wireless Networks	claim
221	92	To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion	claim
222	91	Measurement-Based Self Organization of Interfering 802.11 Wireless Access Networks	claim
223	90	Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree	claim
224	90	QoS-Aware Streaming in Overlay Multicast Considering the Selfishness in Construction Action	claim
225	89	A Suite of Schemes for User-Level Network Diagnosis without Infrastructure	claim
226	89	Paging Mobile Users Efficiently and Optimally	claim
227	89	Low-Complexity Distributed Scheduling Algorithms for Wireless Networks	claim
228	88	Losing Opportunism: Evaluating Service Integration in an Opportunistic Wireless System	claim
229	87	Small Active Counters	claim
230	87	Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm	claim
231	86	Memory-Efficient Regular Expression Search Using State Merging	claim
232	85	Reverse Engineering TCP/IP-Like Networks Using Delay-Sensitive Utility Functions	claim
233	84	Fundamental Complexity of Optical Systems	claim
234	83	An Efficient Single-Transceiver CDMA-Based MAC Protocol for Wireless Networks	claim
235	83	Discrete Power Control: Cooperative and Non-Cooperative Optimization	claim
236	74	Preserving Area Coverage in Sensor Networks with a Realistic Physical Layer	claim
237	71	Residual-Based Measurement of Peer and Link Lifetimes in Gnutella Networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers