|
1845
|
Dynamic source routing in ad hoc wireless networks
– David B. Johnson, David A. Maltz
- 1996
|
|
180
|
Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets
– Bevan Das, Vaduvur Bharghavan
- 1997
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
335
|
On the hardness of approximating minimization problems
– C Lund, M Yannakakis
- 1994
|
|
236
|
On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks
– Jie Wu, et al.
- 1999
|
|
33
|
A clusterbased approach for routing in ad hoc networks, in
– P Krishna, M Chatterjee, N H Vaidya, D K Pradhan
- 1995
|
|
91
|
Routing in Ad Hoc Networks Using a Spine
– Bevan Das, Raghupathy Sivakumar, Vaduvur Bharghavan
- 1997
|
|
41
|
Routing in Ad Hoc Networks Using a Virtual Backbone
– B Das, E Sivakumar, V Bhargavan
|
|
685
|
The Broadcast Storm Problem in a Mobile Ad Hoc Network
– S-Y Ni, Y-C Tseng, Y-S Chen, J-P Sheu
- 1999
|
|
137
|
Multipoint Relaying: An Efficient Technique for flooding in Mobile Wireless Networks
– Amir Qayyum, Laurent Viennot, Anis Laouiti
- 2000
|
|
184
|
Unit disk graphs
– B Clark, C Colbourn, D Johnson
- 1990
|
|
519
|
A Threshold of ln n for Approximating Set Cover
– Uriel Feige
- 1998
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
1221
|
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers
– Charles E. Perkins, Pravin Bhagwat
- 1994
|
|
57
|
A Routing Protocol for Packet Radio Networks
– Shree Murthy, J.J. Garcia-Luna-Aceves
- 1995
|
|
17
|
A threshold of ln n for approximating set-cover
– U Feige
- 1997
|
|
21
|
Improved approximation algorithms for the Steiner tree problem
– P Berman, V Ramaiyer
- 1994
|
|
120
|
A Distributed Routing Algorithm for Mobile Wireless Networks
– M Scott Corson, A Ephremides
- 1995
|
|
61
|
An Efficient Distributed Network-Wide Broadcast Algorithm for Mobile Ad Hoc Networks
– John Sucec, Ivan Marsic
- 2001
|
