In the multiratecasting problem in wireless sensor networks, the source sensor is usually required to report to multiple destinations at dif- ferent rates for each of them. We present a MST-based rate-aware cost-efficient multiratecast routing protocol (MSTRC). The proposed MSTRC examines only one set partition of destinations at each for- warding step. A message split occurs when the locally-built minimum spanning tree (MST) over the current node and the set of destina- tions has multiple edges originated at the current node. Destinations spanned by each of these edges are grouped together, and for each of these subsets the best neighbor is selected as the next hop. We also suggested a novel face recovery mechanism to deal with void ar- eas, when no neighbor provides positive progress toward destinations. It constructs a MST of current node and destinations without the progress via neighbors, and for each set partition of destinations cor- responding to an edge e in MST, the face routing keeps going until a node that is closer to one of these destinations is found, allowing for greedy continuation, while the process repeats for the remaining desti- nations similarly. Our experimental results demonstrate that MSTRC is highly rate-efficient in all scenarios, and unlike existing solutions, it is adaptive to destination rate deviations.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OOU.#10393/23893 |
| Date | 04 March 2013 |
| Creators | Liu, Xidong |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Thèse / Thesis |
Page generated in 0.0019 seconds