The basic topology desired in data-gathering wireless sensor networks is a spanning tree, since the traffic is mainly in the form of many-to-one flows. Nodes in the network can self-configure themselves into such a topology by a two-phase process: a flood initiated by the root node, followed by parent selection by all nodes. We present four localized topology generation mechanisms - earliest-first, randomized, nearest-first, and weighted-randomized parent selection. We also compare the network performance of these mechanisms on the basis of the following metrics: node degree, robustness, channel quality, data aggregation and latency; our study shows how localized self-configuration mechanisms can impact the global network behavior.
CITATION STYLE
Zhou, C., & Krishnamachari, B. (2003). Localized Topology Generation Mechanisms for Wireless Sensor Networks. In Conference Record / IEEE Global Telecommunications Conference (Vol. 3, pp. 1269–1273). https://doi.org/10.1109/glocom.2003.1258442
Mendeley helps you to discover research relevant for your work.