By Topic

In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Iyer, S.K. ; Dept. of Math., Indian Inst. of Sci., Bangalore, India ; Manjunath, D. ; Sundaresan, R.

We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Θ(1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is Θ(√n) time units. We further extend our approach to a network with noisy links. While the refresh rate remains Θ(1) time units per sample, the delay increases to Θ(√n log n). The number of transmissions in both cases is Θ(n) per histogram sample. The achieved Θ(1) refresh rate for PAC histogram computation is a significant improvement over the refresh rate of Θ(1/log n) for histogram computation in noiseless networks. We achieve this by operating in the supercritical thermodynamic regime where large pathways for communication build up, but the network may have more than one component. The largest component however will have an arbitrarily large fraction of nodes in order to enable approximate computation of the histogram to the desired level of accuracy. Operation in the supercritical thermodynamic regime also reduces energy consumption. A key step in the proof of our achievability result is the construction of a connected component having bounded degree and any desired fraction of nodes. This construction may also prove useful in other communication settings on the random geometric graph.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:10 ,  Issue: 1 )