Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
نویسندگان
چکیده
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n log n). The algorithm allows the labels (identifiers) of the nodes to be polynomially large in n, and is based on a novel way of using selective families. The previous best general (i.e., dependent only on n) deterministic upper bounds were O(n log n) for networks with polynomially large node labels [1], and O(n log n) for networks with linearly large node labels [2,3,4].
منابع مشابه
Gossiping with Bounded Size Messages in ad hoc Radio Networks
We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n)-gossiping. We show that √ n-gossiping in an ad hoc radio network on...
متن کاملBrief Announcement: Faster Gossiping in Bidirectional Radio Networks with Large Labels
We consider unknown ad-hoc radio networks, when the underlying network is bidirectional and nodes can have polynomially large labels. For this model, we present a deterministic protocol for gossiping which takes O(n lg n lg lgn) rounds. This improves upon the previous best result for deterministic gossiping for this model by [Gasienec, Potapov, Pagourtizis, Deterministic Gossiping in Radio Netw...
متن کاملFaster Deterministic Broadcasting in Ad Hoc Radio Networks
We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time O(n log n). Our main...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملInformation dissemination in unknown radio networks with large labels
We consider the problems of deterministic broadcasting and gossiping in completely unknown ad-hoc radio networks. We assume that nothing is known to the nodes about the topology or even the size of the network, n, except that n > 1. Protocols for vanilla model, when n is known, may be run for increasingly larger estimates 2 on the size of the network, but one cannot determine when such a protoc...
متن کامل