Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Distributed stochastic optimization via correlated scheduling

Published: 01 April 2016 Publication History

Abstract

This paper considers a problem where multiple devices make repeated decisions based on their own observed events. The events and decisions at each time-step determine the values of a utility function and a collection of penalty functions. The goal is to make distributed decisions over time to maximize time-average utility subject to time-average constraints on the penalties. An example is a collection of power-constrained sensors that repeatedly report their own observations to a fusion center. Maximum time-average utility is fundamentally reduced because devices do not know the events observed by others. Optimality is characterized for this distributed context. It is shown that optimality is achieved by correlating device decisions through a commonly known pseudo-random sequence. An optimal algorithm is developed that chooses pure strategies at each time-step based on a set of time-varying weights.

References

[1]
M. J. Neely, "Distributed stochastic optimization via correlated scheduling," in Proc. IEEE INFOCOM, Toronto, on, Canada, Apr. 2014, pp. 2418--2426.
[2]
M. J. Neely, Stochastic Network Optimization With Application to Communication and Queueing Systems. San Rafael, CA, USA: Morgan & Claypool, 2010.
[3]
B. Liu et al., "Optimizing information credibility in social swarming applications," IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 6, pp. 1147--1158, Jun. 2012.
[4]
N. Michelusi and M. Zorzi, "Optimal random multiaccess in energy harvesting wireless sensor networks," in Proc. IEEE Int. Conf. Commun., Jun. 2013, pp. 463--468.
[5]
M. J. Osborne and A. Rubinstein, A Course in Game Theory. Cambridge, MA, USA: MIT Press, 1994.
[6]
Y. Shoham and K. Leyton-Brown, Multiagent Systems: Algorithmic, Game-Theoretic, Logical Foundations. New York, NY, USA: Cambridge Univ. Press, 2009.
[7]
R. Aumann, "Subjectivity and correlation in randomized strategies," J. Math. Econ., vol. 1, pp. 67--96, 1974.
[8]
R. Aumann, "Correlated equilibrium as an expression of Bayesian rationality," Econometrica, vol. 55, pp. 1--18, 1987.
[9]
L. Georgiadis, M. J. Neely, and L. Tassiulas, "Resource allocation and cross-layer control in wireless networks," Found. Trends Netw., vol. 1, no. 1, pp. 1--149, 2006.
[10]
M. J. Neely, E. Modiano, and C. Li, "Fairness and optimal stochastic control for heterogeneous networks," IEEE/ACM Trans. Netw., vol. 16, no. 2, pp. 396--409, Apr. 2008.
[11]
X. Lin and N. B. Shroff, "Joint rate control and scheduling in multihop wireless networks," in Proc. 43rd IEEE Conf. Decision Control, Paradise Island, Bahamas, Dec. 2004, vol. 2, pp. 1484--1489.
[12]
L. Xiao, M. Johansson, and S. P. Boyd, "Simultaneous routing and resource allocation via dual decomposition," IEEE Trans. Commun., vol. 52, no. 7, pp. 1136--1144, Jul. 2004.
[13]
S. H. Low and D. E. Lapsley, "Optimization flow control, i: Basic algorithm and convergence," IEEE/ACM Trans. Netw., vol. 7, no. 6, pp. 861--875, Dec. 1999.
[14]
C. C. Moallemi and B. Van Roy, "Distributed optimization in adaptive networks," in Advances in Neural Information Processing Systems. Cambridge, MA, USA: MIT Press, 2004, vol. 16.
[15]
L. Jiang and J. Walrand, "A distributed CSMA algorithm for throughput and utility maximization in wireless networks," in Proc. Allerton Conf. Commun., Control, Comput., Sep. 2008, pp. 1511--1519.
[16]
S. Rajagopalan and D. Shah, "Distributed algorithm and reversible network," in Proc. 42nd Annu. CISS, Princeton, NJ, USA, 2008, pp. 498--502.
[17]
L. Jiang and J. Walrand, Scheduling and Congestion Control for Wireless and Processing Networks. San Rafael, CA, USA: Morgan & Claypool, 2010.
[18]
A. Nayyar, "Sequential decision making in decentralized systems," Ph.D. dissertation, University of Michigan, Ann Arbor, MI, USA, 2011.
[19]
M. J. Neely, "Distributed stochastic optimization via correlated scheduling," ArXiv tech. rep., arXiv:1304.7727v2, May 2013.
[20]
M. J. Neely, S. T. Rager, and T. F. La Porta, "Max weight learning algorithms for scheduling in unknown environments," IEEE Trans. Autom. Control, vol. 57, no. 5, pp. 1179--1191, May 2012.
[21]
D. P. Bertsekas, A. Nedic, and A. E. Ozdaglar, Convex Analysis and Optimization. Boston, MA, USA: Athena Scientific, 2003.

Cited By

View all
  • (2022)Repeated Games, Optimal Channel Capture, and Open Problems for Slotted Multiple Access2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/Allerton49937.2022.9929420(1-8)Online publication date: 27-Sep-2022
  • (2020)Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor NetworksIEEE Transactions on Signal Processing10.1109/TSP.2020.296424168(647-661)Online publication date: 1-Jan-2020
  • (2018)Information-Driven Distributed Sensing for Efficient Bayesian Inference in Internet of Things Systems2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)10.1109/SAHCN.2018.8397111(1-9)Online publication date: 11-Jun-2018

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 24, Issue 2
April 2016
646 pages
ISSN:1063-6692
Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 April 2016
Published in TON Volume 24, Issue 2

Author Tags

  1. decentralized control
  2. optimal control
  3. wireless sensor networks

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 04 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Repeated Games, Optimal Channel Capture, and Open Problems for Slotted Multiple Access2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/Allerton49937.2022.9929420(1-8)Online publication date: 27-Sep-2022
  • (2020)Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor NetworksIEEE Transactions on Signal Processing10.1109/TSP.2020.296424168(647-661)Online publication date: 1-Jan-2020
  • (2018)Information-Driven Distributed Sensing for Efficient Bayesian Inference in Internet of Things Systems2018 15th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)10.1109/SAHCN.2018.8397111(1-9)Online publication date: 11-Jun-2018

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media