A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Power consumption in packet radio networks
Theoretical Computer Science
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Ad hoc networking: an introduction
Ad hoc networking
Tradeoffs between knowledge and time of communication in geometric radio networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
A directionality based location discovery scheme for wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Gossiping with Unit Messages in Known Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Energy efficient communication in ad hoc networks from user's and designer's perspective
ACM SIGMOBILE Mobile Computing and Communications Review
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Data Collection with Multiple Sinks in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Energy efficient all-to-all broadcast in all-wireless networks
Information Sciences: an International Journal
Efficient data collection for wireless networks: delay and energy tradeoffs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficient data aggregation in multi-hop WSNs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Approaching the optimal schedule for data aggregation in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Aggregation convergecast scheduling in wireless sensor networks
Wireless Networks
A fault tolerant approach for data aggregation in wireless sensor networks
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
Tight analysis of shortest path convergecast in wireless sensor networks
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Tight analysis of shortest path convergecast in wireless sensor networks
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.02 |
Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a Euclidean plane. We assume that each node has a variable transmission range and can learn the distance to the closest active neighbor at any time. We also assume that nodes have a special collision detection (CD) capability so that a transmitting node can detect a collision within its transmission range. We study the basic communication problem of collecting data from all nodes called convergecast. Recently, there appeared many new applications such as real-time multimedia, battlefield communications and rescue operations that impose stringent delay requirements on the convergecast time. We measure the latency of convergecast, that is the number of time steps needed to collect the data in any n-node network. We propose a very simple randomized distributed algorithm that has the expected running time O(logn). We also show that this bound is tight and any algorithm needs @W(logn) time steps while performing convergecast in an arbitrary network. One of the most important problems in wireless ad hoc networks is to minimize the energy consumption, which maximizes the network lifetime. We study the trade-off between the energy and the latency of convergecast. We show that our algorithm consumes at most O(nlogn) times the minimum energy. We also demonstrate that for a line topology, the minimum energy convergecast takes n time steps while any algorithm performing convergecast within O(logn) time steps requires @W(n/logn) times the minimum energy.