Localized Sensor Area Coverage with Low Communication Overhead Export

@article{citeulike:3154668, abstract = {We propose several localized sensor area coverage protocols for heterogeneous sensors, each with arbitrary sensing and transmission radii. The approach has a very small communication overhead since prior knowledge about neighbor existence is not required. Each node selects a random time out and listens to messages sent by other nodes before the time out expires. Sensor nodes whose sensing area is not fully covered (or fully covered but with a disconnected set of active sensors) when the deadline expires decide to remain active for the considered round and transmit an activity message announcing it. There are four variants in our approach, depending on whether or not withdrawal and retreat messages are transmitted. Covered nodes decide to sleep, with or without transmitting a withdrawal message to inform neighbors about the status. After hearing from more neighbors, active sensors may observe that they became covered and may decide to alter their original decision and transmit a retreat message. Our simulations show a largely reduced message overhead while preserving coverage quality for the ideal MAC/physical layer. Compared to an existing method (based on hello messages followed by retreat ones and where excessive message loss contributed to excessive coverage holes), our approach has shown robustness in a model with collisions and/or a realistic physical layer.}, author = {Gallais, A. and Carle, J. and Simplot-Ryl, D. and Stojmenovic, I.}, booktitle = {Mobile Computing, IEEE Transactions on}, citeulike-article-id = {3154668}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/TMC.2007.70793}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4475871}, doi = {10.1109/TMC.2007.70793}, journal = {Mobile Computing, IEEE Transactions on}, keywords = {anisotropic-network, coverage}, number = {5}, pages = {661--672}, posted-at = {2008-08-26 07:37:09}, priority = {2}, title = {Localized Sensor Area Coverage with Low Communication Overhead}, url = {http://dx.doi.org/10.1109/TMC.2007.70793}, volume = {7}, year = {2008} }

TY - JOUR ID - citeulike:3154668 L3 - citeulike-article-id:3154668 N2 - We propose several localized sensor area coverage protocols for heterogeneous sensors, each with arbitrary sensing and transmission radii. The approach has a very small communication overhead since prior knowledge about neighbor existence is not required. Each node selects a random time out and listens to messages sent by other nodes before the time out expires. Sensor nodes whose sensing area is not fully covered (or fully covered but with a disconnected set of active sensors) when the deadline expires decide to remain active for the considered round and transmit an activity message announcing it. There are four variants in our approach, depending on whether or not withdrawal and retreat messages are transmitted. Covered nodes decide to sleep, with or without transmitting a withdrawal message to inform neighbors about the status. After hearing from more neighbors, active sensors may observe that they became covered and may decide to alter their original decision and transmit a retreat message. Our simulations show a largely reduced message overhead while preserving coverage quality for the ideal MAC/physical layer. Compared to an existing method (based on hello messages followed by retreat ones and where excessive message loss contributed to excessive coverage holes), our approach has shown robustness in a model with collisions and/or a realistic physical layer. IS - 5 JF - Mobile Computing, IEEE Transactions on EP - 672 TI - Localized Sensor Area Coverage with Low Communication Overhead VL - 7 T2 - Mobile Computing, IEEE Transactions on SP - 661 KW - anisotropic-network KW - coverage AU - Gallais, A AU - Carle, J AU - Simplot-Ryl, D AU - Stojmenovic, I PY - 2008/// UR - http://dx.doi.org/10.1109/TMC.2007.70793 ER -