Record Details

On distributed function computation in structure-free random networks

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title On distributed function computation in structure-free random networks
 
Creator KAMATH, S
MANJUNATH, D
 
Description We consider in-network computation of MAX in a structure-free random multihop wireless network. Nodes do not know their relative or absolute locations and use the Aloha MAC protocol. For one-shot computation, we describe a protocol in which the MAX value becomes available at the origin in O(root n-/logn) slots with high probability. This is within a constant factor of that required by the best coordinated protocol. A minimal structure (knowledge of hop-distance from the sink) is imposed on the network and with this structure, we describe a protocol for pipelined computation of MAX that achieves a rate of Omega(1/(log(2) n)).
 
Publisher IEEE
 
Date 2011-10-24T23:50:50Z
2011-12-15T09:11:50Z
2011-10-24T23:50:50Z
2011-12-15T09:11:50Z
2008
 
Type Proceedings Paper
 
Identifier 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6,647-651
978-1-4244-2256-2
http://dx.doi.org/10.1109/ISIT.2008.4595066
http://dspace.library.iitb.ac.in/xmlui/handle/10054/15546
http://hdl.handle.net/100/2316
 
Source IEEE International Symposium on Information Theory,Toronto, CANADA,JUL 06-11, 2008
 
Language English