One of the most critical factors for lifetime and operability of ad-hoc and sensor networks is the limited amount of available energy. To this respect, minimizing the interference in the network has certainly a positive effect, since of the reduced number of conflicting transmissions. However, quite surprisingly, only few theoretical results are known about the possibility to maintain the interference low while at the same time guaranteeing certain network connectivity properties. In this paper, we give a contribution in this direction, and we study several network interference measures with respect to the symmetric connectivity, the strong connectivity, and the broadcast connectivity predicate. In particular, we show that the probably most prominent interference problem, namely that of minimizing the maximum interference experienced by any node in the network, is hard to approximate within better than a logarithmic factor, unless NP admits slightly superpolynomial time algorithms, for any of the above connectivity predicates. On a positive side, we show that any approximation algorithm for the problem of minimizing the total range assigned to the nodes in order to guarantee any of the above connectivity predicates, can be transformed, by maintaining the approximation ratio, into an approximation algorithm for the problem of minimizing the total interference experienced by all the nodes in the network.
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks / Bilò, Davide; Proietti, Guido. - 4240:(2006), pp. 13-24. (Intervento presentato al convegno 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'06)) [10.1007/11963271_2].
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks
BILÒ, Davide;
2006-01-01
Abstract
One of the most critical factors for lifetime and operability of ad-hoc and sensor networks is the limited amount of available energy. To this respect, minimizing the interference in the network has certainly a positive effect, since of the reduced number of conflicting transmissions. However, quite surprisingly, only few theoretical results are known about the possibility to maintain the interference low while at the same time guaranteeing certain network connectivity properties. In this paper, we give a contribution in this direction, and we study several network interference measures with respect to the symmetric connectivity, the strong connectivity, and the broadcast connectivity predicate. In particular, we show that the probably most prominent interference problem, namely that of minimizing the maximum interference experienced by any node in the network, is hard to approximate within better than a logarithmic factor, unless NP admits slightly superpolynomial time algorithms, for any of the above connectivity predicates. On a positive side, we show that any approximation algorithm for the problem of minimizing the total range assigned to the nodes in order to guarantee any of the above connectivity predicates, can be transformed, by maintaining the approximation ratio, into an approximation algorithm for the problem of minimizing the total interference experienced by all the nodes in the network.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.