Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"In-network computation"”.
-
In-network computation in sensor networks
Sensor networks are an important emerging class of networks that have many applications. A sink in these networks acts as a bridge between the sensor nodes and the end-user (which may be automated and/or part of the sink). Typically, convergecast is performed in which all the data collected by the …
-
Tracing and troubleshooting in-network computation
There is a growing move to offload functionality, e.g., TCP or key-value stores, into the network – either on SmartNICs or programmable switches. While offloading promises significant performance boosts, these programmable devices often provide little visibil ity into their performance. Moreover, …
-
In -Network Computation in Wireless Sensor Networks
Next, we study another important metric in sensor networks, which is network lifetime. We consider a formulation of maximizing network lifetime given the simple task of downloading different quantities of data over nodes with different energy levels. We reduce the problem of choosing lifetime …
-
DESIGN AND ANALYSIS OF NETWORK-ON-CHIP BASED HARDWARE ACCELERATOR ARCHITECTURES FOR NEURAL NETWORK APPLICATIONS
Deep learning has transformed fields such as robotics, computer vision, and language processing, leading to a sharp rise in computational demands across cloud and edge platforms. This has driven the proliferation of specialized AI accelerators, including commercial solutions like Apple’s Neural …
-
Cooperative Protocols In Dense Wireless Networks For Broadcast And Consensus
Network congestion is a communication bottleneck in large wireless networks which use packet-switched communications, impeding their performance in critical applications like network broadcast and in-network data processing. This forms the motivation for this thesis. We propose low complexity …
-
Sampling Rate Distortion
… of k ≤ m components are sampled at each time instant and jointly compressed with the objective of reconstructing a prespecified subset of the m components under a given distortion criterion. The combined sampling and lossy compression mechanisms are to be designed to perform robustly with or …
-
Aggregation, dissemination and filtering : controlling complex information flows in networks
Modern day networks, both physical and virtual, are designed to support increasingly sophisticated applications based on complex manipulation of information flows. On the flip side, the ever-growing scale of the underlying networks necessitate the use of low-complexity algorithms. Exploring this …
-
Scaling Up The Performance of Distributed Key-ValueStores Using Emerging Technologies for Big DataApplications
The explosion in the amount of data with the development of the internet and cloud computing prompted much research to develop systems that are able to store and process this data efficiently. As data is generated by different sources with un-unified structures, NoSQL databases emerged as a …
-
Information aggregation in sensor networks
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-04-11T13:17:52Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Kowshik_Hemant.tex: 305839 bytes, checksum: c635582333168c12ace32a61e311875f (MD5) Kowshik_Hemant.pdf: 814415 bytes, …