Algorithms for energy-efficient broad- and multi-casting in wireless networks

  • Authors:

  • Hiroshi Masuyama;Kazuya Murakami;Toshihiko Sasama

  • Affiliations:

  • Information and Knowledge Engineering, Tottori University, Tottori, Japan;Graduate School, Tottori University, Tottori, Japan;Information and Knowledge Engineering, Tottori University, Tottori, Japan

  • Venue:
  • ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The wireless networking environment presents some interesting challenges to the study of broadcasting and multicasting problems, because networks have to be different as occasion demands. Therefore, several types of broadcasting or multicasting protocols have been studied. This paper addresses the problem of broadcasting (and multicasting) focusing on the two points of energy efficient networking and of time efficient computing, where all base stations are fixed and each base station operates as an omni-directional antenna or transceiver. We developed one broadcasting algorithm based on the Stingy method and based on the two performance indices given above. We evaluate this and the other two algorithms based on the Greedy and Dijkstra methods. The purpose of this paper is to make clear the best performing domain of each algorithm. In this paper, the performances of these three algorithms are evaluated in many types of networks. The evaluation gave the result that the Stingy method provides the best performance for energy efficient networking in a type of network where basic stations are distributed wholly, not partially. In this type of network, the Stingy and Dijkstra methods have a trade-off relationship in the two performance indices.