-
1
-
-
0021465991
-
Some complexity results about packet radio networks
-
E. Arikan, Some complexity results about packet radio networks, IEEE Trans. on Information Theory, vol. IT-30, pp. 456-461, 1984.
-
(1984)
IEEE Trans. on Information Theory
, vol.IT-30
, pp. 456-461
-
-
Arikan, E.1
-
2
-
-
0028378721
-
Making transmission schedules immune to topology changes in multihop packet radio networks
-
I. Chlamtac and A. Farago, Making transmission schedules immune to topology changes in multihop packet radio networks, IEEE/ACM Trans. on Networking, vol. 2, pp. 23-29, 1994.
-
(1994)
IEEE/ACM Trans. on Networking
, vol.2
, pp. 23-29
-
-
Chlamtac, I.1
Farago, A.2
-
3
-
-
0942300995
-
The minimum range assignment problem on linear radio networks
-
A. E. F. Clementi, A. Ferreira, P. Penna, S. Perennes, R. Silvestri, The minimum range assignment problem on linear radio networks, Algorithmica, vol. 35, pp. 95-110 2003.
-
(2003)
Algorithmica
, vol.35
, pp. 95-110
-
-
Clementi, A.E.F.1
Ferreira, A.2
Penna, P.3
Perennes, S.4
Silvestri, R.5
-
4
-
-
0033886879
-
Deterministic broadcasting in unknown radio networks
-
B. S. Chlebus, L. Gasienec, A. M. Gibbons, A. Pelec, and W. Ritter, Deterministic broadcasting in unknown radio networks, Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 861-870, 2000.
-
(2000)
Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA)
, pp. 861-870
-
-
Chlebus, B.S.1
Gasienec, L.2
Gibbons, A.M.3
Pelec, A.4
Ritter, W.5
-
5
-
-
0004116989
-
-
Prentice Hall (India) Pvt. Ltd., New Delhi
-
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, Prentice Hall (India) Pvt. Ltd., New Delhi, 1998.
-
(1998)
Introduction to Algorithms
-
-
Cormen, T.H.1
Leiserson, C.E.2
Rivest, R.L.3
-
6
-
-
84944051168
-
The power range assignment problem in radio networks on the plane
-
Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri, The power range assignment problem in radio networks on the plane, Proc. Symp. on Theoretical Aspects of Computer Science (STACS-00), pp. 651-660, 2000.
-
(2000)
Proc. Symp. on Theoretical Aspects of Computer Science (STACS-00)
, pp. 651-660
-
-
Clementi, A.E.F.1
Penna, P.2
Silvestri, R.3
-
7
-
-
0000786253
-
Spanning trees and spanners
-
Ed. J. R. Sack and J. Urrutia, Elsevier, New York
-
D. Eppstein, Spanning trees and spanners in Handbook of Computational Geometry, Ed. J. R. Sack and J. Urrutia, Elsevier, New York, 2000.
-
(2000)
Handbook of Computational Geometry
-
-
Eppstein, D.1
-
8
-
-
0025416483
-
Scheduling boardcasts in multi-hop radio networks
-
A. Ephemides and T. Truong, Scheduling boardcasts in multi-hop radio networks, IEEE Trans. on communications, vol. 30, pp. 456-461, 1990.
-
(1990)
IEEE Trans. on Communications
, vol.30
, pp. 456-461
-
-
Ephemides, A.1
Truong, T.2
-
9
-
-
0001857122
-
Power consumption in packet radio networks
-
L. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science, vol. 243, pp. 289-305, 2000.
-
(2000)
Theoretical Computer Science
, vol.243
, pp. 289-305
-
-
Kirousis, L.1
Kranakis, E.2
Krizanc, D.3
Pelc, A.4
-
10
-
-
0030407583
-
Optimal transmission ranges for mobile communication in linear multihop packet radio networks
-
R. Mathar and J. Mattfeldt, Optimal transmission ranges for mobile communication in linear multihop packet radio networks. Wireless Networks, vol. 2, pp. 329-342, 1996.
-
(1996)
Wireless Networks
, vol.2
, pp. 329-342
-
-
Mathar, R.1
Mattfeldt, J.2
-
11
-
-
0026222446
-
On the connectivity of radio networks
-
P. Piret, On the connectivity of radio networks, IEEE Trans. on Information Theory, vol. 37, pp. 1490-1492, 1991.
-
(1991)
IEEE Trans. on Information Theory
, vol.37
, pp. 1490-1492
-
-
Piret, P.1
-
13
-
-
35248824443
-
Power efficient range assignment in ad-hoc wireless networks
-
E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski, and Z. Alexander, Power Efficient Range Assignment in Ad-hoc Wireless Networks, Proc of the IEEE Wireless Communications and Networking Conference(WCNC), pp. 1889-1894, 2003.
-
(2003)
Proc of the IEEE Wireless Communications and Networking Conference(WCNC)
, pp. 1889-1894
-
-
Althaus, E.1
Calinescu, G.2
Mandoiu, I.3
Prasad, S.4
Tchervenski, N.5
Alexander, Z.6
-
14
-
-
0035789642
-
A probabilistic analysis for the range assignment problem in ad hoc networks
-
P.Santi, D.M.Blough, F.Vainstein, A Probabilistic Analysis for the Range Assignment Problem in Ad Hoc Networks, Proc. ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 212-220, 2001.
-
(2001)
Proc. ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
, pp. 212-220
-
-
Santi, P.1
Blough, D.M.2
Vainstein, F.3
|