Broadcasting in sensor networks of unknown topology in the presence of swamping

Authors:
Evangelos Kranakis;Michel Paquette
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada
Venue:
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Year:
2010

Citing 7
Cited 0

Fault-tolerant broadcasting in radio networks

Journal of Algorithms
Deterministic Broadcasting Time in Radio Networks of Unknown Topology

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Round Robin is optimal for fault-tolerant broadcasting on wireless networks

Journal of Parallel and Distributed Computing
Broadcasting in geometric radio networks

Journal of Discrete Algorithms
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Local broadcasting in the physical interference model

Proceedings of the fifth international workshop on Foundations of mobile computing
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we address the problem of broadcasting in a wireless sensor network under a novel communication model: the swamping communication model. In this model, nodes communicate only with those nodes at distance greater than s and at most r from them. We consider networks of unknown topology of diameter D, with a lower bound a on the geometric distance between nodes and a parameter g = 1/α (granularity). We present broadcast algorithms for networks of nodes placed on the line and on the plane with respective time complexities O(D/l + g2) and O(Dg/l + g4), where l ∈ Θ(max{(1 - s), α}).