A Geometric Theorem for Wireless Network Design Optimization

Franceschetti, M. and Cook, M. and Bruck, J. (2002) A Geometric Theorem for Wireless Network Design Optimization. Technical Report. California Institute of Technology. [CaltechPARADISE:2002.ETR044]

Full text available as:

	Postscript - Requires a viewer, such as GhostView
	PDF (Adobe PDF (1.2MB)) - Requires Adobe Acrobat Reader or other PDF viewer.

Abstract

Consider an infinite square grid G. How many discs of given radius r, centered at the vertices of G, are required, in the worst case, to completely cover an arbitrary disc of radius r placed on the plane? We show that this number is an integer in the set (3.4; 5.6) whose value depends on the ratio of r to the grid spacing. This result can be applied at the very early design stage of a wireless cellular network to determine, under the recent International Telecommunication Union (ITU) proposal for a traffic load model, and under the assumption that each client is able to communicate if it is within a certain range from a base station, conditions for which a grid network design is cost effective, for any expected traffic demand.

EPrint Type:	Monograph (Technical Report)
Additional Information:	[Alternate URL: http://www.paradise.caltech.edu/papers/etr044.ps]
Subjects:	All Records
ID Code:	5
Deposited By:	Jehoshua Bruck
Deposited On:	30 August 2002
Record Number:	CaltechPARADISE:2002.ETR044
Official Persistent URL:	http://resolver.caltech.edu/CaltechPARADISE:2002.ETR044
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record