Karnik, Aditya and Kumar, Anurag and Borkar, Vivek (2006) Distributed self-tuning of sensor networks. In: Wireless Networks, 12 (5). pp. 531-544.
1.pdf - Published Version
Restricted to Registered users only
Download (460Kb) | Request a copy
This work is motivated by the need for an ad hoc sensor network to autonomously optimise its performance for given task objectives and constraints. Arguing thatcommunication is the main bottleneck for distributed computation in a sensor network we formulate two approaches for optimisation of computing rates. The first is a team problem for maximising the minimum communication throughput of sensors and the second is a game problem in which cost for each sensor is a measure of its communication time with its neighbours. We investigate adaptive algorithms using which sensors can tune to the optimal channel attempt rates in a distributed fashion. For the team problem, the adaptive scheme is a stochastic gradient algorithm derived from the augmented Lagrangian formulation of the optimisation problem. The game formulation not only leads to an explicit characterisation of the Nash equilibrium but also to a simple iterative scheme by which sensors can learn the equilibrium attempt probabilities using only the estimates of transmission and reception times from their local measurements. Our approach is promising and should be seen as a step towards developing optimally self-organising architectures for sensor networks.
|Item Type:||Journal Article|
|Additional Information:||Copyright of thia article belongs to springer|
|Keywords:||Sensor networks;Maxmin optimization;Games;Stochastic algorithms.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||20 Mar 2009 11:58|
|Last Modified:||19 Sep 2010 04:55|
Actions (login required)