Towards optimal rate allocation for data aggregation in wireless sensor networks

This paper aims at achieving optimal rate allocation for data aggregation in wireless sensor networks. We first formulate this rate allocation problem as a network utility maximization problem. Due to its non-convexity, we take a couple of variable substitutions on the original problem and transform it into an approximate problem, which is convex. We then apply duality theory to decompose this approximate problem into a rate control subproblem and a scheduling subproblem. Based on this decomposition, a distributed algorithm for joint rate control and scheduling is designed, and proved to approach arbitrarily close to the optimum of the approximate problem. Finally, we show that our approximate solution can achieve near-optimal performance through both theoretical analysis and simulations.

[1]  Ruzena Bajcsy,et al.  Congestion control and fairness for many-to-one routing in sensor networks , 2004, SenSys '04.

[2]  Mingyan Liu,et al.  On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data , 2003, IPSN.

[3]  Xiaohua Jia,et al.  Minimum-latency aggregation scheduling in multihop wireless networks , 2009, MobiHoc '09.

[4]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[5]  Jianzhong Li,et al.  Distributed Data Aggregation Scheduling in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[6]  Sencun Zhu,et al.  SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks , 2006, MobiHoc '06.

[7]  Jaap-Henk Hoepman,et al.  Simple Distributed Weighted Matchings , 2004, ArXiv.

[8]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[9]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[10]  R. Srikant,et al.  Joint congestion control, routing, and MAC for stability and fairness in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[11]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[12]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[13]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[14]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Klara Nahrstedt,et al.  Optimal Resource Allocation in Overlay Multicast , 2006, IEEE Transactions on Parallel and Distributed Systems.

[16]  Yi Shi,et al.  Rate Allocation and Network Lifetime Problems for Wireless Sensor Networks , 2008, IEEE/ACM Transactions on Networking.

[17]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[18]  Leandros Tassiulas,et al.  Optimization based rate control for multirate multicast sessions , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[20]  Dawn Song,et al.  SIA: Secure information aggregation in sensor networks , 2007, J. Comput. Secur..

[21]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[22]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[23]  Ness B. Shroff,et al.  On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[24]  Yong Yang,et al.  oCast: Optimal multicast routing protocol for wireless sensor networks , 2009, 2009 17th IEEE International Conference on Network Protocols.

[25]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[26]  Panganamala Ramana Kumar,et al.  Toward a theory of in-network computation in wireless sensor networks , 2006, IEEE Communications Magazine.

[27]  Zhan Zhang,et al.  Localized algorithm for aggregate fairness in wireless sensor networks , 2006, MobiCom '06.

[28]  Hui Song,et al.  Routing in intermittently connected sensor networks , 2008, 2008 IEEE International Conference on Network Protocols.

[29]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[30]  Klara Nahrstedt,et al.  Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks , 2005, Mob. Networks Appl..

[31]  Dawn Xiaodong Song,et al.  SIA: secure information aggregation in sensor networks , 2003, SenSys '03.