Cyclic network automata and cohomological waves
Authors: 
Yiqing Cai, Robert GhristAuthors Info & Claims
Yiqing Cai, Robert GhristAuthors Info & ClaimsPages 215 - 224
Abstract
Following Baryshnikov-Coffman-Kwak, we use cyclic network automata (CNA) to generate a decentralized protocol for dynamic coverage problems in a sensor network, with only a small fraction of sensors awake at every moment. This paper gives a rigorous analysis of CNA and shows that waves of awake-state nodes automatically solve pusuit/evasion-type problems without centralized coordination. As a corollary of this work, we unearth some interesting topological interpretations of features previously observed in cyclic cellular automata (CCA). By considering CCA over networks and completing to simplicial complexes, we induce dynamics on the higher-dimensional complex. In this setting, waves are seen to be generated by topological defects with a nontrivial degree (or winding number). The simplicial complex has the topological type of the underlying map of the workspace (a subset of the plane), and the resulting waves can be classified cohomologically. This allows one to 'program' pulses in the sensor network according to cohomology class. We give a realization theorem for such pulse waves.
References
[1]
Y. Baryshnikov, E. Coffman, and K. Kwak, "High performance sleep-wake sensor systems based on cyclic cellular automata," in phInformation Processing in Sensor Networks., april 2008, pp. 517--526.
[2]
J. Yick, B. Mukherjee, and D. Ghosal, "Wireless sensor network survey," phComput. Netw., vol. 52, no. 12, pp. 2292--2330, Aug. 2008.
[3]
I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," phComput. Netw., vol. 38, no. 4, pp. 393--422, Mar. 2002.
[4]
A. Kr�ller, S. P. Fekete, D. Pfisterer, and S. Fischer, "Deterministic boundary recognition and topology extraction for large sensor networks," in phProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm.\hskip 1em plus 0.5em minus 0.4em\relax ACM, 2006, pp. 1000--1009.
[5]
S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, "Coverage problems in wireless ad-hoc sensor networks," in phIEEE INFOCOM, vol. 3, 2001, pp. 1380 --1387 vol.3.
[6]
C.-F. Huang and Y.-C. Tseng, "The coverage problem in a wireless sensor network," phMob. Netw. Appl., vol. 10, no. 4, pp. 519--528, Aug. 2005.
[7]
V. de Silva and R. Ghrist, "Coverage in sensor networks via persistent homology," phAlgebraic and Geometric Topology, vol. 7, pp. 339--358, 2007.
[8]
X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated coverage and connectivity configuration in wireless sensor networks," in phSenSys.\hskip 1em plus 0.5em minus 0.4em\relax ACM, 2003, pp. 28--39.
[9]
R. Durrett and J. E. Steif, "Some rigorous results for the greenberg-hastings model," phJournal of Theoretical Probability, vol. 4, pp. 669--690, 1991.
[10]
R. Fisch, J. Gravner, and D. Griffeath, "Cyclic cellular automata in two dimensions," in phSpatial Stochastic Processes, ser. Progress in Probability, K. S. Alexander and J. C. Watkins, Eds., 1991, vol. 19, pp. 171--185.
[11]
----, "Threshold-range scaling of excitable cellular automata," phStatistics and Computing, vol. 1, no. 1, pp. 23--39, 1991.
[12]
----, "Metastability in the greenberg-hastings model," phThe Annals of Applied Probability, vol. 3, no. 4, pp. pp. 935--967, 1993.
[13]
R. Durrett and D. Griffeath, "Asymptotic behavior of excitable cellular automata," phExperimental Math, vol. 2, pp. 1--3, 1993.
[14]
M. Matamala and E. Goles, "Dynamic behavior of cyclic automata networks," phDiscrete Applied Mathematics, vol. 77, no. 2, pp. 161 -- 184, 1997.
[15]
F. Ye, G. Zhong, J. Cheng, S. Lu, and L. Zhang, "Peas: A robust energy conserving protocol for long-lived sensor networks," in phICDCS ’03.\hskip 1em plus 0.5em minus 0.4em\relax IEEE Computer Society, 2003, pp. 28--37.
[16]
G. Nan, G. Shi, Z. Mao, and M. Li, "Cdsws: coverage-guaranteed distributed sleep/wake scheduling for wireless sensor networks," phEURASIP Journal on Wireless Communications and Networking, vol. 2012, no. 1, p. 44, 2012.
[17]
Y. Cai, phCyclic cellular automata and cohomological waves.\hskip 1em plus 0.5em minus 0.4em\relax Ph.D., University of Pennsylvania, 2013.
[18]
J. M. Greenberg and S. P. Hastings, "Spatial patterns for discrete models of diffusion in excitable media," phSIAM Journal on Applied Mathematics, vol. 34, no. 3, pp. pp. 515--523, 1978.
[19]
J. M. Greenberg, "\BIBforeignlanguageEnglishPeriodic solutions to reaction-diffusion equations," ph\BIBforeignlanguageEnglishSIAM Journal on Applied Mathematics, vol. 30, no. 2, pp. pp. 199--205, 1976.
[20]
A. Hatcher, phAlgebraic Topology.\hskip 1em plus 0.5em minus 0.4em\relax Cambridge, 2002.
[21]
E. Chambers, V. de Silva, J. Erickson, and R. Ghrist, "Vietoris rips complexes of planar point sets," phDiscrete and Computational Geometry, vol. 44, pp. 75--90, 2010.
[22]
P. Niyogi, S. Smale, and S. Weinberger, "Finding the homology of submanifolds with high confidence from random samples," phDiscrete Comput. Geom., vol. 39, no. 1, pp. 419--441, Mar. 2008.
[23]
J. Zhao and R. Govindan, "Understanding packet delivery performance in dense wireless sensor networks," in phSenSys.\hskip 1em plus 0.5em minus 0.4em\relax ACM, 2003, pp. 1--13.
Index Terms
- Cyclic network automata and cohomological waves
Recommendations
Cyclic network automata for indoor sensor network
IPSN '12: Proceedings of the 11th international conference on Information Processing in Sensor NetworksFollowing Baryshnikov-Coffman-Kwak [1], we use network cyclic cellular automata to generate a decentralized protocol, with only a small fraction of sensors awake. The work here shows that waves of awake-state nodes turn corners and automatically solve ...
Virtual cyclic cellular automata, finite group actions and recursive properties
Highlights- The notion of virtual cyclic cellular automata VCCA is introduced.
- The inverse of a CCA is shown to be a VCCA and equal to an invariant CCA under group action.
- A new REN algorithm and a recursive Wolfram number are introduced.
AbstractThe aim of these notes is three fold. First we introduce virtual cyclic cellular automata and show that the inverse of a reversible ( 2 R + 1 )-cyclic cellular automaton with periodic boundary conditions is a virtual cyclic cellular automaton. ...
A closed formula for the inverse of a reversible cellular automaton with ( 2 R + 1 )-cyclic rule
AbstractReversibility of cellular automata (CA) has been an extensively studied problem from both a theoretical and a practical point of view. It is known when a ( 2 R + 1 )-cyclic cellular automaton with periodic boundary conditions (p.b.c.) ...
Comments
Information & Contributors
Information
Published In
Sponsors
- IEEE
- SIGBED: ACM Special Interest Group on Embedded Systems
- IEEE-CS\DATC: IEEE Computer Society
Publisher
IEEE Press
Publication History
Published: 15 April 2014
Check for updates
Author Tags
Qualifiers
- Research-article
Acceptance Rates
IPSN '14 Paper Acceptance Rate 23 of 111 submissions, 21%;
Overall Acceptance Rate 143 of 593 submissions, 24%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 92Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in