In this paper we present the efficient solution for the dynamical groups with the variable threshold bound. In fact we consider the more general situation, when there is a family of dynamical groups instead of one group. We were able to handle this more general situation by joining the secret sharing idea together with the certification system device that enabled the system to distinguish the members of distinct groups of the family. The system proposed here is provably secure. The security is proved in the random oracle model, provided the number of corrupted players in the family of groups satisfies the suitable estimates and the "chosen target CDH problem" is computationally hard.
{"title":"Threshold Signatures in Dynamic Groups","authors":"J. Pomykala, T. Warchol","doi":"10.1109/FGCN.2007.219","DOIUrl":"https://doi.org/10.1109/FGCN.2007.219","url":null,"abstract":"In this paper we present the efficient solution for the dynamical groups with the variable threshold bound. In fact we consider the more general situation, when there is a family of dynamical groups instead of one group. We were able to handle this more general situation by joining the secret sharing idea together with the certification system device that enabled the system to distinguish the members of distinct groups of the family. The system proposed here is provably secure. The security is proved in the random oracle model, provided the number of corrupted players in the family of groups satisfies the suitable estimates and the \"chosen target CDH problem\" is computationally hard.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"11 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115818113","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 order to form a good generalization from a set of training instances, a clean training dataset is important. Unfortunately, real world data is never as perfect as we would like it to be and can often suffered from corruptions. In this paper, a new approach is proposed to identify and correct mislabeled training instances. For a given instance, we employ a Bayesian classifier to evaluate the probabilities of the instance belonging to all considered class labels. Then information entropy calculated from the probability distributions is used to evaluate the typicality of the instance belonging to considered class labels. Finally, the instance with low entropy, but with error prediction result, would be identified as mislabeled instance. Experimental results indicate that our approach gains comparative or better performance than previous techniques.
{"title":"Identifying and Correcting Mislabeled Training Instances","authors":"Jiangwen Sun, Feng-ying Zhao, Chong-Jun Wang, Shifu Chen","doi":"10.1109/FGCN.2007.146","DOIUrl":"https://doi.org/10.1109/FGCN.2007.146","url":null,"abstract":"In order to form a good generalization from a set of training instances, a clean training dataset is important. Unfortunately, real world data is never as perfect as we would like it to be and can often suffered from corruptions. In this paper, a new approach is proposed to identify and correct mislabeled training instances. For a given instance, we employ a Bayesian classifier to evaluate the probabilities of the instance belonging to all considered class labels. Then information entropy calculated from the probability distributions is used to evaluate the typicality of the instance belonging to considered class labels. Finally, the instance with low entropy, but with error prediction result, would be identified as mislabeled instance. Experimental results indicate that our approach gains comparative or better performance than previous techniques.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121070180","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 need for high-speed data transmission over wireless channels, multiple-input multiple-output (MIMO) technology has been suggested as it exhibits significant improvement in channel capacity. In practice, adaptive modulation scheme can be applied in different MIMO algorithms to further improve the system efficiency. In this paper, we derive closed-form expressions for the spectral efficiency of MIMO system utilizing two algorithms: Orthogonal Space-Time Block Coding (OSTBC) and spatial multiplexing with zero-forcing (ZF) receiver. Furthermore, a low-complexity adaptive scheme that switches between OSTBC and ZF to achieve even a higher spectral efficiency is suggested based on the closed form expressions.
由于需要在无线信道上进行高速数据传输，人们提出了多输入多输出（MIMO）技术，因为它能显著提高信道容量。在实践中，自适应调制方案可应用于不同的 MIMO 算法，以进一步提高系统效率。本文利用两种算法推导出 MIMO 系统频谱效率的闭式表达式：正交时空块编码（OSTBC）和带零强迫（ZF）接收器的空间复用。此外，还根据闭式表达式提出了一种在 OSTBC 和 ZF 之间切换的低复杂度自适应方案，以实现更高的频谱效率。
{"title":"The Spectral Efficiency of 2 × 2 Adaptive MIMO Systems in Spatially Correlated Rayleigh Fading Channel","authors":"Jinliang Huang, S. Signell","doi":"10.1109/FGCN.2007.218","DOIUrl":"https://doi.org/10.1109/FGCN.2007.218","url":null,"abstract":"In need for high-speed data transmission over wireless channels, multiple-input multiple-output (MIMO) technology has been suggested as it exhibits significant improvement in channel capacity. In practice, adaptive modulation scheme can be applied in different MIMO algorithms to further improve the system efficiency. In this paper, we derive closed-form expressions for the spectral efficiency of MIMO system utilizing two algorithms: Orthogonal Space-Time Block Coding (OSTBC) and spatial multiplexing with zero-forcing (ZF) receiver. Furthermore, a low-complexity adaptive scheme that switches between OSTBC and ZF to achieve even a higher spectral efficiency is suggested based on the closed form expressions.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"2457 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127479547","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 present a novel feedback control-based load shedding scheme for data stream processing. Firstly we apply system identification to establish a dynamic model to describe data stream management system (DSMS), which enables us analyze DSMS quantitatively. Then, based on the model, we use the Root Locus method to design the PI controller with proven performance guarantees. Theoretic analysis and experimental results demonstrate that our approach is robust even when system load changes frequently. Comparing to existing strategies, our approach also achieves significantly better performance.
{"title":"A Novel Adaptive Load Shedding Scheme for Data Stream Processing","authors":"Yunyi Zhang, Chongzheng Huang, Deyun Zhang","doi":"10.1109/FGCN.2007.27","DOIUrl":"https://doi.org/10.1109/FGCN.2007.27","url":null,"abstract":"In this paper, we present a novel feedback control-based load shedding scheme for data stream processing. Firstly we apply system identification to establish a dynamic model to describe data stream management system (DSMS), which enables us analyze DSMS quantitatively. Then, based on the model, we use the Root Locus method to design the PI controller with proven performance guarantees. Theoretic analysis and experimental results demonstrate that our approach is robust even when system load changes frequently. Comparing to existing strategies, our approach also achieves significantly better performance.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124884263","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 B-Reno, a new TCP implementation designed for TCP over OBS networks. B-Reno can overcome the inefficiencies of Reno and 'New-Reno in dealing with consecutive multiple packet losses and thus improve their throughputs over OBS networks. Moreover, B-Reno can also achieve performance similar with that of SACK over OBS networks while avoiding SACK'S complex mechanisms at both the sender's and the receiver's protocol stack.
{"title":"B-Reno: A New TCP Implementation Designed for TCP over OBS Networks","authors":"Yan Zhang, Sheng Wang, Lemin Li","doi":"10.1109/FGCN.2007.75","DOIUrl":"https://doi.org/10.1109/FGCN.2007.75","url":null,"abstract":"In this paper we propose B-Reno, a new TCP implementation designed for TCP over OBS networks. B-Reno can overcome the inefficiencies of Reno and 'New-Reno in dealing with consecutive multiple packet losses and thus improve their throughputs over OBS networks. Moreover, B-Reno can also achieve performance similar with that of SACK over OBS networks while avoiding SACK'S complex mechanisms at both the sender's and the receiver's protocol stack.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124993188","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}
Xue Wang, Sheng Wang, Daowei Bi, Liang Ding, Junjie Ma
Target classification is important in wireless sensor network (WSN). This paper proposes a collaborative peer-to-peer (P2P) training and classifying method with support vector machine (SVM) for WSN. The proposed method incrementally carries out the training process with the collaboration of sensor nodes in P2P paradigm. For decreasing energy consumption and improving accuracy, the collaboration of sensor nodes is implemented by autonomously selecting the proper set of sensor nodes to carry out the training process according to several feasible measures of energy consumption and information utility. Because of the purposeful sensor nodes selection, dynamic collaborative SVM can conquer the inevitable missing rate and false rate of samples in WSN. Results demonstrate that the proposed dynamic collaborative SVM can effectively implement target classification in WSN. It is also verified that the proposed dynamic collaborative SVM has outstanding performance in energy efficiency and time delay.
{"title":"Collaborative Peer-to-Peer Training and Target Classification in Wireless Sensor Networks","authors":"Xue Wang, Sheng Wang, Daowei Bi, Liang Ding, Junjie Ma","doi":"10.1109/FGCN.2007.87","DOIUrl":"https://doi.org/10.1109/FGCN.2007.87","url":null,"abstract":"Target classification is important in wireless sensor network (WSN). This paper proposes a collaborative peer-to-peer (P2P) training and classifying method with support vector machine (SVM) for WSN. The proposed method incrementally carries out the training process with the collaboration of sensor nodes in P2P paradigm. For decreasing energy consumption and improving accuracy, the collaboration of sensor nodes is implemented by autonomously selecting the proper set of sensor nodes to carry out the training process according to several feasible measures of energy consumption and information utility. Because of the purposeful sensor nodes selection, dynamic collaborative SVM can conquer the inevitable missing rate and false rate of samples in WSN. Results demonstrate that the proposed dynamic collaborative SVM can effectively implement target classification in WSN. It is also verified that the proposed dynamic collaborative SVM has outstanding performance in energy efficiency and time delay.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115045552","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}
Requirements elicitation, one of the most critical tasks in requirements engineering activities, is basically the process that involves communication with the stakeholders, understanding their necessities and formulating the problems to be solved. Conventional devices and tools used in different requirements gathering activities are mostly desktop computer or laptop based. Because of their size and less mobility feature, they are usually not brought to the workplace of the stakeholders. The advancing capabilities of mobile devices and mobile tools can significantly contribute to the automation of RE activities. The aim of this proposed research is to enhance requirements elicitation activities by using mobile devices and designing and implementing a web-based mobile RE tool to automate and supplement the traditional requirements elicitation process. This paper describes the ongoing research and presents the progress so far.
{"title":"Enhancing Requirements Engineering Activities through the Use of Mobile Technology Devices and Tools","authors":"S.A. Fahmi, A. Ibrahim, Ho‐Jin Choi","doi":"10.1109/FGCN.2007.117","DOIUrl":"https://doi.org/10.1109/FGCN.2007.117","url":null,"abstract":"Requirements elicitation, one of the most critical tasks in requirements engineering activities, is basically the process that involves communication with the stakeholders, understanding their necessities and formulating the problems to be solved. Conventional devices and tools used in different requirements gathering activities are mostly desktop computer or laptop based. Because of their size and less mobility feature, they are usually not brought to the workplace of the stakeholders. The advancing capabilities of mobile devices and mobile tools can significantly contribute to the automation of RE activities. The aim of this proposed research is to enhance requirements elicitation activities by using mobile devices and designing and implementing a web-based mobile RE tool to automate and supplement the traditional requirements elicitation process. This paper describes the ongoing research and presents the progress so far.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115101694","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}
Packets in multihop wireless networks are often discarded due to missing routes, packet collision, unreachable next-hop or bit error. As a remedy to these problems, this paper presents alternative packet- forwarding mechanisms that will reduce the likelihood of discarding packets. In addition to this, a new packet-buffering solution is proposed. By combining these two methods, reduced packet loss was achieved in addition to preserved network resources. This was confirmed through simulations, where a comparison between our proposed solutions and standard forwarding showed up to 50% reduction in packet loss.
{"title":"Alternative Packet Forwarding for Otherwise Discarded Packets","authors":"L. Landmark, Knut Øvsthus, Ø. Kure","doi":"10.1109/FGCN.2007.52","DOIUrl":"https://doi.org/10.1109/FGCN.2007.52","url":null,"abstract":"Packets in multihop wireless networks are often discarded due to missing routes, packet collision, unreachable next-hop or bit error. As a remedy to these problems, this paper presents alternative packet- forwarding mechanisms that will reduce the likelihood of discarding packets. In addition to this, a new packet-buffering solution is proposed. By combining these two methods, reduced packet loss was achieved in addition to preserved network resources. This was confirmed through simulations, where a comparison between our proposed solutions and standard forwarding showed up to 50% reduction in packet loss.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116462119","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 differential en/decoding scheme for the modified Vertical-Bell Labs layered space-time (V-BLAST) system, where each spatially multiplexed data stream is intentionally inserted with delay offset. The proposed scheme can use only one receive antenna to detect the transmitted signals, whereas neither the transmitter nor the receiver knows the channel state information (CSI). Simulation results show that the bit error rate (BER) performance is nonidentical when different delay offsets are applied. The optimum delay offset for two transmit antennas system, for example, is about 0.6 TS (where Ts denotes symbol period) when the system achieves better performance.
{"title":"Differential Space-Time Modulation for Modified V-BLAST System","authors":"Defu Sun, Youxi Tang, S. Shao, Shaoqian Li","doi":"10.1109/FGCN.2007.104","DOIUrl":"https://doi.org/10.1109/FGCN.2007.104","url":null,"abstract":"This paper proposes a differential en/decoding scheme for the modified Vertical-Bell Labs layered space-time (V-BLAST) system, where each spatially multiplexed data stream is intentionally inserted with delay offset. The proposed scheme can use only one receive antenna to detect the transmitted signals, whereas neither the transmitter nor the receiver knows the channel state information (CSI). Simulation results show that the bit error rate (BER) performance is nonidentical when different delay offsets are applied. The optimum delay offset for two transmit antennas system, for example, is about 0.6 TS (where Ts denotes symbol period) when the system achieves better performance.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114512156","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 combining decoding method for low density parity check codes in the multiple received packets combining used in HARQ, which is based on the minimum distance criterion. Simulation results show that the new combining methods outperform the conventional chase combining over fading channel in terms of throughput.
{"title":"A Combining Decoding Method of LDPC Codes for HARQ","authors":"Zhiping Shi, Liang Zhou","doi":"10.1109/FGCN.2007.4","DOIUrl":"https://doi.org/10.1109/FGCN.2007.4","url":null,"abstract":"This paper proposes a new combining decoding method for low density parity check codes in the multiple received packets combining used in HARQ, which is based on the minimum distance criterion. Simulation results show that the new combining methods outperform the conventional chase combining over fading channel in terms of throughput.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129366731","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
扫码关注我们
求助内容：
应助结果提醒方式：