Pub Date : 2008-05-07DOI: 10.1142/S0219265909002686
J. Taheri, Albert Y. Zomaya
This work presents a survey on bio-inspired algorithms formerly used to solve the location management problem in two different network schemes: paging cell and location area. For a better comparison, two test networks, generated by intelligent algorithms to present real world traffics, are used in this work. Several conclusions were made after comparing their answers. The results provide new insight into the mobility management problem that can influence the design of future networks.
{"title":"Bio-inspired Algorithms for Mobility Management","authors":"J. Taheri, Albert Y. Zomaya","doi":"10.1142/S0219265909002686","DOIUrl":"https://doi.org/10.1142/S0219265909002686","url":null,"abstract":"This work presents a survey on bio-inspired algorithms formerly used to solve the location management problem in two different network schemes: paging cell and location area. For a better comparison, two test networks, generated by intelligent algorithms to present real world traffics, are used in this work. Several conclusions were made after comparing their answers. The results provide new insight into the mobility management problem that can influence the design of future networks.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115109440","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 derive a qualitative model for O-MAC, an energy efficient MAC protocol designed for sensor networks. Through this model we study how each parameter, such as packet sending rate, node density and end-to-end hop lengths, affects the performance of O-MAC and the limitation of current O-MAC protocol. Moreover, the model gives us the direction of with which to modify the current O-MAC protocol to improve its performance.
{"title":"Performance Analysis of an Energy Efficient MAC Protocol for Sensor Networks","authors":"Jun Zhang, Farid Naït-Abdesselam, B. Bensaou","doi":"10.1109/I-SPAN.2008.1","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.1","url":null,"abstract":"In this paper we derive a qualitative model for O-MAC, an energy efficient MAC protocol designed for sensor networks. Through this model we study how each parameter, such as packet sending rate, node density and end-to-end hop lengths, affects the performance of O-MAC and the limitation of current O-MAC protocol. Moreover, the model gives us the direction of with which to modify the current O-MAC protocol to improve its performance.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115401190","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}
Recent advances in wireless sensor technologies have resulted in development of low cost and low power sensor nodes. Wireless sensor networks (WSNs) have increasingly been used for remotely monitoring tasks. Limited capabilities of sensor nodes in terms of communication, computation and storage, present challenges for protocols designed for WSNs. Due to the severe energy constraint of sensor nodes, among the major concerns is the problem of designing efficient energy-aware routing protocols. A large number of routing protocols has been proposed in the literature. They basically differ depending on the application and network architecture used in their design. Cluster-based routing protocols for large-scale WSNs have some advantages as compared to a flat network topology. Clustering results in a reduced number of messages that propagate through the network in order to accomplish a sensing task. It also offers an improved power control. In this paper, we present clustering energy-aware routing protocols for WSNs, highlight their features and present a comparison of the protocols' features.
{"title":"A Taxonomy of Cluster-Based Routing Protocols for Wireless Sensor Networks","authors":"Anahit Martirosyan, A. Boukerche, R. Pazzi","doi":"10.1109/I-SPAN.2008.28","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.28","url":null,"abstract":"Recent advances in wireless sensor technologies have resulted in development of low cost and low power sensor nodes. Wireless sensor networks (WSNs) have increasingly been used for remotely monitoring tasks. Limited capabilities of sensor nodes in terms of communication, computation and storage, present challenges for protocols designed for WSNs. Due to the severe energy constraint of sensor nodes, among the major concerns is the problem of designing efficient energy-aware routing protocols. A large number of routing protocols has been proposed in the literature. They basically differ depending on the application and network architecture used in their design. Cluster-based routing protocols for large-scale WSNs have some advantages as compared to a flat network topology. Clustering results in a reduced number of messages that propagate through the network in order to accomplish a sensing task. It also offers an improved power control. In this paper, we present clustering energy-aware routing protocols for WSNs, highlight their features and present a comparison of the protocols' features.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130836197","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}
Exploiting clusters to develop software radio systems is a much more promising research direction. When vast much feeble communication signal data collected from highspeed network enter a cluster, they will be partitioned and allocated to nodes for processing so as to realize the processing of high-gain and low-delay. This paper proposes a general real-time scheduler model for communication signals processing on clusters, a self-adaptive task partition method and a dynamic synthetical heuristic DSSA, which considers both deadline and makespan while scheduling. By tuning correlative parameters, the DSSA can achieve higher guarantee ratio. On the promise of satisfying timing constraints, the system also has higher throughput and better load balancing. We make comparisons between DSSA and DASAP, DALAP algorithms and the simulation results show that DSSA surpasses DASAP and DALAP.
{"title":"Study of Scheduling for Processing Real-Time Communication Signals on Heterogeneous Clusters","authors":"Xiaomin Zhu, Peizhong Lu","doi":"10.1109/I-SPAN.2008.27","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.27","url":null,"abstract":"Exploiting clusters to develop software radio systems is a much more promising research direction. When vast much feeble communication signal data collected from highspeed network enter a cluster, they will be partitioned and allocated to nodes for processing so as to realize the processing of high-gain and low-delay. This paper proposes a general real-time scheduler model for communication signals processing on clusters, a self-adaptive task partition method and a dynamic synthetical heuristic DSSA, which considers both deadline and makespan while scheduling. By tuning correlative parameters, the DSSA can achieve higher guarantee ratio. On the promise of satisfying timing constraints, the system also has higher throughput and better load balancing. We make comparisons between DSSA and DASAP, DALAP algorithms and the simulation results show that DSSA surpasses DASAP and DALAP.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122980303","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":"Sensor Deployment and Source Localization","authors":"S. Sahni","doi":"10.1109/I-SPAN.2008.54","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.54","url":null,"abstract":"","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121139332","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}
With the development of technology, wireless sensor networks (WSNs) performing sensing and communication tasks will be widely deployed in the near future because they greatly extend our ability to monitor and control the physical environment and improve the accuracy of information gathering. Since the sensors are usually deployed in hostile environments and cannot get recharged frequently, the power in sensors is the scarcest resource. Recently many mobility control protocols have been put forward as an effective mechanism to minimize energy consumption. However, security issues in all these protocols have not been discussed so far. In this paper, we will address these issues and point out a new privacy issue (the sink location privacy). A privacy preserving scheme is proposed to protect the sink. Analysis of the scheme shows its effectiveness in sink protection. This scheme can be well integrated into most mobility control protocols to enhance their security.
{"title":"Privacy Preserving Mobility Control Protocols in Wireless Sensor Networks","authors":"Qijun Gu, Xiao Chen","doi":"10.1109/I-SPAN.2008.20","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.20","url":null,"abstract":"With the development of technology, wireless sensor networks (WSNs) performing sensing and communication tasks will be widely deployed in the near future because they greatly extend our ability to monitor and control the physical environment and improve the accuracy of information gathering. Since the sensors are usually deployed in hostile environments and cannot get recharged frequently, the power in sensors is the scarcest resource. Recently many mobility control protocols have been put forward as an effective mechanism to minimize energy consumption. However, security issues in all these protocols have not been discussed so far. In this paper, we will address these issues and point out a new privacy issue (the sink location privacy). A privacy preserving scheme is proposed to protect the sink. Analysis of the scheme shows its effectiveness in sink protection. This scheme can be well integrated into most mobility control protocols to enhance their security.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127412292","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}
Constructing a realistic systems biology of the mammalian cell will require us to describe molecular and cellular "parts", and to model and simulate their relationships in space and time. To date, most modelling and simulation has focused on temporally dynamic processes including pathways of gene regulation, metabolism and cellular signalling. A goal of the Visible Celltrade project is to integrate spatial as well as temporal models within a common data, computational and visualisation environment to support hypothesis-generation and hypothesis-testing by biologists and modellers. A unique feature of this project is our use of actual 3-D cellular structure data, reconstructed from medium-resolution confocal video microscopy and high-resolution electron tomography, to generate the matrix for our visualisation environment. Molecular sequence and protein structure data are obtained from distributed databases via web services. The Visible Celltrade has been designed as an e-research project and implements computational and data grid standards and technologies.
{"title":"The Visible Cell™ Project: Changing the Way We Think about Cells","authors":"M. Ragan, B. Marsh","doi":"10.1109/I-SPAN.2008.53","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.53","url":null,"abstract":"Constructing a realistic systems biology of the mammalian cell will require us to describe molecular and cellular \"parts\", and to model and simulate their relationships in space and time. To date, most modelling and simulation has focused on temporally dynamic processes including pathways of gene regulation, metabolism and cellular signalling. A goal of the Visible Celltrade project is to integrate spatial as well as temporal models within a common data, computational and visualisation environment to support hypothesis-generation and hypothesis-testing by biologists and modellers. A unique feature of this project is our use of actual 3-D cellular structure data, reconstructed from medium-resolution confocal video microscopy and high-resolution electron tomography, to generate the matrix for our visualisation environment. Molecular sequence and protein structure data are obtained from distributed databases via web services. The Visible Celltrade has been designed as an e-research project and implements computational and data grid standards and technologies.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127517850","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}
Intuitively, a signed graph is a graph in which every edge is labeled with a + or - sign. For each edge, its sign represents the mode of the relationship between the vertices it joins. In a signed graph, cycles can be naturally given the sign corresponding to the product of its edges. Then, a signed graph is called balanced when all the cycles have positive sign. Balanced signed graph have multiple applications in the field of social networks. Consequently, there is a significant amount of research in the problem of determining if a signed graph is balanced or not. In particular, some authors investigated extensions to signed graph of the line graph and studied under what circumstances the signed graphs obtained are balanced or not. This paper presents a new operation, which is also an extension to signed graphs of the line graph, with the property that applied to any signed graph always produces a balanced signed graph.
{"title":"Product Line Sigraphs","authors":"Daniela Ferrero","doi":"10.1109/I-SPAN.2008.15","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.15","url":null,"abstract":"Intuitively, a signed graph is a graph in which every edge is labeled with a + or - sign. For each edge, its sign represents the mode of the relationship between the vertices it joins. In a signed graph, cycles can be naturally given the sign corresponding to the product of its edges. Then, a signed graph is called balanced when all the cycles have positive sign. Balanced signed graph have multiple applications in the field of social networks. Consequently, there is a significant amount of research in the problem of determining if a signed graph is balanced or not. In particular, some authors investigated extensions to signed graph of the line graph and studied under what circumstances the signed graphs obtained are balanced or not. This paper presents a new operation, which is also an extension to signed graphs of the line graph, with the property that applied to any signed graph always produces a balanced signed graph.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125508411","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}
Rui Yang, J. Antony, Pete P. Janes, Alistair P. Rendell
In this work we study the effect of cache blocking and memory/thread placement on a modern multicore shared memory parallel system, the SunFire X4600 M2, using the Gaussian 03 computational chemistry code. A protocol for performing memory and thread placement studies is outlined, as is a scheme for characterizing a particular memory and thread placement pattern. Results for parallel Gaussian 03 runs with up to 16 threads are presented.
{"title":"Memory and Thread Placement Effects as a Function of Cache Usage: A Study of the Gaussian Chemistry Code on the SunFire X4600 M2","authors":"Rui Yang, J. Antony, Pete P. Janes, Alistair P. Rendell","doi":"10.1109/I-SPAN.2008.13","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.13","url":null,"abstract":"In this work we study the effect of cache blocking and memory/thread placement on a modern multicore shared memory parallel system, the SunFire X4600 M2, using the Gaussian 03 computational chemistry code. A protocol for performing memory and thread placement studies is outlined, as is a scheme for characterizing a particular memory and thread placement pattern. Results for parallel Gaussian 03 runs with up to 16 threads are presented.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114585161","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}
Massively multiuser online game, i.e. MMOG, is an active research especially to integrate players to perform routing task with the intention of keeping the game deployment cost to a minimum. This paper proposes a novel state dissemination mechanism for MMOG in the context of hybrid P2P architecture by exploiting the idle period of the participating players. The proposed approach performs such task well ahead of other traditional approaches with the identical environmental setup. It expedites the task of state sharing even with heterogeneous environment. The performance of this technique is compared with the most popular multi-tree dissemination method. The measurement validates its superiority.
{"title":"An Expedite State Dissemination Mechanism for MMOGs","authors":"D. Ahmed, S. Shirmohammadi","doi":"10.1109/I-SPAN.2008.38","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.38","url":null,"abstract":"Massively multiuser online game, i.e. MMOG, is an active research especially to integrate players to perform routing task with the intention of keeping the game deployment cost to a minimum. This paper proposes a novel state dissemination mechanism for MMOG in the context of hybrid P2P architecture by exploiting the idle period of the participating players. The proposed approach performs such task well ahead of other traditional approaches with the identical environmental setup. It expedites the task of state sharing even with heterogeneous environment. The performance of this technique is compared with the most popular multi-tree dissemination method. The measurement validates its superiority.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"14 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133579845","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
扫码关注我们
求助内容：
应助结果提醒方式：