Abstract

In this paper, we address the problem of broadcasting in a wireless network under a novel communication model: the {\em swamping} communication model. In this model, nodes communicate only with those nodes at geometric distance greater than ss and at most rr from them. Communication between nearby nodes under this model can be very time consuming, as the length of the path between two nodes within distance ss is only bounded above by the diameter DD, in many cases. For the nn-node lattice networks, we present algorithms of optimal time complexity, respectively O(n/r+r/(r−s))O(n/r + r/(r-s)) for the lattice line and O(n/r+r/(r−s))O(\sqrt{n}/r + r/(r-s)) for the two-dimensional lattice. We also consider networks of unknown topology of diameter DD and of a parameter gg ({\em granularity}). More specifically, we consider networks with γγ the minimum distance between any two nodes and g=1/γg = 1/γ. We present broadcast algorithms for networks of nodes placed on the line and on the plane with respective time complexities O(D/l+g2)O(D/l + g^2) and O(Dg/l+g4)O(Dg/l + g^4), where l∈Θ(max⁡{(1−s),γ})l \in Θ(\max\{(1-s),γ\}).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.