Skip to main content

A Distributed Gossip Optimization Algorithm for Wireless Multi-hop Networks

  • Conference paper
  • First Online:
Mobile and Wireless Technologies 2017 (ICMWT 2017)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 425))

Included in the following conference series:

  • 1292 Accesses

Abstract

In this paper, we study a constrained network lifetime maximization problem in wireless sensor networks, and introduce a cross-layer formulation with general NUM (network utility maximization) that accommodates routing, scheduling and stream control from different layers of network. Specifically, for this problem, we derive a gossip-based formulation for the consensus agreement on the variables involved, and develop an asynchronous decentralized algorithm specific to the optimization problem. Our numerical experiments exhibit its results, showing that the gossip-based consensus algorithm can actually achieve the optimization objective by means of the simple and robust asynchronous operations developed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Tsitsiklis JN (1984) Problems in decentralized decision making and computation. Ph.D. Dissertation, Mass. Institute of Technology, Cambridge, MA, pp 1–272

    Google Scholar 

  2. Jadbabaie A, Lin J, Morse S (2003) Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans Autom Control 48(6):988–1001

    Article  MathSciNet  Google Scholar 

  3. Xiao L, Boyd S, Kim SJ (2005) Distributed average consensus with least-mean-square deviation. J Parallel Distrib Comput 67:33–46

    Article  MATH  Google Scholar 

  4. Lobel I, Ozdaglar A Distributed subgradient methods for convex optimization over random networks. LIDS, MIT, Technical report 2800

    Google Scholar 

  5. Leinonen M, Codreanu M, Juntti M (2012) Distributed consensus based joint resource and routing optimization in wireless sensor networks. In: Proceedings of ASILOMAR 2012, pp 811–815, November 2012

    Google Scholar 

  6. Mota JFC, Xavier JMF, Aguiar PMQ, Puschel M (2012) ADMM for consensus on colored networks. In: IEEE Annual conference on decision and control (CDC), pp 5116–5121, December 2012

    Google Scholar 

  7. Wei E, Ozdaglar A (2013) Distributed alternating direction method of multipliers. In: Proceedings of the 46th annual conference on information sciences and system, pp 5445–5450

    Google Scholar 

  8. Chen M, Liew S, Shao Z, Kai C (2010) Markov approximation for combinatorial network optimization. In: Proceedings of IEEE INFOCOM 2010, pp 1–9

    Google Scholar 

  9. Cruz RL, Santhanam AV (2003) Optimal routing, link scheduling and power control in multihop wireless networks. In: Proceedings of IEEE INFOCOM 2003, vol 1, pp 702–711

    Google Scholar 

  10. Madan R, Cui S, Lal S, Goldsmith A (2006) Cross-layer design for lifetime maximization in interference-limited wireless sensor networks. IEEE Trans Wireless Commun 5(11):3142–3152

    Article  Google Scholar 

  11. Nama H, Chiang M, Mandayam N (2006) Utility-lifetime trade-off in self-regulating wireless sensor networks: a cross-layer design approach. In: Proceedings of IEEE international conference on communications, vol 8, pp 3511–3561

    Google Scholar 

  12. Palomar DP (2006) Chiang M A tutorial on decomposition methods for network utility maximization. IEEE J Sel Areas Commun 24(8):1439–1451

    Article  Google Scholar 

Download references

Acknowledgment

This work was supported by the National Science Council, Republic of China, under grant MOST 105-2221-E-126-001-MY3.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wan-Ling Chang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media Singapore

About this paper

Cite this paper

Liu, JS., Chang, WL. (2018). A Distributed Gossip Optimization Algorithm for Wireless Multi-hop Networks. In: Kim, K., Joukov, N. (eds) Mobile and Wireless Technologies 2017. ICMWT 2017. Lecture Notes in Electrical Engineering, vol 425. Springer, Singapore. https://doi.org/10.1007/978-981-10-5281-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5281-1_5

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5280-4

  • Online ISBN: 978-981-10-5281-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics