We consider a peer-to-peer approach to wireless sensor networks using the IEEE 802.15.4 standard, with sensors not synchronized, and without any routing protocol. Only communications between neighbors are allowed. In this scenario we do a comparison between four distributed algorithms that solve a special class of optimization problems, which are of great interest in networking applications. We want to retrieve, without a central node, the average of a scalar measurement from all sensors in the network. In the nal state, each sensor should have the global average of the considered measurement. To evaluate performances of the algorithms, we build an application for the network simulator ns2, and we do several simulations to evaluate convergence delay, and nal error, respect to time and to number of packets sent. In this thesis we present the algorithms from theoretical and practical point of views, we describe our application for ns2, and we show the results obtained, which show that this types of algorithms, if tuned properly, work well and are ready to be practically implemented in a real sensor network.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-105895 |
| Date | January 2008 |
| Creators | Carretti, Cesare Maria |
| Publisher | KTH, Reglerteknik |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0026 seconds