ICAR Research Data Repository for Knowledge Management
On distributed computation in noisy random planar networks
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
On distributed computation in noisy random planar networks
|
|
| Creator |
KANORIA, YASHODHAN
MANJUNATH, D |
|
| Subject |
computer networks
technical presentations |
|
| Description |
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We present a new algorithm for computation of the maximum value which is order optimal in the number of transmissions and computation time. We also adapt the histogram computation algorithm of Ying et al [1] to make the histogram computation time optimal.
|
|
| Publisher |
IEEE
|
|
| Date |
2008-12-16T12:04:45Z
2011-11-27T14:42:23Z 2011-12-15T09:57:37Z 2008-12-16T12:04:45Z 2011-11-27T14:42:23Z 2011-12-15T09:57:37Z 2007 |
|
| Type |
Article
|
|
| Identifier |
Proceedings of the IEEE International Symposium on Information Theory, Nice, France, 24-29 June 2007, 626-630.
978-1-4244-1397-3 10.1109/ISIT.2007.4557101 http://hdl.handle.net/10054/347 http://dspace.library.iitb.ac.in/xmlui/handle/10054/347 |
|
| Language |
en
|
|