DocumentCode :
2490918
Title :
Network lifetime maximization by D&C approach in wireless sensor networks
Author :
Wang, Hui ; Agoulmine, Nazim ; Maode Ma ; Jin, Yanliang
Author_Institution :
Networks & Multimedia Syst. Res. Group (LRSM), Univ. of Evry, Evry, France
fYear :
2009
fDate :
26-28 Aug. 2009
Firstpage :
1
Lastpage :
6
Abstract :
The multi-source and single-sink (MSSS) topology is defined as the network topology in wireless sensor networks (WSNs), where all of nodes can gather, receive and transmit data to the sink. We consider the problem of finding the joint optimal scheme with consideration of physical, medium access control (MAC), and network layers to maximize the network lifetime (NL) for the MSSS topology in the energy-constrained WSNs. We note that the multiple-hop (MH) routing is globally optimal scheme to maximize the NL for the single-source and single-sink (SSSS) topology in WSNs. However, since the scheme will cause the source nearest to the sink to run out of its energy earliest in the MSSS case, the results for network lifetime maximization (NLM) in the SSSS topology cannot be directly applied to the MSSS case. The optimization problem, when the link access is an interference-free time division multiple access (TDMA) scheme, can be formulated as a mixed integer-convex programming. When the integer constraints are relaxed to be real values, it becomes a convex problem. First of all, we employ the Karush-Kuhn-Tucker (KKT) optimality conditions to derive analytical expressions of the globally optimal NL for a linear SSSS topology. Then a decomposition and combination (D&C) approach is proposed to obtain suboptimal solutions. As a result, an analytical expression of the suboptimal NL is derived for WSNs with a linear MSSS topology. We also derive the globally optimal NL in the planar SSSS network. The analytical results can be applied to obtain the results in the Planar MSSS case based on the D&C idea. To validate the analysis, numerical results show that the upper-bounds of the NL obtained by our proposed optimization models are tight.
Keywords :
convex programming; integer programming; telecommunication network routing; telecommunication network topology; time division multiple access; wireless sensor networks; Karush-Kuhn-Tucker optimality; MSSS topology; SSSS topology; decomposition and combination approach; interference-free time division multiple access scheme; joint optimal scheme; multi-source and single-sink topology; multiple-hop routing; network lifetime maximization; single-source and single-sink topology; wireless sensor networks; Circuit topology; Data engineering; Energy consumption; Interference; Media Access Protocol; Multimedia systems; Network topology; Routing; Time division multiple access; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Networking in China, 2009. ChinaCOM 2009. Fourth International Conference on
Conference_Location :
Xian
Print_ISBN :
978-1-4244-4337-6
Electronic_ISBN :
978-1-4244-4337-6
Type :
conf
DOI :
10.1109/CHINACOM.2009.5339873
Filename :
5339873
Link To Document :
بازگشت