Performance Analysis of Cluster-Based and Tree-Based Routing Protocols for Wireless Sensor Networks
This work compares the performance of cluster-based and tree-based routing protocols. Two kinds of operations are considered: aggregation and acquisition. We theoretically analyze the performance of cluster-based and tree-based topologies, and find that cluster-based topology is more energy efficien...
Saved in:
| Published in | 2010 International Conference on Communications and Mobile Computing Vol. 1; pp. 418 - 422 |
|---|---|
| Main Authors | , |
| Format | Conference Proceeding |
| Language | English |
| Published |
IEEE
01.04.2010
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 9781424463275 1424463270 |
| DOI | 10.1109/CMC.2010.187 |
Cover
| Summary: | This work compares the performance of cluster-based and tree-based routing protocols. Two kinds of operations are considered: aggregation and acquisition. We theoretically analyze the performance of cluster-based and tree-based topologies, and find that cluster-based topology is more energy efficient for aggregation than tree-based topology; but in the case of acquisition, tree-based topology is more energy efficient than cluster-based topology. In addition, simulations between HEED and MintRoute routing protocols verify above analysis results. This work can be used to guide the design of application-specific routing protocols selection. |
|---|---|
| ISBN: | 9781424463275 1424463270 |
| DOI: | 10.1109/CMC.2010.187 |