Table 1.
Information maintained in the neighborhood table.
| Protocol | Organization type | Objectives | Characteristics |
|---|---|---|---|
| LEACH | Cluster | Improve network life time | CHs are rotated randomly for specific time using threshold. |
|
| |||
| HEED | Cluster | Increase number of rounds | Nodes with different power levels are assumed. |
|
| |||
| PEGASIS | Chain | Average energy spent by node | Network knowledge is required for computation |
|
| |||
| Hierarchical chain based protocols | Chain | Energy × delay | Uses chain scheme with binary values. |
|
| |||
| EADAT | Tree | Improves the number of available nodes at each round. | Broadcasting is achieved from sink |
|
| |||
| PEDAP-PA | Tree | Balances node dissipation such that all nodes die simultaneously. | Uses the popular Minimum Spanning Tree to achieve its goal |