DocumentCode
2605274
Title
Sensor Networks Protocol Design Using Random Markov Field Theory
Author
Perreau, Sylvie ; Sigelle, Marc ; Silva, Paolo Da ; Jayasuriya, Aruna
Author_Institution
Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA, Australia
fYear
2009
fDate
22-26 June 2009
Firstpage
1
Lastpage
8
Abstract
In this paper, we present a new general framework allowing sensor networks design using random Markov fields (MRF) theory. We explain how the principles underlying MRF theory naturally fit design requirements in sensor networks in particular the need to rely on decentralised and distributed methods to solve global optimisation problems. We illustrate the potential of this new general concept with the practical problems of power control and resource allocation. In addition, we present a new method to improve the convergence rate of the simulated annealing when the sensor network design problem is a constrained optimisation problem.
Keywords
Markov processes; convergence; distributed sensors; protocols; simulated annealing; constrained optimisation problem; convergence rate; decentralised methods; distributed methods; global optimisation problems; power control; random Markov field theory; resource allocation; sensor networks protocol design; simulated annealing; Ad hoc networks; Base stations; Communications Society; Decision making; Design optimization; Image processing; Power control; Protocols; Resource management; Sensor phenomena and characterization;
fLanguage
English
Publisher
ieee
Conference_Titel
Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON '09. 6th Annual IEEE Communications Society Conference on
Conference_Location
Rome
Print_ISBN
978-1-4244-2907-3
Electronic_ISBN
978-1-4244-2908-0
Type
conf
DOI
10.1109/SAHCN.2009.5168969
Filename
5168969
Link To Document