\citation{Misra05}
\citation{Akyildiz02}
\citation{varga}
-\citation{ma10}
+\citation{chin2007}
+\citation{Huang:2003:CPW:941350.941367}
+\citation{Shibo}
+\citation{Bang}
+\citation{Zhixin}
+\citation{Changlei}
+\citation{Misra}
+\citation{Zhang}
+\citation{Torkestani}
\@writefile{toc}{\contentsline {section}{\numberline {I}Introduction}{1}}
\@writefile{toc}{\contentsline {section}{\numberline {II}Related works}{1}}
\newlabel{rw}{{II}{1}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {II-A}}Coverage}{1}}
-\citation{die09}
-\citation{Gallais06}
-\citation{Tian02}
-\citation{Ye03}
-\citation{Zhang05}
-\citation{HeinzelmanCB02}
-\citation{Berman05efficientenergy}
-\citation{1240799}
-\citation{Tian02}
-\citation{Prasad:2007:DAL:1782174.1782218}
-\citation{chin2007}
-\citation{Huang:2003:CPW:941350.941367}
-\citation{Ye03}
-\citation{cardei05}
-\citation{Cardei:2006:ECP:1646656.1646898}
-\citation{Slijepcevic01powerefficient}
-\citation{cardei02}
-\citation{Abrams:2004:SKA:984622.984684}
-\citation{Slijepcevic01powerefficient}
-\citation{Cardei:2005:IWS:1160086.1160098}
-\citation{Slijepcevic01powerefficient}
-\citation{Cardei:2005:IWS:1160086.1160098}
-\citation{Slijepcevic01powerefficient}
-\citation{Zorbas2007}
-\citation{Slijepcevic01powerefficient}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {II-B}}Lifetime}{2}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {II-C}}Activity scheduling}{2}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {II-D}}Distributed approaches}{2}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {II-E}}Centralized approaches}{2}}
-\citation{Manju2011}
-\citation{cardei05bis}
-\citation{Cardei:2005:IWS:1160086.1160098}
-\citation{berman04}
-\citation{garg98}
\citation{pc10}
\citation{pc10}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {II-F}}Our contribution}{3}}
-\@writefile{toc}{\contentsline {section}{\numberline {III}Activity scheduling}{3}}
-\newlabel{pd}{{III}{3}}
-\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Multi-round coverage protocol\relax }}{3}}
+\@writefile{toc}{\contentsline {section}{\numberline {III}Activity scheduling}{2}}
+\newlabel{pd}{{III}{2}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Multi-round coverage protocol\relax }}{2}}
\providecommand*\caption@xref[2]{\@setref\relax\@undefined{#1}}
-\newlabel{fig1}{{1}{3}}
+\newlabel{fig1}{{1}{2}}
\citation{Zhang05}
\citation{pedraza2006}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {III-A}}Information exchange phase}{4}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {III-B}}Leader election phase}{4}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {III-C}}Decision phase}{4}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {III-D}}Sensing phase}{4}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Wireless sensor node represented by 13 primary points\relax }}{4}}
-\newlabel{fig2}{{2}{4}}
-\@writefile{toc}{\contentsline {section}{\numberline {IV}Coverage problem formulation}{4}}
-\newlabel{cp}{{IV}{4}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {III-A}}Information exchange phase}{3}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {III-B}}Leader election phase}{3}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {III-C}}Decision phase}{3}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {III-D}}Sensing phase}{3}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Wireless sensor node represented by 13 primary points\relax }}{3}}
+\newlabel{fig2}{{2}{3}}
+\@writefile{toc}{\contentsline {section}{\numberline {IV}Coverage problem formulation}{3}}
+\newlabel{cp}{{IV}{3}}
\citation{varga}
\citation{HeinzelmanCB02}
-\newlabel{eq13}{{3}{5}}
-\newlabel{eq14}{{4}{5}}
-\newlabel{eq:ip2r}{{5}{5}}
-\@writefile{toc}{\contentsline {section}{\numberline {V}Simulation results}{5}}
-\newlabel{exp}{{V}{5}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-A}}The impact of the number of rounds on the coverage ratio}{5}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-B}}The impact of the number of rounds on the active sensors ratio}{5}}
-\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces The impact of the number of rounds on the coverage ratio for 150 deployed nodes\relax }}{6}}
-\newlabel{fig3}{{3}{6}}
-\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces The impact of the number of rounds on the active sensors ratio for 150 deployed nodes \relax }}{6}}
-\newlabel{fig4}{{4}{6}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-C}}The impact of the number of rounds on the energy saving ratio}{6}}
-\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces The impact of the number of rounds on the energy saving ratio for 150 deployed nodes\relax }}{6}}
-\newlabel{fig5}{{5}{6}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-D}}The percentage of stopped simulation runs}{6}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-E}}The energy consumption}{6}}
-\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces The percentage of stopped simulation runs compared to the number of rounds for 150 deployed nodes \relax }}{7}}
-\newlabel{fig6}{{6}{7}}
-\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces The energy consumption\relax }}{7}}
-\newlabel{fig7}{{7}{7}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-F}}The impact of the number of sensors on execution time}{7}}
-\@writefile{lot}{\contentsline {table}{\numberline {I}{\ignorespaces THE EXECUTION TIME(S) VS THE NUMBER OF SENSORS\relax }}{7}}
-\newlabel{table1}{{I}{7}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-G}}The network lifetime}{7}}
-\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces The network lifetime \relax }}{7}}
-\newlabel{fig8}{{8}{7}}
+\newlabel{eq13}{{3}{4}}
+\newlabel{eq14}{{4}{4}}
+\newlabel{eq:ip2r}{{5}{4}}
+\@writefile{toc}{\contentsline {section}{\numberline {V}Simulation results}{4}}
+\newlabel{exp}{{V}{4}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-A}}The impact of the number of rounds on the coverage ratio}{4}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-B}}The impact of the number of rounds on the active sensors ratio}{4}}
+\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces The impact of the number of rounds on the coverage ratio for 150 deployed nodes\relax }}{5}}
+\newlabel{fig3}{{3}{5}}
+\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces The impact of the number of rounds on the active sensors ratio for 150 deployed nodes \relax }}{5}}
+\newlabel{fig4}{{4}{5}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-C}}The impact of the number of rounds on the energy saving ratio}{5}}
+\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces The impact of the number of rounds on the energy saving ratio for 150 deployed nodes\relax }}{5}}
+\newlabel{fig5}{{5}{5}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-D}}The percentage of stopped simulation runs}{5}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-E}}The energy consumption}{5}}
+\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces The percentage of stopped simulation runs compared to the number of rounds for 150 deployed nodes \relax }}{6}}
+\newlabel{fig6}{{6}{6}}
+\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces The energy consumption\relax }}{6}}
+\newlabel{fig7}{{7}{6}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-F}}The impact of the number of sensors on execution time}{6}}
+\@writefile{lot}{\contentsline {table}{\numberline {I}{\ignorespaces THE EXECUTION TIME(S) VS THE NUMBER OF SENSORS\relax }}{6}}
+\newlabel{table1}{{I}{6}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {\unhbox \voidb@x \hbox {V-G}}The network lifetime}{6}}
+\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces The network lifetime \relax }}{6}}
+\newlabel{fig8}{{8}{6}}
\bibstyle{IEEEtran}
\bibdata{bare_conf}
\bibcite{Ammari01}{1}
\bibcite{Nayak04}{4}
\bibcite{Misra05}{5}
\bibcite{varga}{6}
-\bibcite{ma10}{7}
-\bibcite{die09}{8}
-\bibcite{Gallais06}{9}
-\bibcite{Tian02}{10}
-\bibcite{Ye03}{11}
-\bibcite{Zhang05}{12}
-\bibcite{HeinzelmanCB02}{13}
-\bibcite{Berman05efficientenergy}{14}
-\bibcite{1240799}{15}
-\bibcite{Prasad:2007:DAL:1782174.1782218}{16}
-\bibcite{chin2007}{17}
-\bibcite{Huang:2003:CPW:941350.941367}{18}
-\bibcite{cardei05}{19}
-\bibcite{Cardei:2006:ECP:1646656.1646898}{20}
-\bibcite{Slijepcevic01powerefficient}{21}
-\bibcite{cardei02}{22}
-\bibcite{Abrams:2004:SKA:984622.984684}{23}
-\bibcite{Cardei:2005:IWS:1160086.1160098}{24}
-\bibcite{Zorbas2007}{25}
-\bibcite{Manju2011}{26}
-\bibcite{cardei05bis}{27}
-\bibcite{berman04}{28}
-\@writefile{toc}{\contentsline {section}{\numberline {VI}Conclusion and future works}{8}}
-\newlabel{sec:conclusion}{{VI}{8}}
-\@writefile{toc}{\contentsline {section}{References}{8}}
-\bibcite{garg98}{29}
-\bibcite{pc10}{30}
-\bibcite{pedraza2006}{31}
+\bibcite{chin2007}{7}
+\bibcite{Huang:2003:CPW:941350.941367}{8}
+\bibcite{Shibo}{9}
+\bibcite{Bang}{10}
+\bibcite{Zhixin}{11}
+\bibcite{Changlei}{12}
+\bibcite{Misra}{13}
+\bibcite{Zhang}{14}
+\bibcite{Torkestani}{15}
+\bibcite{pc10}{16}
+\bibcite{Zhang05}{17}
+\bibcite{pedraza2006}{18}
+\bibcite{HeinzelmanCB02}{19}
+\@writefile{toc}{\contentsline {section}{\numberline {VI}Conclusion and future works}{7}}
+\newlabel{sec:conclusion}{{VI}{7}}
+\@writefile{toc}{\contentsline {section}{References}{7}}
Computing, vol.~7, no.~1, 2011, pp. 79--97.
\bibitem{Sudip03}
-I.~W. Sudip~Misra and S.~C. Misra, Guide to Wireless Sensor Networks.\hskip 1em
- plus 0.5em minus 0.4em\relax Springer-Verlag London Limited, 2009.
+S.~Misra, I.~Woungang, and S.~C. Misra, Guide to Wireless Sensor
+ Networks.\hskip 1em plus 0.5em minus 0.4em\relax Springer-Verlag London
+ Limited, 2009.
\bibitem{Akyildiz02}
I.~F. Akyildiz and M.~C. Vuran, Wireless Sensor Networks.\hskip 1em plus 0.5em
plus 0.5em minus 0.4em\relax John Wiley and Sons, Inc, 2010.
\bibitem{Misra05}
-M.~K. S.~Misra and M.~Obaidat, ``Connectivity preserving localized coverage
- algorithm for area monitoring using wireless sensor networks,'' Computer
- Communications, vol.~34, no.~12, 2011, pp. 1484--1496.
+S.~Misra, M.~P. Kumar, and M.~S. Obaidat, ``Connectivity preserving localized
+ coverage algorithm for area monitoring using wireless sensor networks,''
+ Computer Communications, vol.~34, no.~12, 2011, pp. 1484--1496.
\bibitem{varga}
A.~Varga, ``Omnet++ discrete event simulation system,'' Available:
http://www.omnetpp.org, 2003.
-\bibitem{ma10}
-R.~R. Mulligan and H.~M. Ammari, ``Coverage in wireless sensor networks: A
- survey,'' Journal of Network Protocols and Algorithms (NPA), vol.~5, no.~2,
- 2010, pp. 27--53.
-
-\bibitem{die09}
-I.~Dietrich and F.~Dressler, ``On the lifetime of wireless sensor networks,''
- TOSN, vol.~5, no.~1, 2009.
-
-\bibitem{Gallais06}
-A.~Gallais, J.~Carle, D.~Simplot-Ryl, and I.~Stojmenovic, ``Localized sensor
- area coverage with low communication overhead,'' in Proceedings of the Fourth
- Annual IEEE International Conference on Pervasive Computing and
- Communications, 2006, pp. 328--337.
-
-\bibitem{Tian02}
-D.~Tian and N.~D. Georganas, ``A coverage-preserving node scheduling scheme for
- large wireless sensor networks,'' in Proceedings of the 1st ACM international
- workshop on Wireless sensor networks and applications, ser. WSNA '02.\hskip
- 1em plus 0.5em minus 0.4em\relax ACM, 2002, pp. 32--41.
-
-\bibitem{Ye03}
-F.~Ye, G.~Zhong, J.~Cheng, S.~Lu, and L.~Zhang, ``Peas: A robust energy
- conserving protocol for long-lived sensor networks,'' in Proceedings of the
- 23rd International Conference on Distributed Computing Systems, ser.
- ICDCS'03, 2003, pp. 28--37.
-
-\bibitem{Zhang05}
-H.~Zhang and J.~C. Hou, ``Maintaining sensing coverage and connectivity in
- large sensor networks,'' Ad Hoc {\&} Sensor Wireless Networks, vol.~1, no.
- 1-2, 2005.
-
-\bibitem{HeinzelmanCB02}
-W.~B. Heinzelman, A.~P. Chandrakasan, and H.~Balakrishnan, ``An
- application-specific protocol architecture for wireless microsensor
- networks,'' IEEE Transactions on Wireless Communications, vol.~1, no.~4,
- 2002, pp. 660--670.
-
-\bibitem{Berman05efficientenergy}
-P.~Berman, G.~Calinescu, C.~Shah, and A.~Zelikovsky, ``Efficient energy
- management in sensor networks,'' in Ad Hoc and Sensor Networks. Nova Science
- Publishers.\hskip 1em plus 0.5em minus 0.4em\relax Nova Science Publisher,
- 2005.
-
-\bibitem{1240799}
-J.~Lu and T.~Suda, ``Coverage-aware self-scheduling in sensor networks,'' in
- Computer Communications, 2003. CCW 2003. Proceedings. 2003 IEEE 18th Annual
- Workshop on, 2003, pp. 117--123.
-
-\bibitem{Prasad:2007:DAL:1782174.1782218}
-\BIBentryALTinterwordspacing
-S.~K. Prasad and A.~Dhawan, ``Distributed algorithms for lifetime of wireless
- sensor networks based on dependencies among cover sets,'' in Proceedings of
- the 14th international conference on High performance computing, ser.
- HiPC'07.\hskip 1em plus 0.5em minus 0.4em\relax Berlin, Heidelberg:
- Springer-Verlag, 2007, pp. 381--392. [Online]. Available:
- \url{http://dl.acm.org/citation.cfm?id=1782174.1782218}
-\BIBentrySTDinterwordspacing
-
\bibitem{chin2007}
C.~T. Vu, ``An energy-efficient distributed algorithm for k-coverage problem in
- wireless sensor networks,'' Ph.D. dissertation, GeorgiaState University,
+ wireless sensor networks,'' Ph.D. dissertation, Georgia State University,
2007.
\bibitem{Huang:2003:CPW:941350.941367}
-\BIBentryALTinterwordspacing
-C.-F. Huang and Y.-C. Tseng, ``The coverage problem in a wireless sensor
- network,'' in Proceedings of the 2nd ACM international conference on Wireless
- sensor networks and applications, ser. WSNA '03.\hskip 1em plus 0.5em minus
- 0.4em\relax New York, NY, USA: ACM, 2003, pp. 115--121. [Online]. Available:
- \url{http://doi.acm.org/10.1145/941350.941367}
-\BIBentrySTDinterwordspacing
-
-\bibitem{cardei05}
-M.~Cardei and M.~P. J.~Wu, N.~Lu, ``Maximum network lifetime with adjustable
- range,'' in WiMob, 2005.
-
-\bibitem{Cardei:2006:ECP:1646656.1646898}
-\BIBentryALTinterwordspacing
-M.~Cardei and J.~Wu, ``Energy-efficient coverage problems in wireless ad-hoc
- sensor networks,'' Comput. Commun., vol.~29, no.~4, Feb. 2006, pp. 413--420.
- [Online]. Available: \url{http://dx.doi.org/10.1016/j.comcom.2004.12.025}
-\BIBentrySTDinterwordspacing
-
-\bibitem{Slijepcevic01powerefficient}
-S.~Slijepcevic and M.~Potkonjak, ``Power efficient organization of wireless
- sensor networks,'' in IEEE International conference on Communications, 2001,
- pp. 472--476.
-
-\bibitem{cardei02}
-M.~Cardei, D.~MacCallum, M.~X. Cheng, M.~Min, X.~Jia, D.~Li, and D.-Z. Du,
- ``Wireless sensor networks with energy efficient organization,'' Journal of
- Interconnection Networks, vol.~3, no. 3-4, 2002, pp. 213--229.
-
-\bibitem{Abrams:2004:SKA:984622.984684}
-\BIBentryALTinterwordspacing
-Z.~Abrams, A.~Goel, and S.~Plotkin, ``Set k-cover algorithms for energy
- efficient monitoring in wireless sensor networks,'' in Proceedings of the 3rd
- international symposium on Information processing in sensor networks, ser.
- IPSN '04.\hskip 1em plus 0.5em minus 0.4em\relax New York, NY, USA: ACM,
- 2004, pp. 424--432. [Online]. Available:
- \url{http://doi.acm.org/10.1145/984622.984684}
-\BIBentrySTDinterwordspacing
-
-\bibitem{Cardei:2005:IWS:1160086.1160098}
-M.~Cardei and D.-Z. Du, ``Improving wireless sensor network lifetime through
- power aware organization,'' Wirel. Netw., vol.~11, May 2005, pp. 333--340.
-
-\bibitem{Zorbas2007}
-D.~Zorbas, D.~Glynos, P.~Kotzanikolaou, and C.~Douligeris, ``B\{GOP\}: an
- adaptive coverage algorithm for wireless sensor networks,'' in Proceedings of
- the 13th European Wireless Conference, ser. EW'07, 2007.
-
-\bibitem{Manju2011}
-M.~Chaudhary and A.~K. Pujari, ``High-energy-first (hef) heuristic for
- energy-efficient target coverage problem,'' International Journal of Ad hoc,
- Sensor and Uniquitous computing (IJASUC), vol.~2, no.~1, 2011.
-
-\bibitem{cardei05bis}
-M.~Cardei, M.~T. Thai, Y.~Li, and W.~Wu, ``Energy-efficient target coverage in
- wireless sensor networks,'' in INFOCOM, 2005, pp. 1976--1984.
-
-\bibitem{berman04}
-P.~Berman and G.~Calinescu, ``Power efficient monitoring management in sensor
- networks,'' in Proceedings of IEEE Wireless Communication and Networking
- Conference (WCNC'04), 2004, pp. 2329--2334.
-
-\bibitem{garg98}
-N.~Garg and J.~Koenemann, ``Faster and simpler algorithms for multicommodity
- flow and other fractional packing problems.'' in Proceedings of the 39th
- Annual Symposium on Foundations of Computer Science, ser. FOCS '98, 1998, pp.
- 300--309.
+C.-F. HUANG and Y.-C. TSENG, ``The coverage problem in a wireless sensor
+ network,'' Mobile Networks and Applications, vol.~10, no.~4, 2005, pp.
+ 519--528.
+
+\bibitem{Shibo}
+S.~He, J.~Chen, X.~Li, X.~Shen, and Y.~Sun, ``Leveraging prediction to improve
+ the coverage of wireless sensor networks,'' IEEE TRANSACTIONS ON PARALLEL AND
+ DISTRIBUTED SYSTEMS, vol.~23, no.~4, 2012, pp. 701--712.
+
+\bibitem{Bang}
+B.~Wang, H.~B. Lim, and D.~Ma, ``A coverage-aware clustering protocol for
+ wireless sensor networks,'' Computer Networks, vol.~56, no.~5, 2012, pp.
+ 1599--1611.
+
+\bibitem{Zhixin}
+Z.~Liu, Q.~Zheng, L.~Xue, and X.~Guan, ``A distributed energy-efficient
+ clustering algorithm with improved coverage in wireless sensor networks,''
+ Future Generation Computer Systems, vol.~28, no.~5, 2012, pp. 780--790.
+
+\bibitem{Changlei}
+C.~Liu and G.~Cao, ``Spatial-temporal coverage optimization in wireless sensor
+ networks,'' IEEE TRANSACTIONS ON MOBILE COMPUTING, vol.~10, no.~5, 2011, pp.
+ 465--478.
+
+\bibitem{Misra}
+S.~Misra, M.~P. Kumar, and M.~S. Obaidat, ``Connectivity preserving localized
+ coverage algorithm for area monitoring using wireless sensor networks,''
+ Computer Communications, vol.~34, no.~12, 2011, pp. 1484--1496.
+
+\bibitem{Zhang}
+L.~Zhang, Q.~Zhu, and J.~Wang, ``Adaptive clustering for maximizing network
+ lifetime and maintaining coverage,'' JOURNAL OF NETWORKS, vol.~8, no.~3,
+ 2013, pp. 616--622.
+
+\bibitem{Torkestani}
+J.~A. Torkestani, ``An adaptive energy-efficient area coverage algorithm for
+ wireless sensor networks,'' Ad Hoc Networks, vol.~11, no.~6, 2013, pp.
+ 1655--1666.
\bibitem{pc10}
-T.~Padmavathy and M.~Chitra, ``Extending the network lifetime of wireless
- sensor networks using residual energy extraction—hybrid scheduling
+T.~V. Padmavathy and M.~Chitra, ``Extending the network lifetime of wireless
+ sensor networks using residual energy extraction hybrid scheduling
algorithm,'' Int. J. of Communications, Network and System Sciences, vol.~3,
no.~1, 2010, pp. 98--106.
+\bibitem{Zhang05}
+H.~Zhang and J.~C. Hou, ``Maintaining sensing coverage and connectivity in
+ large sensor networks,'' Ad Hoc {\&} Sensor Wireless Networks, vol.~1, no.
+ 1-2, 2005.
+
\bibitem{pedraza2006}
F.~Pedraza, A.~L. Medaglia, and A.~Garcia, ``Efficient coverage algorithms for
- wireless sensor networks,'' in Systems and Information Engineering Design
- Symposium, 2006 {IEEE}, 2006, pp. 78 --83.
+ wireless sensor networks,'' in Proceedings of the 2006 Systems and
+ Information Engineering Design Symposium, 2006, pp. 78--83.
+
+\bibitem{HeinzelmanCB02}
+W.~B. Heinzelman, A.~P. Chandrakasan, and H.~Balakrishnan, ``An
+ application-specific protocol architecture for wireless microsensor
+ networks,'' IEEE Transactions on Wireless Communications, vol.~1, no.~4,
+ 2002, pp. 660--670.
\end{thebibliography}
+
+@ARTICLE{Torkestani,
+ author = "J. A. Torkestani",
+ title = "An adaptive energy-efficient area coverage algorithm for wireless sensor networks ",
+ JOURNAL = {Ad Hoc Networks},
+ VOLUME = {11},
+ NUMBER = {6},
+ PAGES = {1655-1666},
+ YEAR = {2013},
+ }
+
+
+
+
+@ARTICLE{Zhang,
+ author = "L. Zhang and Q. Zhu and J. Wang",
+ title = "Adaptive Clustering for Maximizing Network Lifetime and Maintaining Coverage ",
+ JOURNAL = {JOURNAL OF NETWORKS},
+ VOLUME = {8},
+ NUMBER = {3},
+ PAGES = {616-622},
+ YEAR = {2013},
+ }
+
+
+
+@ARTICLE{Misra,
+ author = "S. Misra and M. P. Kumar and M. S. Obaidat",
+ title = "Connectivity preserving localized coverage algorithm for area monitoring using
+wireless sensor networks ",
+ JOURNAL = {Computer Communications},
+ VOLUME = {34},
+ NUMBER = {12},
+ PAGES = {1484-1496},
+ YEAR = {2011},
+ }
+
+
+
+@ARTICLE{Changlei,
+ author = "C. Liu and G. Cao",
+ title = "Spatial-Temporal Coverage Optimization in Wireless Sensor Networks ",
+ JOURNAL = {IEEE TRANSACTIONS ON MOBILE COMPUTING},
+ VOLUME = {10},
+ NUMBER = {5},
+ PAGES = {465-478},
+ YEAR = {2011},
+ }
+
+
+
+@ARTICLE{Zhixin,
+ author = "Z. Liu and Q. Zheng and L. Xue and X. Guan",
+ title = "A distributed energy-efficient clustering algorithm with improved coverage in
+wireless sensor networks",
+ JOURNAL = {Future Generation Computer Systems},
+ VOLUME = {28},
+ NUMBER = {5},
+ PAGES = {780-790},
+ YEAR = {2012},
+ }
+
+@ARTICLE{Bang,
+ author = "B. Wang and H. B. Lim and D. Ma ",
+ title = "A coverage-aware clustering protocol for wireless sensor networks",
+ JOURNAL = {Computer Networks},
+ VOLUME = {56},
+ NUMBER = {5},
+ PAGES = {1599-1611},
+ YEAR = {2012},
+ }
+
+
+@ARTICLE{Shibo,
+ author = " S. He and J. Chen and X. Li and X. Shen and Y. Sun ",
+ title = "Leveraging Prediction to Improve the Coverage of Wireless Sensor Networks",
+ JOURNAL = {IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS},
+ VOLUME = {23},
+ NUMBER = {4},
+ PAGES = {701-712},
+ YEAR = {2012},
+ }
+
@ARTICLE{Ammari01,
- author = "Habib M. Ammari and Sajal K. Das",
+ author = "H. M. Ammari and S. K. Das",
title = "Scheduling protocols for homogeneous and heterogeneous k-covered wireless sensor networks",
- YEAR = {2011},
JOURNAL = {Pervasive and Mobile Computing},
VOLUME = {7},
NUMBER = {1},
PAGES = {79-97},
+ YEAR = {2011},
}
@book{Akyildiz02,
- author = {Ian F. Akyildiz and Mehmet Can Vuran},
+ author = {I. F. Akyildiz and M. C. Vuran},
title = {Wireless Sensor Networks},
- year = {2010},
- isbn = {},
publisher = {John Wiley and Sons Ltd.},
- address = {},
+ year = {2010},
}
@book{Sudip03,
- author = {Sudip Misra, Isaac Woungang and Subhas Chandra Misra},
+ author = {S. Misra and I. Woungang and S. C. Misra},
title = {Guide to Wireless Sensor Networks},
- year = {2009},
- isbn = {},
publisher = {Springer-Verlag London Limited},
- address = {},
+ year = {2009},
}
-@book{Nayak04 ,
- author = {Amiya Nayak and Ivan Stojmenovic},
+@book{Nayak04,
+ author = {A. Nayak and I. Stojmenovic},
title = {Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data Communication},
- year = {2010},
- isbn = {},
publisher = {John Wiley and Sons, Inc},
- address = {},
+ year = {2010},
}
@ARTICLE{Misra05,
- author = "S. Misra, M.P. Kumar and M.S. Obaidat",
+ author = "S. Misra and M. P. Kumar and M. S. Obaidat",
title = "Connectivity preserving localized coverage algorithm for area monitoring using wireless
sensor networks",
- YEAR = {2011},
JOURNAL = {Computer Communications},
VOLUME = {34},
NUMBER = {12},
PAGES = {1484-1496},
+ YEAR = {2011},
}
-@ARTICLE{wns07,
- author ={J. Wang, C. Niu, R. Shen },
- title = {Randomized approach for target coverage scheduling in directional sensor network},
- journal = {ICESS2007},
- year = {2007},
- pages = {379-390},
-
-}
-
-@ARTICLE{dw60,
- author = {G.B. Dantzig and P. Wolfe},
- title = {Decomposition principle for linear programs},
- journal = {Operations Research},
- year = {1960},
- pages = {101-111}
-}
-
@ARTICLE{pc10,
- author = "T.V. Padmavathy and M. Chitra",
- title = "Extending the Network Lifetime of Wireless Sensor Networks Using Residual Energy Extraction—Hybrid Scheduling Algorithm",
- YEAR = {2010},
+ author = "T. V. Padmavathy and M. Chitra",
+ title = "Extending the Network Lifetime of Wireless Sensor Networks Using Residual Energy Extraction Hybrid Scheduling Algorithm",
JOURNAL = {Int. J. of Communications, Network and System Sciences},
VOLUME = {3},
NUMBER = {1},
-PAGES = {98-106},
+ PAGES = {98-106},
+ YEAR = {2010},
}
-@INPROCEEDINGS{Slijepcevic01powerefficient,
- author = {S. Slijepcevic and M. Potkonjak},
- title = {Power Efficient Organization of Wireless Sensor Networks},
- booktitle = {IEEE International conference on Communications},
- year = {2001},
- pages = {472--476}
-}
-
-@article{Cardei:2005:IWS:1160086.1160098,
- author = {Cardei, Mihaela and Du, Ding-Zhu},
- title = {Improving wireless sensor network lifetime through power aware organization},
- journal = {Wirel. Netw.},
- volume = {11},
- issue = {3},
- month = {May},
- year = {2005},
- issn = {1022-0038},
- pages = {333--340},
- numpages = {8},
- acmid = {1160098},
- publisher = {Kluwer Academic Publishers},
- address = {Hingham, MA, USA},
- keywords = {disjoint set covers, energy efficiency, node organization, wireless sensor networks},
-}
-
-@INPROCEEDINGS{Cardei05energy-efficienttarget,
- author = {Mihaela Cardei and My T. Thai and Yingshu Li and Weili Wu},
- title = {Energy-efficient target coverage in wireless sensor networks},
- booktitle = {in IEEE Infocom},
- year = {2005},
- pages = {1976--1984}
-}
-@INPROCEEDINGS{b04,
- author = "P. Berman and G. Calinescu and C. Shah and A. Zelikovsky",
- title = "Power efficient monitoring management in sensor networks",
- YEAR = {2004},
- booktitle = {Wireless Communications and Networking Conference, WCNC. 2004},
+@ARTICLE{Huang:2003:CPW:941350.941367,
+ author = "C.-F. HUANG and Y.-C. TSENG",
+ title = "The Coverage Problem in a Wireless Sensor Network",
+ JOURNAL = {Mobile Networks and Applications},
+ VOLUME = {10},
+ NUMBER = {4},
+ PAGES = {519-528},
+ YEAR = {2005},
}
-@INPROCEEDINGS{Berman05efficientenergy,
- author = {P. Berman and G. Calinescu and C. Shah and A. Zelikovsky},
- title = {Efficient energy management in sensor networks},
- booktitle = {Ad Hoc and Sensor Networks. Nova Science Publishers},
- year = {2005},
- publisher = {Nova Science Publisher}
-}
-
-@INPROCEEDINGS{1240799,
-author={Jun Lu and Suda, T.},
-booktitle={Computer Communications, 2003. CCW 2003. Proceedings. 2003 IEEE 18th Annual Workshop on},
-title={Coverage-aware self-scheduling in sensor networks},
-year={2003},
-pages={117-123},
-keywords={power consumption;probability;scheduling;wireless sensor networks;active state;coverage-aware self-scheduling;data correlation;energy consumption;hibernating state;network coverage;sensing denomination;wireless sensor networks;Animals;Base stations;Capacitive sensors;Chemical sensors;Event detection;Information retrieval;Intelligent networks;Monitoring;Temperature sensors;Wireless sensor networks},
-doi={10.1109/CCW.2003.1240799},}
-
-@inproceedings{Prasad:2007:DAL:1782174.1782218,
- author = {Prasad, Sushil K. and Dhawan, Akshaye},
- title = {Distributed algorithms for lifetime of wireless sensor networks based on dependencies among cover sets},
- booktitle = {Proceedings of the 14th international conference on High performance computing},
- series = {HiPC'07},
- year = {2007},
- isbn = {3-540-77219-7, 978-3-540-77219-4},
- location = {Goa, India},
- pages = {381--392},
- numpages = {12},
- url = {http://dl.acm.org/citation.cfm?id=1782174.1782218},
- acmid = {1782218},
- publisher = {Springer-Verlag},
- address = {Berlin, Heidelberg},
-}
-
-
-@article{Zorbas:2010:SCP:1715927.1715956,
- author = {D. Zorbas and D. Glynos and P. Kotzanikolaou and C. Douligeris},
- title = {Solving coverage problems in wireless sensor networks using cover sets},
- journal = {Ad Hoc Netw.},
- volume = {8},
- issue = {4},
- month = {June},
- year = {2010},
- issn = {1570-8705},
- pages = {400--415},
- numpages = {16},
- acmid = {1715956},
- publisher = {Elsevier Science Publishers B. V.},
- address = {Amsterdam, The Netherlands, The Netherlands},
- keywords = {Centralised algorithm, Cover sets, Target coverage, Wireless sensor networks},
-}
-
-@book{Garey:1990:CIG:574848,
- author = {M.R. Garey and D.S. Johnson},
- title = {Computers and Intractability; A Guide to the Theory of NP-Completeness},
- year = {1990},
- isbn = {0716710455},
- publisher = {W. H. Freeman \& Co.},
- address = {New York, NY, USA},
-}
-
-@ARTICLE{Caprara98algorithmsfor,
- author = {A. Caprara and M. Fischetti and P. Toth},
- title = {Algorithms for the Set Covering Problem},
- journal = {Annals of Operations Research},
- year = {1998},
- volume = {98},
- pages = {2000}
-}
-
-@article{DBLP:journals/eor/AlfieriBBC07,
- author = {Arianna Alfieri and
- Andrea Bianco and
- Paolo Brandimarte and
- Carla-Fabiana Chiasserini},
- title = {Maximizing system lifetime in wireless sensor networks},
- journal = {European Journal of Operational Research},
- volume = {181},
- number = {1},
- year = {2007},
- pages = {390-402},
-}
-
-@article{Gu:2009:QTC:1673018.1673025,
- author = {Gu, Yu and Ji, Yusheng and Li, Jie and Zhao, Baohua},
- title = {QoS-aware target coverage in wireless sensor networks},
- journal = {Wirel. Commun. Mob. Comput.},
- volume = {9},
- issue = {12},
- month = {December},
- year = {2009},
- issn = {1530-8669},
- pages = {1645--1659},
- numpages = {15},
- acmid = {1673025},
- publisher = {John Wiley and Sons Ltd.},
- address = {Chichester, UK},
- keywords = {column generation, lifetime optimization, target coverage, wireless sensor networks},
-}
-
-@article {springerlink:10.1007/BF01594937,
- author = {Y. Ye},
- affiliation = {Department of Management Sciences The University of Iowa 52242 Iowa City IA USA},
- title = {An O($n^3L$)) potential reduction algorithm for linear programming},
- journal = {Mathematical Programming},
- publisher = {Springer Berlin / Heidelberg},
- keyword = {Mathematics and Statistics},
- pages = {239-258},
- volume = {50},
- issue = {1},
- year = {1991}
-}
-
-@MANUAL{glpk,
- author = {A. Mahkorin},
- title = {GNU Linear Programming Kit, Reference Manual},
- year ={2010}
- }
-
-@INPROCEEDINGS{Garg98fasterand,
- author = {N. Garg and J. K\"{o}nemann},
- title = {Faster and simpler algorithms for multicommodity flow and other fractional packing problems},
- booktitle = {In Proceedings of the 39th Annual Symposium on Foundations of Computer Science},
- year = {1998},
- pages = {300--309},
- publisher = {}
-}
-
-@Article{Kuhn55,
- author = "{Harold W. Kuhn}",
- title = "{The Hungarian Method for the assignment problem}",
- journal = "{Naval Research Logistics Quarterly}",
- year = {1955},
- OPTkey = {},
- volume = {2},
- number = {},
- pages = "83--97",
-}
-
-@article{Cardei:2006:ECP:1646656.1646898,
- author = {Cardei, Mihaela and Wu, Jie},
- title = {Energy-efficient coverage problems in wireless ad-hoc sensor networks},
- journal = {Comput. Commun.},
- issue_date = {February, 2006},
- volume = {29},
- number = {4},
- month = feb,
- year = {2006},
- issn = {0140-3664},
- pages = {413--420},
- numpages = {8},
- url = {http://dx.doi.org/10.1016/j.comcom.2004.12.025},
- doi = {10.1016/j.comcom.2004.12.025},
- acmid = {1646898},
- publisher = {Elsevier Science Publishers B. V.},
- address = {Amsterdam, The Netherlands, The Netherlands},
- keywords = {Connectivity, Coverage, Energy efficiency, Wireless sensor networks},
-}
-
-@article{Manju2011,
- author = {Chaudhary, Manju and Pujari, Arun K.},
- journal = {International Journal of Ad hoc, Sensor and Uniquitous computing (IJASUC)},
- doi = {10.5121/ijasuc.2011.2105},
- title = {High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problem},
- volume = {2},
- number = {1},
- year = 2011
-}
-
-@inproceedings{Abrams:2004:SKA:984622.984684,
- author = {Abrams, Zo\"{e} and Goel, Ashish and Plotkin, Serge},
- title = {Set k-cover algorithms for energy efficient monitoring in wireless sensor networks},
- booktitle = {Proceedings of the 3rd international symposium on Information processing in sensor networks},
- series = {IPSN '04},
- year = {2004},
- isbn = {1-58113-846-6},
- location = {Berkeley, California, USA},
- pages = {424--432},
- numpages = {9},
- url = {http://doi.acm.org/10.1145/984622.984684},
- doi = {10.1145/984622.984684},
- acmid = {984684},
- publisher = {ACM},
- address = {New York, NY, USA},
- keywords = {analysis of algorithms, energy conservation, wireless sensor networks},
-}
-
-
-@inproceedings{Zorbas2007,
- author = {D. Zorbas and D. Glynos and P. Kotzanikolaou and C. Douligeris},
- title = {B\{GOP\}: an adaptive coverage algorithm for wireless sensor networks},
- booktitle = {Proceedings of the 13th European Wireless Conference},
- series = {EW'07},
- year = {2007},
- location = {Paris, France},
-
-}
-
-@article{cardei02,
- author = {Mihaela Cardei and
- David MacCallum and
- Maggie Xiaoyan Cheng and
- Manki Min and
- Xiaohua Jia and
- Deying Li and
- Ding-Zhu Du},
- title = {Wireless Sensor Networks with Energy Efficient Organization},
- journal = {Journal of Interconnection Networks},
- volume = {3},
- number = {3-4},
- year = {2002},
- pages = {213-229},
-
-}
-
-@inproceedings{cardei05,
- author = {Mihaela Cardei and J. Wu, N. Lu, M.O. Pervaiz
- },
- title = {Maximum Network Lifetime with Adjustable Range},
- booktitle = {WiMob},
- year = {2005},
- pages = {},
-
-}
-
-@inproceedings{cardei05bis,
- author = {Mihaela Cardei and
- My T. Thai and
- Yingshu Li and
- Weili Wu},
- title = {Energy-efficient target coverage in wireless sensor networks},
- booktitle = {INFOCOM},
- year = {2005},
- pages = {1976-1984},
-
-}
-
-@INPROCEEDINGS{berman04,
- author = {P. Berman and G. Calinescu},
- title = {Power Efficient Monitoring Management in Sensor Networks},
- booktitle = {Proceedings of IEEE Wireless Communication and Networking Conference (WCNC'04)},
- year = {2004},
- pages = {2329--2334}
-}
-
-@inproceedings{garg98,
- author = {Garg, Naveen and Koenemann, Jochen},
- title = {Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.},
- booktitle = {Proceedings of the 39th Annual Symposium on Foundations of Computer Science},
- series = {FOCS '98},
- year = {1998},
- pages = {300--309},
-
-}
-
-@inproceedings{Gallais06,
- author = {Gallais, Antoine and Carle, Jean and Simplot-Ryl, David and Stojmenovic, Ivan},
- title = {Localized Sensor Area Coverage with Low Communication Overhead},
- booktitle = {Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications},
- year = {2006},
- pages = {328--337},
-
-}
-
-@inproceedings{Tian02,
- author = {Tian, Di and Georganas, Nicolas D.},
- title = {A coverage-preserving node scheduling scheme for large wireless sensor networks},
- booktitle = {Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications},
- series = {WSNA '02},
- year = {2002},
- pages = {32--41},
- publisher = {ACM},
-}
-
-@inproceedings{Ye03,
- author = {Ye, Fan and Zhong, Gary and Cheng, Jesse and Lu, Songwu and Zhang, Lixia},
- title = {PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks},
- booktitle = {Proceedings of the 23rd International Conference on Distributed Computing Systems},
- series = {ICDCS'03},
- year = {2003},
- pages = {28--37},
-
-}
-
-@inproceedings{Huang:2003:CPW:941350.941367,
- author = {Huang, Chi-Fu and Tseng, Yu-Chee},
- title = {The coverage problem in a wireless sensor network},
- booktitle = {Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications},
- series = {WSNA '03},
- year = {2003},
- isbn = {1-58113-764-8},
- location = {San Diego, CA, USA},
- pages = {115--121},
- numpages = {7},
- url = {http://doi.acm.org/10.1145/941350.941367},
- doi = {10.1145/941350.941367},
- acmid = {941367},
- publisher = {ACM},
- address = {New York, NY, USA},
- keywords = {ad hoc network, computer geometry, coverage problem, sensor network, ubiquitous computing, wireless network},
-}
-
-
@article{Zhang05,
- author = {Honghai Zhang and Jennifer C. Hou},
- title = {Maintaining Sensing Coverage and Connectivity in Large Sensor
- Networks},
+ author = {H. Zhang and J. C. Hou},
+ title = {Maintaining Sensing Coverage and Connectivity in Large Sensor Networks},
journal = {Ad Hoc {\&} Sensor Wireless Networks},
volume = {1},
number = {1-2},
}
@article{HeinzelmanCB02,
- author = {Wendi B. Heinzelman and
- Anantha P. Chandrakasan and
- Hari Balakrishnan},
- title = {An application-specific protocol architecture for wireless
- microsensor networks},
+ author = {W. B. Heinzelman and A. P. Chandrakasan and H. Balakrishnan},
+ title = {An application-specific protocol architecture for wireless microsensor networks},
journal = {IEEE Transactions on Wireless Communications},
volume = {1},
number = {4},
+ pages = {660-670},
year = {2002},
- pages = {660-670}
}
+
+
@inproceedings{pedraza2006,
- title = {Efficient coverage algorithms for wireless sensor networks},
- urldate = {2013-06-24},
- booktitle = {Systems and Information Engineering Design Symposium, 2006 {IEEE}},
- author = {Pedraza, Fernán and Medaglia, Andrés L. and Garcia, A.},
- year = {2006},
- pages = {78 --83}
-}}
-% file = {FMorningSession4.3.pdf:/home/kdeschin/.mozilla/firefox/ts9zf0qu.default/zotero/storage/MPJFE2UE/FMorningSession4.3.pdf:application/pdf}
-%}
+ author = {F. Pedraza and A. L. Medaglia and A. Garcia},
+ title = {Efficient coverage algorithms for wireless sensor networks},
+ booktitle = {Proceedings of the 2006 Systems and Information Engineering Design Symposium},
+ pages = {78-83},
+ YEAR = {2006},
+}
@PhDThesis{chin2007,
-title = {An Energy-Efficient Distributed Algorithm for k-Coverage Problem in Wireless Sensor Networks
-},
-author = {Chinh Trung Vu},
-school = {GeorgiaState University},
-year = {2007}}
+author = {C. T. Vu},
+title = {An Energy-Efficient Distributed Algorithm for k-Coverage Problem in Wireless Sensor Networks},
+school = {Georgia State University},
+year = {2007},
+}
@ARTICLE{varga,
+author = {A. Varga},
title = {OMNeT++ Discrete Event Simulation System},
-author = {Andras Varga},
journal = {Available: http://www.omnetpp.org},
-year = {2003}}
-
-@article{die09,
- author = {Isabel Dietrich and
- Falko Dressler},
- title = {On the lifetime of wireless sensor networks},
- journal = {TOSN},
- volume = {5},
- number = {1},
- year = {2009},
- ee = {http://doi.acm.org/10.1145/1464420.1464425},
- bibsource = {DBLP, http://dblp.uni-trier.de}
+year = {2003},
}
-@article{ma10,
-author = {Raymond Raymond Mulligan and Habib M. Ammari},
-title = {Coverage in Wireless Sensor Networks: A Survey},
-journal = {Journal of Network Protocols and Algorithms (NPA)},
-volume = {5},
-number = {2},
-pages = {27-53},
-mont = {June},
-year = {2010}
-}
\ No newline at end of file
+
+
+
+
+
+
+
+
+
-- See the "IEEEtran_bst_HOWTO.pdf" manual for usage information.
Done.
-You've used 31 entries,
+You've used 19 entries,
4035 wiz_defined-function locations,
- 1010 strings with 13489 characters,
-and the built_in function-call counts, 23097 in all, are:
-= -- 1875
-> -- 493
-< -- 189
-+ -- 273
-- -- 79
-* -- 1047
-:= -- 3476
-add.period$ -- 67
-call.type$ -- 31
-change.case$ -- 28
-chr.to.int$ -- 444
-cite$ -- 31
-duplicate$ -- 1672
-empty$ -- 1990
-format.name$ -- 108
-if$ -- 5380
+ 927 strings with 10139 characters,
+and the built_in function-call counts, 14084 in all, are:
+= -- 1189
+> -- 298
+< -- 133
++ -- 175
+- -- 47
+* -- 646
+:= -- 2178
+add.period$ -- 38
+call.type$ -- 19
+change.case$ -- 16
+chr.to.int$ -- 282
+cite$ -- 19
+duplicate$ -- 1008
+empty$ -- 1085
+format.name$ -- 63
+if$ -- 3259
int.to.chr$ -- 0
-int.to.str$ -- 31
-missing$ -- 287
-newline$ -- 124
-num.names$ -- 31
-pop$ -- 658
+int.to.str$ -- 19
+missing$ -- 165
+newline$ -- 80
+num.names$ -- 19
+pop$ -- 334
preamble$ -- 1
purify$ -- 0
quote$ -- 2
-skip$ -- 1873
+skip$ -- 1143
stack$ -- 0
-substring$ -- 1064
-swap$ -- 1302
-text.length$ -- 41
+substring$ -- 673
+swap$ -- 840
+text.length$ -- 39
text.prefix$ -- 0
top$ -- 5
-type$ -- 31
+type$ -- 19
warning$ -- 0
-while$ -- 103
-width$ -- 33
-write$ -- 328
+while$ -- 58
+width$ -- 21
+write$ -- 211
-This is pdfTeX, Version 3.1415926-2.4-1.40.13 (TeX Live 2012/Debian) (format=pdflatex 2013.8.31) 6 DEC 2013 00:05
+This is pdfTeX, Version 3.1415926-2.4-1.40.13 (TeX Live 2012/Debian) (format=pdflatex 2013.8.31) 9 DEC 2013 14:08
entering extended mode
restricted \write18 enabled.
%&-line parsing enabled.
\@IEEEtmpitemindent=\dimen116
\c@IEEEbiography=\count90
\@IEEEtranrubishbin=\box26
-) (/usr/share/texlive/texmf-dist/tex/latex/float/float.sty
+) (/usr/share/texmf/tex/latex/etoolbox/etoolbox.sty
+Package: etoolbox 2011/01/03 v2.1 e-TeX tools for LaTeX
+
+(/usr/share/texlive/texmf-dist/tex/latex/etex-pkg/etex.sty
+Package: etex 1998/03/26 v2.0 eTeX basic definition package (PEB)
+\et@xins=\count91
+)
+\etb@tempcnta=\count92
+)
+(/usr/share/texlive/texmf-dist/tex/latex/float/float.sty
Package: float 2001/11/08 v1.3d Float enhancements (AL)
-\c@float@type=\count91
+\c@float@type=\count93
\float@exts=\toks15
\float@box=\box27
\@float@everytoks=\toks16
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty
Package: ltxcmds 2011/11/09 v1.22 LaTeX kernel commands for general use (HO)
)
-\Gread@gobject=\count92
+\Gread@gobject=\count94
))
\Gin@req@height=\dimen117
\Gin@req@width=\dimen118
)
(/usr/share/texlive/texmf-dist/tex/latex/tools/calc.sty
Package: calc 2007/08/22 v4.3 Infix arithmetic (KKT,FJ)
-\calc@Acount=\count93
-\calc@Bcount=\count94
+\calc@Acount=\count95
+\calc@Bcount=\count96
\calc@Adimen=\dimen121
\calc@Bdimen=\dimen122
\calc@Askip=\skip44
\calc@Bskip=\skip45
LaTeX Info: Redefining \setlength on input line 76.
LaTeX Info: Redefining \addtolength on input line 77.
-\calc@Ccount=\count95
+\calc@Ccount=\count97
\calc@Cskip=\skip46
)
(/usr/share/texlive/texmf-dist/tex/latex/psnfss/times.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty
Package: amsopn 1999/12/14 v2.01 operator names
)
-\inf@bad=\count96
+\inf@bad=\count98
LaTeX Info: Redefining \frac on input line 211.
-\uproot@=\count97
-\leftroot@=\count98
+\uproot@=\count99
+\leftroot@=\count100
LaTeX Info: Redefining \overline on input line 307.
-\classnum@=\count99
-\DOTSCASE@=\count100
+\classnum@=\count101
+\DOTSCASE@=\count102
LaTeX Info: Redefining \ldots on input line 379.
LaTeX Info: Redefining \dots on input line 382.
LaTeX Info: Redefining \cdots on input line 467.
\big@size=\dimen125
LaTeX Font Info: Redeclaring font encoding OML on input line 567.
LaTeX Font Info: Redeclaring font encoding OMS on input line 568.
-\macc@depth=\count101
-\c@MaxMatrixCols=\count102
+\macc@depth=\count103
+\c@MaxMatrixCols=\count104
\dotsspace@=\muskip10
-\c@parentequation=\count103
-\dspbrk@lvl=\count104
+\c@parentequation=\count105
+\dspbrk@lvl=\count106
\tag@help=\toks20
-\row@=\count105
-\column@=\count106
-\maxfields@=\count107
+\row@=\count107
+\column@=\count108
+\maxfields@=\count109
\andhelp@=\toks21
\eqnshift@=\dimen126
\alignsep@=\dimen127
(/usr/share/texlive/texmf-dist/tex/latex/base/ifthen.sty
Package: ifthen 2001/05/26 v1.1c Standard LaTeX ifthen package (DPC)
)
-\c@ALC@unique=\count108
-\c@ALC@line=\count109
-\c@ALC@rem=\count110
-\c@ALC@depth=\count111
+\c@ALC@unique=\count110
+\c@ALC@line=\count111
+\c@ALC@rem=\count112
+\c@ALC@depth=\count113
\ALC@tlm=\skip50
\algorithmicindent=\skip51
)
\pgf@yc=\dimen139
\w@pgf@writea=\write3
\r@pgf@reada=\read1
-\c@pgf@counta=\count112
-\c@pgf@countb=\count113
-\c@pgf@countc=\count114
-\c@pgf@countd=\count115
+\c@pgf@counta=\count114
+\c@pgf@countb=\count115
+\c@pgf@countc=\count116
+\c@pgf@countd=\count117
(/usr/share/texmf/tex/generic/pgf/systemlayer/pgf.cfg
File: pgf.cfg 2008/05/14 (rcs-revision 1.7)
)))
(/usr/share/texmf/tex/generic/pgf/systemlayer/pgfsyssoftpath.code.tex
File: pgfsyssoftpath.code.tex 2008/07/18 (rcs-revision 1.7)
-\pgfsyssoftpath@smallbuffer@items=\count116
-\pgfsyssoftpath@bigbuffer@items=\count117
+\pgfsyssoftpath@smallbuffer@items=\count118
+\pgfsyssoftpath@bigbuffer@items=\count119
)
(/usr/share/texmf/tex/generic/pgf/systemlayer/pgfsysprotocol.code.tex
File: pgfsysprotocol.code.tex 2006/10/16 (rcs-revision 1.4)
(/usr/share/texmf/tex/generic/pgf/math/pgfmathutil.code.tex)
(/usr/share/texmf/tex/generic/pgf/math/pgfmathparser.code.tex
\pgfmath@dimen=\dimen140
-\pgfmath@count=\count118
+\pgfmath@count=\count120
\pgfmath@box=\box32
\pgfmath@toks=\toks28
\pgfmath@stack@operand=\toks29
(/usr/share/texmf/tex/generic/pgf/math/pgfmathfunctions.round.code.tex)
(/usr/share/texmf/tex/generic/pgf/math/pgfmathfunctions.misc.code.tex)))
(/usr/share/texmf/tex/generic/pgf/math/pgfmathfloat.code.tex
-\c@pgfmathroundto@lastzeros=\count119
+\c@pgfmathroundto@lastzeros=\count121
))
(/usr/share/texmf/tex/generic/pgf/basiclayer/pgfcorepoints.code.tex
File: pgfcorepoints.code.tex 2010/04/09 (rcs-revision 1.20)
\pgfpic=\box33
\pgf@hbox=\box34
\pgf@layerbox@main=\box35
-\pgf@picture@serial@count=\count120
+\pgf@picture@serial@count=\count122
)
(/usr/share/texmf/tex/generic/pgf/basiclayer/pgfcoregraphicstate.code.tex
File: pgfcoregraphicstate.code.tex 2008/04/22 (rcs-revision 1.9)
(/usr/share/texmf/tex/generic/pgf/basiclayer/pgfcoreshade.code.tex
File: pgfcoreshade.code.tex 2008/11/23 (rcs-revision 1.13)
\pgf@max=\dimen163
-\pgf@sys@shading@range@num=\count121
+\pgf@sys@shading@range@num=\count123
)
(/usr/share/texmf/tex/generic/pgf/basiclayer/pgfcoreimage.code.tex
File: pgfcoreimage.code.tex 2010/03/25 (rcs-revision 1.16)
(/usr/share/texmf/tex/generic/pgf/libraries/pgflibraryplothandlers.code.tex
File: pgflibraryplothandlers.code.tex 2010/05/31 v2.10 (rcs-revision 1.15)
-\pgf@plot@mark@count=\count122
+\pgf@plot@mark@count=\count124
\pgfplotmarksize=\dimen168
)
\tikz@lastx=\dimen169
\tikzsiblingdistance=\dimen174
\tikz@figbox=\box38
\tikz@tempbox=\box39
-\tikztreelevel=\count123
-\tikznumberofchildren=\count124
-\tikznumberofcurrentchild=\count125
-\tikz@fig@count=\count126
+\tikztreelevel=\count125
+\tikznumberofchildren=\count126
+\tikznumberofcurrentchild=\count127
+\tikz@fig@count=\count128
(/usr/share/texmf/tex/generic/pgf/modules/pgfmodulematrix.code.tex
File: pgfmodulematrix.code.tex 2010/08/24 (rcs-revision 1.4)
-\pgfmatrixcurrentrow=\count127
-\pgfmatrixcurrentcolumn=\count128
-\pgf@matrix@numberofcolumns=\count129
+\pgfmatrixcurrentrow=\count129
+\pgfmatrixcurrentcolumn=\count130
+\pgf@matrix@numberofcolumns=\count131
)
-\tikz@expandcount=\count130
+\tikz@expandcount=\count132
(/usr/share/texmf/tex/generic/pgf/frontendlayer/tikz/libraries/tikzlibrarytopat
hs.code.tex
\subfigbottomskip=\skip54
\subfigcapmargin=\dimen176
\subfiglabelskip=\skip55
-\c@subfigure=\count131
-\c@lofdepth=\count132
-\c@subtable=\count133
-\c@lotdepth=\count134
+\c@subfigure=\count133
+\c@lofdepth=\count134
+\c@subtable=\count135
+\c@lotdepth=\count136
****************************************
* Local config file subfigure.cfg used *
****************************************
)
(/usr/share/texlive/texmf-dist/tex/latex/algorithm2e/algorithm2e.sty
Package: algorithm2e 2008/00/00 v3.10 algorithms environments
-\c@AlgoLine=\count135
+\c@AlgoLine=\count137
(/usr/share/texlive/texmf-dist/tex/latex/relsize/relsize.sty
Package: relsize 2011/09/21 ver 4.0
\algoheightrule=\skip69
\algotitleheightruledefault=\skip70
\algotitleheightrule=\skip71
-\c@algocfline=\count136
-\c@algocfproc=\count137
-\c@algocf=\count138
+\c@algocfline=\count138
+\c@algocfproc=\count139
+\c@algocf=\count140
\algocf@algoframe=\box45
\algocf@algobox=\box46
) (/usr/share/texlive/texmf-dist/tex/latex/caption/caption.sty
SSOPTIONconference \hbox to\hsize {\normalfont \footnotesize \box \@tempboxa \h
fil }\else \hbox to\hsize {\normalfont \footnotesize \box \@tempboxa \hfil }\fi
\fi \fi .
-\c@ContinuedFloat=\count139
+\c@ContinuedFloat=\count141
Package caption Info: float package is loaded.
Package caption Info: subfigure package is loaded.
) (/usr/share/texlive/texmf-dist/tex/latex/tools/multicol.sty
Package: multicol 2011/06/27 v1.7a multicolumn formatting (FMi)
-\c@tracingmulticols=\count140
+\c@tracingmulticols=\count142
\mult@box=\box47
\multicol@leftmargin=\dimen189
-\c@unbalance=\count141
-\c@collectmore=\count142
-\doublecol@number=\count143
-\multicoltolerance=\count144
-\multicolpretolerance=\count145
+\c@unbalance=\count143
+\c@collectmore=\count144
+\doublecol@number=\count145
+\multicoltolerance=\count146
+\multicolpretolerance=\count147
\full@width=\dimen190
\page@free=\dimen191
\premulticols=\dimen192
\@tempa=\box68
\@tempa=\box69
\@tempa=\box70
-\c@columnbadness=\count146
-\c@finalcolumnbadness=\count147
+\c@columnbadness=\count148
+\c@finalcolumnbadness=\count149
\last@try=\dimen194
\multicolovershoot=\dimen195
\multicolundershoot=\dimen196
\mult@nat@firstbox=\box71
\colbreak@box=\box72
-\multicol@sort@counter=\count148
+\multicol@sort@counter=\count150
)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/epstopdf.sty
Package: epstopdf 2010/02/09 v2.5 Conversion with epstopdf on the fly (HO)
(./bare_conf.aux)
\openout1 = `bare_conf.aux'.
-LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 43.
-LaTeX Font Info: ... okay on input line 43.
-LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 43.
-LaTeX Font Info: ... okay on input line 43.
-LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 43.
-LaTeX Font Info: ... okay on input line 43.
-LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 43.
-LaTeX Font Info: ... okay on input line 43.
-LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 43.
-LaTeX Font Info: ... okay on input line 43.
-LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 43.
-LaTeX Font Info: ... okay on input line 43.
+LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 44.
+LaTeX Font Info: ... okay on input line 44.
+LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 44.
+LaTeX Font Info: ... okay on input line 44.
+LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 44.
+LaTeX Font Info: ... okay on input line 44.
+LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 44.
+LaTeX Font Info: ... okay on input line 44.
+LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 44.
+LaTeX Font Info: ... okay on input line 44.
+LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 44.
+LaTeX Font Info: ... okay on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <5> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <5> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <7> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <7> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <8> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <8> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <9> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <9> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <10> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <10> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <11> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <11> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <12> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <12> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <17> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <17> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <20> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <20> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <24> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 44.
LaTeX Font Info: Font shape `T1/ptm/bx/it' in size <24> not available
-(Font) Font shape `T1/ptm/b/it' tried instead on input line 43.
+(Font) Font shape `T1/ptm/b/it' tried instead on input line 44.
(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
-\scratchcounter=\count149
+\scratchcounter=\count151
\scratchdimen=\dimen197
\scratchbox=\box73
-\nofMPsegments=\count150
-\nofMParguments=\count151
+\nofMPsegments=\count152
+\nofMParguments=\count153
\everyMPshowfont=\toks33
-\MPscratchCnt=\count152
+\MPscratchCnt=\count154
\MPscratchDim=\dimen198
-\MPnumerator=\count153
-\makeMPintoPDFobject=\count154
+\MPnumerator=\count155
+\makeMPintoPDFobject=\count156
\everyMPtoPDFconversion=\toks34
) ABD: EveryShipout initializing macros
Package caption Info: Begin \AtBeginDocument code.
Package caption Info: End \AtBeginDocument code.
LaTeX Font Info: Font shape `T1/ptm/bx/n' in size <14> not available
-(Font) Font shape `T1/ptm/b/n' tried instead on input line 55.
-LaTeX Font Info: Try loading font information for U+msa on input line 55.
+(Font) Font shape `T1/ptm/b/n' tried instead on input line 56.
+LaTeX Font Info: Try loading font information for U+msa on input line 56.
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd
File: umsa.fd 2009/06/22 v3.00 AMS symbols A
)
-LaTeX Font Info: Try loading font information for U+msb on input line 55.
+LaTeX Font Info: Try loading font information for U+msb on input line 56.
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd
File: umsb.fd 2009/06/22 v3.00 AMS symbols B
)
-LaTeX Font Info: Try loading font information for U+lasy on input line 55.
+LaTeX Font Info: Try loading font information for U+lasy on input line 56.
(/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd
File: ulasy.fd 1998/08/17 v2.2e LaTeX symbol font definitions
)
-Underfull \hbox (badness 3547) in paragraph at lines 76--78
-[]\T1/ptm/b/it/9 Keywords\T1/ptm/b/n/9 -\T1/ptm/b/it/9 Area Cov-er-age, Net-wor
-k life-time, Op-ti-miza-tion,
- []
-
-[1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}
+Missing character: There is no â in font cmr10!
+Missing character: There is no \80 in font cmr10!
+Missing character: There is no \99 in font cmr10!
+ [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}
-] [2]
+]
Package epstopdf Info: Source file: <FirstModel.eps>
(epstopdf) date: 2013-08-29 15:25:32
(epstopdf) size: 886264 bytes
(epstopdf) date: 2013-08-29 15:25:32
(epstopdf) size: 41020 bytes
(epstopdf) Command: <repstopdf FirstModel.eps>
-(epstopdf) \includegraphics on input line 389.
+(epstopdf) \includegraphics on input line 216.
Package epstopdf Info: Output file is already uptodate.
-<FirstModel.pdf, id=20, 586.44093pt x 140.02313pt>
+<FirstModel.pdf, id=13, 586.44093pt x 140.02313pt>
File: FirstModel.pdf Graphic file (type pdf)
<use FirstModel.pdf>
-Package pdftex.def Info: FirstModel.pdf used on input line 389.
+Package pdftex.def Info: FirstModel.pdf used on input line 216.
(pdftex.def) Requested size: 241.84842pt x 57.74529pt.
-[3 <./FirstModel.pdf>]
+[2 <./FirstModel.pdf>]
Package epstopdf Info: Source file: <principles13.eps>
(epstopdf) date: 2013-08-29 15:25:32
(epstopdf) size: 166031 bytes
(epstopdf) date: 2013-08-29 15:25:49
(epstopdf) size: 57812 bytes
(epstopdf) Command: <repstopdf principles13.eps>
-(epstopdf) \includegraphics on input line 528.
+(epstopdf) \includegraphics on input line 355.
Package epstopdf Info: Output file is already uptodate.
- <principles13.pdf, id=28, 794.97pt x 614.295pt>
+ <principles13.pdf, id=21, 794.97pt x 614.295pt>
File: principles13.pdf Graphic file (type pdf)
<use principles13.pdf>
-Package pdftex.def Info: principles13.pdf used on input line 528.
+Package pdftex.def Info: principles13.pdf used on input line 355.
(pdftex.def) Requested size: 198.742pt x 153.57336pt.
- [4 <./principles13.pdf>]
-Underfull \hbox (badness 10000) in paragraph at lines 599--600
+ [3 <./principles13.pdf>]
+Underfull \hbox (badness 10000) in paragraph at lines 426--427
[]
(epstopdf) date: 2013-08-29 15:25:49
(epstopdf) size: 9276 bytes
(epstopdf) Command: <repstopdf TheCoverageRatio150g.eps>
-(epstopdf) \includegraphics on input line 729.
+(epstopdf) \includegraphics on input line 556.
Package epstopdf Info: Output file is already uptodate.
-<TheCoverageRatio150g.pdf, id=38, 484.81125pt x 347.2975pt>
+<TheCoverageRatio150g.pdf, id=35, 484.81125pt x 347.2975pt>
File: TheCoverageRatio150g.pdf Graphic file (type pdf)
<use TheCoverageRatio150g.pdf>
-Package pdftex.def Info: TheCoverageRatio150g.pdf used on input line 729.
+Package pdftex.def Info: TheCoverageRatio150g.pdf used on input line 556.
(pdftex.def) Requested size: 242.40503pt x 173.64832pt.
LaTeX Warning: `!h' float specifier changed to `!ht'.
-LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 741.
+LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 568.
Package epstopdf Info: Source file: <TheActiveSensorRatio150g.eps>
(epstopdf) date: 2013-08-29 15:25:50
(epstopdf) size: 9085 bytes
(epstopdf) Command: <repstopdf TheActiveSensorRatio150g.eps>
-(epstopdf) \includegraphics on input line 751.
+(epstopdf) \includegraphics on input line 578.
Package epstopdf Info: Output file is already uptodate.
-<TheActiveSensorRatio150g.pdf, id=39, 490.83376pt x 347.2975pt>
+<TheActiveSensorRatio150g.pdf, id=36, 490.83376pt x 347.2975pt>
File: TheActiveSensorRatio150g.pdf Graphic file (type pdf)
<use TheActiveSensorRatio150g.pdf>
-Package pdftex.def Info: TheActiveSensorRatio150g.pdf used on input line 751.
+Package pdftex.def Info: TheActiveSensorRatio150g.pdf used on input line 578.
(pdftex.def) Requested size: 245.41628pt x 173.64832pt.
LaTeX Warning: `!h' float specifier changed to `!ht'.
-[5]
+[4]
-LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 771.
+LaTeX Font Warning: Command \scriptsize invalid in math mode on input line 598.
Package epstopdf Info: Source file: <TheEnergySavingRatio150g.eps>
(epstopdf) date: 2013-08-29 15:25:50
(epstopdf) size: 9304 bytes
(epstopdf) Command: <repstopdf TheEnergySavingRatio150g.eps>
-(epstopdf) \includegraphics on input line 784.
+(epstopdf) \includegraphics on input line 611.
Package epstopdf Info: Output file is already uptodate.
-<TheEnergySavingRatio150g.pdf, id=44, 490.83376pt x 347.2975pt>
+<TheEnergySavingRatio150g.pdf, id=41, 490.83376pt x 347.2975pt>
File: TheEnergySavingRatio150g.pdf Graphic file (type pdf)
<use TheEnergySavingRatio150g.pdf>
-Package pdftex.def Info: TheEnergySavingRatio150g.pdf used on input line 784.
+Package pdftex.def Info: TheEnergySavingRatio150g.pdf used on input line 611.
(pdftex.def) Requested size: 245.41628pt x 173.64832pt.
Package epstopdf Info: Source file: <TheNumberofStoppedSimulationRuns150g.eps>
(epstopdf) date: 2013-08-29 15:25:32
(epstopdf) size: 8582 bytes
(epstopdf) Command: <repstopdf TheNumberofStoppedSimulationRuns150g
.eps>
-(epstopdf) \includegraphics on input line 815.
+(epstopdf) \includegraphics on input line 642.
Package epstopdf Info: Output file is already uptodate.
-<TheNumberofStoppedSimulationRuns150g.pdf, id=45, 484.81125pt x 347.2975pt>
+<TheNumberofStoppedSimulationRuns150g.pdf, id=42, 484.81125pt x 347.2975pt>
File: TheNumberofStoppedSimulationRuns150g.pdf Graphic file (type pdf)
<use TheNumberofStoppedSimulationRuns150g.pdf>
Package pdftex.def Info: TheNumberofStoppedSimulationRuns150g.pdf used on input
- line 815.
+ line 642.
(pdftex.def) Requested size: 242.40503pt x 173.64832pt.
LaTeX Warning: `!h' float specifier changed to `!ht'.
-[6 <./TheCoverageRatio150g.pdf> <./TheActiveSensorRatio150g.pdf> <./TheEnergySa
+[5 <./TheCoverageRatio150g.pdf> <./TheActiveSensorRatio150g.pdf> <./TheEnergySa
vingRatio150g.pdf>]
Package epstopdf Info: Source file: <TheEnergyConsumptiong.eps>
(epstopdf) date: 2013-08-29 15:25:32
(epstopdf) date: 2013-08-29 15:25:51
(epstopdf) size: 7990 bytes
(epstopdf) Command: <repstopdf TheEnergyConsumptiong.eps>
-(epstopdf) \includegraphics on input line 847.
+(epstopdf) \includegraphics on input line 674.
Package epstopdf Info: Output file is already uptodate.
- <TheEnergyConsumptiong.pdf, id=64, 493.845pt x 347.2975pt>
+ <TheEnergyConsumptiong.pdf, id=61, 493.845pt x 347.2975pt>
File: TheEnergyConsumptiong.pdf Graphic file (type pdf)
<use TheEnergyConsumptiong.pdf>
-Package pdftex.def Info: TheEnergyConsumptiong.pdf used on input line 847.
+Package pdftex.def Info: TheEnergyConsumptiong.pdf used on input line 674.
(pdftex.def) Requested size: 246.92189pt x 173.64832pt.
Package epstopdf Info: Source file: <TheNetworkLifetimeg.eps>
(epstopdf) date: 2013-08-29 15:25:32
(epstopdf) date: 2013-08-29 15:25:51
(epstopdf) size: 7536 bytes
(epstopdf) Command: <repstopdf TheNetworkLifetimeg.eps>
-(epstopdf) \includegraphics on input line 922.
+(epstopdf) \includegraphics on input line 749.
Package epstopdf Info: Output file is already uptodate.
-<TheNetworkLifetimeg.pdf, id=65, 493.845pt x 347.2975pt>
+<TheNetworkLifetimeg.pdf, id=62, 493.845pt x 347.2975pt>
File: TheNetworkLifetimeg.pdf Graphic file (type pdf)
<use TheNetworkLifetimeg.pdf>
-Package pdftex.def Info: TheNetworkLifetimeg.pdf used on input line 922.
+Package pdftex.def Info: TheNetworkLifetimeg.pdf used on input line 749.
(pdftex.def) Requested size: 246.92189pt x 173.64832pt.
- [7 <./TheNumberofStoppedSimulationRuns150g.pdf> <./TheEnergyConsumptiong.pdf>
-<./TheNetworkLifetimeg.pdf>] (./bare_conf.bbl
-[8])
+ [6 <./TheNumberofStoppedSimulationRuns150g.pdf> <./TheEnergyConsumptiong.pdf>
+<./TheNetworkLifetimeg.pdf>] (./bare_conf.bbl)
** Conference Paper **
Before submitting the final camera ready copy, remember to:
uses only Type 1 fonts and that every step in the generation
process uses the appropriate paper size.
-[9
-
-] (./bare_conf.aux) )
+[7] (./bare_conf.aux) )
Here is how much of TeX's memory you used:
- 14357 strings out of 495059
- 253719 string characters out of 3182030
- 324020 words of memory out of 3000000
- 17235 multiletter control sequences out of 15000+200000
+ 14700 strings out of 495059
+ 257591 string characters out of 3182030
+ 331259 words of memory out of 3000000
+ 17570 multiletter control sequences out of 15000+200000
109666 words of font info for 116 fonts, out of 3000000 for 9000
17 hyphenation exceptions out of 8191
- 56i,9n,55p,789b,276s stack positions out of 5000i,500n,10000p,200000b,50000s
-{/usr/share/texlive/texmf-dist/fonts/enc/dvips/base/8r.enc
-}</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb></usr
-/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb></usr/share
-/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi7.pfb></usr/share/texliv
-e/texmf-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb></usr/share/texlive/texmf
--dist/fonts/type1/public/amsfonts/cm/cmr7.pfb></usr/share/texlive/texmf-dist/fo
-nts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texlive/texmf-dist/fonts/ty
-pe1/public/amsfonts/cm/cmsy7.pfb></usr/share/texlive/texmf-dist/fonts/type1/pub
-lic/amsfonts/symbols/msbm10.pfb></usr/share/texlive/texmf-dist/fonts/type1/urw/
-times/utmb8a.pfb></usr/share/texlive/texmf-dist/fonts/type1/urw/times/utmbi8a.p
-fb></usr/share/texlive/texmf-dist/fonts/type1/urw/times/utmr8a.pfb></usr/share/
-texlive/texmf-dist/fonts/type1/urw/times/utmri8a.pfb>
-Output written on bare_conf.pdf (9 pages, 295623 bytes).
+ 56i,9n,55p,792b,276s stack positions out of 5000i,500n,10000p,200000b,50000s
+{/usr/share/texlive/texmf-dist/fonts/enc/dvips/base/8r.e
+nc}</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb></u
+sr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb></usr/sha
+re/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi7.pfb></usr/share/texl
+ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb></usr/share/texlive/tex
+mf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb></usr/share/texlive/texmf-dist/
+fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texlive/texmf-dist/fonts/
+type1/public/amsfonts/cm/cmsy7.pfb></usr/share/texlive/texmf-dist/fonts/type1/p
+ublic/amsfonts/symbols/msbm10.pfb></usr/share/texlive/texmf-dist/fonts/type1/ur
+w/times/utmb8a.pfb></usr/share/texlive/texmf-dist/fonts/type1/urw/times/utmbi8a
+.pfb></usr/share/texlive/texmf-dist/fonts/type1/urw/times/utmr8a.pfb></usr/shar
+e/texlive/texmf-dist/fonts/type1/urw/times/utmri8a.pfb>
+Output written on bare_conf.pdf (7 pages, 286543 bytes).
PDF statistics:
- 131 PDF objects out of 1000 (max. 8388607)
- 91 compressed objects within 1 object stream
+ 125 PDF objects out of 1000 (max. 8388607)
+ 87 compressed objects within 1 object stream
0 named destinations out of 1000 (max. 500000)
53 words of extra memory for PDF output out of 10000 (max. 10000000)
\hyphenation{op-tical net-works semi-conduc-tor}
+\usepackage{etoolbox}
\usepackage{float}
\usepackage{epsfig}
\usepackage{calc}
\end{abstract}
\begin{IEEEkeywords}
-Area Coverage, Network lifetime, Optimization, Scheduling, Distributed Protocol.
+Wireless Sensor Networks, Area Coverage, Network lifetime, Optimization, Scheduling.
\end{IEEEkeywords}
%\keywords{Area Coverage, Network lifetime, Optimization, Distributed Protocol}
\IEEEpeerreviewmaketitle
-
-
-
-
\section{Introduction}
\noindent The fast developments in the low-cost sensor devices and wireless communications have allowed the emergence the WSNs. WSN includes a large number of small , limited-power sensors that can sense, process and transmit
\section{Related works}
\label{rw}
-
-\noindent This section is dedicated to the various approaches proposed
-in the literature for the coverage lifetime maximization problem,
-where the objective is to optimally schedule sensors' activities in
-order to extend network lifetime in a randomly deployed network. As
-this problem is subject to a wide range of interpretations, we have chosen
-to recall the main definitions and assumptions related to our work.
-
-%\begin{itemize}
-%\item Area Coverage: The main objective is to cover an area. The area coverage requires
-%that the sensing range of working Active nodes cover the whole targeting area, which means any
-%point in target area can be covered~\cite{Mihaela02,Raymond03}.
-
-%\item Target Coverage: The objective is to cover a set of targets. Target coverage means that the discrete target points can be covered in any time. The sensing range of working Active nodes only monitors a finite number of discrete points in targeting area~\cite{Mihaela02,Raymond03}.
-
-%\item Barrier Coverage An objective to determine the maximal support/breach paths that traverse a sensor field. Barrier coverage is expressed as finding one or more routes with starting position and ending position when the targets pass through the area deployed with sensor nodes~\cite{Santosh04,Ai05}.
-%\end{itemize}
-\subsection{Coverage}
-%{\bf Coverage}
-
-The most discussed coverage problems in literature can be classified
-into two types \cite{ma10}: area coverage (also called full or blanket
-coverage) and target coverage. An area coverage problem is to find a
-minimum number of sensors to work, such that each physical point in the
-area is within the sensing range of at least one working sensor node.
-Target coverage problem is to cover only a finite number of discrete
-points called targets. This type of coverage has mainly military
-applications. Our work will concentrate on the area coverage by design
-and implementation of a strategy, which efficiently selects the active
-nodes that must maintain both sensing coverage and network
-connectivity and at the same time improve the lifetime of the wireless
-sensor network. But, requiring that all physical points of the
-considered region are covered may be too strict, especially where the
-sensor network is not dense. Our approach represents an area covered
-by a sensor as a set of primary points and tries to maximize the total
-number of primary points that are covered in each round, while
-minimizing overcoverage (points covered by multiple active sensors
-simultaneously).
-
-\subsection{Lifetime}
-%{\bf Lifetime}
-
-Various definitions exist for the lifetime of a sensor
-network~\cite{die09}. The main definitions proposed in the literature are
-related to the remaining energy of the nodes or to the coverage percentage.
-The lifetime of the network is mainly defined as the amount
-of time during which the network can satisfy its coverage objective (the
-amount of time that the network can cover a given percentage of its
-area or targets of interest). In this work, we assume that the network
-is alive until all nodes have been drained of their energy or the
-sensor network becomes disconnected, and we measure the coverage ratio
-during the WSN lifetime. Network connectivity is important because an
-active sensor node without connectivity towards a base station cannot
-transmit information on an event in the area that it monitors.
-
-\subsection{Activity scheduling}
-%{\bf Activity scheduling}
-
-Activity scheduling is to schedule the activation and deactivation of
-sensor nodes. The basic objective is to decide which sensors are in
-what states (active or sleeping mode) and for how long, so that the
-application coverage requirement can be guaranteed and the network
-lifetime can be prolonged. Various approaches, including centralized,
-distributed, and localized algorithms, have been proposed for activity
-scheduling. In distributed algorithms, each node in the network
-autonomously makes decisions on whether to turn on or turn off itself
-only using local neighbor information. In centralized algorithms, a
-central controller (a node or base station) informs every sensors of
-the time intervals to be activated.
-
-\subsection{Distributed approaches}
-%{\bf Distributed approaches}
-
-Some distributed algorithms have been developed
-in~\cite{Gallais06,Tian02,Ye03,Zhang05,HeinzelmanCB02} to perform the
-scheduling. Distributed algorithms typically operate in rounds for
-a predetermined duration. At the beginning of each round, a sensor
-exchanges information with its neighbors and makes a decision to either
-remain turned on or to go to sleep for the round. This decision is
-basically made on simple greedy criteria like the largest uncovered
-area \cite{Berman05efficientenergy}, maximum uncovered targets
-\cite{1240799}. In \cite{Tian02}, the scheduling scheme is divided
-into rounds, where each round has a self-scheduling phase followed by
-a sensing phase. Each sensor broadcasts a message containing the node ID
-and the node location to its neighbors at the beginning of each round. A
-sensor determines its status by a rule named off-duty eligible rule,
-which tells him to turn off if its sensing area is covered by its
-neighbors. A back-off scheme is introduced to let each sensor delay
-the decision process with a random period of time, in order to avoid
-simultaneous conflicting decisions between nodes and lack of coverage on any area.
-\cite{Prasad:2007:DAL:1782174.1782218} defines a model for capturing
-the dependencies between different cover sets and proposes localized
-heuristic based on this dependency. The algorithm consists of two
-phases, an initial setup phase during which each sensor computes and
-prioritizes the covers and a sensing phase during which each sensor
-first decides its on/off status, and then remains on or off for the
-rest of the duration. Authors in \cite{chin2007} propose a novel
+\indent In this section, we only review some recent work with the coverage lifetime maximization problem, where the objective is to optimally schedule sensors' activities in
+order to extend network lifetime in WSNS. Authors in \cite{chin2007} propose a novel
distributed heuristic named Distributed Energy-efficient Scheduling
for k-coverage (DESK) so that the energy consumption among all the
sensors is balanced, and network lifetime is maximized while the
coverage requirement is being maintained. This algorithm works in
round, requires only 1-sensing-hop-neighbor information, and a sensor
-decides its status (active/sleep) based on its perimeter coverage
-computed through the k-Non-Unit-disk coverage algorithm proposed in
-\cite{Huang:2003:CPW:941350.941367}.
-
-Some other approaches do not consider a synchronized and predetermined
-period of time where the sensors are active or not. Indeed, each
-sensor maintains its own timer and its wake-up time is randomized
-\cite{Ye03} or regulated \cite{cardei05} over time.
-%A ecrire \cite{Abrams:2004:SKA:984622.984684}p33
-
-%The scheduling information is disseminated throughout the network and only sensors in the active state are responsible
-%for monitoring all targets, while all other nodes are in a low-energy sleep mode. The nodes decide cooperatively which of them will remain in sleep mode for a certain
-%period of time.
-
- %one way of increasing lifeteime is by turning off redundant nodes to sleep mode to conserve energy while active nodes provide essential coverage, which improves fault tolerance.
-
-%In this paper we focus on centralized algorithms because distributed algorithms are outside the scope of our work. Note that centralized coverage algorithms have the advantage of requiring very low processing power from the sensor nodes which have usually limited processing capabilities. Moreover, a recent study conducted in \cite{pc10} concludes that there is a threshold in terms of network size to switch from a localized to a centralized algorithm. Indeed the exchange of messages in large networks may consume a considerable amount of energy in a localized approach compared to a centralized one.
-
-\subsection{Centralized approaches}
-%{\bf Centralized approaches}
-
-Power efficient centralized schemes differ according to several
-criteria \cite{Cardei:2006:ECP:1646656.1646898}, such as the coverage
-objective (target coverage or area coverage), the node deployment
-method (random or deterministic) and the heterogeneity of sensor nodes
-(common sensing range, common battery lifetime). The major approach is
-to divide/organize the sensors into a suitable number of set covers
-where each set completely covers an interest region and to activate
-these set covers successively.
-
-The first algorithms proposed in the literature consider that the cover
-sets are disjoint: a sensor node appears in exactly one of the
-generated cover sets. For instance, Slijepcevic and Potkonjak
-\cite{Slijepcevic01powerefficient} propose an algorithm, which
-allocates sensor nodes in mutually independent sets to monitor an area
-divided into several fields. Their algorithm builds a cover set by
-including in priority the sensor nodes, which cover critical fields,
-that is to say fields that are covered by the smallest number of
-sensors. The time complexity of their heuristic is $O(n^2)$ where $n$
-is the number of sensors. In~\cite{cardei02}, a graph coloring
-technique is described to achieve energy savings by organizing the sensor nodes
-into a maximum number of disjoint dominating sets, which are activated
-successively. The dominating sets do not guarantee the coverage of the
-whole region of interest. Abrams et
-al.~\cite{Abrams:2004:SKA:984622.984684} design three approximation
-algorithms for a variation of the set k-cover problem, where the
-objective is to partition the sensors into covers such that the number
-of covers that includes an area, summed over all areas, is maximized.
-Their work builds upon previous work
-in~\cite{Slijepcevic01powerefficient} and the generated cover sets do
-not provide complete coverage of the monitoring zone.
-
-%examine the target coverage problem by disjoint cover sets but relax the requirement that every cover set monitor all the targets and try to maximize the number of times the targets are covered by the partition. They propose various algorithms and establish approximation ratio.
-
-In~\cite{Cardei:2005:IWS:1160086.1160098}, the authors propose a
-heuristic to compute the disjoint set covers (DSC). In order to
-compute the maximum number of covers, they first transform DSC into a
-maximum-flow problem, which is then formulated as a mixed integer
-programming problem (MIP). Based on the solution of the MIP, they
-design a heuristic to compute the final number of covers. The results
-show a slight performance improvement in terms of the number of
-produced DSC in comparison to~\cite{Slijepcevic01powerefficient}, but
-it incurs higher execution time due to the complexity of the mixed
-integer programming solving. %Cardei and Du
-\cite{Cardei:2005:IWS:1160086.1160098} propose a method to efficiently
-compute the maximum number of disjoint set covers such that each set
-can monitor all targets. They first transform the problem into a
-maximum flow problem, which is formulated as a mixed integer
-programming (MIP). Then their heuristic uses the output of the MIP to
-compute disjoint set covers. Results show that this heuristic
-provides a number of set covers slightly larger compared to
-\cite{Slijepcevic01powerefficient} but with a larger execution time
-due to the complexity of the mixed integer programming resolution.
-Zorbas et al. \cite{Zorbas2007} present B\{GOP\}, a centralized
-coverage algorithm introducing sensor candidate categorization
-depending on their coverage status and the notion of critical target
-to call targets that are associated with a small number of
-sensors. The total running time of their heuristic is $0(m n^2)$ where
-$n$ is the number of sensors, and $m$ the number of targets. Compared
-to algorithm's results of Slijepcevic and Potkonjak
-\cite{Slijepcevic01powerefficient}, their heuristic produces more
-cover sets with a slight growth rate in execution time.
-%More recently Manju and Pujari\cite{Manju2011}
-
-In the case of non-disjoint algorithms \cite{Manju2011}, sensors may
-participate in more than one cover set. In some cases, this may
-prolong the lifetime of the network in comparison to the disjoint
-cover set algorithms, but designing algorithms for non-disjoint cover
-sets generally induces a higher order of complexity. Moreover, in
-case of a sensor's failure, non-disjoint scheduling policies are less
-resilient and less reliable because a sensor may be involved in more
-than one cover sets. For instance, Cardei et al.~\cite{cardei05bis}
-present a linear programming (LP) solution and a greedy approach to
-extend the sensor network lifetime by organizing the sensors into a
-maximal number of non-disjoint cover sets. Simulation results show
-that by allowing sensors to participate in multiple sets, the network
-lifetime increases compared with related
-work~\cite{Cardei:2005:IWS:1160086.1160098}. In~\cite{berman04}, the
-authors have formulated the lifetime problem and suggested another
-(LP) technique to solve this problem. A centralized solution based on the Garg-K\"{o}nemann
-algorithm~\cite{garg98}, provably near
-the optimal solution, is also proposed.
-
-\subsection{Our contribution}
-%{\bf Our contribution}
-
-There are three main questions, which should be addressed to build a
+decides its status (active/sleep) based on the perimeter coverage
+model, which proposed in \cite{Huang:2003:CPW:941350.941367}.
+Shibo et al.\cite{Shibo} studied the coverage problem, which is formulated as a minimum weight submodular set cover problem. To address this problem,
+ a distributed truncated greedy algorithm (DTGA) is proposed. They exploited from the
+temporal and spatialcorrelations among the data sensed by different sensor nodes and leverage
+prediction to extend the WSNs lifetime.
+Bang et al. \cite{Bang} proposed a coverage-aware clustering protocol(CACP), which used computation method for the optimal cluster size to minimize the average energy consumption rate per unit area. They defied in this protocol a cost metric that prefer the redundant sensors
+with higher power as best candidates for cluster heads and select the active sensors that cover the area of interest more efficiently.
+Zhixin et al. \cite{Zhixin} propose a Distributed Energy-
+Efficient Clustering with Improved Coverage(DEECIC) algorithm
+which aims at clustering with the least number of cluster
+heads to cover the whole network and assigning a unique ID
+to each node based on local information. In addition, this
+protocol periodically updates cluster heads according to the
+joint information of nodes $’ $residual energy and distribution.
+Although DEECIC does not require knowledge of a node's
+geographic location, it guarantees full coverage of the
+network. However, the protocol does not make any activity
+scheduling to set redundant sensors in passive mode in order
+to conserve energy. C. Liu and G. Cao \cite{Changlei} studied how to
+schedule sensor active time to maximize their coverage during a specified network lifetime. Their objective is to maximize the spatial-temporal coverage by scheduling sensors activity after they have been deployed. They proposed both centralized and distributed algorithms. The distributed parallel optimization protocol can ensure each sensor to converge to local optimality without conflict with each other. S. Misra et al. \cite{Misra} proposed a localized algorithm for coverage in sensor
+networks. The algorithm conserve the energy while ensuring the network coverage by activating the subset of sensors, with the minimum overlap area.The proposed method preserves
+the network connectivity by formation of the network backbone. L. Zhang et al. \cite{Zhang} presented a novel distributed clustering algorithm
+called Adaptive Energy Efficient Clustering (AEEC) to maximize network lifetime. In this study, they are introduced an optimization, which includes restricted global re-clustering,
+intra-cluster node sleeping scheduling and adaptive
+transmission range adjustment to conserve the energy, while connectivity and coverage is ensured. J. A. Torkestani \cite{Torkestani} proposed a learning automata-based energy-efficient coverage protocol
+ named as LAEEC to construct the degree-constrained connected dominating set (DCDS) in WSNs. He shows that the correct choice of the degree-constraint of DCDS balances the network load on the active nodes and leads to enhance the coverage and network lifetime.
+
+The main contribution of our approach addresses three main questions to build a
scheduling strategy. We give a brief answer to these three questions
to describe our approach before going into details in the subsequent
sections.
-\begin{itemize}
-\item {\bf How must the phases for information exchange, decision and
+%\begin{itemize}
+%\item
+{\bf How must the phases for information exchange, decision and
sensing be planned over time?} Our algorithm divides the time line
into a number of rounds. Each round contains 4 phases: Information
Exchange, Leader Election, Decision, and Sensing.
-\item {\bf What are the rules to decide which node has to be turned on
+%\item
+{\bf What are the rules to decide which node has to be turned on
or off?} Our algorithm tends to limit the overcoverage of points of
interest to avoid turning on too many sensors covering the same
areas at the same time, and tries to prevent undercoverage. The
decision is a good compromise between these two conflicting
objectives.
-\item {\bf Which node should make such a decision?} As mentioned in
+%\item
+{\bf Which node should make such a decision?} As mentioned in
\cite{pc10}, both centralized and distributed algorithms have their
own advantages and disadvantages. Centralized coverage algorithms
have the advantage of requiring very low processing power from the
the scheduling decision to all the sensors. When the network size
increases, the network is divided into many subregions and the
decision is made by a leader in each subregion.
-\end{itemize}
+%\end{itemize}
