A distributed gossip optimization algorithm for wireless multi-hop networks

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Liu, J. S., & Chang, W. L. (2018). A distributed gossip optimization algorithm for wireless multi-hop networks. In Lecture Notes in Electrical Engineering (Vol. 425, pp. 37–45). Springer Verlag. https://doi.org/10.1007/978-981-10-5281-1_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free