Lifetime maximization under reliability constraint via cross-layer strategy in wireless sensor networks

In this paper, we investigate the problem of the lifetime maximization in a wireless sensor network under the constraint of the target end-to-end transmission success probability, by adopting a cross-layer strategy that considers both physical layer (i.e., power control) and network layer (i.e., routing protocol) jointly. We first present the optimal power allocation algorithm for a given routing path. This allocation determines per-hop success probability for each link along the path in order to minimize the total energy consumption while guaranteeing the reliability constraint. Then, we develop an optimal routing algorithm that maximizes the network lifetime and a heuristic algorithm that has lower and tractable complexity. Simulation results reveal that a trade-off relation exists between the network lifetime maximization and the reliability constraint, and that the proposed routing algorithm combined with the optimal power allocation algorithm increases the network lifetime significantly.

[1]  Laurence B. Milstein,et al.  Error statistics in data transmission over fading channels , 1998, IEEE Trans. Commun..

[2]  Qun Li,et al.  Online power-aware routing in wireless Ad-hoc networks , 2001, MobiCom '01.

[3]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[4]  Archan Misra,et al.  Minimum energy paths for reliable communication in multi-hop wireless networks , 2002, MobiHoc '02.

[5]  John Heidemann,et al.  RMST: reliable data transport in sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[6]  S. Nash,et al.  Linear and Nonlinear Programming , 1987 .

[7]  Chieh-Yih Wan,et al.  PSFQ: a reliable transport protocol for wireless sensor networks , 2002, WSNA '02.

[8]  Lei Song,et al.  Hierarchical SIR and rate control on the forward link for CDMA data users under delay and error constraints , 2001, IEEE J. Sel. Areas Commun..

[9]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[10]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[11]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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