Results 1 - 10 of 89,940

Table 1: Energy consumed by the different in- network aggregation algorithms

in in-network aggregation trade-offs for data collection in wireless sensor networks
by Ignacio Solis, Katia Obraczka 2003
"... In PAGE 9: ... Even for the no-aggregation case, where packets are for- warded immediately after they are received, placing the sink in the center yields fresher data. Aggregation type / Scenario Corner Random Center Number of packets sent 0 100 200 300 400 500 600 None None None Periodic Periodic Periodic PHSimple PHSimple PHSimple PHAdjusted PHAdjusted PHAdjusted Figure 3: Number of data packets transmitted per round From Table1 , which shows the energy consumed by the different algorithms, we observe that, for our experimental setup, energy consumption can be re- duced to a third when data aggregation is used. Note that all aggregation schemes exhibit similar energy... ..."
Cited by 9

Table 1.1. Summary of Data Dissemination Protocols for Sensor Networks (supported properties or functionalities: 1. multiple sinks 2. sink mobility 3. load balancing 4. robustness 6. real time 7. in-network processing 8. query dissemination to targeted regions)

in Dissemination Protocols For Large Sensor Networks
by Fan Ye, Haiyun Luo, Songwu Lu, Lixia Zhang

TABLE II AVERAGE RELATIVE RANGES (IN %) WITH NETWORKS OF DIFFERENT SIZES

in Traffic Engineering in a Multipoint-to-Point Network
by Guillaume Urvoy-keller, Gérard Hébuterne, Yves Dallery

Table 1: Illustration of a Routing Table with Attribute-Value Pairs

in Attribute Based Routing in Sensor Networks ∗
by A. Agarwal, T. D. C. Little 2006
"... In PAGE 7: ... The attribute-value pairs exchanged are largely dictated by the sensing application (we show examples later). Messages are decoded using an XML schema defined in the module and a routing table as shown in Table1 is generated. The relevant data are passed to the in-network processing module and then to application-specific semantic rules that define message propagation.... ..."

Table 3. Network Costs between Data Hosts and Compute Resources (in G$/MB)

in A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids
by Srikumar Venugopal, Rajkumar Buyya 2005
Cited by 5

TABLE III NETWORK COSTS BETWEEN DATA HOSTS AND COMPUTE RESOURCES (IN G$/MB)

in An Economy-based Algorithm for Scheduling Data-Intensive Applications on Global Grids
by Srikumar Venugopal, Rajkumar Buyya

Table 2: NS-2 parameters

in A Location Based Aggregation Algorithm for Selective Aggregate Queries in Sensor Networks
by Muhammad Umer, Lars Kulik, Egemen Tanin
"... In PAGE 7: ...ion, i.e., during in-network aggregation each internal node is perfectly synchronized with its children and after aggre- gation it always emits just one packet. Table2 summarizes these parameters. We use total data transmission (in MBs) as an indication of energy usage and hence as the basic metric of performance... ..."

Table 3 In this table, data collected online from in-library and outside of the library usage of networked electronic resources are compared to the results of paper surveys distributed in the library during the sample periods.

in Networked Electronic Services Usage Patterns at Four Academic Health Sciences Libraries
by Brinley Franklin, Terry Plum
"... In PAGE 13: ...Table 3 In this table, data collected online from in-library and outside of the library usage of networked electronic resources are compared to the results of paper surveys distributed in the library during the sample periods. Table3 shows that that the distribution of usage of electronic services and print journals show a similar pattern, although it seems that researchers are depending more on the electronic resources than traditional print journals. In addition, sponsored researchers tend to use electronic services and print journals more in their funded research than they use most other library services or a combined total for all library services, including reference services, instruction sessions, interlibrary loan, journals, monographs, networked electronic services, government documents, audiovisual materials, and reserve ... ..."

Table 1: Characteristics of sensor storage systems System Data Index Reads Writes Order preserving

in Tsar: A two tier sensor storage architecture using interval skip graphs
by Peter Desnoyers, Deepak Ganesan, Prashant Shenoy 2005
"... In PAGE 1: ... Research efforts such as Directed Diffusion [17] have attempted to reduce these read costs, however, by intelligent message routing. Between these two extremes lie a number of other sensor storage systems with different trade-offs, summarized in Table1 . The ge- ographic hash table (GHT) approach [24, 26] advocates the use of an in-network index to augment the fully distributed nature of sen- sor storage.... ..."
Cited by 16

Table 1: Characteristics of sensor storage systems System Data Index Reads Writes Order preserving

in Tsar: A two tier sensor storage architecture using interval skip graphs
by Peter Desnoyers, Deepak Ganesan, Prashant Shenoy 2005
"... In PAGE 1: ... Research efforts such as Directed Diffusion [17] have attempted to reduce these read costs, however, by intelligent message routing. Between these two extremes lie a number of other sensor storage systems with different trade-offs, summarized in Table1 . The ge- ographic hash table (GHT) approach [24, 26] advocates the use of an in-network index to augment the fully distributed nature of sen- sor storage.... ..."
Cited by 16
Results 1 - 10 of 89,940