Network capacity analysis for code propagation in Wireless Sensor Networks
by Mustafa Bulent Mutluoglu, Sebnem Baydere
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 7, No. 4, 2011

Abstract: 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.

Online publication date: Thu, 23-Jun-2011

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com