Hierarchical geographic multicast routing for wireless sensor networks |
| |
Authors: | Dimitrios Koutsonikolas Saumitra M Das Y Charlie Hu Ivan Stojmenovic |
| |
Affiliation: | (1) School of ECE, Purdue University, West Lafayette, IN 47907, USA;(2) Electronic, Electrical & Computer Engineering, The University of Birmingham, Birmingham, UK;(3) SITE, University of Ottawa, Ottawa, ON, Canada |
| |
Abstract: | Wireless sensor networks comprise typically dense deployments of large networks of small wireless capable sensor devices.
In such networks, multicast is a fundamental routing service for efficient data dissemination required for activities such as code updates, task assignment
and targeted queries. In particular, efficient multicast for sensor networks is critical due to the limited energy availability in such networks. Multicast protocols that
exploit location information available from GPS or localization algorithms are more efficient and robust than other stateful
protocols as they avoid the difficulty of maintaining distributed state (multicast tree). Since localization is typically
already required for sensing applications, this location information can simply be reused for optimizing multicast performance
at no extra cost. Recently, two protocols were proposed to optimize two orthogonal aspects of location-based multicast protocols:
GMR (Sanchez et al. GMR: Geographic multicast routing for wireless sensor networks. In Proceedings of the IEEE SECON, 2006)
improves the forwarding efficiency by exploiting the wireless multicast advantage but it suffers from scalability issues when
dealing with large sensor networks. On the other hand, HRPM (Das et al. Distributed hashing for scalable multicast in wireless
ad hoc networks. IEEE TPDS 47(4):445–487, 2007) reduces the encoding overhead by constructing a hierarchy at virtually no
maintenance cost via the use of geographic hashing but it is energy-inefficient due to inefficacies in forwarding data packets.
In this paper, we present HGMR (hierarchical geographic multicast routing), a new location-based multicast protocol that seamlessly
incorporates the key design concepts of GMR and HRPM and optimizes them for wireless sensor networks by providing both forwarding
efficiency (energy efficiency) as well as scalability to large networks. Our simulation studies show that: (i) In an ideal
environment, HGMR incurs a number of transmissions either very close to or lower than GMR, and, at the same time, an encoding
overhead very close to HRPM, as the group size or the network size increases. (ii) In a realistic environment, HGMR, like
HRPM, achieves a Packet Delivery Ratio (PDR) that is close to perfect and much higher than GMR. Further, HGMR has the lowest
packet delivery latency among the three protocols, while incurring much fewer packet transmissions than HRPM. (iii) HGMR is
equally efficient with both uniform and non-uniform group member distributions. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|