The Suburban Ad Hoc Network (SAHN) is a cooperative ad hoc wireless mesh network. Nodes are owned and operated by end-users without reliance on central infrastructure. It provides symmetrical bandwidth allowing peer-to-peer services and distributed servers. We minimize the use of scarce unlicensed RF spectrum supported by Smart Antenna technology. RF interference in such networks and techniques and strategies to reduce it are examined. Traffic is spread across multiple frequency channels, and multiple directional beams to achieve improved spatial re-use. We focus on the control of smart antennas rather than their design. By dynamically adjusting our network topology using Smart Antennas and dynamically re-routing current communications we optimize the network for its current traffic needs.
{"title":"Multiple Radio Channels and Directional Antennas in Suburban Ad Hoc Networks","authors":"S. M. Rokonuzzaman, R. Pose, I. Gondal","doi":"10.1109/ISPA.2008.106","DOIUrl":"https://doi.org/10.1109/ISPA.2008.106","url":null,"abstract":"The Suburban Ad Hoc Network (SAHN) is a cooperative ad hoc wireless mesh network. Nodes are owned and operated by end-users without reliance on central infrastructure. It provides symmetrical bandwidth allowing peer-to-peer services and distributed servers. We minimize the use of scarce unlicensed RF spectrum supported by Smart Antenna technology. RF interference in such networks and techniques and strategies to reduce it are examined. Traffic is spread across multiple frequency channels, and multiple directional beams to achieve improved spatial re-use. We focus on the control of smart antennas rather than their design. By dynamically adjusting our network topology using Smart Antennas and dynamically re-routing current communications we optimize the network for its current traffic needs.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124130677","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}
M. Saad, Elfriede Fehr, Nicolai Kamenzky, J. Schiller
ScatterClipse is a generative plugin-oriented tool-chain for the model-driven development of the applications running on the sensor boards of our WSN-platform ScatterWeb. The goal is the furthermost automated and standardized generation of software system families for the ScatterWeb sensor boards. The ScatterClipse's novel approach lies in the accomplishment of the integration of visual automated application debugging and WSN-management features in the model-driven software development process of the deployed sensor boards. Furthermore the just-in-time model validation makes a large contribution towards robustness by discovering certain bugs early on, which, if manually implemented, would only be discovered very late in the process. The plugin-oriented open architecture eases the appropriate enhancement of our opensource tool-chain in response to newly arisen questions regarding WSN.
{"title":"ScatterClipse: A Model-Driven Tool-Chain for Developing, Testing, and Prototyping Wireless Sensor Networks","authors":"M. Saad, Elfriede Fehr, Nicolai Kamenzky, J. Schiller","doi":"10.1109/ISPA.2008.22","DOIUrl":"https://doi.org/10.1109/ISPA.2008.22","url":null,"abstract":"ScatterClipse is a generative plugin-oriented tool-chain for the model-driven development of the applications running on the sensor boards of our WSN-platform ScatterWeb. The goal is the furthermost automated and standardized generation of software system families for the ScatterWeb sensor boards. The ScatterClipse's novel approach lies in the accomplishment of the integration of visual automated application debugging and WSN-management features in the model-driven software development process of the deployed sensor boards. Furthermore the just-in-time model validation makes a large contribution towards robustness by discovering certain bugs early on, which, if manually implemented, would only be discovered very late in the process. The plugin-oriented open architecture eases the appropriate enhancement of our opensource tool-chain in response to newly arisen questions regarding WSN.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114378989","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 design an intelligent system architecture for dealing with context-aware application services in pervasive computing environment. The context-aware intelligent system architecture is composed of middleware, context server, and client. The middleware component of our intelligent system architecture plays an important role in recognizing a moving node with mobility by using a Bluetooth wireless communication technology as well as in executing an appropriate execution module according to the context acquired from a context server. The context server functions as a manager that efficiently stores into the database server context information, such as user's current status, physical environment, and resources of a computing system. To verify the usefulness of our context-aware intelligent system architecture, we finally develop a context-aware application to provide users with a music playing service in pervasive computing environment.
{"title":"Intelligent Context-Aware System Architecture in Pervasive Computing Environment","authors":"Jae-Woo Chang, Sora Na, M. Yoon","doi":"10.1109/ISPA.2008.73","DOIUrl":"https://doi.org/10.1109/ISPA.2008.73","url":null,"abstract":"In this paper, we design an intelligent system architecture for dealing with context-aware application services in pervasive computing environment. The context-aware intelligent system architecture is composed of middleware, context server, and client. The middleware component of our intelligent system architecture plays an important role in recognizing a moving node with mobility by using a Bluetooth wireless communication technology as well as in executing an appropriate execution module according to the context acquired from a context server. The context server functions as a manager that efficiently stores into the database server context information, such as user's current status, physical environment, and resources of a computing system. To verify the usefulness of our context-aware intelligent system architecture, we finally develop a context-aware application to provide users with a music playing service in pervasive computing environment.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114971008","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}
Nowadays, data grids are can be seen as a frameworks responding to the needs large scale applications by affording varied geographically distributed resources set. The main aim here is to ensure a robust and efficient access and quality data, to improve the availability, we must improve application costs and to tolerate the faults. In such systems, these advantages are not yielded by means others than replication mechanisms. The effective use the replication technique involves several problems, in relation with the problem of the coherence maintenance of replicas. Our contribution consists new approach for the consistency management in the data grid. The proposed approach combines between pessimistic and optimistic approaches, taking into account benefits of both approaches, to find a compromise between performance and quality. In addition, our approach has been extended by a mechanism placement of replicas based on models of market economies.
{"title":"An Effective Approach for Consistency Management of Replicas in Data Grid","authors":"Ghalem Belalem, Cherif Haddad, Y. Slimani","doi":"10.1109/ISPA.2008.48","DOIUrl":"https://doi.org/10.1109/ISPA.2008.48","url":null,"abstract":"Nowadays, data grids are can be seen as a frameworks responding to the needs large scale applications by affording varied geographically distributed resources set. The main aim here is to ensure a robust and efficient access and quality data, to improve the availability, we must improve application costs and to tolerate the faults. In such systems, these advantages are not yielded by means others than replication mechanisms. The effective use the replication technique involves several problems, in relation with the problem of the coherence maintenance of replicas. Our contribution consists new approach for the consistency management in the data grid. The proposed approach combines between pessimistic and optimistic approaches, taking into account benefits of both approaches, to find a compromise between performance and quality. In addition, our approach has been extended by a mechanism placement of replicas based on models of market economies.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116409486","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 a distributed system, the environment is described by the scheduler (also called adversary or demon). Through an example related to stabilization, we show that a formal proof that does not use a formal definition of a scheduler is pointless. As a matter of fact, we show that the same algorithm, according to the scheduler, can be either correct or incorrect and in the cases where it is correct, can have different complexities. The paper is an attempt to better understand the meaning of proving a probabilistic algorithm in a indeterministic environment.
{"title":"Analyze of Probabilistic Algorithms under Indeterministic Scheduler","authors":"J. Beauquier, C. Johnen","doi":"10.1109/ISPA.2008.21","DOIUrl":"https://doi.org/10.1109/ISPA.2008.21","url":null,"abstract":"In a distributed system, the environment is described by the scheduler (also called adversary or demon). Through an example related to stabilization, we show that a formal proof that does not use a formal definition of a scheduler is pointless. As a matter of fact, we show that the same algorithm, according to the scheduler, can be either correct or incorrect and in the cases where it is correct, can have different complexities. The paper is an attempt to better understand the meaning of proving a probabilistic algorithm in a indeterministic environment.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129525830","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}
The comparison of protein tertiary structures is a key milestone in many structural bioinformatics activities that rely in comparing very large structure datasets. As the number of proteins in the dataset increases, the corresponding computational time taken by the protein structure comparison algorithms also increases, squarely for an all-against-all comparison and linearly for an all-against-target assessment. Thus ever larger proteomics problems call for the distribution of pairwise comparison jobs in the form of well granulated subsets/packages to be run in parallel on a pool of networked processors/workstations under the coordination of a message passing interface (MPI) environment. This paper evaluates the effect on the performance of such jobs when the MPI environment is integrated with a local resource management system (LRMS) such as sun grid engine (SGE). From our experiments with different ways of integration we draw a comparative picture of all possible approaches with the description of resource usage information for each parallel job on each processor. Understanding of different ways of integration sheds light on the most promising routes for setting up an efficient environment for very large scale protein structure comparisons.
{"title":"Performance Evaluation of Protein Structure Comparison Algorithms Under Integrated Resource Management Environment for MPI Jobs","authors":"A. Shah, Daniel Barthel, G. Folino, N. Krasnogor","doi":"10.1109/ISPA.2008.41","DOIUrl":"https://doi.org/10.1109/ISPA.2008.41","url":null,"abstract":"The comparison of protein tertiary structures is a key milestone in many structural bioinformatics activities that rely in comparing very large structure datasets. As the number of proteins in the dataset increases, the corresponding computational time taken by the protein structure comparison algorithms also increases, squarely for an all-against-all comparison and linearly for an all-against-target assessment. Thus ever larger proteomics problems call for the distribution of pairwise comparison jobs in the form of well granulated subsets/packages to be run in parallel on a pool of networked processors/workstations under the coordination of a message passing interface (MPI) environment. This paper evaluates the effect on the performance of such jobs when the MPI environment is integrated with a local resource management system (LRMS) such as sun grid engine (SGE). From our experiments with different ways of integration we draw a comparative picture of all possible approaches with the description of resource usage information for each parallel job on each processor. Understanding of different ways of integration sheds light on the most promising routes for setting up an efficient environment for very large scale protein structure comparisons.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"22 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129648236","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}
Much has been said about processing efficiently data in parallel database servers, and some data warehouse applications must process in the order of tens to hundreds of Gigabytes efficiently. Yet, there is no effective approach targeted at using non-dedicated low-cost platforms efficiently in this context. Imagine taking together 10 or 1000 commodity PCs and setting-up a data crunching platform for large database-resident data with acceptable performance. There are significant inter-related data layout and processing challenges when the computational, storage and network hardware are heterogeneous and slow. We propose how to place, replicate and load-balance the data efficiently in this context. This work innovates in several respects: being practically as fast as full-mirroring without its overhead, exploring schema, chunk-wise placement, replication and load-balanced processing to be faster and more flexible than previous efforts. Our findings are complemented by an evaluation using TPC-H performance benchmark queries.
{"title":"Efficient, Chunk-Replicated Node Partitioned Data Warehouses","authors":"P. Furtado","doi":"10.1109/ISPA.2008.86","DOIUrl":"https://doi.org/10.1109/ISPA.2008.86","url":null,"abstract":"Much has been said about processing efficiently data in parallel database servers, and some data warehouse applications must process in the order of tens to hundreds of Gigabytes efficiently. Yet, there is no effective approach targeted at using non-dedicated low-cost platforms efficiently in this context. Imagine taking together 10 or 1000 commodity PCs and setting-up a data crunching platform for large database-resident data with acceptable performance. There are significant inter-related data layout and processing challenges when the computational, storage and network hardware are heterogeneous and slow. We propose how to place, replicate and load-balance the data efficiently in this context. This work innovates in several respects: being practically as fast as full-mirroring without its overhead, exploring schema, chunk-wise placement, replication and load-balanced processing to be faster and more flexible than previous efforts. Our findings are complemented by an evaluation using TPC-H performance benchmark queries.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131693730","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}
Hong Min, Sangho Yi, Junyoung Heo, Yookun Cho, Jiman Hong
The energy is the most critical resource in wireless sensor networks. Many energy efficient techniques have been studied especially in communication protocol. Among these protocols, PEGASIS proposed by Lindsey is the most superior interms of energy efficiency. In PEGASIS, all sensor nodes aggregate and transmit data along the single chain. However, this single chain causes some problems such as delay, unexpected long transmission and non-directional transmission to the sink. To resolve delay problem, PEGASIS cuts the chain into several chains. In this way, the delay can be decreased but there is new problem, wireless interference. In this paper, we propose a new chain construction algorithm to resolve above problems. The proposed algorithm minimizes the delay without the wireless interferences and maximizes the energy efficiency by removing the non-directional transmission when transmitting packets to the sink node on wireless sensor networks. Our simulation results show that our proposed algorithm can minimize the delay without expense of energy consumption.
{"title":"Energy-Efficient Data Aggregation Protocol for Location-Aware Wireless Sensor Networks","authors":"Hong Min, Sangho Yi, Junyoung Heo, Yookun Cho, Jiman Hong","doi":"10.1109/ISPA.2008.38","DOIUrl":"https://doi.org/10.1109/ISPA.2008.38","url":null,"abstract":"The energy is the most critical resource in wireless sensor networks. Many energy efficient techniques have been studied especially in communication protocol. Among these protocols, PEGASIS proposed by Lindsey is the most superior interms of energy efficiency. In PEGASIS, all sensor nodes aggregate and transmit data along the single chain. However, this single chain causes some problems such as delay, unexpected long transmission and non-directional transmission to the sink. To resolve delay problem, PEGASIS cuts the chain into several chains. In this way, the delay can be decreased but there is new problem, wireless interference. In this paper, we propose a new chain construction algorithm to resolve above problems. The proposed algorithm minimizes the delay without the wireless interferences and maximizes the energy efficiency by removing the non-directional transmission when transmitting packets to the sink node on wireless sensor networks. Our simulation results show that our proposed algorithm can minimize the delay without expense of energy consumption.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126774268","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}
This paper proposes a new addressing scheme for personal area and sensor networks with Zigbee. The method is based on arithmetic series and avoids address duplication and wastage. Problems associated with skip distance addressing and static addressing schemes are highlighted. Progressive addressing of nodes is demonstrated. The method permits identifying the Zigbee network using IPv6 addressing of a parent gateway and offset addressing of children nodes.
{"title":"A New Address Allocation Scheme and Planning of Personal Area and Sensor Networks","authors":"J. Agbinya, Mary Anya Agbinya","doi":"10.1109/ISPA.2008.45","DOIUrl":"https://doi.org/10.1109/ISPA.2008.45","url":null,"abstract":"This paper proposes a new addressing scheme for personal area and sensor networks with Zigbee. The method is based on arithmetic series and avoids address duplication and wastage. Problems associated with skip distance addressing and static addressing schemes are highlighted. Progressive addressing of nodes is demonstrated. The method permits identifying the Zigbee network using IPv6 addressing of a parent gateway and offset addressing of children nodes.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123268783","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}
Successful HPC over desktop grids and non-dedicated NOWs is challenging, since good performance is difficult to achieve due to dynamic workloads. On iterative data-parallel applications, this is addressed by dynamic data distribution. However, current approaches migrate an application from one distribution to another in one single phase, which can impact performance. In this paper, we present D3-ARC, a programming framework to support adaptive and incremental data distribution, so that data migration takes place over several successive iterations. D3-ARC consists of a runtime system and an API for specifying the distribution of arrays as well as how data redistribution takes place. We demonstrate how D3-ARC can be used to develop an incremental strategy for data distribution in a Poisson solver, utilising a runtime feedback mechanism to determine how much data to migrate during each iteration.
{"title":"A Programming Framework for Incremental Data Distribution in Iterative Applications","authors":"Philip Chan, D. Abramson","doi":"10.1109/ISPA.2008.105","DOIUrl":"https://doi.org/10.1109/ISPA.2008.105","url":null,"abstract":"Successful HPC over desktop grids and non-dedicated NOWs is challenging, since good performance is difficult to achieve due to dynamic workloads. On iterative data-parallel applications, this is addressed by dynamic data distribution. However, current approaches migrate an application from one distribution to another in one single phase, which can impact performance. In this paper, we present D3-ARC, a programming framework to support adaptive and incremental data distribution, so that data migration takes place over several successive iterations. D3-ARC consists of a runtime system and an API for specifying the distribution of arrays as well as how data redistribution takes place. We demonstrate how D3-ARC can be used to develop an incremental strategy for data distribution in a Poisson solver, utilising a runtime feedback mechanism to determine how much data to migrate during each iteration.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126250041","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
扫码关注我们
求助内容：
应助结果提醒方式：