TRADING-OFF CONSUMPTION OF ROUTING AND PRECISION OF MEMBERSHIP IN AD HOC NETWORKS

摘要

The development of distributed applications and components for ad hoc networks rises specific questions. The need for energy-efficient protocols is always one major concern in the design. Nevertheless, when several services are to be simultaneously provided, the choice of the most energy saving option for an individual component may be against the quality of other services. In this paper we focus on providing routing together with a global membership estimation. The former is a fundamental service in ad hoc networks. The latter will be required by any distributed application using consensus. Some proactive routing protocols, as OLSR, already maintain at each node information on the global composition of the system. With reactive routing algorithms, as DSR, a specific service must be used to monitor the global system composition. We perform a study of the joint performance of routing and failure discovery services in the case of OLSR, which provides both at once, and in the case of DSR routing complemented with gossip-style failure detection. We compare the energy consumption of both approaches and show that the advantage of one routing service over the other may be compensated or inverted when bounds are imposed on the liveness of membership monitoring information.