Connectivity of random graphs and mobile networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Connectivity of random graphs and mobile networks: validation of Monte Carlo simulation results

Full text

Pdf (379 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2001 ACM symposium on Applied computing table of contents

Las Vegas, Nevada, United States

Pages: 77 - 81

Year of Publication: 2001

ISBN:1-58113-287-5

Authors

L. Jonathan Dowell	Los Alamos National Laboratory, P. O. Box 1663 MS F604, Los Alamos, NM
Michael Lee Bruno	United States Naval Academy, P.O Box 14904, Annapolis, MD

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 32, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/372202.372280 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Y. Cheng and T. G. Robertazzi, Critical Connectivity Phenomena in Multihop Radio Models, IEEE Trans. Commun. 37 (1989) 770-777.
	2	L. Jonathan Dowell, Optimal configuration of a command and control network: balancing performance and reconfiguration constraints, Proceedings of the 2000 ACM symposium on Applied computing, p.94-98, March 2000, Como, Italy [doi>10.1145/335603.335708]
	3	P. Gupta and P. R. Kumar, The Capacity of Wireless Networks, IEEE Trans. Info. Theory 46 (2000) 388-404.
	4	A.M. Kellerer, On the Number of Clumps Resulting from the Overlap of Randomly Placed Figures in a Plane, J. Appl. Prob. 20 (1983) 126-135.
	5	L. Kleinreck and J. A. Silvester, Optimum Transmission Radii for Packet Radio Networks or Why Six is a Magic Number, Conf. Rec. Nat. Telecommun. Conf. (1978) 4.3.1-4.3.5.
	6	J. Ni and S. A. G. Chandler, Connectivity Properties of a Random Radio Network, IEE Prec. Commun. 141 (1994) 289-296.
	7	Zhizhang Shen, The calculation of average distance in mesh structures, Proceedings of the 2000 ACM symposium on Applied computing, p.89-93, March 2000, Como, Italy [doi>10.1145/335603.335707]
	8	P.D. Stroud, Kalman Extension of the Genetic Algorithm, Prec. SPIE 4055 (2000) 176-187.
	9	M.W. Subbarao and B. L. Hughes, Optimal Transmission Ranges and Code Rates for Frequency-Hop Packet Radio Networks, IEEE Trans. Commun. 48 (2000) 670-678.
	10	S.M. Sussman, A Survivable Network of Ground Relays for Tactical Data Communications, IEEE Trans. Commun. 28 (1980) 1616-1624.