DocumentCode :
1098724
Title :
On the connectivity of radio networks
Author :
Piret, Philippe
Author_Institution :
Philips Res. Lab., Louvain-La-Neuve, Belgium
Volume :
37
Issue :
5
fYear :
1991
fDate :
9/1/1991 12:00:00 AM
Firstpage :
1490
Lastpage :
1492
Abstract :
The connectivity of a two-dimensional radio network as a function of the range of the transmitters is still an open problem. It has bee conjectured that the critical range of this problem is the same as the one for the covering problem. The analysis of the one-dimensional problem makes it clear that situations can exist where these two ranges are different. It is conjectured that the critical ranges of the two-dimensional problems are also different. The author presents results to substantiate this conjecture
Keywords :
radio networks; connectivity; covering problem; critical ranges; one-dimensional problem; packet radio; radio networks; transmitter range; two-dimensional problems; Counting circuits; Equations; Radio networks;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.133276
Filename :
133276
Link To Document :
بازگشت