Pub Date : 2012-10-18DOI: 10.1109/IPSN.2014.6846754
Yiqing Cai, R. Ghrist
Following Baryshnikov-Coffman-Kwak [2], 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.
{"title":"Cyclic network automata and cohomological waves","authors":"Yiqing Cai, R. Ghrist","doi":"10.1109/IPSN.2014.6846754","DOIUrl":"https://doi.org/10.1109/IPSN.2014.6846754","url":null,"abstract":"Following Baryshnikov-Coffman-Kwak [2], 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.","PeriodicalId":297218,"journal":{"name":"IPSN-14 Proceedings of the 13th International Symposium on Information Processing in Sensor Networks","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128954364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ipsn.2014.6846776
Ambuj Varshney, T. Voigt, L. Mottola
Bulk data transmission is an important traffic pattern of many sensor network applications. These applications deliver large amounts of sensed data to a sink node for further processing. Most of the existing bulk data transmission protocols use a single flow of communication. This is inefficient as the radio at the source node is transmitting and the sink node is receiving packets for only half of the duration of the burst. We show in this paper that reduced contention because of directional communication enables us to construct node disjoint paths from the source to the sink node using only one wireless channel. This allows us to forward subsequent packets in the burst on the disjoint paths which maximises the radio transmit and receive time at the source and the sink node respectively. We demonstrate that this doubles the sink throughput as compared to a single flow of communication.
{"title":"Poster Abstract : Directional transmissions and receptions for burst forwarding using disjoint paths","authors":"Ambuj Varshney, T. Voigt, L. Mottola","doi":"10.1109/ipsn.2014.6846776","DOIUrl":"https://doi.org/10.1109/ipsn.2014.6846776","url":null,"abstract":"Bulk data transmission is an important traffic pattern of many sensor network applications. These applications deliver large amounts of sensed data to a sink node for further processing. Most of the existing bulk data transmission protocols use a single flow of communication. This is inefficient as the radio at the source node is transmitting and the sink node is receiving packets for only half of the duration of the burst. We show in this paper that reduced contention because of directional communication enables us to construct node disjoint paths from the source to the sink node using only one wireless channel. This allows us to forward subsequent packets in the burst on the disjoint paths which maximises the radio transmit and receive time at the source and the sink node respectively. We demonstrate that this doubles the sink throughput as compared to a single flow of communication.","PeriodicalId":297218,"journal":{"name":"IPSN-14 Proceedings of the 13th International Symposium on Information Processing in Sensor Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117321239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：