Achieving scalability and expressiveness in an Internet-scale event notification service
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
STEAM: Event-Based Middleware for Wireless Ad Hoc Network
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Publish/Subscribe Tree Construction in Wireless Ad-Hoc Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Herald: Achieving a Global Event Notification Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Proceedings of the 1st international conference on Embedded networked sensor systems
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
The dynamic behavior of a data dissemination protocol for network programming at scale
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Publish/subscribe in a mobile environment
Wireless Networks - Special issue: Pervasive computing and communications
MNP: Multihop Network Reprogramming Service for Sensor Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Telos: enabling ultra-low power wireless research
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Pervasive and Mobile Computing
Mobile node authentication using key distribution scheme in wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Wireless Sensor Networks (WSN) monitor large environments for long periods of time. During this period, mechanisms are needed to propagate code updates to the network when needed. In this paper, a distributed code propagation algorithm that utilises reliable transport to all sensors is presented. A mathematical model is developed to analyse the achievable network branch capacities in terms of optimum node numbers per tree level. The outcome of the analysis is used to construct an optimum tree with heuristically best children lists. The capacity analysis is verified with experimental testbed and simulation results and the performance gain is shown.