Hybrid Event-Time-Driven Communication and Network Optimization
In sensor networks (SNs), how to allocate the limited resources so as to optimize data gathering and network utility is an important and challenging task. This chapter introduces a hybrid event-time-driven communication and updating scheme, with which sensor network optimization problems can be solved. A distributed hybrid driven optimization algorithm based on the coordinate descent method is presented. The proposed optimization algorithm differs from the existing ones since the hybrid driven scheme allows more choices of actuation time, resulting a tradeoff between communications and computation performance. Applying the proposed algorithm, each sensor node is driven in a hybrid event time manner, which removes the requirement of strict time synchronization. The convergence and optimality of the proposed algorithm are analyzed, and verified by simulation examples. The developed results also show the tradeoff between communications and computation performance.
- 6.P. Wan and M. D. Lemmon, “Event-triggered distributed optimization in sensor networks,” in Proc. Int. Conf. Inf. Process. Sensor Netw. (IPSN ’09), 2009, pp. 49–60.Google Scholar
- 10.E. Wei and A. Ozdaglar, “Distributed alternating direction method of multipliers,” in Proc. 51st IEEE Conf. Decision Control, 2012, pp. 5445–5450.Google Scholar
- 21.B. Min and K. I. Goh, “Multiple resource demands and viability in multiplex networks,” Physical Review E, vol. 89, no. 4, pp. 040802, 2014.Google Scholar