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 and at most 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 is only bounded above by the diameter , in many cases. For the -node lattice networks, we present algorithms of optimal time complexity, respectively for the lattice line and for the two-dimensional lattice. We also consider networks of unknown topology of diameter and of a parameter ({\em granularity}). More specifically, we consider networks with the minimum distance between any two nodes and . We present broadcast algorithms for networks of nodes placed on the line and on the plane with respective time complexities and , where .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.