TON 2002 - PDF Preprint Papers

TON 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TON-2002 Paper

click to vote

TON
2002

189views more TON 2002»

Mobility increases the capacity of ad hoc wireless networks

13 years 4 months ago

Download www.eecs.berkeley.edu

Abstract--The capacity of ad hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad hoc network where ...

Matthias Grossglauser, David N. C. Tse

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	189	Mobility increases the capacity of ad hoc wireless networks	claim
2	175	Compressed bloom filters	claim
3	170	The BLUE active queue management algorithms	claim
4	148	Internet pricing with a game theoretical approach: concepts and examples	claim
5	144	Algorithms for provisioning virtual private networks in the hose model	claim
6	138	Single-packet IP traceback	claim
7	138	Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet	claim
8	125	Multicast-based inference of network-internal delay distributions	claim
9	123	Utility-based rate control in the Internet for elastic traffic	claim
10	117	Generalized loop-back recovery in optical mesh networks	claim
11	116	Managing capacity for telecommunications networks under uncertainty	claim
12	114	Dynamic parallel access to replicated content in the internet	claim
13	112	Pricing in multiservice loss networks: static pricing, asymptotic optimality, and demand substitution effects	claim
14	109	Coordinated multihop scheduling: a framework for end-to-end services	claim
15	102	A min, + system theory for constrained traffic regulation and dynamic service guarantees	claim
16	99	Computing shortest paths for any number of hops	claim
17	99	Beyond folklore: observations on fragmented traffic	claim
18	94	Multicast routing and wavelength assignment in multihop optical networks	claim
19	93	Static and dynamic approaches to modeling end-to-end routing in circuit-switched networks	claim
20	91	Resource management with hoses: point-to-cloud services for virtual private networks	claim
21	91	The stable paths problem and interdomain routing	claim
22	86	Efficient randomized web-cache replacement schemes using samples from past eviction times	claim
23	85	The impact of point-to-multipoint traffic concentration on multirate networks design	claim
24	85	Scalable flow control for multicast ABR services in ATM networks	claim
25	83	MLSR: a novel routing algorithm for multilayered satellite IP networks	claim
26	83	Heuristic algorithms for multiconstrained quality-of-service routing	claim
27	82	On multicast flow control for heterogeneous receivers	claim
28	82	Lexicographically optimal balanced networks	claim
29	81	Robust rate control for integrated services packet networks	claim
30	79	A multicast routing algorithm for LEO satellite IP networks	claim
31	77	Packet-mode scheduling in input-queued cell-based switches	claim
32	76	Some properties of variable length packet shapers	claim
33	75	Optimal retrial and timeout strategies for accessing network resources	claim
34	75	Concurrent round-robin-based dispatching schemes for Clos-network switches	claim
35	65	Switching using parallel input-output queued switches with no speedup	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers