In this paper, we study the problem of gossiping with neighboring interference constraint in radio chain networks. Gossiping (also called total exchange information) is a protocol where each node in the network has a message and is expected to distribute its own message to every other node in the network. The gossiping problem consists in finding the minimum running time (makespan) of a gossiping protocol and efficient algorithms that attain this makespan. We focus on the case where the transmission network is a chain (directed path or line) network. We consider synchronous protocols where it takes one unit of time (step) to transmit a unit-length message. During one step, a node receives at most one message only through one of its two neighbors. We assume that during one step, a node cannot be both a sender and a receiver (half duplex model). Moreover we have neighboring interference constraints under which a node cannot receive a message if one of its neighbors is sending. A round consists of a set of non-interfering (or compatible) calls and uses one step. We completely solve the gossiping problem for P n , the chain network on n nodes, and give an algorithm that completes the gossiping in 3n − 5 rounds (for n > 3), which is exactly the makespan.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.