INFOCOM 2005 - PDF Preprint Papers

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

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed INFOCOM-2005 Paper

click to vote

INFOCOM
2005
IEEE

240views Communications» more INFOCOM 2005»

Joint congestion control and media access control design for ad hoc wireless networks

14 years 5 months ago

Download netlab.caltech.edu

Abstract— We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix,...

Lijun Chen, Steven H. Low, John C. Doyle

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	240	Joint congestion control and media access control design for ad hoc wireless networks	claim
2	224	Farsighted users harness network time-diversity	claim
3	205	Packetostatics: deployment of massively dense sensor networks as an electrostatics problem	claim
4	204	Gossip algorithms: design, analysis and applications	claim
5	204	A disconnection-tolerant transport for drive-thru Internet environments	claim
6	193	Achieving minimum-cost multicast: a decentralized approach based on network coding	claim
7	189	Anonymous communications in mobile ad hoc networks	claim
8	183	CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming	claim
9	182	rDCF: a relay-enabled medium access control protocol for wireless ad hoc networks	claim
10	180	BARD: Bayesian-assisted resource discovery in sensor networks	claim
11	177	On achieving optimal throughput with network coding	claim
12	175	Assisted peer-to-peer search with partial indexing	claim
13	175	RID: radio interference detection in wireless sensor networks	claim
14	173	Asymptotically optimal transmission policies for low-power wireless sensor networks	claim
15	170	SMART: a scan-based movement-assisted sensor deployment method in wireless sensor networks	claim
16	164	Time and energy complexity of distributed computation in wireless sensor networks	claim
17	164	Credit based fair scheduling for packet switched networks	claim
18	163	The effect of DNS delays on worm propagation in an IPv6 Internet	claim
19	162	FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs	claim
20	162	Optimal fixed and scalable energy management for wireless networks	claim
21	161	HADOF: defense against routing disruptions in mobile ad hoc networks	claim
22	160	Perfect simulation and stationarity of a class of mobility models	claim
23	158	Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks	claim
24	158	A distributed adaptive cache update algorithm for the dynamic source routing protocol	claim
25	157	Optimal utility based multi-user throughput allocation subject to throughput constraints	claim
26	152	Spoofing prevention method	claim
27	150	Achieving faster access to satellite link bandwidth	claim
28	149	Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network	claim
29	148	Bayesian indoor positioning systems	claim
30	148	Optimal ISP subscription for Internet multihoming: algorithm design and implication analysis	claim
31	147	Fast replication in content distribution overlays	claim
32	146	Localization for anisotropic sensor networks	claim
33	145	Power control for OSNR optimization in optical networks: a distributed algorithm via a central cost approach	claim
34	145	Improving VoIP quality through path switching	claim
35	144	Network coding for large scale content distribution	claim
36	144	Heterogeneity and load balance in distributed hash tables	claim
37	144	Joint optimal scheduling and routing for maximum network throughput	claim
38	144	The impact of imperfect scheduling on cross-layer rate control in wireless networks	claim
39	143	An analytic framework for modeling peer to peer networks	claim
40	143	A calculus approach to minimum energy transmission policies with quality of service guarantees	claim
41	142	PEER: a progressive energy efficient routing protocol for wireless ad hoc networks	claim
42	141	On neighbor discovery in wireless networks with directional antennas	claim
43	140	Energy optimal control for time varying wireless networks	claim
44	140	Multicast capacity of packet-switched ring WDM networks	claim
45	139	Differentiated bandwidth sharing with disparate flow sizes	claim
46	138	Topology aware overlay networks	claim
47	138	Routing in ad hoc networks: a theoretical framework with practical implications	claim
48	136	Spatial energy balancing in large-scale wireless multihop networks	claim
49	136	Dependency isolation for thread-based multi-tier Internet services	claim
50	135	Delayed-dictionary compression for packet networks	claim
51	134	Fairness and optimal stochastic control for heterogeneous networks	claim
52	133	Distributed querying of Internet distance information	claim
53	133	Failure inferencing based fast rerouting for handling transient link and node failures	claim
54	132	Fairness in MIMD congestion control algorithms	claim
55	132	Minimum energy accumulative routing in wireless networks	claim
56	132	MiNT: a miniaturized network testbed for mobile wireless research	claim
57	132	Bayesian packet loss detection for TCP	claim
58	132	Link scheduling in sensor networks: distributed edge coloring revisited	claim
59	131	A beacon-less location discovery scheme for wireless sensor networks	claim
60	131	Smart power-saving mode for IEEE 802.11 wireless LANs	claim
61	131	dPAM: a distributed prefetching protocol for scalable asynchronous multicast in P2P systems	claim
62	131	Interference-aware routing in multihop wireless networks using directional antennas	claim
63	130	Provably competitive adaptive routing	claim
64	130	Modelling and stability of FAST TCP	claim
65	130	Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach	claim
66	129	A performance vs. cost framework for evaluating DHT design tradeoffs under churn	claim
67	129	Downlink beamforming algorithms with inter-cell interference in cellular networks	claim
68	129	Exploiting heterogeneity in sensor networks	claim
69	127	A fair resource allocation algorithm for peer-to-peer overlays	claim
70	127	FIT: fast Internet traceback	claim
71	125	On the interaction between overlay routing and underlay routing	claim
72	125	TCAM-based distributed parallel packet classification algorithm with range-matching solution	claim
73	125	On failure detection algorithms in overlay networks	claim
74	124	On the effectiveness of DDoS attacks on statistical filtering	claim
75	124	Distributed, secure load balancing with skew, heterogeneity and churn	claim
76	124	Non-pipelined relay improves throughput performance of wireless ad-hoc networks	claim
77	122	A cost-based analysis of overlay routing geometries	claim
78	122	Hybrid search schemes for unstructured peer-to-peer networks	claim
79	122	SyncScan: practical fast handoff for 802.11 infrastructure networks	claim
80	121	Practical algorithms for performance guarantees in buffered crossbars	claim
81	121	A study of analyzing network traffic as images in real-time	claim
82	120	A comparative study of multicast protocols: top, bottom, or in the middle?	claim
83	120	Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS	claim
84	119	Design and implementation of network puzzles	claim
85	119	Practical routing-layer support for scalable multihoming	claim
86	119	A measurement study of Internet bottlenecks	claim
87	119	ECHOS - enhanced capacity 802.11 hotspots	claim
88	118	Cross-layer design for lifetime maximization in interference-limited wireless sensor networks	claim
89	118	A new admission control scheme under energy and QoS constraints for wireless networks	claim
90	117	Intentional dropping: a novel scheme for SYN flooding mitigation	claim
91	117	A QoS-aware AIMD protocol for time-sensitive applications in wired/wireless networks	claim
92	117	The effect of network topology on the spread of epidemics	claim
93	117	Classification of access network types: Ethernet wireless LAN, ADSL, cable modem or dialup?	claim
94	117	Bounding the power rate function of wireless ad hoc networks	claim
95	116	Pricing and revenue sharing strategies for Internet service providers	claim
96	115	PIKE: peer intermediaries for key establishment in sensor networks	claim
97	115	Exploiting diversity to enhance multimedia streaming over cellular links	claim
98	115	Analysis of alternating-priority queueing models with (cross) correlated switchover times	claim
99	115	Dynamic node activation in networks of rechargeable sensors	claim
100	114	IPStash: a set-associative memory approach for efficient IP-lookup	claim
101	114	A quantitative study of authentication and QoS in wireless IP networks	claim
102	114	Connection admission control for flow level QoS in bufferless models	claim
103	113	Random-access scheduling with service differentiation in wireless networks	claim
104	112	Power aware routing for sensor databases	claim
105	112	GPS free coordinate assignment and routing in wireless sensor networks	claim
106	112	Power assignment for k-connectivity in wireless ad hoc networks	claim
107	110	TCP vs. TCP: a systematic study of adverse impact of short-lived TCP flows on long-lived TCP flows	claim
108	109	Mobile-assisted localization in wireless sensor networks	claim
109	108	Design multicast protocols for non-cooperative networks	claim
110	107	The one-to-many TCP overlay: a scalable and reliable multicast architecture	claim
111	107	Limiting path exploration in BGP	claim
112	107	Network localization in partially localizable networks	claim
113	106	SCOPE: scalable consistency maintenance in structured P2P systems	claim
114	105	Monotone percolation and the topology control of wireless networks	claim
115	103	Designing wireless radio access networks for third generation cellular networks	claim
116	102	Low-state fairness: lower bounds and practical enforcement	claim
117	102	Avoiding transient loops during IGP convergence in IP networks	claim
118	102	Relevance of massively distributed explorations of the Internet topology: simulation results	claim
119	101	Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control	claim
120	101	Asymptotically optimal power-aware routing for multihop wireless networks with renewable energy sources	claim
121	101	Optical switching networks with minimum number of limited range wavelength converters	claim
122	101	On static reachability analysis of IP networks	claim
123	100	Spatial-temporal analysis of passive TCP measurements	claim
124	100	The impact of network variabilities on TCP clocking schemes	claim
125	100	Analysis and modeling of MPEG-4 and H.264 multi-layer video traffic	claim
126	100	Pitfalls in the fluid modeling of RTT variations in window-based congestion control	claim
127	99	Impact of power control on the performance of ad hoc wireless networks	claim
128	99	On the maximal throughput of networks with finite buffers and its application to buffered crossbars	claim
129	99	Network equilibrium of heterogeneous congestion control protocols	claim
130	98	Pricing differentiated Internet services	claim
131	98	A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm	claim
132	97	Optimizing cost-sensitive trust-negotiation protocols	claim
133	97	Efficient and scalable query routing for unstructured peer-to-peer networks	claim
134	97	Economics of network pricing with multiple ISPs	claim
135	96	Designing incentives for peer-to-peer routing	claim
136	96	Mobile multi-layered IPsec	claim
137	96	Cooperation and decision-making in a wireless multi-provider setting	claim
138	95	MV routing and capacity building in disruption tolerant networks	claim
139	95	Relating two formal models of path-vector routing	claim
140	95	Multipath routing for multiple description video in wireless ad hoc networks	claim
141	95	Capturing accurate snapshots of the Gnutella network	claim
142	95	Defending against Internet worms: a signature-based approach	claim
143	93	Exchange power management for mobile ad hoc networks	claim
144	93	Improved single-round protocols for remote file synchronization	claim
145	93	New insights from a fixed point analysis of single cell IEEE 802.11 WLANs	claim
146	93	Distributed algorithms for secure multipath routing	claim
147	93	Joint mobility and routing for lifetime elongation in wireless sensor networks	claim
148	93	Sensor relocation in mobile sensor networks	claim
149	93	Network overlay construction under limited end-to-end reachability	claim
150	92	Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas	claim
151	92	Reduction of quality (RoQ) attacks on Internet end-systems	claim
152	91	Secure positioning of wireless devices with application to sensor networks	claim
153	91	Measurement-based multipath multicast	claim
154	91	A dynamic adaptive acknowledgment strategy for TCP over multihop wireless networks	claim
155	90	Pollution in P2P file sharing systems	claim
156	90	Non-uniform random membership management in peer-to-peer networks	claim
157	89	Flow control as stochastic optimal control problem with incomplete information	claim
158	89	DotSlash: handling Web hotspots at dynamic content Web sites	claim
159	88	Online time-constrained scheduling in linear networks	claim
160	88	Predicting Internet end-to-end delay: a multiple-model approach	claim
161	87	Buffer sizing for congested Internet links	claim
162	87	FRR: a proportional and worst-case fair round robin scheduler	claim
163	86	Localized fault-tolerant event boundary detection in sensor networks	claim
164	85	GLIDER: gradient landmark-based distributed routing for sensor networks	claim
165	85	Understanding XCP: equilibrium and fairness	claim
166	84	Optimal load-balancing	claim
167	82	Optimal peer selection for P2P downloading and streaming	claim
168	81	An efficient mechanism of TCP-Vegas on mobile IP networks	claim
169	75	What signals do packet-pair dispersions carry?	claim
170	70	Throughput-storage tradeoff in ad hoc networks	claim
171	69	Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput	claim
172	69	TCP-Africa: an adaptive and fair rapid increase rule for scalable TCP	claim
173	68	Location management for PCS networks with consideration of mobility patterns	claim
174	68	Distributed optimal contention window control for elastic traffic in wireless LANs	claim
175	60	Virtual mobility control domain for enhancements of mobility protocols	claim
176	58	Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers