Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207357
F. M. A. Silva, Ulisses Telemaco Neto
Topology control is one of the main techniques that can be used to decrease energy spenditure in wireless sensor networks. Although it has been the subject of much research, less attention has been devoted to study the effects of overhearing on topology control, i.e., the effects of the cost implied by nodes hearing transmissions even if these transmissions were not intended to them. In this paper we describe a distributed (localized) algorithm for topology control in wireless sensor networks. Our approach differs from previous work mainly in the sense that it takes the effects of overhearing into consideration and that it might eliminate more communication links from a given connectivity graph, and thus possibly assign lower transmission power to some nodes. This is done by eliminating so-called k-redundant edges, instead of eliminating only tworedundant edges. We present the sketch of the proof of properties of the algorithm and simulation results.
{"title":"A topology control algorithm for wireless sensor networks that considers overhearing","authors":"F. M. A. Silva, Ulisses Telemaco Neto","doi":"10.1109/ISADS.2009.5207357","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207357","url":null,"abstract":"Topology control is one of the main techniques that can be used to decrease energy spenditure in wireless sensor networks. Although it has been the subject of much research, less attention has been devoted to study the effects of overhearing on topology control, i.e., the effects of the cost implied by nodes hearing transmissions even if these transmissions were not intended to them. In this paper we describe a distributed (localized) algorithm for topology control in wireless sensor networks. Our approach differs from previous work mainly in the sense that it takes the effects of overhearing into consideration and that it might eliminate more communication links from a given connectivity graph, and thus possibly assign lower transmission power to some nodes. This is done by eliminating so-called k-redundant edges, instead of eliminating only tworedundant edges. We present the sketch of the proof of properties of the algorithm and simulation results.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124199974","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207334
Taehee Kim, Hosung Park, Jeongcheol Lee, Min-Sook Jin, Sang-Ha Kim
In delay-tolerant wireless sensor networks, reporting data from a source node to a sink may be delayed to satisfy certain criterions, for example, high energy-efficiency, low algorithm complexity and so on. Sensed data in such networks accumulate on a sensor node during time delayed. It means that even a single failed node may cause a massive-data loss. This paper proposes a backup scheme to minimize data losses caused by failed nodes in wireless sensor networks using the delayed report. The proposed scheme can safely preserve data and consume less energy by backuping a single data to multiple nodes that exist in the one-hop distance from the source node. Multiple backup nodes do not only store and recover backup data but also distributedly report their backup data to the sink instead of the source node. As a result, the energy consumption for data report is not concentrated to the source node and is distributed to backup nodes. Such approach suggests the new potentiality of a backup scheme in error-scarce network.
{"title":"Distributed Backup Scheme for Wireless Sensor Networks Using Delayed Report","authors":"Taehee Kim, Hosung Park, Jeongcheol Lee, Min-Sook Jin, Sang-Ha Kim","doi":"10.1109/ISADS.2009.5207334","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207334","url":null,"abstract":"In delay-tolerant wireless sensor networks, reporting data from a source node to a sink may be delayed to satisfy certain criterions, for example, high energy-efficiency, low algorithm complexity and so on. Sensed data in such networks accumulate on a sensor node during time delayed. It means that even a single failed node may cause a massive-data loss. This paper proposes a backup scheme to minimize data losses caused by failed nodes in wireless sensor networks using the delayed report. The proposed scheme can safely preserve data and consume less energy by backuping a single data to multiple nodes that exist in the one-hop distance from the source node. Multiple backup nodes do not only store and recover backup data but also distributedly report their backup data to the sink instead of the source node. As a result, the energy consumption for data report is not concentrated to the source node and is distributed to backup nodes. Such approach suggests the new potentiality of a backup scheme in error-scarce network.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"119 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123570537","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207319
Vasilis Papadinas, Y. Stamatiou
The technological as well as software advances in microelectronics and embedded component design have led to the development of low cost, small-sized devices capable of forming wireless, ad-hoc networks and sensing a number of qualities of their environment, while performing computations that depend on the sensed qualities as well as information received by their peers. These sensor networks rely on the collective power of the separate devices as well as their computational and sensing capabilities to understand “global” environmental states through locally sampled information and local sensor interactions. Due to the locality of the sensor networks, that naturally arises due to the locality of their communications capabilities, a number of interesting connections exist between these networks and geometrical concepts and problems. In this paper we study two simple problems that pertain to the formation of low power and low interference communication patterns in fixed topology sensor networks. We study the problem of using multihop communication links instead of direct ones as well as the problem of forming a communication ring of sensor networks so as to reduce power consumption as well as interference from other nodes. Our focus is on the connection between sensor networks and geometrical concepts, rather than on practicality, so as to highlight their interrelationship.
{"title":"Geometric approaches for creating low power, low interference connectivity patterns in static, structureless sensor networks","authors":"Vasilis Papadinas, Y. Stamatiou","doi":"10.1109/ISADS.2009.5207319","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207319","url":null,"abstract":"The technological as well as software advances in microelectronics and embedded component design have led to the development of low cost, small-sized devices capable of forming wireless, ad-hoc networks and sensing a number of qualities of their environment, while performing computations that depend on the sensed qualities as well as information received by their peers. These sensor networks rely on the collective power of the separate devices as well as their computational and sensing capabilities to understand “global” environmental states through locally sampled information and local sensor interactions. Due to the locality of the sensor networks, that naturally arises due to the locality of their communications capabilities, a number of interesting connections exist between these networks and geometrical concepts and problems. In this paper we study two simple problems that pertain to the formation of low power and low interference communication patterns in fixed topology sensor networks. We study the problem of using multihop communication links instead of direct ones as well as the problem of forming a communication ring of sensor networks so as to reduce power consumption as well as interference from other nodes. Our focus is on the connection between sensor networks and geometrical concepts, rather than on practicality, so as to highlight their interrelationship.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131696311","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207356
Konstantinos Tsakalozos, V. Kriakov, A. Delis
Existing GRID infrastructures rely on explicit user instructions in order to replicate files for the purposes of resiliency. This human-intensive process is inefficient, error prone and, more importantly, makes file replication in GRIDs a cumbersome task. To address this problem, we introduce FlexFS – a fully automated file-system framework that seamlessly plugs into existing GRID structures providing automated file replication and transparent-to-user resilience. FlexFS breaks apart files into blocks and injects resilient information into these blocks through the use of Forward Erasure Correction codes. FlexFS employs a number of methods that facilitate the automated storage and efficient retrieval of the blocks in order to provide I/O throughput similar to that of local hard disks, all in the face of ever-changing utilization and availability of the GRID resources. Compared to currently available GRID replication schemes, FlexFS attains 15% to 230% higher throughput, both for reading and writing files.
{"title":"FlexFS: Transparent resilience for GRID storage resources","authors":"Konstantinos Tsakalozos, V. Kriakov, A. Delis","doi":"10.1109/ISADS.2009.5207356","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207356","url":null,"abstract":"Existing GRID infrastructures rely on explicit user instructions in order to replicate files for the purposes of resiliency. This human-intensive process is inefficient, error prone and, more importantly, makes file replication in GRIDs a cumbersome task. To address this problem, we introduce FlexFS – a fully automated file-system framework that seamlessly plugs into existing GRID structures providing automated file replication and transparent-to-user resilience. FlexFS breaks apart files into blocks and injects resilient information into these blocks through the use of Forward Erasure Correction codes. FlexFS employs a number of methods that facilitate the automated storage and efficient retrieval of the blocks in order to provide I/O throughput similar to that of local hard disks, all in the face of ever-changing utilization and availability of the GRID resources. Compared to currently available GRID replication schemes, FlexFS attains 15% to 230% higher throughput, both for reading and writing files.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132264573","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207381
K. Tsuji, E. Kamioka
In this paper, we propose a user's position and behavior estimation method using sensors, such as a GPS device, an acceleration sensor, and an ultrasonic sensor, to alert important information to the user at just the right time. For example, the information obtained by the acceleration sensor can be used to estimate the user's behaviors and the position on the rail track where the train is, and the data measured by the ultrasonic sensor tells the distance to the ceiling, that is to say, the user's location, such as indoor/outdoor, on the platform, in the station premise, on the train, and in the campus building, can be detected. The evaluation result based on the field experiment proves the effectiveness of the proposed method with the accuracy of more than 90%.
{"title":"Estimation of user's position and behavior based on measurements of sensor information","authors":"K. Tsuji, E. Kamioka","doi":"10.1109/ISADS.2009.5207381","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207381","url":null,"abstract":"In this paper, we propose a user's position and behavior estimation method using sensors, such as a GPS device, an acceleration sensor, and an ultrasonic sensor, to alert important information to the user at just the right time. For example, the information obtained by the acceleration sensor can be used to estimate the user's behaviors and the position on the rail track where the train is, and the data measured by the ultrasonic sensor tells the distance to the ceiling, that is to say, the user's location, such as indoor/outdoor, on the platform, in the station premise, on the train, and in the campus building, can be detected. The evaluation result based on the field experiment proves the effectiveness of the proposed method with the accuracy of more than 90%.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134418126","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207343
Min-Sook Jin, Euisin Lee, Sang-Ha Kim, Fucai Yu, Soochang Park
This paper addresses issues for tracking and monitoring continuous objects, such as poison gas, biochemical, and chemical liquid in wireless sensor networks. These continuous objects are quite different from the individual objects, such as people, animals, and vehicles in that they are continuously distributed across a region and usually occupy a large area. Accordingly, they are detected and sensed by many sensor nodes, and their sensing data are redundant and highly correlated. Hence, there needs any efficient scheme on collecting and aggregating locally their sensing data and generating the data report. The continuous objects also tend to diffuse, changes in shape, increases the size, even splits into multiple smaller continuous objects, or join together one continuous object. Accordingly, there also need any efficient scheme to manage efficiently the dynamic change of shape of the continuous objects. Therefore, we introduce Dynamic Rectangle Zone-based Collaboration Mechanism for detecting, tracking, and monitoring the continuous objects taking into account the dynamic change of their shape. The proposed mechanism constructs a dynamic rectangle zone included the area occupied by one continuous object. One center node in the zone collects and aggregates the sensing data from sensor nodes which detect the continuous object. The dynamic rectangle zone change newly according to dynamic change of the continuous object and the center node is also altered by another node to minimize the energy consumption for collecting the sensing data. Through simulation results, we also evaluate how environmental factors and control parameters affect the performance of the proposed mechanism.
{"title":"Localized mechanism for continuous objects tracking and monitoring in wireless sensor networks","authors":"Min-Sook Jin, Euisin Lee, Sang-Ha Kim, Fucai Yu, Soochang Park","doi":"10.1109/ISADS.2009.5207343","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207343","url":null,"abstract":"This paper addresses issues for tracking and monitoring continuous objects, such as poison gas, biochemical, and chemical liquid in wireless sensor networks. These continuous objects are quite different from the individual objects, such as people, animals, and vehicles in that they are continuously distributed across a region and usually occupy a large area. Accordingly, they are detected and sensed by many sensor nodes, and their sensing data are redundant and highly correlated. Hence, there needs any efficient scheme on collecting and aggregating locally their sensing data and generating the data report. The continuous objects also tend to diffuse, changes in shape, increases the size, even splits into multiple smaller continuous objects, or join together one continuous object. Accordingly, there also need any efficient scheme to manage efficiently the dynamic change of shape of the continuous objects. Therefore, we introduce Dynamic Rectangle Zone-based Collaboration Mechanism for detecting, tracking, and monitoring the continuous objects taking into account the dynamic change of their shape. The proposed mechanism constructs a dynamic rectangle zone included the area occupied by one continuous object. One center node in the zone collects and aggregates the sensing data from sensor nodes which detect the continuous object. The dynamic rectangle zone change newly according to dynamic change of the continuous object and the center node is also altered by another node to minimize the energy consumption for collecting the sensing data. Through simulation results, we also evaluate how environmental factors and control parameters affect the performance of the proposed mechanism.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122108790","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207370
Yongdong Tan, Q. Qian, K. Mori
During the past two decades, Autonomous Decentralized System (ADS) has resolved on-line extensibility, on-line maintenance and fault-tolerance of system, and realized dynamic extension of system in node level and module level. However, with the developing of research on ADS, autonomously expression of system function is needed for achieving evolutional ability in function level.
{"title":"Role Autonomous Decentralized System architecture towards system evolution","authors":"Yongdong Tan, Q. Qian, K. Mori","doi":"10.1109/ISADS.2009.5207370","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207370","url":null,"abstract":"During the past two decades, Autonomous Decentralized System (ADS) has resolved on-line extensibility, on-line maintenance and fault-tolerance of system, and realized dynamic extension of system in node level and module level. However, with the developing of research on ADS, autonomously expression of system function is needed for achieving evolutional ability in function level.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125968579","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207374
Y. Kakuda, T. Ohta, S. Inoue, Eitaro Kohno, Y. Akiyama
Recently, in Japan, crimes against children become atrocious and brutal. In some cases, children are attacked on the way to and back from school. Many technologies using ubiquitous networks have been developed to prevent crimes against children on their way to and back from school. Existing technologies, however, are not powerful to prevent crimes against children and helpful for parents since it is difficult to take information of children as a group. If the system can provide group information of children on the way to and back from school, it is easy for parents to know their safety level. This paper proposes a new technology for Children Tracking System based on mobile ad hoc networks and describes outline of Children Tracking System in Hiroshima City. The field experiments using the Children Tracking System have been performed and the effectiveness of the system is shown by data analysis for the experimental results.
{"title":"Performance improvement of Hiroshima City Children Tracking System by correction of wrong registrations on school routes","authors":"Y. Kakuda, T. Ohta, S. Inoue, Eitaro Kohno, Y. Akiyama","doi":"10.1109/ISADS.2009.5207374","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207374","url":null,"abstract":"Recently, in Japan, crimes against children become atrocious and brutal. In some cases, children are attacked on the way to and back from school. Many technologies using ubiquitous networks have been developed to prevent crimes against children on their way to and back from school. Existing technologies, however, are not powerful to prevent crimes against children and helpful for parents since it is difficult to take information of children as a group. If the system can provide group information of children on the way to and back from school, it is easy for parents to know their safety level. This paper proposes a new technology for Children Tracking System based on mobile ad hoc networks and describes outline of Children Tracking System in Hiroshima City. The field experiments using the Children Tracking System have been performed and the effectiveness of the system is shown by data analysis for the experimental results.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117214663","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207382
J. Funasaka
(Parallel downloading) is one of the most effective technologies which speed up downloading large files on the Internet. As ubiquitous networks will be realized in the near future, downloading large files quickly is also very important on various types of networks. However, if we use the parallel downloading method on dynamic networks, such as ad hoc networks, it will not work well because of high loss rate and delay. To address this issue, we adopt UDP as a transport layer protocol instead of TCP which guarantees perfect in-order delivery unnecessary for file downloading. In our previous paper, a prototype of the parallel downloading method using HTTP over UDP is developed, and it is confirmed that our method outperforms the traditional method which adopts TCP, especially when loss rate is high and delay is large. In this paper, the key feature of the parallel downloading method using HTTP/UDP is evaluated through simple theoretical estimation and some simulation experiments. As a result, it is confirmed that the large division number tends to yield short download time. The proposed method can be an attractive protocol to distribute large files on dynamic networks composed of wireless links.
并行下载是一种最有效的技术，可以加快互联网上大文件的下载速度。随着无处不在的网络将在不久的将来实现，在各种类型的网络上快速下载大文件也非常重要。然而，如果在动态网络(如ad hoc网络)上使用并行下载方法，由于高丢失率和延迟，将无法很好地工作。为了解决这个问题，我们采用UDP作为传输层协议，而不是TCP，它保证了文件下载不必要的完美有序传输。在我们之前的文章中，我们开发了一种基于HTTP over UDP的并行下载方法的原型，并证实了我们的方法优于采用TCP的传统方法，特别是在丢包率高、延迟大的情况下。本文通过简单的理论估计和一些仿真实验，对基于HTTP/UDP的并行下载方法的主要特点进行了评估。结果表明，除法数越大，下载时间越短。该方法是一种在由无线链路组成的动态网络上分发大型文件的有吸引力的协议。
{"title":"Evaluation on parallel downloading method using HTTP over UDP","authors":"J. Funasaka","doi":"10.1109/ISADS.2009.5207382","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207382","url":null,"abstract":"(Parallel downloading) is one of the most effective technologies which speed up downloading large files on the Internet. As ubiquitous networks will be realized in the near future, downloading large files quickly is also very important on various types of networks. However, if we use the parallel downloading method on dynamic networks, such as ad hoc networks, it will not work well because of high loss rate and delay. To address this issue, we adopt UDP as a transport layer protocol instead of TCP which guarantees perfect in-order delivery unnecessary for file downloading. In our previous paper, a prototype of the parallel downloading method using HTTP over UDP is developed, and it is confirmed that our method outperforms the traditional method which adopts TCP, especially when loss rate is high and delay is large. In this paper, the key feature of the parallel downloading method using HTTP/UDP is evaluated through simple theoretical estimation and some simulation experiments. As a result, it is confirmed that the large division number tends to yield short download time. The proposed method can be an attractive protocol to distribute large files on dynamic networks composed of wireless links.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123332239","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207386
Long Zheng, Jian Li, Jing-lun Zhou, Yongqiang Zhang
Recently, computation, communication and control are deeply and pervasively embedded into physical and engineered components of network System, to advance entire networked system performance and dependability. In such systems, the growing complexity of network structure result in need of increasing system reliability. Network reliability modeling and analysis need not only capture the complex dynamic process of network systems, but also need the facilities for applying, understanding and computing. The objective of this paper is to develop a suitable modeling and analysis framework to study the ad-hoc network reliability. Using the mutual transformations of reliability functions between the time-domain and the frequency-domain, we adopt frequency-domain analysis approach to model network reliability. The advantages of the proposed approach over the traditional time-domain approaches include capability to capture higher order moments of system characteristics, scalability to analyze reliability of complex network systems, efficiency in calculation and practicability in computer simulation, etc. Finally, numerical experiment results show the feasibility and efficacy of this approach.
{"title":"Frequency-domain modeling and analysis of network reliability","authors":"Long Zheng, Jian Li, Jing-lun Zhou, Yongqiang Zhang","doi":"10.1109/ISADS.2009.5207386","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207386","url":null,"abstract":"Recently, computation, communication and control are deeply and pervasively embedded into physical and engineered components of network System, to advance entire networked system performance and dependability. In such systems, the growing complexity of network structure result in need of increasing system reliability. Network reliability modeling and analysis need not only capture the complex dynamic process of network systems, but also need the facilities for applying, understanding and computing. The objective of this paper is to develop a suitable modeling and analysis framework to study the ad-hoc network reliability. Using the mutual transformations of reliability functions between the time-domain and the frequency-domain, we adopt frequency-domain analysis approach to model network reliability. The advantages of the proposed approach over the traditional time-domain approaches include capability to capture higher order moments of system characteristics, scalability to analyze reliability of complex network systems, efficiency in calculation and practicability in computer simulation, etc. Finally, numerical experiment results show the feasibility and efficacy of this approach.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132063369","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
扫码关注我们
求助内容：
应助结果提醒方式：