Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
15,820
Table V. Sensors Selected for Querying by the Cluster Head
2004
Cited by 27
TABLE III SENSORS SELECTED FOR QUERYING BY THE CLUSTER HEAD.
TABLE III SENSORS SELECTED FOR QUERYING BY THE CLUSTER HEAD.
TABLE I MESSAGES USED FOR CLUSTER FORMATION AND CLUSTER HEAD (CH) ELECTION
2006
Cited by 3
TABLE I THE PERCENTAGE OF DIFFERENT NUMBER OF CLUSTER-HEADS ELECTED IN A ROUND DURING A SYSTEM LIFETIME. # of cluster-heads 0 1 2 3 4 5 6 7 8 over 9
Table 1 shows that by adopting the maximum coverage approach (each cluster head forms a cluster by choosing geographically farthest nodes from its one hop neighbors) in the clustering algorithm we can form as many as twice the number of clusters with closest approach (each cluster head forms a cluster by choosing geographically closest nodes from its one hop neighbors) even when N=2. This justifies the large protocol overhead observed in case of maximum coverage approach.
"... In PAGE 9: ... PACKET FLOODING DISTRIBUTED DENIAL OF SERVICE ATTACKS In this attack, packets are sent to flood links and exhaust arc capacities. Table1 shows Blue configurations and tree diagram we use to illustrate a branch and bound solution as shown in Figure 2. Details on executing branch and bound search can be found in [7,8].... In PAGE 9: ... Details on executing branch and bound search can be found in [7,8]. Set of nodes BC1 BC2 BC3 BC4 A1 1-3,2-4 1-3 2-4,1-4 1-4 A2 2-4 2-4 1-3 A3 3-4 3-4,1- 4,4-5 Table1 Blue configurations and min-cut edges. Figure 2.... In PAGE 62: ...Table1 . Comparison of Stream Hierarchy to Conventional Abstractions/Hierarchies Levels Lowest Level Highest Level Abstraction Inter-level Data Migration Memory Hierarchy n External Storage Subset/Cache/Buffer Fetch/Prefetch DBMS Data Hierarchy 3 Physical Storage External View Fetch, Prefetch Data Warehouse n Operational Data Cube/Multidimensional View Aggregation Stream Hierarchy 4 Sensor Data Visualization/Triggers Automatic Push There have been several DSMS projects: STREAM (developed at Stanford) supports SQL-like queries.... In PAGE 68: ... The platform, however, stil does not alow interoperability of heterogeneous networks nor does it introduce a service-based aproach to sensor network. To sum up, ActorNet, along with the other proposals herein reviewed, have aproached reconfigurable sensor network Table1 : Comparison of the aproaches to sensor network reconfiguration System Platform System Requirements Heterogeneous Tasks Node Multiplicity Interoperability of networks Service- oriented infrastructure Mate Virtual Machine TinyOS No Singular No No SensorWare Run-time environment TinyOS Yes Multiple No No Deluge Network programing TinyOS No Singular No No Agila Agent system TinyOS Yes Multiple No No UC Davis framework Agent system Mate, TinyOS Yes Multiple No No ActorNet Agent system TinyOS Yes Multiple No No ... ..."
Table 12. Percentages for the head training and test samples that were located within the appropriate clusters for the 8 by 8 units network. Head
Table 1. Parallel text analysis: word clusters associated with uses of the Greek word arche in Thucydides (c. 150,000 words) and five English translations. Translation equivalents are underlined. The clusters cap- ture the senses empire, government, political office, and beginning. The cluster headed ancient (marked in bold) captures a distinct word that happens to share the stem arch-.
2006
"... In PAGE 7: ... One pragmatic approach involves examining translation equivalents: where translators use distinct words in the translation language, we have evidence of a substantive different meaning. Thus Table1 displays one cluster of word meanings for the polysemous Greek word arche, derived from comparison of a Greek source text and five separate English translations. Arche can mean empire, government, political office, and beginning ; by grouping together the words that occur around it, we are able to use translations to identifyits intended sense.... ..."
Cited by 2
Table 2 lists all the simulation settings. Because clustering consumes energy, it should not be executed frequently. To reduce clustering costs, the network operation phase is set to 10 TDMA frames each round. We use a one-hop cluster setting in our simulation. Data gathered from sensors are sent to the cluster heads, which fuse data and send them to the sink. Because sensors are location unaware, we set their transmission range identical to the communication range. A cluster head is capable of increasing its transmission power so that it can communicate with the sink. We conducted 100 independent simulations and calculated the average lifetime of the network. Our radio model is similar to that of [Younis, 04], in which ETx= ERx =50 nJ/bit, Eamp=100 pJ/bit/m2 (n=2) when d lt;d0 or 0.0013pJ/bit/m4 (n=4) when d gt;d0, where d0=75m is the threshold distance. For each simulation setting, we conducted 100 independent simulations and calculated the average lifetime of the network.
2007
"... In PAGE 18: ... Table2 : Simulation settings. To analyze the performance of VCA, we compared it with HEED and GCA.... In PAGE 20: ... Figure 12 shows the network lifetime when the network operation phase is set to 20 TDMA frames. Compared to the settings in Table2 , each cluster head sends more messages to the sink during each round. Consequently, cluster heads consume about twice the amount of energy in each round.... In PAGE 21: ...100 200 300 400 500 30 50 70 90 # round s until the first nod e dies Number of nodes VCA-fitness VCA-Min degree HEED GCA 100 200 300 400 500 300 400 500 600 # rou nds unti l the las t node die s Number of nodes (a) when the first node dies (b) when the last node dies Figure 12: Network lifetime when the network operation time is increased to 20 TDMA frames To study the performance of VCA when nodes are mobile, we conducted a number of simulations with the same settings shown in Table2 . We choose the random waypoint mobility model[Camp, 02] to model node movement.... ..."
Cited by 1
Results 1 - 10
of
15,820
