Grid emulation for managing random sensor networks

Zvi Lotker; Alfredo Navarra

doi:10.1016/j.adhoc.2007.08.001

Grid emulation for managing random sensor networks

Zvi Lotker, Alfredo Navarra

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

A common assumption in sensor networks is that sensors are located according to a uniform random distribution. In this paper, we show that uniform random points on the two dimensional unit square are almost a "grid". In particular, for a synchronous geographic sensor network we show how to emulate any grid protocol on random sensor networks, with high probability. This suggests the following framework. In order to solve a problem on a random sensor network, we solve the same problem on a grid. Then we use our emulation to make the obtained solution suitable for random sensor network. We analyze the cost of the emulation in terms of consumed energy and time. Finally, we provide some examples that illustrate our method.

Original language	English
Pages (from-to)	900-908
Number of pages	9
Journal	Ad Hoc Networks
Volume	6
Issue number	6
DOIs	https://doi.org/10.1016/j.adhoc.2007.08.001
State	Published - Aug 2008
Externally published	Yes

Bibliographical note

Funding Information:
The research was partially funded by the European projects COST Action 293, “Graphs and Algorithms in Communication Networks” (GRAAL) and COST Action 295, “Dynamic Communication Networks” (DYNAMO).

Funding

The research was partially funded by the European projects COST Action 293, “Graphs and Algorithms in Communication Networks” (GRAAL) and COST Action 295, “Dynamic Communication Networks” (DYNAMO).

Funders	Funder number
European Cooperation in Science and Technology

Keywords

Collisions
Grid
MAC-layer
Routing
Scheduling

Access to Document

10.1016/j.adhoc.2007.08.001

Cite this

@article{069ef9672b224bf5b777715f70b4eb1c,

title = "Grid emulation for managing random sensor networks",

abstract = "A common assumption in sensor networks is that sensors are located according to a uniform random distribution. In this paper, we show that uniform random points on the two dimensional unit square are almost a {"}grid{"}. In particular, for a synchronous geographic sensor network we show how to emulate any grid protocol on random sensor networks, with high probability. This suggests the following framework. In order to solve a problem on a random sensor network, we solve the same problem on a grid. Then we use our emulation to make the obtained solution suitable for random sensor network. We analyze the cost of the emulation in terms of consumed energy and time. Finally, we provide some examples that illustrate our method.",

keywords = "Collisions, Grid, MAC-layer, Routing, Scheduling",

author = "Zvi Lotker and Alfredo Navarra",

note = "Funding Information: The research was partially funded by the European projects COST Action 293, “Graphs and Algorithms in Communication Networks” (GRAAL) and COST Action 295, “Dynamic Communication Networks” (DYNAMO). ",

year = "2008",

month = aug,

doi = "10.1016/j.adhoc.2007.08.001",

language = "אנגלית",

volume = "6",

pages = "900--908",

journal = "Ad Hoc Networks",

issn = "1570-8705",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - Grid emulation for managing random sensor networks

AU - Lotker, Zvi

AU - Navarra, Alfredo

N1 - Funding Information: The research was partially funded by the European projects COST Action 293, “Graphs and Algorithms in Communication Networks” (GRAAL) and COST Action 295, “Dynamic Communication Networks” (DYNAMO).

PY - 2008/8

Y1 - 2008/8

N2 - A common assumption in sensor networks is that sensors are located according to a uniform random distribution. In this paper, we show that uniform random points on the two dimensional unit square are almost a "grid". In particular, for a synchronous geographic sensor network we show how to emulate any grid protocol on random sensor networks, with high probability. This suggests the following framework. In order to solve a problem on a random sensor network, we solve the same problem on a grid. Then we use our emulation to make the obtained solution suitable for random sensor network. We analyze the cost of the emulation in terms of consumed energy and time. Finally, we provide some examples that illustrate our method.

AB - A common assumption in sensor networks is that sensors are located according to a uniform random distribution. In this paper, we show that uniform random points on the two dimensional unit square are almost a "grid". In particular, for a synchronous geographic sensor network we show how to emulate any grid protocol on random sensor networks, with high probability. This suggests the following framework. In order to solve a problem on a random sensor network, we solve the same problem on a grid. Then we use our emulation to make the obtained solution suitable for random sensor network. We analyze the cost of the emulation in terms of consumed energy and time. Finally, we provide some examples that illustrate our method.

KW - Collisions

KW - Grid

KW - MAC-layer

KW - Routing

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=44149122397&partnerID=8YFLogxK

U2 - 10.1016/j.adhoc.2007.08.001

DO - 10.1016/j.adhoc.2007.08.001

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:44149122397

SN - 1570-8705

VL - 6

SP - 900

EP - 908

JO - Ad Hoc Networks

JF - Ad Hoc Networks

IS - 6

ER -

Grid emulation for managing random sensor networks

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this