2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks 2011
DOI: 10.1109/sahcn.2011.5984934
|View full text |Cite
|
Sign up to set email alerts
|

Distributed coordination for fast iterative optimization in wireless sensor/actuator networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2014
2014

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…It facilitates data parallel execution of (sub)iterations in the incremental subgradient method [Nedic and Bertsekas 2001] and a randomized local search algorithm [Kansal et al 2006] such that the outcome is equivalent to some random sequence of estimations in each iteration (serializability). A subsequent publication [Balani et al 2011a] demonstrates significant increases in efficiency via similar algorithmic modifications to consensus-based subgradient methods [Johansson et al 2008]. …”
Section: Objective and Proposed Solutionmentioning
confidence: 99%
See 2 more Smart Citations
“…It facilitates data parallel execution of (sub)iterations in the incremental subgradient method [Nedic and Bertsekas 2001] and a randomized local search algorithm [Kansal et al 2006] such that the outcome is equivalent to some random sequence of estimations in each iteration (serializability). A subsequent publication [Balani et al 2011a] demonstrates significant increases in efficiency via similar algorithmic modifications to consensus-based subgradient methods [Johansson et al 2008]. …”
Section: Objective and Proposed Solutionmentioning
confidence: 99%
“…Events are defined as modifications in the external environment, such as users entering or exiting a room or changes in ambient light, to which the controllers must react by altering actuator control inputs. Our prior work [Balani et al 2011a] demonstrates that the former metric is often misleading, as a lower iteration count, although important, does not necessarily translate to lower latency.…”
Section: Incremental Subgradient Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The first is by estimating the state of the system at all controllers through several iterations of local message exchange and executing the control input after consensus has been achieved on the system state [12]. The second technique is to successively determine control inputs based on localized message exchanges with neighboring controllers until convergence is achieved to the required state [13]. Note that in both these methods, although message exchange in each iteration is local, information is essentially propagated system-wide through multiple such iterations before convergence is achieved.…”
Section: Related Workmentioning
confidence: 99%
“…However, from a communication perspective, a fundamental challenge still remains-the timely and reliable supply of required system state information to each controller. Typically, control decentralization is achieved either by first estimating a synchronous global state at all controllers and then computing the new input [12] or by iteratively computing control inputs based on local information exchange until the solution converges to an optimal control input [13]. Note that although consensus in these techniques is typically achieved by a local exchange of messages with neighboring controllers, both these methods involve several rounds of such message exchange before computing the next control input.…”
Section: Introductionmentioning
confidence: 99%