CaltechAUTHORS
  A Caltech Library Service

A Geometric Theorem for Wireless Network Design Optimization

Franceschetti, Massimo and Cook, Matthew and Bruck, Jehoshua (2002) A Geometric Theorem for Wireless Network Design Optimization. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:2002.ETR044

[img]
Preview
Postscript
See Usage Policy.

171Kb
[img]
Preview
PDF (Adobe PDF (1.2MB))
See Usage Policy.

1176Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:2002.ETR044

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.


Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
http://www.paradise.caltech.edu/papers/etr044.psPublisherUNSPECIFIED
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:2002.ETR044
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.
ID Code:26032
Collection:CaltechPARADISE
Deposited By: Imported from CaltechPARADISE
Deposited On:30 Aug 2002
Last Modified:26 Dec 2012 13:51

Repository Staff Only: item control page