{"title":"物理世界中的分布式计算","authors":"D. Culler","doi":"10.1109/ICDCS.2005.25","DOIUrl":null,"url":null,"abstract":"Summary form only given. Networks of intelligent sensors that are distributed through the physical world will revolutionize practices in the life sciences, civil engineering, manufacturing, security, agriculture, ubiquitous computing, and many other areas. They also present an opportunity and a need to explore distributed algorithms that are wedded to the noisy, localized, time varying physical world. Bandwidth, storage, and energy limitations make in-network processing essential - within the node and among collections of nodes. The algorithms should be resource efficient, but also deal with noise, uncertainty and dynamically changing connectivity. A broad research community has been exploring these issues in the context of TinyOS and the Berkeley motes. This talk will highlight novel distributed algorithms coming out of these efforts and discuss issues in making such networks robust and programmable","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"33 1","pages":"3"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed Computation in the Physical World\",\"authors\":\"D. Culler\",\"doi\":\"10.1109/ICDCS.2005.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. Networks of intelligent sensors that are distributed through the physical world will revolutionize practices in the life sciences, civil engineering, manufacturing, security, agriculture, ubiquitous computing, and many other areas. They also present an opportunity and a need to explore distributed algorithms that are wedded to the noisy, localized, time varying physical world. Bandwidth, storage, and energy limitations make in-network processing essential - within the node and among collections of nodes. The algorithms should be resource efficient, but also deal with noise, uncertainty and dynamically changing connectivity. A broad research community has been exploring these issues in the context of TinyOS and the Berkeley motes. This talk will highlight novel distributed algorithms coming out of these efforts and discuss issues in making such networks robust and programmable\",\"PeriodicalId\":6300,\"journal\":{\"name\":\"2012 IEEE 32nd International Conference on Distributed Computing Systems\",\"volume\":\"33 1\",\"pages\":\"3\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 32nd International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.2005.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 32nd International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2005.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Summary form only given. Networks of intelligent sensors that are distributed through the physical world will revolutionize practices in the life sciences, civil engineering, manufacturing, security, agriculture, ubiquitous computing, and many other areas. They also present an opportunity and a need to explore distributed algorithms that are wedded to the noisy, localized, time varying physical world. Bandwidth, storage, and energy limitations make in-network processing essential - within the node and among collections of nodes. The algorithms should be resource efficient, but also deal with noise, uncertainty and dynamically changing connectivity. A broad research community has been exploring these issues in the context of TinyOS and the Berkeley motes. This talk will highlight novel distributed algorithms coming out of these efforts and discuss issues in making such networks robust and programmable