Pub Date : 2005-05-20DOI: 10.1109/WISES.2005.1438712
Matthias Witt, V. Turau
This paper introduces BGR, a new beacon-less geographic routing algorithm for wireless sensor networks. Data packets are forwarded toward the destination, and nodes, which hear the packet compete for becoming the next hop. A recovery strategy is provided for the case of empty forwarding areas. The main innovation is a strategy to avoid simultaneous forwarding situations, which would otherwise cause packet failures. It is confirmed by simulation that BGR sends very few packets and is reliable infields with sufficiently high node density. Furthermore, BGR is compared with similar algorithms after developing a general framework for beacon-less algorithms with an integrative terminology. Different kinds of forwarding areas are compared.
{"title":"BGR: blind geographic routing for sensor networks","authors":"Matthias Witt, V. Turau","doi":"10.1109/WISES.2005.1438712","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438712","url":null,"abstract":"This paper introduces BGR, a new beacon-less geographic routing algorithm for wireless sensor networks. Data packets are forwarded toward the destination, and nodes, which hear the packet compete for becoming the next hop. A recovery strategy is provided for the case of empty forwarding areas. The main innovation is a strategy to avoid simultaneous forwarding situations, which would otherwise cause packet failures. It is confirmed by simulation that BGR sends very few packets and is reliable infields with sufficiently high node density. Furthermore, BGR is compared with similar algorithms after developing a general framework for beacon-less algorithms with an integrative terminology. Different kinds of forwarding areas are compared.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125051157","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438719
J. Cinkelj, M. Mihelj, M. Munih
In the paper we present two possible approaches for a soft real-time acquisition under Windows XP. The first approach is based on a high priority thread and the second one on a local advanced programmable interrupt controller (LAPIC). Robustness was evaluated on unloaded and loaded system. In order to assess real-time system performance we analyzed sampling time histograms and maximum timing error. Both approaches perform satisfactory on unloaded system. On loaded system LAPIC approach shows better robustness. Although sampling time histograms show bigger errors on loaded systems than on unloaded systems, maximum timing error does not change significantly for the LAPIC approach.
{"title":"Soft real-time acquisition in Windows XP","authors":"J. Cinkelj, M. Mihelj, M. Munih","doi":"10.1109/WISES.2005.1438719","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438719","url":null,"abstract":"In the paper we present two possible approaches for a soft real-time acquisition under Windows XP. The first approach is based on a high priority thread and the second one on a local advanced programmable interrupt controller (LAPIC). Robustness was evaluated on unloaded and loaded system. In order to assess real-time system performance we analyzed sampling time histograms and maximum timing error. Both approaches perform satisfactory on unloaded system. On loaded system LAPIC approach shows better robustness. Although sampling time histograms show bigger errors on loaded systems than on unloaded systems, maximum timing error does not change significantly for the LAPIC approach.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123922712","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438724
Marcus Venzke, C. Weyer, V. Turau
The paper compares two approaches for developing Web service interfaces for the vertical integration of TTP/A fieldbus systems. High-level abstractions are provided by application specific interfaces, generated from metadata describing fieldbus systems. In contrast standardised interfaces such as OPC XML DA only allow lower levels of abstractions. But these enable accessing the fieldbus system from a broad range of standard clients, while high-level abstractions reflecting the application programmer's view on the system facilitate the development of more specific clients and workflows.
本文比较了两种用于TTP/A现场总线系统垂直集成的Web服务接口的开发方法。高级抽象由特定于应用程序的接口提供，这些接口是从描述现场总线系统的元数据生成的。相比之下，标准化接口(如OPC XML DA)只允许低级别的抽象。但是，这些允许从广泛的标准客户端访问现场总线系统，而反映应用程序程序员对系统的看法的高级抽象促进了更具体的客户端和工作流的开发。
{"title":"Application specific vs. standard Web service interfaces for the vertical integration of fieldbus systems","authors":"Marcus Venzke, C. Weyer, V. Turau","doi":"10.1109/WISES.2005.1438724","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438724","url":null,"abstract":"The paper compares two approaches for developing Web service interfaces for the vertical integration of TTP/A fieldbus systems. High-level abstractions are provided by application specific interfaces, generated from metadata describing fieldbus systems. In contrast standardised interfaces such as OPC XML DA only allow lower levels of abstractions. But these enable accessing the fieldbus system from a broad range of standard clients, while high-level abstractions reflecting the application programmer's view on the system facilitate the development of more specific clients and workflows.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133849507","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438713
Peter Tawdross, A. König
The location detection is intensively investigated topic as it enables environment-man interaction, specially for the ambient intelligence applications (e.g. giving the user hints or warnings according to his location). In our work, which is motivated by the potential of implementing our prototype by MEMS technology, we got inspiration from the polarization of vision, which is found in some insects for location detection. The polarization vision in some insects enables them to navigate by the so-called polar compass, which is based on the polarization pattern of the sky. In our work, first we investigate a polar compass, then use this polar compass to determine the location, where more than one source is available by measuring the angles of all of the sources. Our experimental result proves the feasibility of our low cost, compact and integratable prototype to measure the angular displacement.
{"title":"Feasibility study of a novel bio-inspired location sensor concept for indoor location based services in ambient intelligence applications","authors":"Peter Tawdross, A. König","doi":"10.1109/WISES.2005.1438713","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438713","url":null,"abstract":"The location detection is intensively investigated topic as it enables environment-man interaction, specially for the ambient intelligence applications (e.g. giving the user hints or warnings according to his location). In our work, which is motivated by the potential of implementing our prototype by MEMS technology, we got inspiration from the polarization of vision, which is found in some insects for location detection. The polarization vision in some insects enables them to navigate by the so-called polar compass, which is based on the polarization pattern of the sky. In our work, first we investigate a polar compass, then use this polar compass to determine the location, where more than one source is available by measuring the angles of all of the sources. Our experimental result proves the feasibility of our low cost, compact and integratable prototype to measure the angular displacement.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115585871","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438720
Klaus Danne, M. Platzner
Todays reconfigurable hardware devices, such as FPGAs, have high densities and allow for the execution of several hardware tasks in parallel. This paper deals with scheduling periodic real-time tasks to such an architecture, a problem which has not been considered before. We formalize the real-time scheduling problem and propose two preemptive scheduling algorithms. The first is an adaption of the well-known earliest deadline first (EDF) technique to the FPGA execution model. The algorithm reveals good scheduling performance; task sets with system utilizations of up to 85% can be feasibly scheduled. However, the EDF approach is practical only for a small number of tasks, since there is no efficient schedulability test. The second algorithm uses the concept of servers that reserve area and execution time for other tasks. Tasks are successively merged into servers, which are then scheduled sequentially. While this method can only feasibly schedule task sets with a system utilization of up to some 50%, it is applicable to large tasks sets as the schedulability test runs in polynomial time. Equally important, the method requires only a small number of FPGA configurations which directly translates into reduced memory requirements.
{"title":"Periodic real-time scheduling for FPGA computers","authors":"Klaus Danne, M. Platzner","doi":"10.1109/WISES.2005.1438720","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438720","url":null,"abstract":"Todays reconfigurable hardware devices, such as FPGAs, have high densities and allow for the execution of several hardware tasks in parallel. This paper deals with scheduling periodic real-time tasks to such an architecture, a problem which has not been considered before. We formalize the real-time scheduling problem and propose two preemptive scheduling algorithms. The first is an adaption of the well-known earliest deadline first (EDF) technique to the FPGA execution model. The algorithm reveals good scheduling performance; task sets with system utilizations of up to 85% can be feasibly scheduled. However, the EDF approach is practical only for a small number of tasks, since there is no efficient schedulability test. The second algorithm uses the concept of servers that reserve area and execution time for other tasks. Tasks are successively merged into servers, which are then scheduled sequentially. While this method can only feasibly schedule task sets with a system utilization of up to some 50%, it is applicable to large tasks sets as the schedulability test runs in polynomial time. Equally important, the method requires only a small number of FPGA configurations which directly translates into reduced memory requirements.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127233488","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438718
T. Sivanthi, U. Killat, K. Angrishi
A system which provides a set of control functions on time is referred as a real-time control system (RTCS). In a traditional RTCS, a set of tasks running in a central controller provide the required system control. The recent technological advances have made it possible to embed controllers with sufficient computing power directly in the end control devices. These devices also have a communication interface by means of which they can communicate with the other devices via a broadcast bus. These devices are referred to as intelligent nodes. A network of such intelligent nodes can be used to perform the same control functions as that of a centralized RTCS in a distributed manner. This paper discusses an application of a formal approach to distribute the control of a centralized RTCS over a set of intelligent nodes with an example.
{"title":"An application of a formal approach for distribution of real-time control","authors":"T. Sivanthi, U. Killat, K. Angrishi","doi":"10.1109/WISES.2005.1438718","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438718","url":null,"abstract":"A system which provides a set of control functions on time is referred as a real-time control system (RTCS). In a traditional RTCS, a set of tasks running in a central controller provide the required system control. The recent technological advances have made it possible to embed controllers with sufficient computing power directly in the end control devices. These devices also have a communication interface by means of which they can communicate with the other devices via a broadcast bus. These devices are referred to as intelligent nodes. A network of such intelligent nodes can be used to perform the same control functions as that of a centralized RTCS in a distributed manner. This paper discusses an application of a formal approach to distribute the control of a centralized RTCS over a set of intelligent nodes with an example.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133890225","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438714
D. Schroeder
The paper addresses the problem of power consumption of sensor nodes in a wireless network. An integrated low-power analog/digital converter (ADC) is presented that is particularly suited for wireless sensor applications. The converter makes use of information theoretic redundancy in the input signal for reducing the conversion workload and performing data compression on-the-fly during conversion (entropy-coding A/D converter). Thus, energy is saved both in signal conversion and transmission. Experimental results from a prototype chip are presented. The converter is especially suitable for sensor networks that maintain a global data model. This is further illustrated on an exemplary scenario of distributed wave detection. It is shown that sensor signal detection and acquisition in this type of applications can be carried out very efficiently with entropy-coding converters used in the sensor nodes.
{"title":"Adaptive low-power analog/digital converters for wireless sensor networks","authors":"D. Schroeder","doi":"10.1109/WISES.2005.1438714","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438714","url":null,"abstract":"The paper addresses the problem of power consumption of sensor nodes in a wireless network. An integrated low-power analog/digital converter (ADC) is presented that is particularly suited for wireless sensor applications. The converter makes use of information theoretic redundancy in the input signal for reducing the conversion workload and performing data compression on-the-fly during conversion (entropy-coding A/D converter). Thus, energy is saved both in signal conversion and transmission. Experimental results from a prototype chip are presented. The converter is especially suitable for sensor networks that maintain a global data model. This is further illustrated on an exemplary scenario of distributed wave detection. It is shown that sensor signal detection and acquisition in this type of applications can be carried out very efficiently with entropy-coding converters used in the sensor nodes.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132973487","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438708
M. Bramberger, B. Rinner, H. Schwabach
This paper presents a dynamic task allocation method for smart cameras targeting traffic surveillance. Since our target platforms are distributed embedded systems with limited resources, the task allocation has to be light-weight, flexible as well as scalable and has to support real-time requirements. Therefore, surveillance tasks are not allocated to smart cameras directly, but to groups of smart cameras, so called surveillance clusters. We formulate the allocation problem as a distributed constraint satisfaction problem (DCSP) and present a distributed method for finding feasible allocations. Finally, a cost function is used to determine the optimal allocation of tasks. We have realized this dynamic task allocation using heterogeneous, mobile agents, which utilize their agencies and our embedded software framework to find the most appropriate mapping of tasks in a distributed manner. The dynamic task allocation has been implemented on our smart cameras (SmartCam), which are comprised of a network processor and several digital signal processors (DSPs) and provide a complex software framework.
{"title":"A mobile agent-based system for dynamic task allocation in clusters of embedded smart cameras","authors":"M. Bramberger, B. Rinner, H. Schwabach","doi":"10.1109/WISES.2005.1438708","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438708","url":null,"abstract":"This paper presents a dynamic task allocation method for smart cameras targeting traffic surveillance. Since our target platforms are distributed embedded systems with limited resources, the task allocation has to be light-weight, flexible as well as scalable and has to support real-time requirements. Therefore, surveillance tasks are not allocated to smart cameras directly, but to groups of smart cameras, so called surveillance clusters. We formulate the allocation problem as a distributed constraint satisfaction problem (DCSP) and present a distributed method for finding feasible allocations. Finally, a cost function is used to determine the optimal allocation of tasks. We have realized this dynamic task allocation using heterogeneous, mobile agents, which utilize their agencies and our embedded software framework to find the most appropriate mapping of tasks in a distributed manner. The dynamic task allocation has been implemented on our smart cameras (SmartCam), which are comprised of a network processor and several digital signal processors (DSPs) and provide a complex software framework.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127769863","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438721
H. O. Mota, F. Vasconcelos
This paper describes a system able to acquire, process and eliminate noise in continuous streams of data in real-time. The signal processing algorithms were based on the discrete wavelet transform and employ a new approach to deal with border problems, allowing to process the data continuously. The system was implemented using a DSP coupled to a digitizer through its external memory bus to guarantee deterministic behavior while maintaining some degree of flexibility in its configuration. The achieved performance and potential applications are discussed at the end of the text.
{"title":"Data processing system for denoising of signals in real-time using the wavelet transform","authors":"H. O. Mota, F. Vasconcelos","doi":"10.1109/WISES.2005.1438721","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438721","url":null,"abstract":"This paper describes a system able to acquire, process and eliminate noise in continuous streams of data in real-time. The signal processing algorithms were based on the discrete wavelet transform and employ a new approach to deal with border problems, allowing to process the data continuously. The system was implemented using a DSP coupled to a digitizer through its external memory bus to guarantee deterministic behavior while maintaining some degree of flexibility in its configuration. The achieved performance and potential applications are discussed at the end of the text.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130117612","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 : 2005-05-20DOI: 10.1109/WISES.2005.1438726
P. Owotoki, F. Mayer-Lindenberg
The peculiarities of the aircraft monitoring and maintenance domain are described and shortcomings of the current monitoring methodology are revealed. It is also shown why a new approach using computational intelligence models, as a replacement for the current BITE models, is paramount. In section 2 a brief review of developments in computational intelligence research is given. After which we present the comprehensible hierarchical intelligent framework, as a conceptual non monolithic intelligent approach utilizing distributed CI models for monitoring. Finally we conclude with discussions on the implementation and justification for our approach and direction for future work.
{"title":"Comprehensible hierarchical intelligent (CHI) framework for monitoring and preventive maintenance of aircraft systems","authors":"P. Owotoki, F. Mayer-Lindenberg","doi":"10.1109/WISES.2005.1438726","DOIUrl":"https://doi.org/10.1109/WISES.2005.1438726","url":null,"abstract":"The peculiarities of the aircraft monitoring and maintenance domain are described and shortcomings of the current monitoring methodology are revealed. It is also shown why a new approach using computational intelligence models, as a replacement for the current BITE models, is paramount. In section 2 a brief review of developments in computational intelligence research is given. After which we present the comprehensible hierarchical intelligent framework, as a conceptual non monolithic intelligent approach utilizing distributed CI models for monitoring. Finally we conclude with discussions on the implementation and justification for our approach and direction for future work.","PeriodicalId":266947,"journal":{"name":"Third International Workshop on Intelligent Solutions in Embedded Systems, 2005.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2005-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123859546","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
扫码关注我们
求助内容：
应助结果提醒方式：