2004 · 53 citations · 10 references
ComputingComputer ScienceComputer NetworksDigital CommunicationDistributed SystemsCommunication NetworksDistributed Sensor NetworksNetwork TopologyRoutingSensor NetworksWireless Sensor NetworksNetwork Performance OptimizationNode DegreeParent Selection StrategySelf-configurationSensor Network RoutingSensor Network TopologiesTopology ControlWireless Sensor Network Routing
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.
10
Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam · IEEE Communications Magazine · 2002 · 13.7K citations
Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin · 2000 · 5.4K citations
The broadcast storm problem in a mobile ad hoc network
Sze-Yao Ni, Yu‐Chee Tseng, Yuh‐Shyan Chen et al. · 1999 · 3.1K citations · Full text
Deborah Estrin, Ramesh Govindan, John Heidemann et al. · 1999 · 2.7K citations
J.M. Kahn, Randy H. Katz, Kristofer S. J. Pister · 1999 · 1.7K citations