Revisiting relative neighborhood graph-based broadcasting algorithms for multimedia ad hoc wireless networks.

Wang, Hwang-Cheng; Woungang, Isaac; Lin, Jia-Bao; Kuo, Fang-Chang; Ting, Kuo-Chang

Multimedia broadcasting is a popular application in an ad hoc wireless network, itself composed of battery-operated nodes. Hence, energy conservation and avoidance of frequent re-construction of broadcast paths are crucial to ensure robust and uninterrupted service of multimedia broadcasting applications. This paper introduces a class of distributed broadcast algorithms based on variations of Relative Neighborhood Graphs (RNG). In contrast to the original RNG-based algorithms, the proposed algorithms consider the remaining battery energy of nodes and the distance between nodes as criteria for determining the relative neighborhood of a node. This approach is intended to boost the resiliency of the broadcast path by avoiding the choice of nodes with low remaining battery capacity as rebroadcast nodes. Extensive simulations are conducted, demonstrating that the proposed algorithms improve over the original RNG in several aspects, including the reduction of broadcast storms, longer path lifetime, and shorter broadcast latency.

WIRELESS communications; AD hoc computer networks; COMPUTER network architectures; COMPUTER networks; ALGORITHMS

Journal of Supercomputing, 2012, Vol 62, Issue 1, p24

0920-8542

Academic Journal

10.1007/s11227-011-0662-9