Rank-Based Data Gathering in Wireless Sensor Networks

Free registration required

Executive Summary

The authors propose a Rank-Based Data Gathering (RBDG) algorithm for wireless sensor networks with randomly distributed sensor nodes. For every round of data communication, the algorithm functions as follows: A set of sensor nodes or vertices are assigned a random rank between 0 and 1. A link is formed between any two nodes if they are within each other's transmission range. If a sensor node has the highest rank among it neighbors, then it is considered an associate node, else it is categorized as a leaf node. Next, they form a complete graph among the associate nodes with edge weights representing the physical Euclidean distance between the nodes.

  • Format: PDF
  • Size: 442.42 KB