GARGANO , Luisa

Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. In this paper we suppose that each sensor is equipped with an half–duplex interface; hence, a node cannot receive and transmit at the same time. Moreover, each node is equipped with...

Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. In this paper we suppose that each sensor is equipped with an half--duplex interface; hence, a node cannot receive and transmit at the same time. Moreover, each node is equipped with...

Gossiping is the process of information di ffusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a fixed number p of blocks during each call. We study...

We consider the problem of disseminating messages in networks whose topology and size are not known to nodes. Three communication tasks of increasing difficulty are studied. In blind broadcasting (BB) the goal is to communicate the source message to all nodes. In acknowledged blind broadcasting (ABB) the goal is to achieve BB and inform the...

International audience

International audience

This paper studies the problems of One{to{All and All{to{All Communication in optical networks. In such networks the vast bandwidth available is utilized through wavelength division multiplexing: a single physical optical link can carry several logical signals, provided that they are transmitted on di erent wavelengths. In this paper we...

We study algorithmic and complexity issues originating from the problem of data gathering in wireless networks. We give an algorithm to construct minimum makespan transmission schedules for data gathering when the communication graph $G$ is a tree network, the interference range is \emph{any} integer $m\geq 2$, and no buffering is allowed at...

A Wireless Network consists of a large number of devices, deployed over a geographical area, and of a base station where data sensed by the devices are collected and accessed by the end users. In this paper we study algorithmic and complexity issues originating from the problem of data gathering in wireless networks. We give an algorithm to...

A Wireless Network consists of a large number of devices, deployed over a geographical area, and of a base station where data sensed by the devices are collected and accessed by the end users. In this paper we study algorithmic and complexity issues originating from the problem of data gathering in wireless networks. We give an algorithm to...

International audience

This paper surveys the theoretical results obtained for wavelength{routing all{optical networks, presents some new results and proposes several open problems. In all{optical networks the vast bandwidth available is utilized through wavelength division multiplexing: a single physical optical link can carry several logical signals, provided that...

We survey the theoretical results obtained for wavelength routing in all--optical networks, present some new results and propose several open problems. In all--optical networks the vast bandwidth available is utilized through {\em wavelength division multiplexing}~: a single physical optical link can carry several logical signals, provided that...