INFOCOM 2003 - PDF Preprint Papers

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

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed INFOCOM-2003 Paper

click to vote

INFOCOM
2003
IEEE

454views Communications» more INFOCOM 2003»

Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks

14 years 5 months ago

Download www.ieee-infocom.org

Abstract— As mobile ad hoc network applications are deployed, security emerges as a central requirement. In this paper, we introduce the wormhole attack, a severe attack in ad ho...

Yih-Chun Hu, Adrian Perrig, David B. Johnson

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	454	Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks	claim
2	285	An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks	claim
3	246	On-demand Power Management for Ad Hoc Networks	claim
4	232	Optimal Energy Allocation for Delay-Constrained Data Transmission over a Time-Varying Channel	claim
5	224	IMPORTANT: A framework to systematically analyze the Impact of Mobility on Performance of RouTing protocols for Adhoc NeTworks	claim
6	210	An Analytical Study of a Tradeoff Between Transmission Power and FEC for TCP Optimization in Wireless Networks	claim
7	201	An approach to alleviate link overload as observed on an IP backbone	claim
8	201	Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks	claim
9	200	Power Controlled Dual Channel (PCDC) Medium Access Protocol for Wireless Ad Hoc Networks	claim
10	199	Dynamic Power Allocation and Routing for Time Varying Wireless Networks	claim
11	198	Network Layer Support for Service Discovery in Mobile Ad Hoc Networks	claim
12	198	Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad hoc Networks	claim
13	196	Associative Search in Peer to Peer Networks: Harnessing Latent Semantics	claim
14	192	A Dynamic RWA Algorithm in a Wavelength-Routed All-Optical Network with Wavelength Converters	claim
15	191	A scalable and lightweight QoS monitoring technique combining passive and active approaches: On the mathematical formulation of CoMPACT Monitor	claim
16	190	IP-Subnet Aware Routing in WDM Mesh Networks	claim
17	184	Design and Analysis of an MST-Based Topology Control Algorithm	claim
18	181	Network Design For Rate Adaptive Media Streams	claim
19	179	An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlays	claim
20	179	Pricing strategies under heterogeneous service requirements	claim
21	176	Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking	claim
22	175	Congestion Control Policies for IP-based CDMA Radio Access Networks	claim
23	174	Understanding TCP fairness over Wireless LAN	claim
24	173	Modeling Malware Spreading Dynamics	claim
25	169	Dynamic Load Balancing Through Coordinated Scheduling in Packet Data Systems	claim
26	169	A Bandwidth Guaranteed Polling MAC Protocol for Ethernet Passive Optical Networks	claim
27	168	Capacity, Delay and Mobility in Wireless Ad-Hoc Networks	claim
28	166	Minimizing Request Blocking in All-Optical Rings	claim
29	164	Exploiting Multiuser Diversity for Medium Access Control in Wireless Networks	claim
30	163	Stability and Convergence of TCP-like Congestion Controllers in a Many-Flows Regime	claim
31	163	Optimal Quality Adaptation for MPEG-4 Fine-Grained Scalable Video	claim
32	163	Delay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy	claim
33	162	Detecting Network Intrusions via Sampling: A Game Theoretic Approach	claim
34	162	Local Scheduling Policies in Networks of Packet Switches with Input Queues	claim
35	162	Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations	claim
36	161	Distributed Admission Control to Support Guaranteed Services in Core-Stateless Networks	claim
37	160	Flow Level Simulation of Large IP Networks	claim
38	160	Integrity for Virtual Private Routed Networks	claim
39	160	Optimal Partition of QoS Requirements for Many-to-Many Connections	claim
40	159	Long-Term Forecasting of Internet Backbone Traffic: Observations and Initial Models	claim
41	158	Flow Aggregation for Enhanced TCP over Wide Area Wireless	claim
42	158	Sensor-Centric Quality of Routing in Sensor Networks	claim
43	157	An FDD Wideband CDMA MAC Protocol for Wireless Multimedia Networks	claim
44	156	The Impact of Multihop Wireless Channel on TCP Throughput and Loss	claim
45	156	Internet Quarantine: Requirements for Containing Self-Propagating Code	claim
46	156	Energy Efficient Routing in Ad Hoc Disaster Recovery Networks	claim
47	155	Resource Optimization of Spatial TDMA in Ad Hoc Radio Networks: A Column Generation Approach	claim
48	154	A Framework for Incremental Deployment Strategies for Router-Assisted Services	claim
49	154	A Unifying Passivity Framework for Network Flow Control	claim
50	153	Algorithms for Computing QoS Paths with Restoration	claim
51	153	Distributed Queueing in Scalable High Performance Routers	claim
52	153	Static and Dynamic Analysis of the Internet's Susceptibility to Faults and Attacks	claim
53	153	Target-Pursuing Policies for Open Multiclass Queueing Networks	claim
54	153	A Framework for Reliable Routing in Mobile Ad Hoc Networks	claim
55	152	Design of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks	claim
56	151	S-MIP: A Seamless Handoff Architecture for Mobile IP	claim
57	151	On the Capacity of Hybrid Wireless Networks	claim
58	150	A Novel Mechanism for Contention Resolution in HFC Networks	claim
59	150	Optimizing Route-Cache Lifetime in Ad Hoc Networks	claim
60	150	Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks	claim
61	150	MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN	claim
62	150	Modelling the Blocking Behavior of Multicast Clos Networks	claim
63	150	On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks	claim
64	150	Integrating effective-bandwidth-based QoS routing and best effort routing	claim
65	149	Input Queued Switches: Cell Switching vs. Packet Switching	claim
66	149	Power Constrained and Delay Optimal Policies for Scheduling Transmission over a Fading Channel	claim
67	148	A Distributed and Adaptive Signal Processing Approach to Reducing Energy Consumption in Sensor Networks	claim
68	148	Spectral Analysis of Internet Topologies	claim
69	148	Opportunistic Fair Scheduling over Multiple Wireless Channels	claim
70	148	Can Shortest-path Routing and TCP Maximize Utility	claim
71	147	Graph Wavelets for Spatial Traffic Analysis	claim
72	145	Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations	claim
73	145	Integration of 802.11 and Third-Generation Wireless Data Networks	claim
74	145	Time-Optimal Network Queue Control: The Case of a Single Congested Node	claim
75	145	Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity	claim
76	145	Analysis on Packet Resequencing for Reliable Network Protocols	claim
77	145	Topology Inference in the Presence of Anonymous Routers	claim
78	145	Sensor Deployment and Target Localization Based on Virtual Forces	claim
79	144	A new TCP/AQM for Stable Operation in Fast Networks	claim
80	142	Providing Guaranteed Rate Services in the Load Balanced Birkhoff-von Neumann Switches	claim
81	142	Adaptive Data Structures for IP Lookups	claim
82	141	Analysis of Routing Characteristics in the Multicast Infrastructure	claim
83	140	Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency	claim
84	139	Physical Topology Discovery for Large Multi-Subnet Networks	claim
85	139	Broadcasting in Ad Hoc Networks Based on Self-Pruning	claim
86	138	Protection Mechanisms for Optical WDM Networks based on Wavelength Converter	claim
87	138	Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks	claim
88	138	Distributed Network Monitoring with Bounded Link Utilization in IP Networks	claim
89	138	Receiver-Driven Bandwidth Sharing for TCP	claim
90	138	Server-based Inference of Internet Link Lossiness	claim
91	138	Big-Bang Simulation for embedding network distances in Euclidean space	claim
92	137	Performance anomaly of 802.11b	claim
93	137	The AWG\|\|PSC Network: A Performance Enhanced Single-Hop WDM Network with Heterogeneous Protection	claim
94	137	Ad Hoc Positioning System (APS) Using AOA	claim
95	136	Exploring the trade-off between label size and stack depth in MPLS Routing	claim
96	136	Load Balancing and Stability Issues in Algorithms for Service Composition	claim
97	135	Stabilized Vegas	claim
98	134	Nash equilibria of a generic networking game with applications to circuit-switched networks	claim
99	134	Sampling Biases in IP Topology Measurements	claim
100	134	Statistical Per-Flow Service Bounds in a Network with Aggregate Provisioning	claim
101	134	Exploiting Wireless Channel State Information for Throughput Maximization	claim
102	132	On the Intrinsic Locality Properties of Web Reference Streams	claim
103	132	On Bandwidth Efficiency of the Hose Resource Management Model in Virtual Private Networks	claim
104	132	Pseudo Likelihood Estimation in Network Tomography	claim
105	132	EMPOWER: A Network Emulator for Wireless and Wireline Networks	claim
106	131	Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks	claim
107	131	Localized minimum-energy broadcasting in ad-hoc networks	claim
108	131	Modeling the Spread of Active Worms	claim
109	131	On Multicast Trees: Structure and Size Estimation	claim
110	130	A Multicast Transmission Schedule for Scalable Multi-Rate Distribution of Bulk Data Using Non-Scalable Erasure-Correcting Codes	claim
111	130	Large-scale Data Collection: a Coordinated Approach	claim
112	130	Smooth Multirate Multicast Congestion Control	claim
113	129	Evaluation of an Adaptive Transport Protocol	claim
114	129	Goodput Analysis of a Fluid Queue with Selective Discarding and a Responsive Bursty Source	claim
115	129	Optimal Bandwidth Reservation Schedule in Cellular Network	claim
116	129	Core-stateless Guaranteed Throughput Networks	claim
117	129	Uplink Scheduling in CDMA Packet-Data Systems	claim
118	127	A State Feedback Control Approach to Stabilizing Queues for ECN-Enabled TCP Connections	claim
119	127	Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection	claim
120	127	The effect of layer-2 store-and-forward devices on per-hop capacity estimation	claim
121	127	Pricing Network Services	claim
122	125	On-line Tuning of Prices for Network Services	claim
123	125	The Impact of Correlated Link Weights on QoS Routing	claim
124	125	Analysis of a single-wavelength optical buffer	claim
125	125	Path Diversity with Forward Error Correction (PDF) System for Delay Sensitive Applications over the Internet	claim
126	125	End-to-End Congestion Control for InfiniBand	claim
127	125	Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows	claim
128	125	Random Waypoint Considered Harmful	claim
129	124	Measuring Bottleneck Bandwidth of Targeted Path Segments	claim
130	124	Multipoint-to-Point Session Fairness in the Internet	claim
131	124	Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays	claim
132	123	FPQ : A Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet	claim
133	122	Using Switched Delay Lines for Exact Emulation of FIFO Multiplexers with Variable Length Bursts	claim
134	122	TCP-LP: A Distributed Algorithm for Low Priority Data Transfer	claim
135	122	Robust Location Detection in Emergency Sensor Networks	claim
136	122	Internet Traffic Modeling and Future Technology Implications	claim
137	121	Computing the Types of the Relationships between Autonomous Systems	claim
138	121	A Queueing Network Model of an Edge Optical Burst Switching Node	claim
139	121	Efficient Channel Scheduling Algorithms in Optical Burst Switching Networks	claim
140	120	Downlink Admission/Congestion Control and Maximal Load in CDMA Networks	claim
141	120	Robust Monitoring of Link Delays and Faults in IP Networks	claim
142	120	MPLS over WDM Network Design with Packet Level QoS Constraints based on ILP Models	claim
143	120	Chaotic Maps as Parsimonious Bit Error Models of Wireless Channels	claim
144	120	Efficient QoS Routing	claim
145	120	Cooperation in Wireless Ad Hoc Networks	claim
146	120	Turning Heterogeneity into an Advantage in Overlay Routing	claim
147	119	Performance Evaluation of Wavelength Band Switching in Multi-fiber All-Optical Networks	claim
148	119	Modeling Peer-Peer File Sharing Systems	claim
149	118	Scheduling reserved traffic in input-queued switches: New delay bounds via probabilistic techniques	claim
150	118	Non-Uniform Waveband Hierarchy in Hybrid Optical Networks	claim
151	117	Estimation of Congestion Price Using Probabilistic Packet Marking	claim
152	117	On the Stability of Adaptive Routing in the Presence of Congestion Control	claim
153	117	Power Control and Clustering in Ad Hoc Networks	claim
154	117	On Guaranteed Smooth Scheduling For Input-Queued Switches	claim
155	117	The Impact of Space Division Multiplexing on Resource Allocation: A Unified Approach	claim
156	117	Energy-Efficient Collision Resolution in Wireless Ad-Hoc Networks	claim
157	116	User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks	claim
158	116	Adaptive joint playout buffer and FEC adjustement for Internet Telephony	claim
159	116	Measurement-Based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems	claim
160	115	A Utility-Based Congestion Control Scheme for Internet-Style Networks with Delay	claim
161	115	Oblivious AQM and Nash Equilibria	claim
162	115	Probing strategies for distributed admission control in large and small scale systems	claim
163	115	Dynamic Layering and Bandwidth Allocation for Multi-Session Video Broadcasting with General Utility Functions	claim
164	115	Behavior of Distributed Wavelength Provisioning in Wavelength-Routed Networks with Partial Wavelength Conversion	claim
165	114	Load optimal MPLS routing with N+M labels	claim
166	114	Packet Classification for Core Routers: Is there an alternative to CAMs?	claim
167	114	Unreliable Sensor Grids: Coverage, Connectivity and Diameter	claim
168	114	Prophet Address Allocation for Large Scale MANETs	claim
169	113	Closed Loop Analysis of the Bottleneck Buffer under Adaptive Window Controlled Transfer of HTTP-Like Traffic	claim
170	112	Fast Incremental Updates for Pipelined Forwarding Engines	claim
171	112	Simplification of Network Analysis in Large-Bandwidth Systems	claim
172	112	An information theoretic view of network management	claim
173	112	Time Sliced Optical Burst Switching	claim
174	112	Effective Throughput: A Unified Benchmark for Pilot-Aided OFDM/SDMA Wireless Communication Systems	claim
175	111	Efficient Routing and Wavelength Assignment for Reconfigurable WDM Networks with Wavelength Converters	claim
176	110	Improving Web Performance in Broadcast-Unicast Networks	claim
177	110	Improved BGP Convergence via Ghost Flushing	claim
178	110	Stability of Multipacket Slotted Aloha with Selfish Users and Perfect Information	claim
179	109	Optimal replacement policies for non-uniform cache objects with optional eviction	claim
180	109	Kalman Filter Estimation of the Number of Competing Terminals in an IEEE 802.11 network	claim
181	109	Measuring performance of ad hoc networks using timescales for information flow	claim
182	109	Impact of Interferences on Connectivity in Ad Hoc Networks	claim
183	108	CoolCAMs: Power-Efficient TCAMs for Forwarding Engines	claim
184	107	Cooperative Peer Groups in NICE	claim
185	106	Distributed Construction of Random Expander Networks	claim
186	106	Understanding CHOKe	claim
187	106	An Efficient Scheduling Algorithm for CIOQ Switches with Space-Division Multiplexing Expansion	claim
188	105	Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems	claim
189	104	Cache Satellite Distribution Systems: Modeling and Analysis	claim
190	104	Responding to Spurious Timeouts in TCP	claim
191	103	YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology	claim
192	102	The Waiting Time Distribution for a TDMA Model with a Finite Buffer	claim
193	101	Provisioning IP Backbone Networks to Support Latency Sensitive Traffic	claim
194	101	MNCM a new class of efficient scheduling algorithms for input-buffered switches with no speedup	claim
195	100	Joint power and handoff control using a hybrid systems framework	claim
196	100	Instability Phenomena in Underloaded Packet Networks with QoS Schedulers	claim
197	99	cing: Measuring Network-Internal Delays using only Existing Infrastructure	claim
198	99	Unresponsive Flows and AQM Performance	claim
199	98	Optimal Configuration for BGP Route Selection	claim
200	98	A Petabit Photonic Packet Switch (P3S)	claim
201	98	Stochastic Traffic Engineering, with Applications to Network Revenue Management	claim
202	95	A Stochastic Model of TCP and Fair Video Transmission	claim
203	94	Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications	claim
204	85	Interaction of TCP Flows as Billiards	claim
205	80	Precomputation for Multi-constrained QoS Routing in High-speed Networks	claim
206	80	ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers