Birhan Payli, A. Durresi, Deniz U. Dincer, L. Barolli
Many people, young or old, adult or children live with life-threatening health conditions and deal with frequent visits to the doctor's office or a healthcare facility for blood tests. Blood tests are one of the key processes that aid in examining people's health. Although people with certain illness can check certain blood properties at home without professional help, most people require going to a place where their blood may be analyzed in a laboratory environment to examine the state of their illness. Frequent visitation to a medical clinic for blood tests is exhausting and expensive. This periodical process leads the patients to being depressed and, over time, careless about their health. In this study, we introduce a wireless system, Non-Invasive Real-Time Blood Observation System (NIRT-BOS). NIRT-BOS will be able to read blood properties via body sensors and report the results online and, depending on the patient’s wishes, off line. NIRT-BOS will offer continuous blood data collection capabilities with the ability to detect a problem and signal a warning in real time. We are developing NIRT-BOS based on life experiences of people with chronic illnesses such as Diabetes, Heart, Kidney or Liver Diseases. The main purpose of this study is to help the frequent visitation struggles of people who live with certain health conditions and, most importantly, to be able to give them a sense of security, independence, and, to some degree, give them the peace of mind which comes from being free from the worry of their illnesses.
{"title":"Real-Time Monitoring of Vital Signs","authors":"Birhan Payli, A. Durresi, Deniz U. Dincer, L. Barolli","doi":"10.1109/WAINA.2009.161","DOIUrl":"https://doi.org/10.1109/WAINA.2009.161","url":null,"abstract":"Many people, young or old, adult or children live with life-threatening health conditions and deal with frequent visits to the doctor's office or a healthcare facility for blood tests. Blood tests are one of the key processes that aid in examining people's health. Although people with certain illness can check certain blood properties at home without professional help, most people require going to a place where their blood may be analyzed in a laboratory environment to examine the state of their illness. Frequent visitation to a medical clinic for blood tests is exhausting and expensive. This periodical process leads the patients to being depressed and, over time, careless about their health. In this study, we introduce a wireless system, Non-Invasive Real-Time Blood Observation System (NIRT-BOS). NIRT-BOS will be able to read blood properties via body sensors and report the results online and, depending on the patient’s wishes, off line. NIRT-BOS will offer continuous blood data collection capabilities with the ability to detect a problem and signal a warning in real time. We are developing NIRT-BOS based on life experiences of people with chronic illnesses such as Diabetes, Heart, Kidney or Liver Diseases. The main purpose of this study is to help the frequent visitation struggles of people who live with certain health conditions and, most importantly, to be able to give them a sense of security, independence, and, to some degree, give them the peace of mind which comes from being free from the worry of their illnesses.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128051966","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}
In this paper, we introduce a new idea of Revision Tree which can provide a flexible mechanism to store the current collaborative virtual environments (CVE) space, replay the past recorded CVE space and replace the current CVE by other past CVE space. Revision Tree with hierarchical 3D structure is visualized in space and operated by users to refer the past space information using replay, revert, clone and merge functions. Those functions provide effective and flexible collaborative work in CVE to support communication among many users over computer network. Using this method, the users as group members can progress collaborative work and confirm the past CVE without prior communication even if some of the group members do not participate in the space. Thus, asynchronous collaborative work can be attained and applied to efficiently more creative CVE applications.
{"title":"Asynchronous Collaborative Support System by Revision Tree Method","authors":"Hiroki Ogasawara, Y. Shibata","doi":"10.1109/WAINA.2009.180","DOIUrl":"https://doi.org/10.1109/WAINA.2009.180","url":null,"abstract":"In this paper, we introduce a new idea of Revision Tree which can provide a flexible mechanism to store the current collaborative virtual environments (CVE) space, replay the past recorded CVE space and replace the current CVE by other past CVE space. Revision Tree with hierarchical 3D structure is visualized in space and operated by users to refer the past space information using replay, revert, clone and merge functions. Those functions provide effective and flexible collaborative work in CVE to support communication among many users over computer network. Using this method, the users as group members can progress collaborative work and confirm the past CVE without prior communication even if some of the group members do not participate in the space. Thus, asynchronous collaborative work can be attained and applied to efficiently more creative CVE applications.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124983204","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}
In this paper we propose a new architecture, which is composed of distributed cooperative agents to reduce the false alarm ratio of the intrusion detection systems (IDS) in a twofold contribution. The first contribution lies in reducing the false alarm rate of the attack detection in an agent-based architecture by using honeypot network as the closer level of investigation. The connection is retrieved to the original destination in case of false alarm recognition, while the actions are hidden to the user. Such a scheme significantly decreases the alarm rate and provides a higher performance of IDS. The second contribution applies the game theoretic analysis in the sense that the contributing agents are led to perform the best they could in order to achieve their goals. The Shaply value is computed to find the actual contribution of each agent in the coalition he belongs to. The Equilibrium Point is found and consequently the winner coalition is formed. In this paper the architecture of the proposed system is described, a theoretical analysis of agents' behavior is given and its possible extensions are explained.
{"title":"A Multi-agent-based Approach to Improve Intrusion Detection Systems False Alarm Ratio by Using Honeypot","authors":"B. Khosravifar, Maziar Gomrokchi, J. Bentahar","doi":"10.1109/WAINA.2009.103","DOIUrl":"https://doi.org/10.1109/WAINA.2009.103","url":null,"abstract":"In this paper we propose a new architecture, which is composed of distributed cooperative agents to reduce the false alarm ratio of the intrusion detection systems (IDS) in a twofold contribution. The first contribution lies in reducing the false alarm rate of the attack detection in an agent-based architecture by using honeypot network as the closer level of investigation. The connection is retrieved to the original destination in case of false alarm recognition, while the actions are hidden to the user. Such a scheme significantly decreases the alarm rate and provides a higher performance of IDS. The second contribution applies the game theoretic analysis in the sense that the contributing agents are led to perform the best they could in order to achieve their goals. The Shaply value is computed to find the actual contribution of each agent in the coalition he belongs to. The Equilibrium Point is found and consequently the winner coalition is formed. In this paper the architecture of the proposed system is described, a theoretical analysis of agents' behavior is given and its possible extensions are explained.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130207195","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}
P. Pawar, B. Beijnum, H. Hermens, K. Wac, D. Konstantas
The advances in the area of mobile computing is likely to make it feasible to predict the availability of wireless networks and their application level Quality of Service (QoS) characteristics along the user mobility path. Such predictions are referred to as QoS predictions which are provided by the QoS Context Source (QoSCS) hosted in the fixed network. On the multi-homed mobile devices, the QoS Predictions could be used for the handover to the optimal wireless network which satisfies the QoS requirements of the mobile applications. However, to achieve this functionality, a middleware support is necessary to obtain and make use of QoS predictions in real-time. To this end, we present design, architecture and validation of the context-aware computing support for network-assisted seamless vertical handover that uses QoS predictions to take a handover decision. We evaluate the proposed solution, in a case where it is applied in the mobile health care applications. The obtained simulation results encourage us to conduct the real-time system validation by employing the proposed solution.
{"title":"Context-Aware Computing Support for Network-Assisted Seamless Vertical Handover in Remote Patient Monitoring","authors":"P. Pawar, B. Beijnum, H. Hermens, K. Wac, D. Konstantas","doi":"10.1109/WAINA.2009.191","DOIUrl":"https://doi.org/10.1109/WAINA.2009.191","url":null,"abstract":"The advances in the area of mobile computing is likely to make it feasible to predict the availability of wireless networks and their application level Quality of Service (QoS) characteristics along the user mobility path. Such predictions are referred to as QoS predictions which are provided by the QoS Context Source (QoSCS) hosted in the fixed network. On the multi-homed mobile devices, the QoS Predictions could be used for the handover to the optimal wireless network which satisfies the QoS requirements of the mobile applications. However, to achieve this functionality, a middleware support is necessary to obtain and make use of QoS predictions in real-time. To this end, we present design, architecture and validation of the context-aware computing support for network-assisted seamless vertical handover that uses QoS predictions to take a handover decision. We evaluate the proposed solution, in a case where it is applied in the mobile health care applications. The obtained simulation results encourage us to conduct the real-time system validation by employing the proposed solution.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127097925","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}
We show in this paper that the metabolic chain can be supposed a potential-Hamiltonian system in which the dynamical flow can be shared between gradient dissipative and periodic conservative parts. If the chain is branched and if we know the fluxes at the extremities of each branch we can deduce information about the internal kinetics (e.g. place of allosteric and Michaelian step with respect to those of branching paths, cooperatively) from minimal additional measurements inside the black box constituted by the system. We will treat as example the glycolysis with the pentose pathway whose fluxes measurements are done at the pyruvate and pentose levels.
{"title":"Modeling the Glycolysis: An Inverse Problem Approach","authors":"J. Demongeot, A. Doncescu","doi":"10.1109/WAINA.2009.135","DOIUrl":"https://doi.org/10.1109/WAINA.2009.135","url":null,"abstract":"We show in this paper that the metabolic chain can be supposed a potential-Hamiltonian system in which the dynamical flow can be shared between gradient dissipative and periodic conservative parts. If the chain is branched and if we know the fluxes at the extremities of each branch we can deduce information about the internal kinetics (e.g. place of allosteric and Michaelian step with respect to those of branching paths, cooperatively) from minimal additional measurements inside the black box constituted by the system. We will treat as example the glycolysis with the pentose pathway whose fluxes measurements are done at the pyruvate and pentose levels.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125724536","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}
Actin is a cytoskeletal protein found in all eukaryotic cells. It is involved in cellular motility and cytokinesis and is essential for processes such as defense against microorganisms and for cancer cells to spread as metastases. Actin binds ATP in physiological conditions and hydrolyzes it to ADP after polymerizing into microfilaments. ADF/cofilin is one of the key actin-binding proteins and is required for the rapid actin turnover necessary in cell motility. It functions by taking advantage of the ATP/ADP gradient in actin filaments by associating with the older parts of actin filaments to depolymerize filaments by binding with 100 fold higher affinity to ADP-actin than to ATP-actin. ADF/cofilin also binds monomeric ADP-actin more strongly than ATP-actin and inhibits nucleotide exchange. However, the structural mechanisms for these processes are a mystery as a crystal structure is not available for the actin-cofilin complex. Yet, ADF/cofilin binds actin through an ADF homology (ADF-H) domain, which is also found in other actin-binding proteins, such as twinfilin, and a structure of the complex of ATP-actin with the C-terminal ADF-H domain of twinfilin was recently determined. We are using the crystal structure of the actin-Twf-C complex to simulate the interaction of ADF/cofilin with ADP-actin and ATP-actin through molecular dynamics simulations and to examine conformational changes that may explain the mechanisms for ADF/cofilin inhibition of nucleotide exchange as well as the stronger affinity for ADP-actin. Thus far we have run a 2 ns simulation of the Twf-C-actin complex with ATP. Surprisingly, in this simulation the adenine ring of ATP underwent a large ring flip even though in simulations of monomeric ATP-actin the ATP is extremely stable. This result was unexpected since a similar ring flip was previously seen in ADP-Arp3 (actin-related protein 3), but in this case the nucleotide was being released. Experimentally, however, ADF/cofilin prevents nucleotide release. It may be possible that the ATP is actually going into a more stable conformation. We are working on running the simulation for a longer time as well as replacing ADP into the complex. Analyzing ADF/cofilin’s contributions to cell motility through computational biology may help us understand its roles in apoptosis and several diseases, such as Alzheimer’s and cancer.
{"title":"Analyzing the Interaction of ADF/Cofilin with Actin through Molecular Dynamics Simulations","authors":"Ershela Durresi, P. Dalhaimer, T. Pollard","doi":"10.1109/WAINA.2009.166","DOIUrl":"https://doi.org/10.1109/WAINA.2009.166","url":null,"abstract":"Actin is a cytoskeletal protein found in all eukaryotic cells. It is involved in cellular motility and cytokinesis and is essential for processes such as defense against microorganisms and for cancer cells to spread as metastases. Actin binds ATP in physiological conditions and hydrolyzes it to ADP after polymerizing into microfilaments. ADF/cofilin is one of the key actin-binding proteins and is required for the rapid actin turnover necessary in cell motility. It functions by taking advantage of the ATP/ADP gradient in actin filaments by associating with the older parts of actin filaments to depolymerize filaments by binding with 100 fold higher affinity to ADP-actin than to ATP-actin. ADF/cofilin also binds monomeric ADP-actin more strongly than ATP-actin and inhibits nucleotide exchange. However, the structural mechanisms for these processes are a mystery as a crystal structure is not available for the actin-cofilin complex. Yet, ADF/cofilin binds actin through an ADF homology (ADF-H) domain, which is also found in other actin-binding proteins, such as twinfilin, and a structure of the complex of ATP-actin with the C-terminal ADF-H domain of twinfilin was recently determined. We are using the crystal structure of the actin-Twf-C complex to simulate the interaction of ADF/cofilin with ADP-actin and ATP-actin through molecular dynamics simulations and to examine conformational changes that may explain the mechanisms for ADF/cofilin inhibition of nucleotide exchange as well as the stronger affinity for ADP-actin. Thus far we have run a 2 ns simulation of the Twf-C-actin complex with ATP. Surprisingly, in this simulation the adenine ring of ATP underwent a large ring flip even though in simulations of monomeric ATP-actin the ATP is extremely stable. This result was unexpected since a similar ring flip was previously seen in ADP-Arp3 (actin-related protein 3), but in this case the nucleotide was being released. Experimentally, however, ADF/cofilin prevents nucleotide release. It may be possible that the ATP is actually going into a more stable conformation. We are working on running the simulation for a longer time as well as replacing ADP into the complex. Analyzing ADF/cofilin’s contributions to cell motility through computational biology may help us understand its roles in apoptosis and several diseases, such as Alzheimer’s and cancer.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126472689","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}
Goshi Sato, Daisuke Asahizawa, Yasuhiro Kawano, Y. Shibata
In this paper, we introduce a mobile network for disaster communication network by combination of different wireless LANs and mobile network. Currently available wireless LANs such as IEEE802.11b,g,j,n, IEEE802.16, cellular network are combined with a mobile router and loaded on a car to build a cognitive radio LAN node. Using multiple mobile network nodes, a large disaster communication network is organized. A communication path between nodes has multiple links and the suitable links among them is selected based on the distance, power and transmission frequency. By multi-hopping those nodes, user can communicate with other user and send/receive disaster information even though some of information infrastructure are damaged. In this paper, we designed a wireless mobile network with currently available different wireless LANs and constructed a prototyped system to evaluate the functional and performance.
{"title":"Disaster Information Network by Cognitive Radio LANs","authors":"Goshi Sato, Daisuke Asahizawa, Yasuhiro Kawano, Y. Shibata","doi":"10.1109/WAINA.2009.178","DOIUrl":"https://doi.org/10.1109/WAINA.2009.178","url":null,"abstract":"In this paper, we introduce a mobile network for disaster communication network by combination of different wireless LANs and mobile network. Currently available wireless LANs such as IEEE802.11b,g,j,n, IEEE802.16, cellular network are combined with a mobile router and loaded on a car to build a cognitive radio LAN node. Using multiple mobile network nodes, a large disaster communication network is organized. A communication path between nodes has multiple links and the suitable links among them is selected based on the distance, power and transmission frequency. By multi-hopping those nodes, user can communicate with other user and send/receive disaster information even though some of information infrastructure are damaged. In this paper, we designed a wireless mobile network with currently available different wireless LANs and constructed a prototyped system to evaluate the functional and performance.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121501342","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}
Mobile ad hoc networks allow to create very dynamic communication systems, which are independent from any fixed infrastructure. One of the most important issues regarding the management of an ad hoc network is the configuration of the system according to the way users move. Since a centralized control structure does not exist, we need to determine how the IP addresses must be assigned to the nodes in the network. In this paper we add a security mechanism to VASM protocol based on zero knowledge approach. A hash function has very low running time. So this so this scheme is very light-weight. The VASM protocol uses coordinate value of point in main address sheet for generating addresses. The performances of this solution are evaluated through the Behavioral simulation, which allowed us to check the correctness of the protocol and to estimate the control traffic generated under different operating conditions.
{"title":"Lightweight Secure IP Address Auto-Configuration Based on VASM","authors":"Majid Tajamolian, M. Taghiloo, Mahnaz Tajamolian","doi":"10.1109/WAINA.2009.149","DOIUrl":"https://doi.org/10.1109/WAINA.2009.149","url":null,"abstract":"Mobile ad hoc networks allow to create very dynamic communication systems, which are independent from any fixed infrastructure. One of the most important issues regarding the management of an ad hoc network is the configuration of the system according to the way users move. Since a centralized control structure does not exist, we need to determine how the IP addresses must be assigned to the nodes in the network. In this paper we add a security mechanism to VASM protocol based on zero knowledge approach. A hash function has very low running time. So this so this scheme is very light-weight. The VASM protocol uses coordinate value of point in main address sheet for generating addresses. The performances of this solution are evaluated through the Behavioral simulation, which allowed us to check the correctness of the protocol and to estimate the control traffic generated under different operating conditions.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121521865","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}
We present a graph-theoretic model of routing hierarchies that abstracts the generic properties of standard routing protocols such as PNNI and OSPF/BGP. These protocols are currently deployed in operational networks. Our model is based on purely topological constructs, without referring to protocol details. Through graph partitioning and refinements, a multi-level hierarchy of sibling and child clusters is obtained. By hiding the topology of a cluster from outside, this structure allows routing protocols to scale to support large networks. Without revealing intra-cluster details, a cluster cost graph is defined in terms of entry-to-exit transit costs. This graph is advertised to other clusters. Each node within a cluster combines the cost graphs from other clusters to construct a routing graph for routing traffic. The limited view of a routing graph may sometimes lead to suboptimal path selection. Additionally, routing between sibling clusters may have loops; protocol restrictions are needed for loop avoidance.
{"title":"A Graph-Theoretic Model of Routing Hierarchies","authors":"Yvonne Lai, W. Lai","doi":"10.1109/WAINA.2009.94","DOIUrl":"https://doi.org/10.1109/WAINA.2009.94","url":null,"abstract":"We present a graph-theoretic model of routing hierarchies that abstracts the generic properties of standard routing protocols such as PNNI and OSPF/BGP. These protocols are currently deployed in operational networks. Our model is based on purely topological constructs, without referring to protocol details. Through graph partitioning and refinements, a multi-level hierarchy of sibling and child clusters is obtained. By hiding the topology of a cluster from outside, this structure allows routing protocols to scale to support large networks. Without revealing intra-cluster details, a cluster cost graph is defined in terms of entry-to-exit transit costs. This graph is advertised to other clusters. Each node within a cluster combines the cost graphs from other clusters to construct a routing graph for routing traffic. The limited view of a routing graph may sometimes lead to suboptimal path selection. Additionally, routing between sibling clusters may have loops; protocol restrictions are needed for loop avoidance.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127550709","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}
C. Buckl, Stephan Sommer, A. Scholz, A. Knoll, A. Kemper, J. Heuer, A. Schmitt
More and more devices become network enabled and are integrated within one large, distributed system. The serviceoriented paradigm is the main concept to implement this approachand to cope with the heterogeneity of the underlying network. However, resource constraints imposed by the underlying hardware, such as 8-Bit micro controllers, require efficient protocols and often prohibit the use of technologies known from the Web service domain, the major implementation of the service-oriented paradigm. Nevertheless, a quick and seamless information flow between embedded devices and Web services is an important requirement for many application scenarios, e.g., real-time aware production management or the Internet of Things. Within this paper, we present an approach that allows to profit from the benefits of traditional SOA implementations, such as Web service interfaces and an IP compatible addressing scheme, and on the other hand can be implemented on resource constraint devices. The main idea is to use a data-centric processing paradigm at the device level and a gateway that mediates between the Web service and the embedded device world.
{"title":"Services to the Field: An Approach for Resource Constrained Sensor/Actor Networks","authors":"C. Buckl, Stephan Sommer, A. Scholz, A. Knoll, A. Kemper, J. Heuer, A. Schmitt","doi":"10.1109/WAINA.2009.20","DOIUrl":"https://doi.org/10.1109/WAINA.2009.20","url":null,"abstract":"More and more devices become network enabled and are integrated within one large, distributed system. The serviceoriented paradigm is the main concept to implement this approachand to cope with the heterogeneity of the underlying network. However, resource constraints imposed by the underlying hardware, such as 8-Bit micro controllers, require efficient protocols and often prohibit the use of technologies known from the Web service domain, the major implementation of the service-oriented paradigm. Nevertheless, a quick and seamless information flow between embedded devices and Web services is an important requirement for many application scenarios, e.g., real-time aware production management or the Internet of Things. Within this paper, we present an approach that allows to profit from the benefits of traditional SOA implementations, such as Web service interfaces and an IP compatible addressing scheme, and on the other hand can be implemented on resource constraint devices. The main idea is to use a data-centric processing paradigm at the device level and a gateway that mediates between the Web service and the embedded device world.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127614080","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
扫码关注我们
求助内容：
应助结果提醒方式：