Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479663
E. Sheybani, G. Javidi
Noise (from different sources), data dimension, and fading can have dramatic effects on the performance of wireless sensor networks and the decisions made at the fusion center. Any of these parameters alone or their combined result can affect the final outcome of a wireless sensor network. As such, total elimination of these parameters could also be damaging to the final outcome, as it may result in removing useful information that can benefit the decision making process. Several efforts have been made to find the optimal balance between which parameters, where, and how to remove them. We have developed computationally low power, low bandwidth, and low cost filters that will remove the noise and compress the data so that a decision can be made at the node level.
{"title":"An algorithm for real-time noise cancellation in wireless sensor networks","authors":"E. Sheybani, G. Javidi","doi":"10.1109/WTS.2010.5479663","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479663","url":null,"abstract":"Noise (from different sources), data dimension, and fading can have dramatic effects on the performance of wireless sensor networks and the decisions made at the fusion center. Any of these parameters alone or their combined result can affect the final outcome of a wireless sensor network. As such, total elimination of these parameters could also be damaging to the final outcome, as it may result in removing useful information that can benefit the decision making process. Several efforts have been made to find the optimal balance between which parameters, where, and how to remove them. We have developed computationally low power, low bandwidth, and low cost filters that will remove the noise and compress the data so that a decision can be made at the node level.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129058260","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}
Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479630
Yongxue Yu, R. Sankar
In cellular systems, one of the most significant metrics to measure quality of performance is the average number of call drops in a system. Hand-off mechanism ensures that the active calls in the system are successfully completed without being dropped in the mid communication. This seamless connectivity is achieved as the user moves around transferring active calls from one base station to another. In this paper, we study and propose a hand-off mechanism using cooperative game theory. Using a simple quality of service (QoS) utility function proposed in this paper, we conclude that our optimal deterministic hand-off strategy is to transfer the active calls to the base station with greater signal-to-interference and noise ratio (SINR) and greater number of available channels.
{"title":"A cooperative game-theoretic approach to cellular network hand-off","authors":"Yongxue Yu, R. Sankar","doi":"10.1109/WTS.2010.5479630","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479630","url":null,"abstract":"In cellular systems, one of the most significant metrics to measure quality of performance is the average number of call drops in a system. Hand-off mechanism ensures that the active calls in the system are successfully completed without being dropped in the mid communication. This seamless connectivity is achieved as the user moves around transferring active calls from one base station to another. In this paper, we study and propose a hand-off mechanism using cooperative game theory. Using a simple quality of service (QoS) utility function proposed in this paper, we conclude that our optimal deterministic hand-off strategy is to transfer the active calls to the base station with greater signal-to-interference and noise ratio (SINR) and greater number of available channels.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115032274","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}
Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479647
M. Shoaib, A. Cai
In this paper, inter-layer residual prediction's trade-off between concealing lost macroblock (MB) and removing visual artifact in extended spatial scalability (ESS) is investigated. In order to improve visual artifacts, various schemes are proposed in the literature, including higher distortion to the residual prediction used in ESS enhancement layer for non matching residuals. Whereas, residual prediction is also used to conceal lost MBs in inter-layer error concealment methods. We propose an efficient use of residual prediction to prevent those artifacts as well as to conceal lost MBs, exploiting features in homogenous characteristics in video objects for error resilient coding. Simulation results show that the proposed scheme achieves up to 0.29 dB PSNR gain, with overall average of 0.1 dB PSNR gain at the decoder for various tested sequences compared to JVT-W123 under testing conditions specified in JVT-V302.
{"title":"Efficient residual prediction with error concealment in extended spatial scalability","authors":"M. Shoaib, A. Cai","doi":"10.1109/WTS.2010.5479647","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479647","url":null,"abstract":"In this paper, inter-layer residual prediction's trade-off between concealing lost macroblock (MB) and removing visual artifact in extended spatial scalability (ESS) is investigated. In order to improve visual artifacts, various schemes are proposed in the literature, including higher distortion to the residual prediction used in ESS enhancement layer for non matching residuals. Whereas, residual prediction is also used to conceal lost MBs in inter-layer error concealment methods. We propose an efficient use of residual prediction to prevent those artifacts as well as to conceal lost MBs, exploiting features in homogenous characteristics in video objects for error resilient coding. Simulation results show that the proposed scheme achieves up to 0.29 dB PSNR gain, with overall average of 0.1 dB PSNR gain at the decoder for various tested sequences compared to JVT-W123 under testing conditions specified in JVT-V302.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125695117","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}
Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479625
Yulong Zhang, Xubin Chen, Wenhua Fan, Jun Han, Xiaoyang Zeng
In this paper, a robust and reliable frame synchronization method is developed for satellite-based DVB-S2 system. To perform frame synchronization accurately and rapidly under the condition of low signal-to-noise ratios and large carrier frequency offset, a novel frame synchronization scheme combining pilot-symbol-assisted differential correlation with double-peak search algorithm is analytically investigated and evaluated by extensive simulations. Simulation results show that the proposed method can achieve much lower false synchronization probability in comparison with the existing ones with low complexity overhead. Furthermore, time to acquire frame synchronization is reduced to a desirable level, even under much worse channel condition than specified.
{"title":"Robust and reliable frame synchronization method for DVB-S2 system","authors":"Yulong Zhang, Xubin Chen, Wenhua Fan, Jun Han, Xiaoyang Zeng","doi":"10.1109/WTS.2010.5479625","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479625","url":null,"abstract":"In this paper, a robust and reliable frame synchronization method is developed for satellite-based DVB-S2 system. To perform frame synchronization accurately and rapidly under the condition of low signal-to-noise ratios and large carrier frequency offset, a novel frame synchronization scheme combining pilot-symbol-assisted differential correlation with double-peak search algorithm is analytically investigated and evaluated by extensive simulations. Simulation results show that the proposed method can achieve much lower false synchronization probability in comparison with the existing ones with low complexity overhead. Furthermore, time to acquire frame synchronization is reduced to a desirable level, even under much worse channel condition than specified.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114344204","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 rapid development of m-commerce, predicting user's navigation and making the service recommendation become more and more important. Most researches focus on predicting user's navigation using context history and user preferences. But, the influence of the attributes of a service has been ignored. Simultaneously, some attributes are variable, so the recommendations are changeable. Therefore, the paper proposes an attribute-based scheme for service recommendation based on CASUP (context-aware system considering user preference). In proposed approach, the services are classified into several service clusters, and the service recommendations are carried out using Apriori algorithm and ant colony algorithm. Finally, the proposed model is validated by several simulation experiments, which demonstrate the effects of the service attributes in m-commerce.
{"title":"An attribute-based scheme for service recommendation using association rules and ant colony algorithm","authors":"Zhikui Chen, Zhuang Shao, Zhijiang Xie, Xiaodi Huang","doi":"10.1109/WTS.2010.5479624","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479624","url":null,"abstract":"With the rapid development of m-commerce, predicting user's navigation and making the service recommendation become more and more important. Most researches focus on predicting user's navigation using context history and user preferences. But, the influence of the attributes of a service has been ignored. Simultaneously, some attributes are variable, so the recommendations are changeable. Therefore, the paper proposes an attribute-based scheme for service recommendation based on CASUP (context-aware system considering user preference). In proposed approach, the services are classified into several service clusters, and the service recommendations are carried out using Apriori algorithm and ant colony algorithm. Finally, the proposed model is validated by several simulation experiments, which demonstrate the effects of the service attributes in m-commerce.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130097760","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}
Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479673
A. Mráz, L. Pap
Accurate technique is presented to analyze the symbol error rate of coherent M-QAM and M-PSK modulation schemes. Transmission happens in the presence of additive white Gaussian noise, different types of fading channels have effect on analyzed signal, and arbitrary number interference sources are modeled. M-QAM and M-PSK symbol error rate results are extended for OFDMA transmission with equally spaced subcarriers of interferers.
{"title":"General performance analysis of M-PSK and M-QAM wireless communications applied to OFDMA interference","authors":"A. Mráz, L. Pap","doi":"10.1109/WTS.2010.5479673","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479673","url":null,"abstract":"Accurate technique is presented to analyze the symbol error rate of coherent M-QAM and M-PSK modulation schemes. Transmission happens in the presence of additive white Gaussian noise, different types of fading channels have effect on analyzed signal, and arbitrary number interference sources are modeled. M-QAM and M-PSK symbol error rate results are extended for OFDMA transmission with equally spaced subcarriers of interferers.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133492331","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}
Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479641
S. Dhakal, Joonbeom Kim
In this paper a novel algorithm for user-pairing is proposed for virtual multiple-input multiple-output (V-MIMO) systems. Channel orthogonality is utilized to derive an expression for the output SNR (OSNR) in a V-MIMO system. We also show that the V-MIMO OSNR almost surely converges to the OSNR of a single input multiple output transmission as number of receive antennas approach infinity. Applying the statistical properties of orthogonality to independent and identically distributed wireless channels, system performance for the proposed pairing algorithm is evaluated in terms of joint capacity, OSNR loss, throughput fairness, and computational complexity. Numerical results show that the proposed orthogonal pairing algorithm outperforms conventional pairing methods that are oriented to maximize joint capacity.
{"title":"Statistical analysis of user-pairing algorithms in virtual MIMO systems","authors":"S. Dhakal, Joonbeom Kim","doi":"10.1109/WTS.2010.5479641","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479641","url":null,"abstract":"In this paper a novel algorithm for user-pairing is proposed for virtual multiple-input multiple-output (V-MIMO) systems. Channel orthogonality is utilized to derive an expression for the output SNR (OSNR) in a V-MIMO system. We also show that the V-MIMO OSNR almost surely converges to the OSNR of a single input multiple output transmission as number of receive antennas approach infinity. Applying the statistical properties of orthogonality to independent and identically distributed wireless channels, system performance for the proposed pairing algorithm is evaluated in terms of joint capacity, OSNR loss, throughput fairness, and computational complexity. Numerical results show that the proposed orthogonal pairing algorithm outperforms conventional pairing methods that are oriented to maximize joint capacity.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131240451","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}
Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479666
Dalin Zhu, B. Natarajan
In this paper, a novel hopping pilot pattern design method is proposed for downlink multi-cell OFDMA. Specifically, residue number system (RNS) arithmetic is invoked as a tool for constructing pilot patterns with equidistant sampling in both time and frequency domains, and limited mutual interference. Compared to Costas array-based pilot patterns, RNS-based method generates more unique pilot patterns, providing additional degrees of freedom for identifying cells/devices in a multi-cell multi-antenna environment.
{"title":"Residue number system arithmetic inspired hopping pilot pattern design for cellular downlink OFDMA","authors":"Dalin Zhu, B. Natarajan","doi":"10.1109/WTS.2010.5479666","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479666","url":null,"abstract":"In this paper, a novel hopping pilot pattern design method is proposed for downlink multi-cell OFDMA. Specifically, residue number system (RNS) arithmetic is invoked as a tool for constructing pilot patterns with equidistant sampling in both time and frequency domains, and limited mutual interference. Compared to Costas array-based pilot patterns, RNS-based method generates more unique pilot patterns, providing additional degrees of freedom for identifying cells/devices in a multi-cell multi-antenna environment.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115864080","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}
Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479635
William D. Phillips, R. Sankar
The problems, such as environmental monitoring for global warming, currently under research by scientists and engineers are complex, inter-related worldwide phenomena that require global scale sensor networks to study and understand. Cost and resource constraints prohibit organizations, even national governments, and industrial and academic consortiums from deploying sensor networks on a global scale. Therefore, it is increasingly necessary for research groups to provide access to their non-proprietary, unclassified sensor networks so that the data may be analyzed without compromising its integrity, and at times repurposed by scientists and engineers studying other aspects of inter-related phenomena. This paper proposes a global scale wireless sensor network (GSWSN) architectural framework with the Internet providing backbone connectivity among geographically disperse sensor network sites, and discusses the challenges inherent to this undertaking.
{"title":"An internet overlay architecture for global scale wireless sensor networks","authors":"William D. Phillips, R. Sankar","doi":"10.1109/WTS.2010.5479635","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479635","url":null,"abstract":"The problems, such as environmental monitoring for global warming, currently under research by scientists and engineers are complex, inter-related worldwide phenomena that require global scale sensor networks to study and understand. Cost and resource constraints prohibit organizations, even national governments, and industrial and academic consortiums from deploying sensor networks on a global scale. Therefore, it is increasingly necessary for research groups to provide access to their non-proprietary, unclassified sensor networks so that the data may be analyzed without compromising its integrity, and at times repurposed by scientists and engineers studying other aspects of inter-related phenomena. This paper proposes a global scale wireless sensor network (GSWSN) architectural framework with the Internet providing backbone connectivity among geographically disperse sensor network sites, and discusses the challenges inherent to this undertaking.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122335758","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}
Pub Date : 2010-04-21DOI: 10.1109/WTS.2010.5479645
N. Kiyani, U. H. Rizvi, G. Dolmans
In this paper we propose modulation diversity as a candidate diversity scheme for uncoded cooperative communication in wireless networks with decode-and-forward (DF) communication protocol. A performance analysis of such a scheme in Nakagami-m fading channels in the presence of additive white Gaussian noise (AWGN) is presented. An upper bound on the average probability of bit error (Pb) and average probability of symbol error (Ps) is derived for M-ary phase shift keying (MPSK) modulation schemes. It is shown that the system employing employing modulation diversity is able to provide a performance improvement of 5 dB at a bit error rate of 10−4 as compared to the conventional cooperative communication systems. We introduce a power allocation factor and show that equal power allocation is not the optimal solution. Furthermore, we also analyze the effect of different rotation angles and power allocation on the system performance.
{"title":"Modulation diversity benefits in cooperative communications","authors":"N. Kiyani, U. H. Rizvi, G. Dolmans","doi":"10.1109/WTS.2010.5479645","DOIUrl":"https://doi.org/10.1109/WTS.2010.5479645","url":null,"abstract":"In this paper we propose modulation diversity as a candidate diversity scheme for uncoded cooperative communication in wireless networks with decode-and-forward (DF) communication protocol. A performance analysis of such a scheme in Nakagami-m fading channels in the presence of additive white Gaussian noise (AWGN) is presented. An upper bound on the average probability of bit error (Pb) and average probability of symbol error (Ps) is derived for M-ary phase shift keying (MPSK) modulation schemes. It is shown that the system employing employing modulation diversity is able to provide a performance improvement of 5 dB at a bit error rate of 10−4 as compared to the conventional cooperative communication systems. We introduce a power allocation factor and show that equal power allocation is not the optimal solution. Furthermore, we also analyze the effect of different rotation angles and power allocation on the system performance.","PeriodicalId":117027,"journal":{"name":"2010 Wireless Telecommunications Symposium (WTS)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122557617","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
扫码关注我们
求助内容：
应助结果提醒方式：