Trees of special properties are required to provide efficient network management of group communications in mobile ad hoc networks. Usually, such trees try to balance between the requirements to minimize the total tree cost and the requirement to minimize the maximal shortest path. This paper presents a novel solution for efficient multicast trees that fulfill both requirements called SPLAST. The following discussion covers the development process, starting from centralized static solution, through distributed implementation to a complete distributed algorithm that cope with various scenarios that are relevant to wireless ad hoc networks by efficient management and maintenance of the underlying components of the algorithm. Simulation inquiry shows that the average performance of SPLAST is attractive as well.
|Number of pages||5|
|State||Published - 1 Dec 2004|
|Event||2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2004 - Barcelona, Spain|
Duration: 5 Sep 2004 → 8 Sep 2004
|Conference||2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2004|
|Period||5/09/04 → 8/09/04|
- Spider decomposition