Geographic Dijkstra-based Multicast Algorithms for wireless sensor networks
[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] pracownik
2012
artykuł naukowy
angielski
EN Limited resources in Wireless Sensor Networks (WSNs) are the key concern that needs to be given a careful consideration when studying virtually any aspect of a sensor network. Therefore, energy demands and radio bandwidth utilization should be addressed, especially in one-to-many communication. It is evident that a need for centralized networkwide topology knowledge can jeopardize scarce energy resources of a sensor network. Thus, localized geographic multicast relies solely on locally available information about the position of current node, other nodes within the radio range and the location of destination group members. Greedy multicast routing procedures often transport messages along paths that may be far from being optimal. Therefore, Dijkstra-based Localized Energy-Efficient Multicast Algorithm (DLEMA) is presented, described with pseudocode, and discussed. DLEMA focuses on discovering energy shortest paths leading through nodes that provide the maximum geographical advance towards desired destinations. Local routes are followed owing to the use of a source routing technique. Additionally, the algorithm takes advantage of the broadcast nature of omnidirectional radio communication and utilizes perimeter routing to find a solution for local optimum situations. The analysis of the simulation results confirms interesting characteristics of the proposed algorithm.
33 - 46