Achieving Energy Efficiency for Altruistic DISH: Three Properties

TL;DR

This paper introduces an altruistic DISH protocol that deploys special nodes called altruists to enhance energy efficiency in multi-channel ad hoc networks while maintaining performance, and analyzes its properties and complexity.

Contribution

It provides theoretical proofs for conditions of unsafe pairs, cooperation coverage, and establishes the NP-hardness of optimal altruist placement.

Findings

Conditions for forming unsafe pairs are characterized.

Full cooperation coverage conditions are identified.

Determining minimal altruist deployment is NP-hard.

Abstract

In an altruistic DISH protocol, additional nodes called "altruists" are deployed in a multi-channel ad hoc network to achieve energy efficiency while still maintaining the original throughput-delay performance. The responsibility of altruists is to constantly monitor the control channel and awaken other (normal) nodes when necessary (to perform data transmissions). Altruists never sleep while other nodes sleep as far as possible. This technical report proves three properties related to this cooperative protocol. The first is the conditions for forming an unsafe pair (UP) in an undirected graph. The second is the necessary and sufficient conditions for full cooperation coverage to achieve the void of multi-channel coordination (MCC) problems. The last is the NP-hardness of determining the minimum number and locations of altruistic nodes to achieve full cooperation coverage.