An ad-hoc wireless network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. This type of network is of great importance in situations where it is very difficult to provide the necessary infrastructure, but it is a challenging task to enable fast and reliable communication within such a network. In this paper, we model and analyze the performance of so-called powercontrolled ad-hoc wireless networks: networks where the mobile hosts are able to change their transmission power. We concentrate on finding schemes for routing arbitrary permutations in these networks. In general, it is NP-hard even to find a n
|
272
|
Probabilistic construction of deterministic algorithms: approximating packing integer programs
– Raghavan
- 1988
|
|
174
|
A scheme for fast parallel communication
– Valiant
- 1982
|
|
112
|
ALOHA packet system with and without slots and capture
– Roberts
- 1975
|
|
104
|
A perspective on multiaccess channels
– Gallager
- 1985
|
|
92
|
Making Transmission Schedules Immune to Topology Changes in Multi-Hop Packet Radio Networks
– Chlamtac, Farago
- 1994
|
|
87
|
Power consumption in packet radio networks
– Kirousis, Kranakis, et al.
|
|
86
|
Distributed assignment algorithms for multihop packet radio networks
– Cidon, Sidi
- 1989
|
|
75
|
Universal packet routing algorithms
– Leighton, Maggs, et al.
- 1988
|
|
74
|
Protocols for adaptive wireless and mobile networking
– Johnson, Maltz
- 1996
|
|
69
|
A lower bound for radio broadcast
– Alon, Bar-Noy, et al.
- 1991
|
|
66
|
Stochastic power control for cellular radio systems
– Ulukus, Yates
- 1998
|
|
58
|
A Mobile Host Protocol Supporting Route Optimization and Authentication
– Myles, Johnson, et al.
- 1995
|
|
57
|
Medium Access Control of Wireless LANs for Mobile Computing
– Chen
- 1994
|
|
56
|
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
– Bar-Yehuda, Goldreich, et al.
- 1992
|
|
55
|
Weinstein The wave expansion approach to broadcasting in multihop radio networks
– Chlamtac
- 1987
|
|
54
|
A New Model for Scheduling Packet Radio Networks
– Sen, Huson
- 1997
|
|
52
|
On broadcasting in radio networks - Problem analysis and protocol design
– Chlamtac, Kutten
- 1985
|
|
46
|
Distributed packet switching in arbitrary networks
– Rabani, Tardos
- 1996
|
|
45
|
öcking. Universal algorithms for store-andforward and wormhole routing
– Cypher, Heide, et al.
- 1996
|
|
42
|
Routing permutations on graphs via matchings
– Alon, Chung, et al.
- 1994
|
|
36
|
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
– Chlamtac, Pinter
- 1987
|
|
35
|
Multiple communication in multi-hop radio networks
– Bar-Yehuda, Israeli, et al.
- 1993
|
|
35
|
Broadcast in radio networks
– Gaber, Mansour
- 1995
|
|
32
|
Asymptotically tight bounds for computing with faulty arrays of processors
– Kaklamanis, Karlin, et al.
- 1990
|
|
31
|
Routing in Ad Hoc Networks Using a Virtual Backbone
– Das, Sivakumar, et al.
- 1997
|
|
29
|
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
– Dolev, Kranakis, et al.
- 1999
|
|
29
|
Lower bounds for the broadcast problem in mobile radio networks
– Bruschi, Pinto
- 1997
|
|
19
|
On the connectivity of radio networks
– Piret
- 1991
|
|
17
|
Robust algorithms for packet routing in a mesh
– Raghavan
- 1989
|
|
11
|
A Distributed Evolutionary Algorithm for Reorganizing Network Communications
– Post, Kershenbaum, et al.
- 1985
|
|
6
|
The time complexity of deterministic broadcast radio networks
– Hwang
- 1995
|
|
6
|
Congestion relief on power-controlled CDMA networks
– Jacobsmeyer
- 1996
|
|
6
|
Asymptotically optimal gossiping in radio networks
– Ravishankar, Singh
- 1995
|
|
4
|
Deterministic routing with bounded buffers: Turning offline into online protocols
– Heide, Scheideler
- 1996
|
|
4
|
Distributed packet switching in arbitrary networks
– Tardos
- 1996
|
|
3
|
A robust multi-priority topology-independent transmission schedule for packet radio networks
– Boztas
- 1995
|
|
2
|
Recon arrays with random faults
– Cole, Maggs, et al.
- 1997
|
|
2
|
An \Omega\Gamma D log(N=D)) lower bound for broadcast in radio networks
– Kushilevitz, Mansour
- 1993
|
|
1
|
Reconfiguringarrays with random faults
– Cole, Maggs, et al.
- 1997
|
|
1
|
Asymptoticallyoptimal gossiping in radio networks
– Ravishankar, Singh
- 1995
|
|
