منابع مشابه
Gathering Radio Messages in the Path
In this paper, we address the problem of gathering information in one node (sink) of a radio network where interference constraints are present: when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is modeled by a graph; a node is able to transmit one unit of information to the set of vertices at distance at m...
متن کاملMinimum Delay Data Gathering in Radio Networks
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbors at most one data item. Each device is equipped with a half duplex interface; so a node cannot both ...
متن کاملEfficient Gathering in Radio Grids with Interference†
We study the problem of gathering information from the nodes of a radio network into a central destination node. A transmission can be received by a node if it is sent from a distance of at most dT and there is no interference from other transmissions. One transmission interferes with the reception of another transmission if the sender of the first transmission is at distance dI or less from th...
متن کاملOptimal gathering in radio grids with interference
We study the problem of gathering information from the nodes of a radio network into a central node. We model the network of possible transmissions by a graph and consider a binary model of interference in which two transmissions interfere if the distance in the graph from the sender of one transmission to the receiver of the other is dI or less. A round is a set of compatible (i.e., non-interf...
متن کاملScattering and Gathering Messages in Networks of Processors
The operations of scattering and gathering in a network of processors involve one processor of the network | call it P0 | communicating with all other processors. In scattering, P0 sends (possibly) distinct messages to all other processors; in gathering, the other processors send (possibly) distinct messages to P0. We consider networks that are trees of processors; we present algorithms for sca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics, Algorithms and Applications
سال: 2013
ISSN: 1793-8309,1793-8317
DOI: 10.1142/s1793830913500043