-This is pdfTeX, Version 3.1415926-2.4-1.40.13 (TeX Live 2012/Debian) (format=pdflatex 2013.9.3) 19 JUN 2015 15:28
+This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) (preloaded format=pdflatex 2015.1.24) 23 JUN 2015 18:09
entering extended mode
restricted \write18 enabled.
%&-line parsing enabled.
**articleeo.tex
(./articleeo.tex
-LaTeX2e <2011/06/27>
-Babel <v3.8m> and hyphenation patterns for english, dumylang, nohyphenation, lo
-aded.
+LaTeX2e <2014/05/01>
+Babel <3.9l> and hyphenation patterns for 61 languages loaded.
(./gENO2e.cls
Document Class: gENO2e 2013/04/29 v4.1 Engineering Optimization LaTeX2e documen
t class
Package: graphicx 1999/02/16 v1.0f Enhanced LaTeX Graphics (DPC,SPQR)
(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty
-Package: keyval 1999/03/16 v1.13 key=value parser (DPC)
+Package: keyval 2014/05/08 v1.15 key=value parser (DPC)
\KV@toks@=\toks20
)
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty
Package: rotating 1997/09/26, v2.13 Rotation package
(/usr/share/texlive/texmf-dist/tex/latex/base/ifthen.sty
-Package: ifthen 2001/05/26 v1.1c Standard LaTeX ifthen package (DPC)
+Package: ifthen 2014/09/29 v1.1c Standard LaTeX ifthen package (DPC)
)
\c@r@tfl@t=\count118
\rot@float@box=\box30
(/usr/share/texlive/texmf-dist/tex/latex/tools/indentfirst.sty
Package: indentfirst 1995/11/23 v1.03 Indent first paragraph (DPC)
)
-(./articleeo.aux)
+(./algorithm2e.sty
+Package: algorithm2e 2008/00/00 v3.10 algorithms environments
+\c@AlgoLine=\count123
+ (/usr/share/texlive/texmf-dist/tex/latex/tools/xspace.sty
+Package: xspace 2014/10/28 v1.13 Space after command names (DPC,MH)
+)
+(/usr/share/texlive/texmf-dist/tex/latex/relsize/relsize.sty
+Package: relsize 2013/03/29 ver 4.1
+)
+********************************************************
+Package `algorithm2e' Release 4.01 -- december 14 2009 --
+- algorithm2e-announce@lirmm.fr mailing list for announcement about releases
+- algorithm2e-discussion@lirmm.fr mailing list for discussion about package
+subscribe by emailing sympa@lirmm.fr with 'subscribe <list> <firstname name>'
+- Author: Christophe Fiorio (fiorio@lirmm.fr)
+********************************************************
+\skiptotal=\skip55
+\skiplinenumber=\skip56
+\skiprule=\skip57
+\skiphlne=\skip58
+\skiptext=\skip59
+\skiplength=\skip60
+\algomargin=\skip61
+\skipalgocfslide=\skip62
+\algowidth=\dimen152
+\inoutsize=\dimen153
+\inoutline=\dimen154
+\interspacetitleruled=\dimen155
+\interspacealgoruled=\dimen156
+\interspacetitleboxruled=\dimen157
+\algocf@inoutbox=\box31
+\algocf@inputbox=\box32
+\AlCapSkip=\skip63
+\AlCapHSkip=\skip64
+\algocf@nlbox=\box33
+\algocf@hangingbox=\box34
+\algocf@capbox=\box35
+\algoheightruledefault=\skip65
+\algoheightrule=\skip66
+\algotitleheightruledefault=\skip67
+\algotitleheightrule=\skip68
+\c@algocfline=\count124
+\c@algocfproc=\count125
+\c@algocf=\count126
+\algocf@algoframe=\box36
+\algocf@algobox=\box37
+) (./articleeo.aux)
\openout1 = `articleeo.aux'.
-LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 8.
-LaTeX Font Info: ... okay on input line 8.
-LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 8.
-LaTeX Font Info: ... okay on input line 8.
-LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 8.
-LaTeX Font Info: ... okay on input line 8.
-LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 8.
-LaTeX Font Info: ... okay on input line 8.
-LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 8.
-LaTeX Font Info: ... okay on input line 8.
-LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 8.
-LaTeX Font Info: ... okay on input line 8.
- (/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
+LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 9.
+LaTeX Font Info: ... okay on input line 9.
+LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 9.
+LaTeX Font Info: ... okay on input line 9.
+LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 9.
+LaTeX Font Info: ... okay on input line 9.
+LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 9.
+LaTeX Font Info: ... okay on input line 9.
+LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 9.
+LaTeX Font Info: ... okay on input line 9.
+LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 9.
+LaTeX Font Info: ... okay on input line 9.
+
+(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
-\scratchcounter=\count123
-\scratchdimen=\dimen152
-\scratchbox=\box31
-\nofMPsegments=\count124
-\nofMParguments=\count125
+\scratchcounter=\count127
+\scratchdimen=\dimen158
+\scratchbox=\box38
+\nofMPsegments=\count128
+\nofMParguments=\count129
\everyMPshowfont=\toks21
-\MPscratchCnt=\count126
-\MPscratchDim=\dimen153
-\MPnumerator=\count127
-\makeMPintoPDFobject=\count128
+\MPscratchCnt=\count130
+\MPscratchDim=\dimen159
+\MPnumerator=\count131
+\makeMPintoPDFobject=\count132
\everyMPtoPDFconversion=\toks22
) (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/pdftexcmds.sty
Package: pdftexcmds 2011/11/29 v0.20 Utility functions of pdfTeX for LuaTeX (HO
))
LaTeX Font Warning: Font shape `OT1/cmr/m/n' in size <13> not available
-(Font) size <12> substituted on input line 21.
+(Font) size <12> substituted on input line 22.
LaTeX Font Warning: Font shape `OT1/cmr/bx/n' in size <13> not available
-(Font) size <12> substituted on input line 21.
+(Font) size <12> substituted on input line 22.
LaTeX Font Warning: Font shape `OT1/cmr/bx/it' in size <13> not available
-(Font) size <12> substituted on input line 21.
+(Font) size <12> substituted on input line 22.
-LaTeX Font Info: Try loading font information for OML+cmr on input line 21.
+LaTeX Font Info: Try loading font information for OML+cmr on input line 22.
(/usr/share/texlive/texmf-dist/tex/latex/base/omlcmr.fd
-File: omlcmr.fd 1999/05/25 v2.5h Standard LaTeX font definitions
+File: omlcmr.fd 2014/09/29 v2.5h Standard LaTeX font definitions
)
LaTeX Font Info: Font shape `OML/cmr/m/it' in size <10> not available
-(Font) Font shape `OML/cmm/m/it' tried instead on input line 21.
+(Font) Font shape `OML/cmm/m/it' tried instead on input line 22.
LaTeX Font Info: Font shape `OML/cmr/m/it' in size <7> not available
-(Font) Font shape `OML/cmm/m/it' tried instead on input line 21.
+(Font) Font shape `OML/cmm/m/it' tried instead on input line 22.
LaTeX Font Info: Font shape `OML/cmr/m/it' in size <5> not available
-(Font) Font shape `OML/cmm/m/it' tried instead on input line 21.
-LaTeX Font Info: Try loading font information for OMS+cmr on input line 21.
+(Font) Font shape `OML/cmm/m/it' tried instead on input line 22.
+LaTeX Font Info: Try loading font information for OMS+cmr on input line 22.
(/usr/share/texlive/texmf-dist/tex/latex/base/omscmr.fd
-File: omscmr.fd 1999/05/25 v2.5h Standard LaTeX font definitions
+File: omscmr.fd 2014/09/29 v2.5h Standard LaTeX font definitions
)
LaTeX Font Info: Font shape `OMS/cmr/m/n' in size <10> not available
-(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 21.
+(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 22.
LaTeX Font Info: Font shape `OMS/cmr/m/n' in size <7> not available
-(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 21.
+(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 22.
LaTeX Font Info: Font shape `OMS/cmr/m/n' in size <5> not available
-(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 21.
-LaTeX Font Info: Try loading font information for OMX+cmr on input line 21.
-LaTeX Font Info: No file OMXcmr.fd. on input line 21.
+(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 22.
+LaTeX Font Info: Try loading font information for OMX+cmr on input line 22.
+LaTeX Font Info: No file OMXcmr.fd. on input line 22.
LaTeX Font Warning: Font shape `OMX/cmr/m/n' undefined
-(Font) using `OMX/cmex/m/n' instead on input line 21.
+(Font) using `OMX/cmex/m/n' instead on input line 22.
-LaTeX Font Info: Try loading font information for U+msa on input line 21.
+LaTeX Font Info: Try loading font information for U+msa on input line 22.
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd
-File: umsa.fd 2009/06/22 v3.00 AMS symbols A
+File: umsa.fd 2013/01/14 v3.01 AMS symbols A
)
-LaTeX Font Info: Try loading font information for U+msb on input line 21.
+LaTeX Font Info: Try loading font information for U+msb on input line 22.
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd
-File: umsb.fd 2009/06/22 v3.00 AMS symbols B
+File: umsb.fd 2013/01/14 v3.01 AMS symbols B
)
LaTeX Font Info: Font shape `OML/cmr/m/it' in size <8> not available
-(Font) Font shape `OML/cmm/m/it' tried instead on input line 21.
+(Font) Font shape `OML/cmm/m/it' tried instead on input line 22.
LaTeX Font Info: Font shape `OML/cmr/m/it' in size <6> not available
-(Font) Font shape `OML/cmm/m/it' tried instead on input line 21.
+(Font) Font shape `OML/cmm/m/it' tried instead on input line 22.
LaTeX Font Info: Font shape `OMS/cmr/m/n' in size <8> not available
-(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 21.
+(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 22.
LaTeX Font Info: Font shape `OMS/cmr/m/n' in size <6> not available
-(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 21.
-LaTeX Font Info: Calculating math sizes for size <11> on input line 43.
+(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 22.
+LaTeX Font Info: Calculating math sizes for size <11> on input line 46.
LaTeX Font Warning: Font shape `OT1/cmr/m/n' in size <5.5> not available
-(Font) size <5> substituted on input line 43.
+(Font) size <5> substituted on input line 46.
LaTeX Font Info: Font shape `OML/cmr/m/it' in size <11> not available
-(Font) Font shape `OML/cmm/m/it' tried instead on input line 43.
+(Font) Font shape `OML/cmm/m/it' tried instead on input line 46.
LaTeX Font Info: Font shape `OML/cmr/m/it' in size <7.69997> not available
-(Font) Font shape `OML/cmm/m/it' tried instead on input line 43.
+(Font) Font shape `OML/cmm/m/it' tried instead on input line 46.
LaTeX Font Info: Font shape `OML/cmr/m/it' in size <5.5> not available
-(Font) Font shape `OML/cmm/m/it' tried instead on input line 43.
+(Font) Font shape `OML/cmm/m/it' tried instead on input line 46.
LaTeX Font Warning: Font shape `OML/cmm/m/it' in size <5.5> not available
-(Font) size <5> substituted on input line 43.
+(Font) size <5> substituted on input line 46.
LaTeX Font Info: Font shape `OMS/cmr/m/n' in size <11> not available
-(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 43.
+(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 46.
LaTeX Font Info: Font shape `OMS/cmr/m/n' in size <7.69997> not available
-(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 43.
+(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 46.
LaTeX Font Info: Font shape `OMS/cmr/m/n' in size <5.5> not available
-(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 43.
+(Font) Font shape `OMS/cmsy/m/n' tried instead on input line 46.
LaTeX Font Warning: Font shape `OMS/cmsy/m/n' in size <5.5> not available
-(Font) size <5> substituted on input line 43.
-
-
-Underfull \hbox (badness 10000) in paragraph at lines 61--75
-
- []
+(Font) size <5> substituted on input line 46.
Underfull \vbox (badness 10000) has occurred while \output is active []
[3]
LaTeX Font Warning: Font shape `OT1/cmr/bx/sc' undefined
-(Font) using `OT1/cmr/bx/n' instead on input line 208.
+(Font) using `OT1/cmr/bx/n' instead on input line 220.
Package epstopdf Info: Source file: <figure1a.eps>
-(epstopdf) date: 2015-02-20 10:11:12
+(epstopdf) date: 2015-02-20 10:20:43
(epstopdf) size: 358485 bytes
(epstopdf) Output file: <figure1a-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:43
+(epstopdf) date: 2015-02-20 10:20:45
(epstopdf) size: 78307 bytes
(epstopdf) Command: <repstopdf --outfile=figure1a-eps-converted-to.
pdf figure1a.eps>
-(epstopdf) \includegraphics on input line 254.
+(epstopdf) \includegraphics on input line 268.
Package epstopdf Info: Output file is already uptodate.
<figure1a-eps-converted-to.pdf, id=24, 418.56375pt x 396.48125pt>
File: figure1a-eps-converted-to.pdf Graphic file (type pdf)
<use figure1a-eps-converted-to.pdf>
-Package pdftex.def Info: figure1a-eps-converted-to.pdf used on input line 254.
+Package pdftex.def Info: figure1a-eps-converted-to.pdf used on input line 268.
(pdftex.def) Requested size: 213.39566pt x 202.1362pt.
Package epstopdf Info: Source file: <figure1b.eps>
-(epstopdf) date: 2015-02-20 10:11:12
+(epstopdf) date: 2015-02-20 10:20:43
(epstopdf) size: 241675 bytes
(epstopdf) Output file: <figure1b-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:44
+(epstopdf) date: 2015-02-20 10:20:46
(epstopdf) size: 57181 bytes
(epstopdf) Command: <repstopdf --outfile=figure1b-eps-converted-to.
pdf figure1b.eps>
-(epstopdf) \includegraphics on input line 255.
+(epstopdf) \includegraphics on input line 269.
Package epstopdf Info: Output file is already uptodate.
<figure1b-eps-converted-to.pdf, id=25, 385.44pt x 269.005pt>
File: figure1b-eps-converted-to.pdf Graphic file (type pdf)
<use figure1b-eps-converted-to.pdf>
-Package pdftex.def Info: figure1b-eps-converted-to.pdf used on input line 255.
+Package pdftex.def Info: figure1b-eps-converted-to.pdf used on input line 269.
(pdftex.def) Requested size: 213.39566pt x 148.93011pt.
Underfull \vbox (badness 10000) has occurred while \output is active []
[5 <./figure1a-eps-converted-to.pdf> <./figure1b-eps-converted-to.pdf>]
Package epstopdf Info: Source file: <figure2.eps>
-(epstopdf) date: 2015-02-20 10:11:12
+(epstopdf) date: 2015-02-20 10:20:43
(epstopdf) size: 508784 bytes
(epstopdf) Output file: <figure2-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:44
+(epstopdf) date: 2015-02-20 10:20:46
(epstopdf) size: 138861 bytes
(epstopdf) Command: <repstopdf --outfile=figure2-eps-converted-to.p
df figure2.eps>
-(epstopdf) \includegraphics on input line 298.
+(epstopdf) \includegraphics on input line 311.
Package epstopdf Info: Output file is already uptodate.
<figure2-eps-converted-to.pdf, id=41, 518.93875pt x 260.975pt>
File: figure2-eps-converted-to.pdf Graphic file (type pdf)
<use figure2-eps-converted-to.pdf>
-Package pdftex.def Info: figure2-eps-converted-to.pdf used on input line 298.
+Package pdftex.def Info: figure2-eps-converted-to.pdf used on input line 311.
(pdftex.def) Requested size: 362.77263pt x 182.4463pt.
Underfull \vbox (badness 10000) has occurred while \output is active []
[6 <./figure2-eps-converted-to.pdf>]
Package epstopdf Info: Source file: <figure3.eps>
-(epstopdf) date: 2015-02-20 10:11:12
+(epstopdf) date: 2015-02-20 10:20:43
(epstopdf) size: 196938 bytes
(epstopdf) Output file: <figure3-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:45
+(epstopdf) date: 2015-02-20 10:20:47
(epstopdf) size: 48639 bytes
(epstopdf) Command: <repstopdf --outfile=figure3-eps-converted-to.p
df figure3.eps>
-(epstopdf) \includegraphics on input line 348.
+(epstopdf) \includegraphics on input line 356.
Package epstopdf Info: Output file is already uptodate.
<figure3-eps-converted-to.pdf, id=48, 332.24126pt x 276.03125pt>
File: figure3-eps-converted-to.pdf Graphic file (type pdf)
<use figure3-eps-converted-to.pdf>
-Package pdftex.def Info: figure3-eps-converted-to.pdf used on input line 348.
+Package pdftex.def Info: figure3-eps-converted-to.pdf used on input line 356.
(pdftex.def) Requested size: 177.82971pt x 147.74475pt.
Package epstopdf Info: Source file: <figure4.eps>
-(epstopdf) date: 2015-02-20 10:11:12
+(epstopdf) date: 2015-02-20 10:20:43
(epstopdf) size: 428048 bytes
(epstopdf) Output file: <figure4-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:45
+(epstopdf) date: 2015-02-20 10:20:47
(epstopdf) size: 76496 bytes
(epstopdf) Command: <repstopdf --outfile=figure4-eps-converted-to.p
df figure4.eps>
-(epstopdf) \includegraphics on input line 381.
+(epstopdf) \includegraphics on input line 394.
Package epstopdf Info: Output file is already uptodate.
<figure4-eps-converted-to.pdf, id=49, 493.845pt x 362.35374pt>
File: figure4-eps-converted-to.pdf Graphic file (type pdf)
<use figure4-eps-converted-to.pdf>
-Package pdftex.def Info: figure4-eps-converted-to.pdf used on input line 381.
-(pdftex.def) Requested size: 227.62204pt x 167.01096pt.
+Package pdftex.def Info: figure4-eps-converted-to.pdf used on input line 394.
+(pdftex.def) Requested size: 241.84842pt x 177.44983pt.
Underfull \vbox (badness 10000) has occurred while \output is active []
Overfull \vbox (701.0pt too high) has occurred while \output is active []
[7 <./figure3-eps-converted-to.pdf>]
+
+LaTeX Warning: Reference `alg:PeCO' on page 8 undefined on input line 421.
+
+
Underfull \vbox (badness 10000) has occurred while \output is active []
[10]
-LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 642.
+LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 682.
+
+
+LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 697.
-LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 657.
+
+LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 710.
[11]
-LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 670.
-
-
+LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 717.
-LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 677.
+LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 719.
-LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 679.
-
-LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 681.
+LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 721.
[12]
Package epstopdf Info: Source file: <figure5.eps>
-(epstopdf) date: 2015-02-06 11:42:02
+(epstopdf) date: 2015-02-20 10:16:57
(epstopdf) size: 29526 bytes
(epstopdf) Output file: <figure5-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:46
-(epstopdf) size: 12638 bytes
+(epstopdf) date: 2015-02-20 10:17:32
+(epstopdf) size: 12679 bytes
(epstopdf) Command: <repstopdf --outfile=figure5-eps-converted-to.p
df figure5.eps>
-(epstopdf) \includegraphics on input line 738.
+(epstopdf) \includegraphics on input line 778.
Package epstopdf Info: Output file is already uptodate.
<figure5-eps-converted-to.pdf, id=81, 484.81125pt x 350.30875pt>
File: figure5-eps-converted-to.pdf Graphic file (type pdf)
<use figure5-eps-converted-to.pdf>
-Package pdftex.def Info: figure5-eps-converted-to.pdf used on input line 738.
+Package pdftex.def Info: figure5-eps-converted-to.pdf used on input line 778.
(pdftex.def) Requested size: 242.40503pt x 175.15395pt.
Package epstopdf Info: Source file: <figure6.eps>
-(epstopdf) date: 2015-02-06 11:42:02
+(epstopdf) date: 2015-02-20 10:16:57
(epstopdf) size: 29515 bytes
(epstopdf) Output file: <figure6-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:46
-(epstopdf) size: 12695 bytes
+(epstopdf) date: 2015-02-20 10:17:32
+(epstopdf) size: 12739 bytes
(epstopdf) Command: <repstopdf --outfile=figure6-eps-converted-to.p
df figure6.eps>
-(epstopdf) \includegraphics on input line 760.
+(epstopdf) \includegraphics on input line 800.
Package epstopdf Info: Output file is already uptodate.
<figure6-eps-converted-to.pdf, id=82, 484.81125pt x 350.30875pt>
File: figure6-eps-converted-to.pdf Graphic file (type pdf)
<use figure6-eps-converted-to.pdf>
-Package pdftex.def Info: figure6-eps-converted-to.pdf used on input line 760.
+Package pdftex.def Info: figure6-eps-converted-to.pdf used on input line 800.
(pdftex.def) Requested size: 242.40503pt x 175.15395pt.
Underfull \vbox (badness 10000) has occurred while \output is active []
[13 <./figure5-eps-converted-to.pdf> <./figure6-eps-converted-to.pdf>]
Package epstopdf Info: Source file: <figure7a.eps>
-(epstopdf) date: 2015-02-06 11:42:02
+(epstopdf) date: 2015-02-20 10:16:57
(epstopdf) size: 24136 bytes
(epstopdf) Output file: <figure7a-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:46
-(epstopdf) size: 8179 bytes
+(epstopdf) date: 2015-02-20 10:17:32
+(epstopdf) size: 8217 bytes
(epstopdf) Command: <repstopdf --outfile=figure7a-eps-converted-to.
pdf figure7a.eps>
-(epstopdf) \includegraphics on input line 783.
+(epstopdf) \includegraphics on input line 823.
Package epstopdf Info: Output file is already uptodate.
<figure7a-eps-converted-to.pdf, id=97, 493.845pt x 350.30875pt>
File: figure7a-eps-converted-to.pdf Graphic file (type pdf)
<use figure7a-eps-converted-to.pdf>
-Package pdftex.def Info: figure7a-eps-converted-to.pdf used on input line 783.
+Package pdftex.def Info: figure7a-eps-converted-to.pdf used on input line 823.
(pdftex.def) Requested size: 234.5788pt x 166.39838pt.
Package epstopdf Info: Source file: <figure7b.eps>
-(epstopdf) date: 2015-02-06 11:42:02
+(epstopdf) date: 2015-02-20 10:16:57
(epstopdf) size: 24138 bytes
(epstopdf) Output file: <figure7b-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:47
-(epstopdf) size: 8180 bytes
+(epstopdf) date: 2015-02-20 10:17:33
+(epstopdf) size: 8218 bytes
(epstopdf) Command: <repstopdf --outfile=figure7b-eps-converted-to.
pdf figure7b.eps>
-(epstopdf) \includegraphics on input line 784.
+(epstopdf) \includegraphics on input line 824.
Package epstopdf Info: Output file is already uptodate.
<figure7b-eps-converted-to.pdf, id=98, 493.845pt x 350.30875pt>
File: figure7b-eps-converted-to.pdf Graphic file (type pdf)
<use figure7b-eps-converted-to.pdf>
-Package pdftex.def Info: figure7b-eps-converted-to.pdf used on input line 784.
+Package pdftex.def Info: figure7b-eps-converted-to.pdf used on input line 824.
(pdftex.def) Requested size: 234.5788pt x 166.39838pt.
Package epstopdf Info: Source file: <figure8a.eps>
-(epstopdf) date: 2015-02-06 11:42:03
+(epstopdf) date: 2015-02-20 10:16:57
(epstopdf) size: 24103 bytes
(epstopdf) Output file: <figure8a-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:47
-(epstopdf) size: 8351 bytes
+(epstopdf) date: 2015-02-20 10:17:33
+(epstopdf) size: 8390 bytes
(epstopdf) Command: <repstopdf --outfile=figure8a-eps-converted-to.
pdf figure8a.eps>
-(epstopdf) \includegraphics on input line 810.
+(epstopdf) \includegraphics on input line 850.
Package epstopdf Info: Output file is already uptodate.
<figure8a-eps-converted-to.pdf, id=99, 493.845pt x 350.30875pt>
File: figure8a-eps-converted-to.pdf Graphic file (type pdf)
<use figure8a-eps-converted-to.pdf>
-Package pdftex.def Info: figure8a-eps-converted-to.pdf used on input line 810.
+Package pdftex.def Info: figure8a-eps-converted-to.pdf used on input line 850.
(pdftex.def) Requested size: 234.5788pt x 166.39838pt.
Package epstopdf Info: Source file: <figure8b.eps>
-(epstopdf) date: 2015-02-06 11:42:03
+(epstopdf) date: 2015-02-20 10:16:57
(epstopdf) size: 24855 bytes
(epstopdf) Output file: <figure8b-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:47
-(epstopdf) size: 8466 bytes
+(epstopdf) date: 2015-02-20 10:17:33
+(epstopdf) size: 8505 bytes
(epstopdf) Command: <repstopdf --outfile=figure8b-eps-converted-to.
pdf figure8b.eps>
-(epstopdf) \includegraphics on input line 811.
+(epstopdf) \includegraphics on input line 851.
Package epstopdf Info: Output file is already uptodate.
<figure8b-eps-converted-to.pdf, id=100, 493.845pt x 350.30875pt>
File: figure8b-eps-converted-to.pdf Graphic file (type pdf)
<use figure8b-eps-converted-to.pdf>
-Package pdftex.def Info: figure8b-eps-converted-to.pdf used on input line 811.
+Package pdftex.def Info: figure8b-eps-converted-to.pdf used on input line 851.
(pdftex.def) Requested size: 234.5788pt x 166.39838pt.
+
+LaTeX Warning: `!h' float specifier changed to `!ht'.
+
+
Underfull \vbox (badness 10000) has occurred while \output is active []
[14 <./figure7a-eps-converted-to.pdf> <./figure7b-eps-converted-to.pdf>]
Package epstopdf Info: Source file: <figure9.eps>
-(epstopdf) date: 2015-02-06 11:42:03
+(epstopdf) date: 2015-02-20 10:16:57
(epstopdf) size: 27000 bytes
(epstopdf) Output file: <figure9-eps-converted-to.pdf>
-(epstopdf) date: 2015-02-20 10:12:48
-(epstopdf) size: 7927 bytes
+(epstopdf) date: 2015-02-20 10:17:33
+(epstopdf) size: 7971 bytes
(epstopdf) Command: <repstopdf --outfile=figure9-eps-converted-to.p
df figure9.eps>
-(epstopdf) \includegraphics on input line 833.
+(epstopdf) \includegraphics on input line 873.
Package epstopdf Info: Output file is already uptodate.
<figure9-eps-converted-to.pdf, id=114, 484.81125pt x 350.30875pt>
File: figure9-eps-converted-to.pdf Graphic file (type pdf)
<use figure9-eps-converted-to.pdf>
-Package pdftex.def Info: figure9-eps-converted-to.pdf used on input line 833.
+Package pdftex.def Info: figure9-eps-converted-to.pdf used on input line 873.
(pdftex.def) Requested size: 242.40503pt x 175.15395pt.
-
-LaTeX Warning: `!h' float specifier changed to `!ht'.
-
-
-LaTeX Warning: `h' float specifier changed to `ht'.
-
-
Underfull \vbox (badness 10000) has occurred while \output is active []
Overfull \vbox (701.0pt too high) has occurred while \output is active []
- [15 <./figure8a-eps-converted-to.pdf> <./figure8b-eps-converted-to.pdf>]
-(./articleeo.bbl
+ [15 <./figure8a-eps-converted-to.pdf> <./figure8b-eps-converted-to.pdf> <./fig
+ure9-eps-converted-to.pdf>] (./articleeo.bbl
+Underfull \vbox (badness 4752) has occurred while \output is active []
+
+
Underfull \vbox (badness 10000) has occurred while \output is active []
Overfull \vbox (701.0pt too high) has occurred while \output is active []
- [16 <./figure9-eps-converted-to.pdf>]
+ [16]
Underfull \vbox (badness 10000) has occurred while \output is active []
LaTeX Font Warning: Some font shapes were not available, defaults substituted.
+
+LaTeX Warning: There were undefined references.
+
)
Here is how much of TeX's memory you used:
- 3712 strings out of 495059
- 48196 string characters out of 3182031
- 114324 words of memory out of 3000000
- 6820 multiletter control sequences out of 15000+200000
- 14560 words of font info for 56 fonts, out of 3000000 for 9000
- 14 hyphenation exceptions out of 8191
- 41i,14n,27p,839b,355s stack positions out of 5000i,500n,10000p,200000b,50000s
+ 4823 strings out of 493221
+ 62796 string characters out of 6141266
+ 153132 words of memory out of 5000000
+ 8173 multiletter control sequences out of 15000+600000
+ 14560 words of font info for 56 fonts, out of 8000000 for 9000
+ 1119 hyphenation exceptions out of 8191
+ 41i,18n,27p,839b,369s stack positions out of 5000i,500n,10000p,200000b,80000s
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb></us
r/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx9.pfb></usr/share
/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmbxti10.pfb></usr/share/tex
/public/amsfonts/cm/cmti10.pfb></usr/share/texlive/texmf-dist/fonts/type1/publi
c/amsfonts/cm/cmti8.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfo
nts/symbols/msbm10.pfb>
-Output written on articleeo.pdf (19 pages, 743136 bytes).
+Output written on articleeo.pdf (19 pages, 742959 bytes).
PDF statistics:
213 PDF objects out of 1000 (max. 8388607)
145 compressed objects within 2 object streams
%\usepackage[linesnumbered,ruled,vlined,commentsnumbered]{algorithm2e}
%\renewcommand{\algorithmcfname}{ALGORITHM}
\usepackage{indentfirst}
+\usepackage[algo2e,ruled,vlined]{algorithm2e}
\begin{document}
%\jvol{00} \jnum{00} \jyear{2013} \jmonth{April}
%\articletype{GUIDE}
-\title{{\itshape Perimeter-based Coverage Optimization to Improve Lifetime in Wireless Sensor Networks}}
+\title{{\itshape Perimeter-based Coverage Optimization to Improve Lifetime \\
+ in Wireless Sensor Networks}}
\author{Ali Kadhum Idrees$^{a}$, Karine Deschinkel$^{a}$$^{\ast}$\thanks{$^\ast$Corresponding author. Email: karine.deschinkel@univ-fcomte.fr}, Michel Salomon$^{a}$ and Rapha\"el Couturier $^{a}$
$^{a}${\em{FEMTO-ST Institute, UMR 6174 CNRS, University of Franche-Comte,
- Belfort, France}};}
-
+ Belfort, France}}}
\maketitle
\begin{abstract}
The most important problem in a Wireless Sensor Network (WSN) is to optimize the
-use of its limited energy provision, so that it can fulfill its monitoring task
-as long as possible. Among known available approaches that can be used to
+use of its limited energy provision, so that it can fulfill its monitoring task
+as long as possible. Among known available approaches that can be used to
improve power management, lifetime coverage optimization provides activity
-scheduling which ensures sensing coverage while minimizing the energy cost. We propose such an approach called Perimeter-based Coverage Optimization
-protocol (PeCO). It is a hybrid of centralized and distributed methods: the
-region of interest is first subdivided into subregions and the protocol is then
-distributed among sensor nodes in each subregion.
-The novelty of our approach lies essentially in the formulation of a new
-mathematical optimization model based on the perimeter coverage level to schedule
-sensors' activities. Extensive simulation experiments demonstrate that PeCO can
-offer longer lifetime coverage for WSNs in comparison with some other protocols.
-
-\begin{keywords}Wireless Sensor Networks, Area Coverage, Energy efficiency, Optimization, Scheduling.
+scheduling which ensures sensing coverage while minimizing the energy cost. We
+propose such an approach called Perimeter-based Coverage Optimization protocol
+(PeCO). It is a hybrid of centralized and distributed methods: the region of
+interest is first subdivided into subregions and the protocol is then
+distributed among sensor nodes in each subregion. The novelty of our approach
+lies essentially in the formulation of a new mathematical optimization model
+based on the perimeter coverage level to schedule sensors' activities.
+Extensive simulation experiments demonstrate that PeCO can offer longer lifetime
+coverage for WSNs in comparison with some other protocols.
+
+\begin{keywords}
+ Wireless Sensor Networks, Area Coverage, Energy efficiency, Optimization, Scheduling.
\end{keywords}
\end{abstract}
\section{Introduction}
\label{sec:introduction}
-The continuous progress in Micro Electro-Mechanical Systems (MEMS) and
-wireless communication hardware has given rise to the opportunity to use large
-networks of tiny sensors, called Wireless Sensor Networks
-(WSN)~\citep{akyildiz2002wireless,puccinelli2005wireless}, to fulfill monitoring
+The continuous progress in Micro Electro-Mechanical Systems (MEMS) and wireless
+communication hardware has given rise to the opportunity to use large networks
+of tiny sensors, called Wireless Sensor Networks
+(WSN)~\citep{akyildiz2002wireless,puccinelli2005wireless}, to fulfill monitoring
tasks. A WSN consists of small low-powered sensors working together by
communicating with one another through multi-hop radio communications. Each node
can send the data it collects in its environment, thanks to its sensor, to the
user by means of sink nodes. The features of a WSN made it suitable for a wide
range of application in areas such as business, environment, health, industry,
-military, and so on~\citep{yick2008wireless}. Typically, a sensor node contains
-three main components~\citep{anastasi2009energy}: a sensing unit able to measure
+military, and so on~\citep{yick2008wireless}. Typically, a sensor node contains
+three main components~\citep{anastasi2009energy}: a sensing unit able to measure
physical, chemical, or biological phenomena observed in the environment; a
processing unit which will process and store the collected measurements; a radio
communication unit for data transmission and receiving.
communication is supplied by a power supply which is a battery. This battery has
a limited energy provision and it may be unsuitable or impossible to replace or
recharge it in most applications. Therefore it is necessary to deploy WSN with
-high density in order to increase reliability and to exploit node redundancy
+high density in order to increase reliability and to exploit node redundancy
thanks to energy-efficient activity scheduling approaches. Indeed, the overlap
of sensing areas can be exploited to schedule alternatively some sensors in a
low power sleep mode and thus save energy. Overall, the main question that must
be answered is: how to extend the lifetime coverage of a WSN as long as possible
-while ensuring a high level of coverage? These past few years many
+while ensuring a high level of coverage? These past few years many
energy-efficient mechanisms have been suggested to retain energy and extend the
-lifetime of the WSNs~\citep{rault2014energy}.\\\\
+lifetime of the WSNs~\citep{rault2014energy}.
+
This paper makes the following contributions.
\begin{enumerate}
-\item We have devised a framework to schedule nodes to be activated alternatively such
- that the network lifetime is prolonged while ensuring that a certain level of
- coverage is preserved. A key idea in our framework is to exploit spatial and
- temporal subdivision. On the one hand, the area of interest is divided into
- several smaller subregions and, on the other hand, the time line is divided into
- periods of equal length. In each subregion the sensor nodes will cooperatively
- choose a leader which will schedule nodes' activities, and this grouping of
- sensors is similar to typical cluster architecture.
-\item We have proposed a new mathematical optimization model. Instead of trying to
- cover a set of specified points/targets as in most of the methods proposed in
- the literature, we formulate an integer program based on perimeter coverage of
- each sensor. The model involves integer variables to capture the deviations
- between the actual level of coverage and the required level. Hence, an
- optimal schedule will be obtained by minimizing a weighted sum of these
- deviations.
-\item We have conducted extensive simulation experiments, using the discrete event
- simulator OMNeT++, to demonstrate the efficiency of our protocol. We have compared
- our PeCO protocol to two approaches found in the literature:
- DESK~\citep{ChinhVu} and GAF~\citep{xu2001geography}, and also to our previous
- protocol DilCO published in~\citep{Idrees2}. DilCO uses the same framework as PeCO but is based on another optimization model for sensor scheduling.
+\item We have devised a framework to schedule nodes to be activated
+ alternatively such that the network lifetime is prolonged while ensuring that
+ a certain level of coverage is preserved. A key idea in our framework is to
+ exploit spatial and temporal subdivision. On the one hand, the area of
+ interest is divided into several smaller subregions and, on the other hand,
+ the time line is divided into periods of equal length. In each subregion the
+ sensor nodes will cooperatively choose a leader which will schedule nodes'
+ activities, and this grouping of sensors is similar to typical cluster
+ architecture.
+\item We have proposed a new mathematical optimization model. Instead of trying
+ to cover a set of specified points/targets as in most of the methods proposed
+ in the literature, we formulate an integer program based on perimeter coverage
+ of each sensor. The model involves integer variables to capture the
+ deviations between the actual level of coverage and the required level.
+ Hence, an optimal schedule will be obtained by minimizing a weighted sum of
+ these deviations.
+\item We have conducted extensive simulation experiments, using the discrete
+ event simulator OMNeT++, to demonstrate the efficiency of our protocol. We
+ have compared the PeCO protocol to two approaches found in the literature:
+ DESK~\citep{ChinhVu} and GAF~\citep{xu2001geography}, and also to our previous
+ protocol DiLCO published in~\citep{Idrees2}. DiLCO uses the same framework as
+ PeCO but is based on another optimization model for sensor scheduling.
\end{enumerate}
-
-
-
-
-
-The rest of the paper is organized as follows. In the next section
-some related work in the field is reviewed. Section~\ref{sec:The PeCO Protocol Description}
+The rest of the paper is organized as follows. In the next section some related
+work in the field is reviewed. Section~\ref{sec:The PeCO Protocol Description}
is devoted to the PeCO protocol description and Section~\ref{cp} focuses on the
coverage model formulation which is used to schedule the activation of sensor
nodes. Section~\ref{sec:Simulation Results and Analysis} presents simulations
results and discusses the comparison with other approaches. Finally, concluding
-remarks are drawn and some suggestions are given for future works in
+remarks are drawn and some suggestions are given for future works in
Section~\ref{sec:Conclusion and Future Works}.
\section{Related Literature}
\label{sec:Literature Review}
-In this section, some related works regarding the
-coverage problem is summarized, and specific aspects of the PeCO protocol from the works presented in
-the literature are presented.
+In this section, some related works regarding the coverage problem is
+summarized, and specific aspects of the PeCO protocol from the works presented
+in the literature are presented.
The most discussed coverage problems in literature can be classified in three
-categories~\citep{li2013survey} according to their respective monitoring
-objective. Hence, area coverage \citep{Misra} means that every point inside a
-fixed area must be monitored, while target coverage~\citep{yang2014novel} refers
+categories~\citep{li2013survey} according to their respective monitoring
+objective. Hence, area coverage \citep{Misra} means that every point inside a
+fixed area must be monitored, while target coverage~\citep{yang2014novel} refers
to the objective of coverage for a finite number of discrete points called
-targets, and barrier coverage~\citep{HeShibo,kim2013maximum} focuses on
+targets, and barrier coverage~\citep{HeShibo,kim2013maximum} focuses on
preventing intruders from entering into the region of interest. In
-\citep{Deng2012} authors transform the area coverage problem into the target
+\citep{Deng2012} authors transform the area coverage problem into the target
coverage one taking into account the intersection points among disks of sensors
nodes or between disk of sensor nodes and boundaries. In
-\citep{Huang:2003:CPW:941350.941367} authors prove that if the perimeters of
+\citep{Huang:2003:CPW:941350.941367} authors prove that if the perimeters of
sensors are sufficiently covered it will be the case for the whole area. They
provide an algorithm in $O(nd~log~d)$ time to compute the perimeter-coverage of
-each sensor. $d$ denotes the maximum number of sensors that are
-neighbors to a sensor, and $n$ is the total number of sensors in the
-network. {\it In PeCO protocol, instead of determining the level of coverage of
- a set of discrete points, our optimization model is based on checking the
- perimeter-coverage of each sensor to activate a minimal number of sensors.}
+each sensor. $d$ denotes the maximum number of sensors that are neighbors to a
+sensor, and $n$ is the total number of sensors in the network. {\it In PeCO
+ protocol, instead of determining the level of coverage of a set of discrete
+ points, our optimization model is based on checking the perimeter-coverage of
+ each sensor to activate a minimal number of sensors.}
The major approach to extend network lifetime while preserving coverage is to
divide/organize the sensors into a suitable number of set covers (disjoint or
-non-disjoint)\citep{wang2011coverage}, where each set completely covers a region of interest, and to
-activate these set covers successively. The network activity can be planned in
-advance and scheduled for the entire network lifetime or organized in periods,
-and the set of active sensor nodes is decided at the beginning of each period
-\citep{ling2009energy}. Active node selection is determined based on the problem
-requirements (e.g. area monitoring, connectivity, or power efficiency). For
-instance, \citet{jaggi2006} address the problem of maximizing
-the lifetime by dividing sensors into the maximum number of disjoint subsets
-such that each subset can ensure both coverage and connectivity. A greedy
-algorithm is applied once to solve this problem and the computed sets are
-activated in succession to achieve the desired network lifetime.
-\citet{chin2007}, \citet{yan2008design}, \citet{pc10}, propose algorithms
-working in a periodic fashion where a cover set is computed at the beginning of
-each period. {\it Motivated by these works, PeCO protocol works in periods,
- where each period contains a preliminary phase for information exchange and
- decisions, followed by a sensing phase where one cover set is in charge of the
- sensing task.}
-
-Various centralized and distributed approaches, or even a mixing of these two
-concepts, have been proposed to extend the network lifetime \citep{zhou2009variable}. In distributed algorithms~\citep{Tian02,yangnovel,ChinhVu,qu2013distributed} each sensor decides of its
-own activity scheduling after an information exchange with its neighbors. The
-main interest of such an approach is to avoid long range communications and thus
-to reduce the energy dedicated to the communications. Unfortunately, since each
-node has only information on its immediate neighbors (usually the one-hop ones)
-it may make a bad decision leading to a global suboptimal solution. Conversely,
-centralized
-algorithms~\citep{cardei2005improving,zorbas2010solving,pujari2011high} always
+non-disjoint)\citep{wang2011coverage}, where each set completely covers a region
+of interest, and to activate these set covers successively. The network activity
+can be planned in advance and scheduled for the entire network lifetime or
+organized in periods, and the set of active sensor nodes is decided at the
+beginning of each period \citep{ling2009energy}. Active node selection is
+determined based on the problem requirements (e.g. area monitoring,
+connectivity, or power efficiency). For instance, \citet{jaggi2006} address the
+problem of maximizing the lifetime by dividing sensors into the maximum number
+of disjoint subsets such that each subset can ensure both coverage and
+connectivity. A greedy algorithm is applied once to solve this problem and the
+computed sets are activated in succession to achieve the desired network
+lifetime. \citet{chin2007}, \citet{yan2008design}, \citet{pc10}, propose
+algorithms working in a periodic fashion where a cover set is computed at the
+beginning of each period. {\it Motivated by these works, PeCO protocol works in
+ periods, where each period contains a preliminary phase for information
+ exchange and decisions, followed by a sensing phase where one cover set is in
+ charge of the sensing task.}
+
+Various centralized and distributed approaches, or even a mixing of these two
+concepts, have been proposed to extend the network lifetime
+\citep{zhou2009variable}. In distributed
+algorithms~\citep{Tian02,yangnovel,ChinhVu,qu2013distributed} each sensor
+decides of its own activity scheduling after an information exchange with its
+neighbors. The main interest of such an approach is to avoid long range
+communications and thus to reduce the energy dedicated to the communications.
+Unfortunately, since each node has only information on its immediate neighbors
+(usually the one-hop ones) it may make a bad decision leading to a global
+suboptimal solution. Conversely, centralized
+algorithms~\citep{cardei2005improving,zorbas2010solving,pujari2011high} always
provide nearly or close to optimal solution since the algorithm has a global
view of the whole network. The disadvantage of a centralized method is obviously
-its high cost in communications needed to transmit to a single node, the base
-station which will globally schedule nodes' activities, and data from all the other
-sensor nodes in the area. The price in communications can be huge since
-long range communications will be needed. In fact the larger the WNS is, the
-higher the communication and thus the energy cost are. {\it In order to be
- suitable for large-scale networks, in the PeCO protocol, the area of interest
- is divided into several smaller subregions, and in each one, a node called the
- leader is in charge of selecting the active sensors for the current
- period. Thus our protocol is scalable and is a globally distributed method,
- whereas it is centralized in each subregion.}
-
-Various coverage scheduling algorithms have been developed these past few years.
+its high cost in communications needed to transmit to a single node, the base
+station which will globally schedule nodes' activities, data from all the other
+sensor nodes in the area. The price in communications can be huge since long
+range communications will be needed. In fact the larger the WNS is, the higher
+the communication and thus the energy cost are. {\it In order to be suitable
+ for large-scale networks, in the PeCO protocol, the area of interest is
+ divided into several smaller subregions, and in each one, a node called the
+ leader is in charge of selecting the active sensors for the current period.
+ Thus our protocol is scalable and is a globally distributed method, whereas it
+ is centralized in each subregion.}
+
+Various coverage scheduling algorithms have been developed these past few years.
Many of them, dealing with the maximization of the number of cover sets, are
heuristics. These heuristics involve the construction of a cover set by
including in priority the sensor nodes which cover critical targets, that is to
say targets that are covered by the smallest number of sensors
-\citep{berman04,zorbas2010solving}. Other approaches are based on mathematical
-programming formulations~\citep{cardei2005energy,5714480,pujari2011high,Yang2014}
-and dedicated techniques (solving with a branch-and-bound algorithm available in
+\citep{berman04,zorbas2010solving}. Other approaches are based on mathematical
+programming
+formulations~\citep{cardei2005energy,5714480,pujari2011high,Yang2014} and
+dedicated techniques (solving with a branch-and-bound algorithm available in
optimization solver). The problem is formulated as an optimization problem
(maximization of the lifetime or number of cover sets) under target coverage and
energy constraints. Column generation techniques, well-known and widely
practiced techniques for solving linear programs with too many variables, have
also been
-used~\citep{castano2013column,doi:10.1080/0305215X.2012.687732,deschinkel2012column}. {\it In the PeCO
- protocol, each leader, in charge of a subregion, solves an integer program
- which has a twofold objective: minimize the overcoverage and the undercoverage
- of the perimeter of each sensor.}
-
-
-
-The authors in \citep{Idrees2} propose a Distributed Lifetime Coverage Optimization (DiLCO) protocol, which maintains the coverage and improves the lifetime in WSNs. It is an improved version
-of a research work they presented in~\citep{idrees2014coverage}. First, they partition the area of interest into subregions using a divide-and-conquer method. DiLCO protocol is then distributed on the sensor nodes in each subregion in a second step. DiLCO protocol combines two techniques: a leader election in each subregion, followed by an optimization-based node activity scheduling performed by each elected leader. The proposed DiLCO protocol is a periodic protocol where each period is decomposed into 4 phases: information exchange, leader election, decision, and sensing. The simulations show that DiLCO is able to increase the WSN lifetime and provides improved coverage performance. {\it In the PeCO
- protocol, We have proposed a new mathematical optimization model. Instead of trying to
-cover a set of specified points/targets as in DiLCO protocol, we formulate an integer program based
-on perimeter coverage of each sensor. The model involves integer variables to capture the deviations between the actual level of coverage and the required level. The idea is that an optimal scheduling will be obtained by minimizing a weighted sum of these deviations.}
-
+used~\citep{castano2013column,doi:10.1080/0305215X.2012.687732,deschinkel2012column}.
+{\it In the PeCO protocol, each leader, in charge of a subregion, solves an
+ integer program which has a twofold objective: minimize the overcoverage and
+ the undercoverage of the perimeter of each sensor.}
+
+The authors in \citep{Idrees2} propose a Distributed Lifetime Coverage
+Optimization (DiLCO) protocol, which maintains the coverage and improves the
+lifetime in WSNs. It is an improved version of a research work presented
+in~\citep{idrees2014coverage}. First, the area of interest is partitioned into
+subregions using a divide-and-conquer method. DiLCO protocol is then distributed
+on the sensor nodes in each subregion in a second step. Hence this protocol
+combines two techniques: a leader election in each subregion, followed by an
+optimization-based node activity scheduling performed by each elected
+leader. The proposed DiLCO protocol is a periodic protocol where each period is
+decomposed into 4 phases: information exchange, leader election, decision, and
+sensing. The simulations show that DiLCO is able to increase the WSN lifetime
+and provides improved coverage performance. {\it In the PeCO protocol, a new
+ mathematical optimization model is proposed. Instead of trying to cover a set
+ of specified points/targets as in DiLCO protocol, we formulate an integer
+ program based on perimeter coverage of each sensor. The model involves integer
+ variables to capture the deviations between the actual level of coverage and
+ the required level. The idea is that an optimal scheduling will be obtained by
+ minimizing a weighted sum of these deviations.}
-
-
\section{ The P{\scshape e}CO Protocol Description}
\label{sec:The PeCO Protocol Description}
\subsection{Assumptions and Models}
\label{CI}
-A WSN consisting of $J$ stationary sensor nodes randomly and uniformly
+A WSN consisting of $J$ stationary sensor nodes randomly and uniformly
distributed in a bounded sensor field is considered. The wireless sensors are
deployed in high density to ensure initially a high coverage ratio of the area
of interest. We assume that all the sensor nodes are homogeneous in terms of
-communication, sensing, and processing capabilities and heterogeneous from
-the energy provision point of view. The location information is available to a
+communication, sensing, and processing capabilities and heterogeneous from the
+energy provision point of view. The location information is available to a
sensor node either through hardware such as embedded GPS or location discovery
-algorithms. We consider a Boolean disk coverage model,
-which is the most widely used sensor coverage model in the literature, and all
-sensor nodes have a constant sensing range $R_s$. Thus, all the space points
-within a disk centered at a sensor with a radius equal to the sensing range are
-said to be covered by this sensor. We also assume that the communication range
-$R_c$ satisfies $R_c \geq 2 \cdot R_s$. In fact, \citet{Zhang05}
-proved that if the transmission range fulfills the previous hypothesis, the
-complete coverage of a convex area implies connectivity among active nodes.
-
-The PeCO protocol uses the same perimeter-coverage model as \citet{huang2005coverage}. It can be expressed as follows: a sensor is
-said to be perimeter covered if all the points on its perimeter are covered by
-at least one sensor other than itself. Authors \citet{huang2005coverage} proved that a network area is
-$k$-covered (every point in the area covered by at least k sensors) if and only if each sensor in the network is $k$-perimeter-covered (perimeter covered by at least $k$ sensors).
+algorithms. We consider a Boolean disk coverage model, which is the most widely
+used sensor coverage model in the literature, and all sensor nodes have a
+constant sensing range $R_s$. Thus, all the space points within a disk centered
+at a sensor with a radius equal to the sensing range are said to be covered by
+this sensor. We also assume that the communication range $R_c$ satisfies $R_c
+\geq 2 \cdot R_s$. In fact, \citet{Zhang05} proved that if the transmission
+range fulfills the previous hypothesis, the complete coverage of a convex area
+implies connectivity among active nodes.
+
+The PeCO protocol uses the same perimeter-coverage model as
+\citet{huang2005coverage}. It can be expressed as follows: a sensor is said to
+be perimeter covered if all the points on its perimeter are covered by at least
+one sensor other than itself. Authors \citet{huang2005coverage} proved that a
+network area is $k$-covered (every point in the area is covered by at least
+$k$~sensors) if and only if each sensor in the network is $k$-perimeter-covered
+(perimeter covered by at least $k$ sensors).
-Figure~\ref{figure1}(a) shows the coverage of sensor node~$0$. On this
-figure, sensor~$0$ has nine neighbors and we have reported on
-its perimeter (the perimeter of the disk covered by the sensor) for each
-neighbor the two points resulting from the intersection of the two sensing
-areas. These points are denoted for neighbor~$i$ by $iL$ and $iR$, respectively
-for left and right from a neighboing point of view. The resulting couples of
-intersection points subdivide the perimeter of sensor~$0$ into portions called
-arcs.
+Figure~\ref{figure1}(a) shows the coverage of sensor node~$0$. On this figure,
+sensor~$0$ has nine neighbors and we have reported on its perimeter (the
+perimeter of the disk covered by the sensor) for each neighbor the two points
+resulting from the intersection of the two sensing areas. These points are
+denoted for neighbor~$i$ by $iL$ and $iR$, respectively for left and right from
+a neighboring point of view. The resulting couples of intersection points
+subdivide the perimeter of sensor~$0$ into portions called arcs.
\begin{figure}[ht!]
\centering
\label{figure1}
\end{figure}
-Figure~\ref{figure1}(b) describes the geometric information used to find the
+Figure~\ref{figure1}(b) describes the geometric information used to find the
locations of the left and right points of an arc on the perimeter of a sensor
node~$u$ covered by a sensor node~$v$. Node~$v$ is supposed to be located on the
west side of sensor~$u$, with the following respective coordinates in the
-sensing area~: $(v_x,v_y)$ and $(u_x,u_y)$. From the previous coordinates
-the euclidean distance between nodes~$u$ and $v$ is computed: $Dist(u,v)=\sqrt{\vert
- u_x - v_x \vert^2 + \vert u_y-v_y \vert^2}$, while the angle~$\alpha$ is
-obtained through the formula:
+sensing area~: $(v_x,v_y)$ and $(u_x,u_y)$. From the previous coordinates the
+euclidean distance between nodes~$u$ and $v$ is computed as follows:
+$$
+ Dist(u,v)=\sqrt{\vert u_x - v_x \vert^2 + \vert u_y-v_y \vert^2},
+$$
+while the angle~$\alpha$ is obtained through the formula:
\[
-\alpha = \arccos \left(\frac{Dist(u,v)}{2R_s}
-\right).
+\alpha = \arccos \left(\frac{Dist(u,v)}{2R_s} \right).
\]
-The arc on the perimeter of~$u$ defined by the angular interval $[\pi
- - \alpha,\pi + \alpha]$ is said to be perimeter-covered by sensor~$v$.
+The arc on the perimeter of~$u$ defined by the angular interval $[\pi -
+ \alpha,\pi + \alpha]$ is then said to be perimeter-covered by sensor~$v$.
Every couple of intersection points is placed on the angular interval $[0,2\pi)$
in a counterclockwise manner, leading to a partitioning of the interval.
Figure~\ref{figure1}(a) illustrates the arcs for the nine neighbors of
-sensor $0$ and table~\ref{my-label} gives the position of the corresponding arcs
+sensor $0$ and Table~\ref{my-label} gives the position of the corresponding arcs
in the interval $[0,2\pi)$. More precisely, the points are
ordered according to the measures of the angles defined by their respective
positions. The intersection points are then visited one after another, starting
from the first intersection point after point~zero, and the maximum level of
coverage is determined for each interval defined by two successive points. The
maximum level of coverage is equal to the number of overlapping arcs. For
-example,
-between~$5L$ and~$6L$ the maximum level of coverage is equal to $3$
+example, between~$5L$ and~$6L$ the maximum level of coverage is equal to $3$
(the value is highlighted in yellow at the bottom of Figure~\ref{figure2}), which
means that at most 2~neighbors can cover the perimeter in addition to node $0$.
Table~\ref{my-label} summarizes for each coverage interval the maximum level of
coverage and the sensor nodes covering the perimeter. The example discussed
above is thus given by the sixth line of the table.
-
\begin{figure*}[t!]
\centering
\includegraphics[width=127.5mm]{figure2.eps}
\label{figure2}
\end{figure*}
-
-
-
- \begin{table}
- \tbl{Coverage intervals and contributing sensors for sensor node 0 \label{my-label}}
+\begin{table}
+\tbl{Coverage intervals and contributing sensors for node 0 \label{my-label}}
{\begin{tabular}{|c|c|c|c|c|c|c|c|c|}
\hline
\begin{tabular}[c]{@{}c@{}}Left \\ point \\ angle~$\alpha$ \end{tabular} & \begin{tabular}[c]{@{}c@{}}Interval \\ left \\ point\end{tabular} & \begin{tabular}[c]{@{}c@{}}Interval \\ right \\ point\end{tabular} & \begin{tabular}[c]{@{}c@{}}Maximum \\ coverage\\ level\end{tabular} & \multicolumn{5}{c|}{\begin{tabular}[c]{@{}c@{}}Set of sensors\\ involved \\ in coverage interval\end{tabular}} \\ \hline
\end{table}
-
-
-
-In the PeCO protocol, the scheduling of the sensor nodes' activities is formulated with an
-mixed-doi:10.1155/2010/926075integer program based on coverage intervals. The formulation of the coverage
+In the PeCO protocol, the scheduling of the sensor nodes' activities is
+formulated with an mixed-integer program based on coverage
+intervals~\citep{doi:10.1155/2010/926075}. The formulation of the coverage
optimization problem is detailed in~Section~\ref{cp}. Note that when a sensor
node has a part of its sensing range outside the WSN sensing field, as in
-Figure~\ref{figure3}, the maximum coverage level for this arc is set to $\infty$
+Figure~\ref{figure3}, the maximum coverage level for this arc is set to $\infty$
and the corresponding interval will not be taken into account by the
optimization algorithm.
- \newpage
+\newpage
\begin{figure}[h!]
\centering
\includegraphics[width=62.5mm]{figure3.eps}
\caption{Sensing range outside the WSN's area of interest.}
\label{figure3}
-\end{figure}
-
-
-\subsection{The Main Idea}
-
-The WSN area of interest is, in a first step, divided into regular
-homogeneous subregions using a divide-and-conquer algorithm. In a second step
-our protocol will be executed in a distributed way in each subregion
-simultaneously to schedule nodes' activities for one sensing period. In the study, sensors are assumed to be deployed almost uniformly over the region. The regular subdivision is made such that the number of hops between any pairs of sensors inside a subregion is less than or equal to 3.
-
-As shown in Figure~\ref{figure4}, node activity scheduling is produced by our
-protocol in a periodic manner. Each period is divided into 4 stages: Information
-(INFO) Exchange, Leader Election, Decision (the result of an optimization
-problem), and Sensing. For each period there is exactly one set cover
-responsible for the sensing task. Protocols based on a periodic scheme, like
-PeCO, are more robust against an unexpected node failure. On the one hand, if
-a node failure is discovered before taking the decision, the corresponding sensor
-node will not be considered by the optimization algorithm. On the other
+\end{figure}
+
+\vspace{-0.25cm}
+
+\subsection{Main Idea}
+
+The WSN area of interest is, in a first step, divided into regular homogeneous
+subregions using a divide-and-conquer algorithm. In a second step our protocol
+will be executed in a distributed way in each subregion simultaneously to
+schedule nodes' activities for one sensing period. Node Sensors are assumed to
+be deployed almost uniformly over the region. The regular subdivision is made
+such that the number of hops between any pairs of sensors inside a subregion is
+less than or equal to 3.
+
+As shown in Figure~\ref{figure4}, node activity scheduling is produced by the
+proposed protocol in a periodic manner. Each period is divided into 4 stages:
+Information (INFO) Exchange, Leader Election, Decision (the result of an
+optimization problem), and Sensing. For each period there is exactly one set
+cover responsible for the sensing task. Protocols based on a periodic scheme,
+like PeCO, are more robust against an unexpected node failure. On the one hand,
+if a node failure is discovered before taking the decision, the corresponding
+sensor node will not be considered by the optimization algorithm. On the other
hand, if the sensor failure happens after the decision, the sensing task of the
network will be temporarily affected: only during the period of sensing until a
new period starts, since a new set cover will take charge of the sensing task in
information (including their residual energy) at the beginning of each period.
However, the pre-sensing phases (INFO Exchange, Leader Election, and Decision)
are energy consuming, even for nodes that will not join the set cover to monitor
-the area. Sensing period duration is adapted according to the QoS requirements of the application.
+the area. Sensing period duration is adapted according to the QoS requirements
+of the application.
\begin{figure}[t!]
\centering
-\includegraphics[width=80mm]{figure4.eps}
+\includegraphics[width=85mm]{figure4.eps}
\caption{PeCO protocol.}
\label{figure4}
\end{figure}
We define two types of packets to be used by PeCO protocol:
-
\begin{itemize}
\item INFO packet: sent by each sensor node to all the nodes inside a same
subregion for information exchange.
sensing phase.
\end{itemize}
-
Five statuses are possible for a sensor node in the network:
-
\begin{itemize}
\item LISTENING: waits for a decision (to be active or not);
\item COMPUTATION: executes the optimization algorithm as leader to
\item COMMUNICATION: transmits or receives packets.
\end{itemize}
-
\subsection{PeCO Protocol Algorithm}
-The pseudocode implementing the protocol on a node is given below.
-More precisely, Algorithm~\ref{alg:PeCO} gives a brief description of the
-protocol applied by a sensor node $s_k$ where $k$ is the node index in the WSN.
-
+The pseudocode implementing the protocol on a node is given below. More
+precisely, Algorithm~\ref{alg:PeCO} gives a brief description of the protocol
+applied by a sensor node $s_k$ where $k$ is the node index in the WSN.
-\begin{algorithm}
+\begin{algorithm2e}
% \KwIn{all the parameters related to information exchange}
% \KwOut{$winer-node$ (: the id of the winner sensor node, which is the leader of current round)}
% \BlankLine
- %\emph{Initialize the sensor node and determine it's position and subregion} \;
-
-\noindent{\bf If} $RE_k \geq E_{th}$ {\bf then}\\
-\hspace*{0.6cm} \emph{$s_k.status$ = COMMUNICATION;}\\
-\hspace*{0.6cm} \emph{Send $INFO()$ packet to other nodes in subregion;}\\
-\hspace*{0.6cm} \emph{Wait $INFO()$ packet from other nodes in subregion;}\\
-\hspace*{0.6cm} \emph{Update K.CurrentSize;}\\
-\hspace*{0.6cm} \emph{LeaderID = Leader election;}\\
-\hspace*{0.6cm} {\bf If} $ s_k.ID = LeaderID $ {\bf then}\\
-\hspace*{1.2cm} \emph{$s_k.status$ = COMPUTATION;}\\
-\hspace*{1.2cm}{\bf If} \emph{$ s_k.ID $ is Not previously selected as a Leader} {\bf then}\\
-\hspace*{1.8cm} \emph{ Execute the perimeter coverage model;}\\
-\hspace*{1.2cm} {\bf end}\\
-\hspace*{1.2cm}{\bf If} \emph{($s_k.ID $ is the same Previous Leader)~And~(K.CurrentSize = K.PreviousSize)}\\
-\hspace*{1.8cm} \emph{ Use the same previous cover set for current sensing stage;}\\
-\hspace*{1.2cm} {\bf end}\\
-\hspace*{1.2cm} {\bf else}\\
-\hspace*{1.8cm}\emph{Update $a^j_{ik}$; prepare data for IP~Algorithm;}\\
-\hspace*{1.8cm} \emph{$\left\{\left(X_{1},\dots,X_{l},\dots,X_{K}\right)\right\}$ = Execute Integer Program Algorithm($K$);}\\
-\hspace*{1.8cm} \emph{K.PreviousSize = K.CurrentSize;}\\
-\hspace*{1.2cm} {\bf end}\\
-\hspace*{1.2cm}\emph{$s_k.status$ = COMMUNICATION;}\\
-\hspace*{1.2cm}\emph{Send $ActiveSleep()$ to each node $l$ in subregion;}\\
-\hspace*{1.2cm}\emph{Update $RE_k $;}\\
-\hspace*{0.6cm} {\bf end}\\
-\hspace*{0.6cm} {\bf else}\\
-\hspace*{1.2cm}\emph{$s_k.status$ = LISTENING;}\\
-\hspace*{1.2cm}\emph{Wait $ActiveSleep()$ packet from the Leader;}\\
-\hspace*{1.2cm}\emph{Update $RE_k $;}\\
-\hspace*{0.6cm} {\bf end}\\
-{\bf end}\\
-{\bf else}\\
-\hspace*{0.6cm} \emph{Exclude $s_k$ from entering in the current sensing stage;}\\
-{\bf end}\\
-\label{alg:PeCO}
-\end{algorithm}
-
-
+ %\emph{Initialize the sensor node and determine it's position and subregion} \;
+ \caption{PeCO pseudocode}
+ \eIf{$RE_k \geq E_{th}$}{
+ $s_k.status$ = COMMUNICATION\;
+ Send $INFO()$ packet to other nodes in subregion\;
+ Wait $INFO()$ packet from other nodes in subregion\;
+ Update K.CurrentSize\;
+ LeaderID = Leader election\;
+ \eIf{$s_k.ID = LeaderID$}{
+ $s_k.status$ = COMPUTATION\;
+ \If{$ s_k.ID $ is Not previously selected as a Leader}{
+ Execute the perimeter coverage model\;
+ }
+ \eIf{($s_k.ID $ is the same Previous Leader) {\bf and} \\
+ \indent (K.CurrentSize = K.PreviousSize)}{
+ Use the same previous cover set for current sensing stage\;
+ }{
+ Update $a^j_{ik}$; prepare data for IP~Algorithm\;
+ $\left\{\left(X_{1},\dots,X_{l},\dots,X_{K}\right)\right\}$ = Execute Integer Program Algorithm($K$)\;
+ K.PreviousSize = K.CurrentSize\;
+ }
+ $s_k.status$ = COMMUNICATION\;
+ Send $ActiveSleep()$ to each node $l$ in subregion\;
+ Update $RE_k $\;
+ }{
+ $s_k.status$ = LISTENING\;
+ Wait $ActiveSleep()$ packet from the Leader\;
+ Update $RE_k $\;
+ }
+ }{
+ Exclude $s_k$ from entering in the current sensing stage\;
+ }
+\end{algorithm2e}
+
+%\begin{algorithm}
+%\noindent{\bf If} $RE_k \geq E_{th}$ {\bf then}\\
+%\hspace*{0.6cm} \emph{$s_k.status$ = COMMUNICATION;}\\
+%\hspace*{0.6cm} \emph{Send $INFO()$ packet to other nodes in subregion;}\\
+%\hspace*{0.6cm} \emph{Wait $INFO()$ packet from other nodes in subregion;}\\
+%\hspace*{0.6cm} \emph{Update K.CurrentSize;}\\
+%\hspace*{0.6cm} \emph{LeaderID = Leader election;}\\
+%\hspace*{0.6cm} {\bf If} $ s_k.ID = LeaderID $ {\bf then}\\
+%\hspace*{1.2cm} \emph{$s_k.status$ = COMPUTATION;}\\
+%\hspace*{1.2cm}{\bf If} \emph{$ s_k.ID $ is Not previously selected as a Leader} {\bf then}\\
+%\hspace*{1.8cm} \emph{ Execute the perimeter coverage model;}\\
+%\hspace*{1.2cm} {\bf end}\\
+%\hspace*{1.2cm}{\bf If} \emph{($s_k.ID $ is the same Previous Leader)~And~(K.CurrentSize = K.PreviousSize)}\\
+%\hspace*{1.8cm} \emph{ Use the same previous cover set for current sensing stage;}\\
+%\hspace*{1.2cm} {\bf end}\\
+%\hspace*{1.2cm} {\bf else}\\
+%\hspace*{1.8cm}\emph{Update $a^j_{ik}$; prepare data for IP~Algorithm;}\\
+%\hspace*{1.8cm} \emph{$\left\{\left(X_{1},\dots,X_{l},\dots,X_{K}\right)\right\}$ = Execute Integer Program Algorithm($K$);}\\
+%\hspace*{1.8cm} \emph{K.PreviousSize = K.CurrentSize;}\\
+%\hspace*{1.2cm} {\bf end}\\
+%\hspace*{1.2cm}\emph{$s_k.status$ = COMMUNICATION;}\\
+%\hspace*{1.2cm}\emph{Send $ActiveSleep()$ to each node $l$ in subregion;}\\
+%\hspace*{1.2cm}\emph{Update $RE_k $;}\\
+%\hspace*{0.6cm} {\bf end}\\
+%\hspace*{0.6cm} {\bf else}\\
+%\hspace*{1.2cm}\emph{$s_k.status$ = LISTENING;}\\
+%\hspace*{1.2cm}\emph{Wait $ActiveSleep()$ packet from the Leader;}\\
+%\hspace*{1.2cm}\emph{Update $RE_k $;}\\
+%\hspace*{0.6cm} {\bf end}\\
+%{\bf end}\\
+%{\bf else}\\
+%\hspace*{0.6cm} \emph{Exclude $s_k$ from entering in the current sensing stage;}\\
+%{\bf end}\\
+%\label{alg:PeCO}
+%\end{algorithm}
In this algorithm, K.CurrentSize and K.PreviousSize respectively represent the
-current number and the previous number of living nodes in the subnetwork of the
+current number and the previous number of living nodes in the subnetwork of the
subregion. Initially, the sensor node checks its remaining energy $RE_k$, which
must be greater than a threshold $E_{th}$ in order to participate in the current
-period. Each sensor node determines its position and its subregion using an
-embedded GPS or a location discovery algorithm. After that, all the sensors
+period. Each sensor node determines its position and its subregion using an
+embedded GPS or a location discovery algorithm. After that, all the sensors
collect position coordinates, remaining energy, sensor node ID, and the number
-of their one-hop live neighbors during the information exchange. The sensors
-inside a same region cooperate to elect a leader. The selection criteria for the
-leader, in order of priority, are: larger numbers of neighbors, larger remaining
-energy, and then in case of equality, larger index. Once chosen, the leader
-collects information to formulate and solve the integer program which allows to
-construct the set of active sensors in the sensing stage.
-
+of their one-hop live neighbors during the information exchange. The sensors
+inside a same region cooperate to elect a leader. The selection criteria for
+the leader, in order of priority, are: larger numbers of neighbors, larger
+remaining energy, and then in case of equality, larger index. Once chosen, the
+leader collects information to formulate and solve the integer program which
+allows to construct the set of active sensors in the sensing stage.
+
+% TO BE CONTINUED
\section{Perimeter-based Coverage Problem Formulation}
\label{cp}
