Figure 1.1: Mica mote. nodes far from the sink die earlier than the other nodes. In a multi-hop network, however, Figure 2.1: A randomly deployed network over a circular area. where |-| denotes the integer ceiling. To ease the notations, let us assume that R is ar [a a (oe, ee <n Figure 3.2: Probability of achieving the lifetime threshold vs. the ratio of dead nodes for single-hop networks deployed over different area shapes. achieving the desired lifetime. Figure 3.4: Probability of achieving the lifetime threshold vs. the ratio of dead nodes in a multi-hop network earlier. As a consequence, the optimal density can be obtained for each secto1 Figure 3.6: An arbitrary network with non-centered sink. the sector, the average traffic load can be determined similar to the approach that we tool Figure 4.1: Sensor nodes deployed randomly within a cluster. Figure 4.3: Comparison of the number of alive nodes versus time between periodic and adaptive clustering. Figure 5.2: Traffic load distribution (V = 15, 30, 60). Figure 5.3: Traffic load distribution (V = 1000). Figure 5.4: Linearly increasing distribution of the nodes over the network.
Connect with 287M+ leading minds in your field
Discover breakthrough research and expand your academic network
