Engineering of Replica Voting Protocols for Energy-Efficiency in Data Delivery
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
International Journal of Distributed Sensor Networks - Sensor Networks, Ubiquitous and Trustworthy Computing
Hierarchical adaptive QoS control for voting-based data collection in hostile scenarios
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
The paper employs majority voting among replica processes to move a correct data from the environment to the end-user entity in a secure real-time application setting. The replicas may be wireless computation nodes deployed in a power-constrained environment, and the data may be quite large in size with non-numeric and non-exact contents (e.g., imaging devices in a geographic terrain). The voting protocol is made energy-efficient by reducing the amount of data processing and network-level message exchanges required in delivering a data to the user. Our optimization takes into account: i) processing cycles expended in comparing data, ii) amount of replica data movement required, and iii) number of control messages generated. We consider two types of voting protocol: a ýcentralizedý scheme where replica data are collected at a secure power-abundant site to carry out the data comparisons for voting; and a ýdecentralizedý scheme where each replica compares its locally computed data with a candidate data to send its consent/dissent message to a central vote collating site. The paper develops a performance model that considers the tradeoffs (i)-(iii) to determine the energy consumption levels in the centralized and decentralized voting schemes. Our model allows the voting apparatus to select an energy-optipmal scheme, given the timeliness parameters and the network and processing bandwidths.