Test sets for experimentation with resource sharing strategies

Available experiments

• Experimentation with algorithms for energy-efficient multicasting in ad hoc wireless networks (UoP)

• Experimental analysis of practically efficient algorithms for bounded-hop accumulation in ad-hoc wireless networks (Rome)

• Algorithms and experiments on colouring squares of planar graphs (CTI)

• Generating and radiocoloring families of perfect graphs (CTI)

• Experimenting with improved approximation algorithms for scheduling malleable tasks with precedence constraints (CAU)

• Experimental analysis of for the dual power management problem in sensor networks (Geneva)

• Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees  (UNISA)