The new age of 4G technology is upon us which is about to reshape our lives. 4G offers us greater bandwidth, higher data rates, efficient spectrum use, and increased interoperability across the globe. It supports user friendly, innovative, and secure application environment. 4G systems are expected to become a platform capable of providing seamless integrating between the existing systems like GSM and wireless LAN. These systems will support comprehensive personalized services, providing stable system performance and improved quality of service. With these enhanced capabilities 4G promises to bring wireless experience to a whole new level. User will now have access to sophisticated GUI, real time gaming and high definition video. This paper will explore benefits, challenges, Multiplexing techniques and standards of 4G technologies. In it next generation applications and integration is discussed. Solutions to the research problems in developing 4G technologies are examined. Finally a short summary on 5G vision is presented as a continuum of features in the development of mobile technology.
{"title":"4G Evolution and Multiplexing Techniques with Solution to Implementation Challenges","authors":"M. Iqbal, M. B. Iqbal, I. Rasheed, M. Sandhu","doi":"10.1109/CyberC.2012.88","DOIUrl":"https://doi.org/10.1109/CyberC.2012.88","url":null,"abstract":"The new age of 4G technology is upon us which is about to reshape our lives. 4G offers us greater bandwidth, higher data rates, efficient spectrum use, and increased interoperability across the globe. It supports user friendly, innovative, and secure application environment. 4G systems are expected to become a platform capable of providing seamless integrating between the existing systems like GSM and wireless LAN. These systems will support comprehensive personalized services, providing stable system performance and improved quality of service. With these enhanced capabilities 4G promises to bring wireless experience to a whole new level. User will now have access to sophisticated GUI, real time gaming and high definition video. This paper will explore benefits, challenges, Multiplexing techniques and standards of 4G technologies. In it next generation applications and integration is discussed. Solutions to the research problems in developing 4G technologies are examined. Finally a short summary on 5G vision is presented as a continuum of features in the development of mobile technology.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134274816","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}
Several asynchronous duty cycle MAC protocols have been proposed for low power in the wireless sensor networks. However, these proposed MACs pay little attention on the performance degradation in many-to-one communications which is the most common traffic pattern in wireless sensor networks. In this paper, we propose AB-MAC, an appointment based MAC protocol to overcome the effect of channel contention of multiple senders. In AB-MAC, a fusion appointment scheme is proposed to enable scheduled batch transmission for multiple senders with low overhead. This scheme improves the transmission efficiency of the current asynchronous MACs in many-to-one traffic pattern. The experimental results show that, comparing to X-MAC which is a leading asynchronous MAC, AB-MAC can achieve better performance in terms of throughput, latency and energy efficiency.
{"title":"An Appointment Based MAC Protocol for Wireless Sensor Networks","authors":"Hao Liu, Fulong Jiang, Guoliang Yao","doi":"10.1109/CyberC.2012.68","DOIUrl":"https://doi.org/10.1109/CyberC.2012.68","url":null,"abstract":"Several asynchronous duty cycle MAC protocols have been proposed for low power in the wireless sensor networks. However, these proposed MACs pay little attention on the performance degradation in many-to-one communications which is the most common traffic pattern in wireless sensor networks. In this paper, we propose AB-MAC, an appointment based MAC protocol to overcome the effect of channel contention of multiple senders. In AB-MAC, a fusion appointment scheme is proposed to enable scheduled batch transmission for multiple senders with low overhead. This scheme improves the transmission efficiency of the current asynchronous MACs in many-to-one traffic pattern. The experimental results show that, comparing to X-MAC which is a leading asynchronous MAC, AB-MAC can achieve better performance in terms of throughput, latency and energy efficiency.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130076608","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}
A criminal network is a kind of social networks with both secrecy and efficiency. The hidden knowledge in criminal networks can be regarded as an important indicators for criminal investigations which can help finding the criminal's relationship and identifying suspects. However such criminal network analysis has not been studied well in an applied way and remains primarily a manual process. To assist investigators to find criminals relationship, criminal leader, and identify suspicious guys of a conspiracy, we built a comprehensive indicator model using methods developed in the field of Social Network Analysis (SNA). A simulation is done on a large office from open source reports and the ranked list with respect to comprehensive indicator indicates that we provide a reasonable ranking based on the proposed model.
{"title":"Social Network Analysis in Multiple Social Networks Data for Criminal Group Discovery","authors":"Xufeng Shang, Yubo Yuan","doi":"10.1109/CyberC.2012.14","DOIUrl":"https://doi.org/10.1109/CyberC.2012.14","url":null,"abstract":"A criminal network is a kind of social networks with both secrecy and efficiency. The hidden knowledge in criminal networks can be regarded as an important indicators for criminal investigations which can help finding the criminal's relationship and identifying suspects. However such criminal network analysis has not been studied well in an applied way and remains primarily a manual process. To assist investigators to find criminals relationship, criminal leader, and identify suspicious guys of a conspiracy, we built a comprehensive indicator model using methods developed in the field of Social Network Analysis (SNA). A simulation is done on a large office from open source reports and the ranked list with respect to comprehensive indicator indicates that we provide a reasonable ranking based on the proposed model.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127509668","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}
Currently, the complexity of embedded software is increased, hence, more efficient design approaches are demanded. Although component based design is well-defined for developing Embedded Real Time (ERT) systems, the design and implementation of ERT component software is slow and complex. Distributed ERT systems can reduce the complexity of a component and increase its reliability and re-usability as well. Currently, Service Oriented Architecture (SOA) is an excellent technology for the implementation of distributed software. Some platforms are introduced to implement the components in SOA concept such as Service Component Architecture (SCA) and OSGI (Open Services Gateway Initiative). SCA provides a hierarchical component composition, distributed configurations and an interconnection with various means to design and combine services. However, SCA is unable to discover and reference services dynamically. In contrast, OSGI focuses on loading the service component. The services can be stopped, loaded and unloaded in frameworks supported by OSGI. Hence, this paper proposes an integration of SCA and OSGI to introduce a new framework for the implementation of distributed ERT systems.
{"title":"An Implementation of Embedded Real Time System Framework in Service Oriented Architecture","authors":"Mahmood Aghajani, D. Jawawi","doi":"10.1109/CyberC.2012.63","DOIUrl":"https://doi.org/10.1109/CyberC.2012.63","url":null,"abstract":"Currently, the complexity of embedded software is increased, hence, more efficient design approaches are demanded. Although component based design is well-defined for developing Embedded Real Time (ERT) systems, the design and implementation of ERT component software is slow and complex. Distributed ERT systems can reduce the complexity of a component and increase its reliability and re-usability as well. Currently, Service Oriented Architecture (SOA) is an excellent technology for the implementation of distributed software. Some platforms are introduced to implement the components in SOA concept such as Service Component Architecture (SCA) and OSGI (Open Services Gateway Initiative). SCA provides a hierarchical component composition, distributed configurations and an interconnection with various means to design and combine services. However, SCA is unable to discover and reference services dynamically. In contrast, OSGI focuses on loading the service component. The services can be stopped, loaded and unloaded in frameworks supported by OSGI. Hence, this paper proposes an integration of SCA and OSGI to introduce a new framework for the implementation of distributed ERT systems.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128138739","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 have evaluated the performance of Beam forming algorithm for uncoded signal with and without Jacket Matrix based eigenvalue decomposition. First, the channel matrix has been converted to the Jacket form according to the Jacket matrix transformation and the eigenvalue is calculated. Eigenvalues are used to calculate the weight matrix. Finally, weight matrix is used for transmit signal with adaptive white Gaussian noise. The experimental result shows that the jacket matrix based eigenvalue decomposition performs better than normal decomposition.
{"title":"Performance Evaluation of Beamforming Algorithm with Jacket Matrix Based Eigenvalue Decomposition","authors":"Md. Hashem Ali Khan, M. Lee","doi":"10.1109/CyberC.2012.100","DOIUrl":"https://doi.org/10.1109/CyberC.2012.100","url":null,"abstract":"In this paper, we have evaluated the performance of Beam forming algorithm for uncoded signal with and without Jacket Matrix based eigenvalue decomposition. First, the channel matrix has been converted to the Jacket form according to the Jacket matrix transformation and the eigenvalue is calculated. Eigenvalues are used to calculate the weight matrix. Finally, weight matrix is used for transmit signal with adaptive white Gaussian noise. The experimental result shows that the jacket matrix based eigenvalue decomposition performs better than normal decomposition.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128780151","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 D-S evidence theory, the Dempster's rule always leads to counter-intuitive results when combining conflicting evidences. The methods proposed to solve these problems all simply focus on BBA features, and ignore the decision assistant purpose. In order to get consistent results, a new combination scheme is proposed, which imitates the thinking of our brain, and fuses evidences with different conflict levels by different rules. The new scheme firstly classifies the evidences according to decision support property, then, fuses the BBAs in the same class through classical discounting method, in which the discount factor is related to probability quality, finally, combines the evidences conflicting seriously through another discount way selecting BBA reliability as the factor. The numeric examples show that the new scheme evaluates BBAs from decision assistant point all-time long, and can solve the counter-intuitive paradoxes effectively.
{"title":"A New Evidence Combination Scheme for Decision Assistant","authors":"Wanqing Wang, Yongjun Zhao, Jie Huang","doi":"10.1109/CyberC.2012.18","DOIUrl":"https://doi.org/10.1109/CyberC.2012.18","url":null,"abstract":"In D-S evidence theory, the Dempster's rule always leads to counter-intuitive results when combining conflicting evidences. The methods proposed to solve these problems all simply focus on BBA features, and ignore the decision assistant purpose. In order to get consistent results, a new combination scheme is proposed, which imitates the thinking of our brain, and fuses evidences with different conflict levels by different rules. The new scheme firstly classifies the evidences according to decision support property, then, fuses the BBAs in the same class through classical discounting method, in which the discount factor is related to probability quality, finally, combines the evidences conflicting seriously through another discount way selecting BBA reliability as the factor. The numeric examples show that the new scheme evaluates BBAs from decision assistant point all-time long, and can solve the counter-intuitive paradoxes effectively.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124471542","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 multiprocessor environment, resource reservation technology will split the continuous idle resources and generate resource fragments which would reduce resource utilization and job acceptance rate. In this paper, we defined resource fragments produced by resource reservation and proposed scheduling algorithms based on fragment-aware, the designs of which focus on improve acceptance ability of following-up jobs. Based on resource fragment-aware, we proposed two algorithms, Occupation Rate Best Fit and Occupation Rate Worst Fit, and in combination with heuristic algorithms, PE Worst Fit - Occupation Rate Best Fit and PE Worst Fit - Occupation Rate Worst Fit are put forward. We not only realized and analyzed algorithms in simulation, but also studied relationship between task properties and algorithms' performance. Experiments proved that PE Worst Fit - Occupation Worst Fit provides the best job acceptance rate and Occupation Rate Worst Fit has the best performance on average slowdown.
{"title":"Fragment Aware Scheduling for Advance Reservations in Multiprocessor Systems","authors":"Bo Li, Enwei Zhou, Hao Wu, Yijian Pei, Bin Shen","doi":"10.1109/CyberC.2012.54","DOIUrl":"https://doi.org/10.1109/CyberC.2012.54","url":null,"abstract":"In multiprocessor environment, resource reservation technology will split the continuous idle resources and generate resource fragments which would reduce resource utilization and job acceptance rate. In this paper, we defined resource fragments produced by resource reservation and proposed scheduling algorithms based on fragment-aware, the designs of which focus on improve acceptance ability of following-up jobs. Based on resource fragment-aware, we proposed two algorithms, Occupation Rate Best Fit and Occupation Rate Worst Fit, and in combination with heuristic algorithms, PE Worst Fit - Occupation Rate Best Fit and PE Worst Fit - Occupation Rate Worst Fit are put forward. We not only realized and analyzed algorithms in simulation, but also studied relationship between task properties and algorithms' performance. Experiments proved that PE Worst Fit - Occupation Worst Fit provides the best job acceptance rate and Occupation Rate Worst Fit has the best performance on average slowdown.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115757364","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}
Fuzzy vault can be used as an encryption framework to protect the user's identity key using the biometric. This framework can provide a balance between fuzzy biometric and the accuracy of cryptography system. In this paper, we propose a method to fuse multi-biometrics and encrypt the key of users based on fuzzy vault. We test this method using the multibiometrics from the same source database made by Shandong University, and the results show the proposed method is more effective.
{"title":"A Dual-Mode Fingerprint Fusion Encryption Method Based on Fuzzy Vault","authors":"Xiaolei Li, Dongmei Sun","doi":"10.1109/CyberC.2012.42","DOIUrl":"https://doi.org/10.1109/CyberC.2012.42","url":null,"abstract":"Fuzzy vault can be used as an encryption framework to protect the user's identity key using the biometric. This framework can provide a balance between fuzzy biometric and the accuracy of cryptography system. In this paper, we propose a method to fuse multi-biometrics and encrypt the key of users based on fuzzy vault. We test this method using the multibiometrics from the same source database made by Shandong University, and the results show the proposed method is more effective.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116758605","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 demerits of the texture image retrieval algorithm based on sparse coding are found expression in the low recall and inconspicuous serial priority of qualified images. Several methods are presented in this paper to improve the performance of the image retrieval algorithm. Firstly, Brodatz texture image filter basis function is used for processing the texture images, thereafter, the kurtosis is added to generate the eigenvector, finally, the joint-scale filter basis is utilized to advance the filter effect. Experimental results indicate that the performance of the proposed methods is positive.
{"title":"Improvement of Texture Image Retrieval Algorithm Based on Sparse Coding","authors":"Yansi Yang, Yingyun Yang, Xuan Zeng","doi":"10.1109/CyberC.2012.92","DOIUrl":"https://doi.org/10.1109/CyberC.2012.92","url":null,"abstract":"The demerits of the texture image retrieval algorithm based on sparse coding are found expression in the low recall and inconspicuous serial priority of qualified images. Several methods are presented in this paper to improve the performance of the image retrieval algorithm. Firstly, Brodatz texture image filter basis function is used for processing the texture images, thereafter, the kurtosis is added to generate the eigenvector, finally, the joint-scale filter basis is utilized to advance the filter effect. Experimental results indicate that the performance of the proposed methods is positive.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121227510","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 investigate the simulation time and wall clock time synchronization problem for High Level Architecture (HLA). We first identify and analyze two drawbacks in the traditional HLA-based time synchronization algorithm. A novel time synchronization algorithm based on synchronization events is then proposed to address these two drawbacks. To verify the proposed algorithm, experiment are conducted in the HLA based distributed and hardware-in-the-loop simulation systems. The experimental result shows that our approach significantly outperforms the traditional algorithms.
{"title":"A Novel Simulation Time and Wall Clock Time Synchronization Algorithm for HLA","authors":"Zexin Jiang","doi":"10.1109/CyberC.2012.50","DOIUrl":"https://doi.org/10.1109/CyberC.2012.50","url":null,"abstract":"In this paper, we investigate the simulation time and wall clock time synchronization problem for High Level Architecture (HLA). We first identify and analyze two drawbacks in the traditional HLA-based time synchronization algorithm. A novel time synchronization algorithm based on synchronization events is then proposed to address these two drawbacks. To verify the proposed algorithm, experiment are conducted in the HLA based distributed and hardware-in-the-loop simulation systems. The experimental result shows that our approach significantly outperforms the traditional algorithms.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117067652","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
扫码关注我们
求助内容：
应助结果提醒方式：