×

Optimizing sensor cover energy via DC programming. (English) Zbl 1343.90064

Summary: Wireless sensor coverage problem has been extensively studied in the last years, with growing attention to energy efficient configurations. In the paper we consider the problem of determining the radius of a given number of sensors, covering a set of targets, with the objective of minimizing the total coverage energy consumption. The problem has a non linear objective function and non convex constraints. To solve it we adopt a penalty function approach which allows us to state the problem in difference of convex functions form. Some numerical results are presented on a set of randomly generated test problems.

MSC:

90C26 Nonconvex programming, global optimization
90C90 Applications of mathematical programming
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Yick, J; Mukherjee, B; Ghosal, D, Wireless sensor network survey, Comput. Netw., 52, 2292-2330, (2008)
[2] Mulligan, R, Coverage in wireless sensor networks: a survey, Netw. Protoc. Algorithms, 2, 27-53, (2010)
[3] Bartolini, N; Calamoneri, T; La Porta, T; Petrioli, C; Silvestri, S, Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks, ACM Trans. Sensor Netw. (TOSN), 8, 24, (2012)
[4] Cardei, M; Du, D, Improving wireless sensor network lifetime through poweraware organization, Wirel. Netw., 11, 333-340, (2005)
[5] Cardei, M; Wu, J, Energy-efficient coverage problems in wireless ad-hoc sensor networks, Comput. Commun., 29, 413-420, (2006)
[6] Alfieri, A; Bianco, A; Brandimarte, P; Chiasserini, CF, Maximizing system lifetime in wireless sensor networks, Eur. J. Operat. Res., 181, 390-402, (2007) · Zbl 1121.90309
[7] Cardei, M., Mingming, L., Pervaiz, M.O.: Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: Proceedings of the IEEE international conference on wireless and mobile computing, networking and communications (WiMob) 3, pp. 438-445 (2005) · Zbl 1253.90057
[8] Cerulli, R; Donato, R; Raiconi, A, Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges, Eur. J. Operat. Res., 220, 58-66, (2012) · Zbl 1253.90057
[9] Zou, Z; Das, S; Gupta, H, Variable radii connected sensor cover in sensor networks, ACM Trans. Sensor Netw., 5, 8-36, (2009)
[10] Zhang, H; Hou, JC, Maintaining sensing coverage and connectivity in large sensor networks, Adhoc Sensor Wirel. Netw., 1, 89-124, (2005)
[11] Thi, HA; Pham Dinh, T, The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Ann. Oper. Res., 133, 23-46, (2005) · Zbl 1116.90122
[12] Pham Dinh, T; Le Thi, HA, A D.C. optimization algorithm for solving the trust-region subproblem, SIAM J. Control. Optim., 8, 476-505, (1998) · Zbl 0913.65054
[13] Pattem, S., Poduri, S., Krishnamachari, B.: Energy-quality tradeoffs for target tracking in wireless sensor networks. In: Proceedings of of ACM international conference on information processing in sensor networks (IPSN) (2003) · Zbl 1027.68911
[14] Fuduli, A; Gaudioso, M; Giallombardo, G, Minimizing nonconvex nonsmooth functions via cutting planes and proximity control, SIAM J. Optim., 14, 743-756, (2004) · Zbl 1079.90105
[15] Zangwill, WI, Nonlinear programming via penalty functions, Manag. Sci., 13, 344-358, (1967) · Zbl 0171.18202
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.