{"title":"Relational Approach Towards Feasibility Performance for Routing Algorithms in Wireless Sensor Network","authors":"J. Nikodem","doi":"10.1109/DepCoS-RELCOMEX.2009.40","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.40","url":null,"abstract":"This paper presents an investigation into feasibility performance gains for routing protocols. Routing protocols are crucial for WSN activity because sensors are not capable to realise individually overall system tasks. Because of that, sensors need to have more or less tightly integrated cooperation, based on information exchange, between them. We propose relational approach, based on set theory, which considers three relations: subordination, tolerance and collision. Using these relations we perform initial organization, but there is no necessity to perform any reorganization during a network lifetime. The obtained results show that providing relatively high collision intensity quotient, nodes can avoid selectively malfunctioned nodes. On the other side, decreasing subordination intensity quotient inhibits error dissemination process.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126545481","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}
{"title":"Dataflow Approach to Testing Java Programs","authors":"I. Bluemke, Artur Rembiszewski","doi":"10.1109/DepCoS-RELCOMEX.2009.34","DOIUrl":"https://doi.org/10.1109/DepCoS-RELCOMEX.2009.34","url":null,"abstract":"Code based (“white box”) approach to testing can be divided into two main types: control flow coverage and data flow coverage methods. Dataflow testing was introduced for structural programming languages and later adopted for object languages. Among many tools supporting code based testing of object programs, only JaBUTi and DFC (Data Flow Coverage) support dataflow testing of Java programs. DFC is a tool implemented at the Institute of Computer Science Warsaw University of Technology as an Eclipse plug-in. The objective of this paper is to present dataflow coverage testing of Java programs supported by DFC. DFC finds all definition-uses pairs in tested unit and provides also the definition-uses graph for methods. After the execution of test information which def-uses pairs were covered is shown. An example of data flow testing of Java program is also presented.","PeriodicalId":185730,"journal":{"name":"2009 Fourth International Conference on Dependability of Computer Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127013238","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}