Distributed algorithms for sensor networks

被引：10

作者：

Lenzen, Christoph ^{[1
]}

Wattenhofer, Roger ^{[2
]}

机构：

[1] Hebrew Univ Jerusalem, Sch Engn & Comp Sci, IL-91904 Jerusalem, Israel

[2] ETH, Comp Engn & Networks Lab, CH-8092 Zurich, Switzerland

来源：

PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES | 2012年 / 370卷 / 1958期

基金：

瑞士国家科学基金会;

关键词：

local algorithms; topology of sensor networks; interference models; maximal independent set; vertex colouring; clock synchronization; RANDOMIZED PARALLEL ALGORITHM; AD HOC NETWORKS; PROBABILISTIC ALGORITHMS; RADIO NETWORKS;

D O I：

10.1098/rsta.2011.0212

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

Distributed algorithms are an established tool for designing protocols for sensor networks. In this paper, we discuss the relation between distributed computing theory and sensor network applications. We also present a few basic and illustrative distributed algorithms.

引用

页码：11 / 26

页数：16

共 52 条

[1]

Abramson N., P AFIPS 70 FALL P FA, P281, DOI [10.1145/1478462.1478502, DOI 10.1145/1478462.1478502]

[2] A Biological Solution to a Fundamental Distributed Computing Problem [J].

Afek, Yehuda ;

Alon, Noga ;

Barad, Omer ;

Hornstein, Eran ;

Barkai, Naama ;

Bar-Joseph, Ziv .

SCIENCE, 2011, 331 (6014) :183-185

[3] A LOWER BOUND FOR RADIO BROADCAST [J].

ALON, N ;

BARNOY, A ;

LINIAL, N ;

PELEG, D .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1991, 43 (02) :290-298

[4] A FAST AND SIMPLE RANDOMIZED PARALLEL ALGORITHM FOR THE MAXIMAL INDEPENDENT SET PROBLEM [J].

ALON, N ;

BABAI, L ;

ITAI, A .

JOURNAL OF ALGORITHMS, 1986, 7 (04) :567-583

[5]

[Anonymous], 2000, SIAM MONOG DISCR MAT

[6]

Bar-Yehuda R., 1987, ACM PODC, P98, DOI DOI 10.1145/41840.41849

[7] Deterministic Distributed Vertex Coloring in Polylogarithmic Time [J].

Barenboim, Leonid ;

Elkin, Michael .

PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, :410-419

[8] Robust position-based routing in wireless ad hoc networks with irregular transmission ranges [J].

Barrière, L ;

Fraigniaud, P ;

Narayanan, L ;

Opatrny, J .

WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2003, 3 (02) :141-153

[9] Free bits, PCPs, and nonapproximability - Towards tight results [J].

Bellare, M ;

Goldreich, O ;

Sudan, M .

SIAM JOURNAL ON COMPUTING, 1998, 27 (03) :804-915

[10] Closed form bounds for clock synchronization under simple uncertainty assumptions [J].

Biaz, S ;

Welch, JL .

INFORMATION PROCESSING LETTERS, 2001, 80 (03) :151-157

← 1 2 3 4 5 6 →