Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898993
Philipp M. Glatz, L. Hörmann, C. Steger, R. Weiss
Wireless sensor network (WSN) motes are resource constrained devices. Especially, bandwidth and energy are scarce resources. Therefore, lots of effort is put into the optimization of low-power networking protocols. While network control overhead is an issue for many to most of such protocols, we present an approach that is virtually overhead-free. We introduce the implementation of an autonomous network coding implementation that can be implemented for existing applications and added over existing routing mechanisms with no need to change the application or networking protocols. We discuss and carefully evaluate the approach for applicability and gain according to the most prominent optimization metrics for WSN networking protocols. Especially, we consider the comparison of autonomous network coding to state-of-the-art collection protocols and multipath routing. The completely autonomously acting network coding plug-in implementation is profiled to conserve up to 29 % of the messages that need to be sent locally without the need for centralized network control.
{"title":"Implementing autonomous network coding for wireless sensor network applications","authors":"Philipp M. Glatz, L. Hörmann, C. Steger, R. Weiss","doi":"10.1109/CTS.2011.5898993","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898993","url":null,"abstract":"Wireless sensor network (WSN) motes are resource constrained devices. Especially, bandwidth and energy are scarce resources. Therefore, lots of effort is put into the optimization of low-power networking protocols. While network control overhead is an issue for many to most of such protocols, we present an approach that is virtually overhead-free. We introduce the implementation of an autonomous network coding implementation that can be implemented for existing applications and added over existing routing mechanisms with no need to change the application or networking protocols. We discuss and carefully evaluate the approach for applicability and gain according to the most prominent optimization metrics for WSN networking protocols. Especially, we consider the comparison of autonomous network coding to state-of-the-art collection protocols and multipath routing. The completely autonomously acting network coding plug-in implementation is profiled to conserve up to 29 % of the messages that need to be sent locally without the need for centralized network control.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132469198","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898973
C. Christophorou, A. Pitsillides
As currently specified by 3GPP for UMTS, MBMS services are provided within a cell, either by P-t-P or by P-t-M transmission mode, but not both at the same time. Our previous work highlighted the inefficiencies that can occur with this approach and proposed the “Dual Transmission mode cell” (that allows both transmission modes to coexist within the same cell) to address them. This approach, compared to the current 3GPP specified one, achieved major capacity and channel quality gains, however the tradeoffs were small increases in the terminal's battery consumption and uplink noise due to the context reporting request process adopted. In this paper we enhance our previous work and propose a new context reporting request process. Our enhanced approach revealed improvements on the terminal battery consumption and the uplink noise rise, without affecting any of the capacity and link quality gains previously achieved. In addition, it managed to significantly reduce the need for frequent and redundant reporting, which resulted in less processing effort in the RNC, faster decision making, and reduced possibility for uplink congestion. Thus, even in situations where a large number of users are present in the cell, scalability and improved system performance is achieved.
{"title":"An enhanced MBMS service provision approach for improved performance in UTRAN","authors":"C. Christophorou, A. Pitsillides","doi":"10.1109/CTS.2011.5898973","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898973","url":null,"abstract":"As currently specified by 3GPP for UMTS, MBMS services are provided within a cell, either by P-t-P or by P-t-M transmission mode, but not both at the same time. Our previous work highlighted the inefficiencies that can occur with this approach and proposed the “Dual Transmission mode cell” (that allows both transmission modes to coexist within the same cell) to address them. This approach, compared to the current 3GPP specified one, achieved major capacity and channel quality gains, however the tradeoffs were small increases in the terminal's battery consumption and uplink noise due to the context reporting request process adopted. In this paper we enhance our previous work and propose a new context reporting request process. Our enhanced approach revealed improvements on the terminal battery consumption and the uplink noise rise, without affecting any of the capacity and link quality gains previously achieved. In addition, it managed to significantly reduce the need for frequent and redundant reporting, which resulted in less processing effort in the RNC, faster decision making, and reduced possibility for uplink congestion. Thus, even in situations where a large number of users are present in the cell, scalability and improved system performance is achieved.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132484132","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898933
Kari Aho, Petri Eskelinen, I. Repo, Frans Laakso
3GPP is investigating uplink transmit diversity alternatives for HSUPA. This paper addresses uplink transmit diversity from the perspective of open loop where additional feedback information is not available. Furthermore, the focus will be on switched antenna transmit diversity where only one antenna is active at the time even though UE is equipped with multiple transmit antennas. Five different algorithms are presented and benchmarked in system level in various conditions against baseline performance without Tx diversity. The studies show achievable gains when the UE velocity is low but practical algorithms get only fraction of the possible gain and improper algorithms can lead to even performance loss.
{"title":"Introducing switched antenna transmit diversity for high speed uplink packet access","authors":"Kari Aho, Petri Eskelinen, I. Repo, Frans Laakso","doi":"10.1109/CTS.2011.5898933","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898933","url":null,"abstract":"3GPP is investigating uplink transmit diversity alternatives for HSUPA. This paper addresses uplink transmit diversity from the perspective of open loop where additional feedback information is not available. Furthermore, the focus will be on switched antenna transmit diversity where only one antenna is active at the time even though UE is equipped with multiple transmit antennas. Five different algorithms are presented and benchmarked in system level in various conditions against baseline performance without Tx diversity. The studies show achievable gains when the UE velocity is low but practical algorithms get only fraction of the possible gain and improper algorithms can lead to even performance loss.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328213","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-12-09DOI: 10.1109/CTS.2011.5898917
M. H. Khoozani, A. Rashidinejad, M. H. L. Froushani, P. Pad, F. Marvasti
The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary, rather than Gaussian, input distributions. Since design based on channel capacity is computationally expensive, we have focused on introducing a set of alternative criteria that not only speed up the matrix formation procedure, but also maintain optimality. The Bit Error Rate (BER) and Constellation measures are our main criteria propositions. Simulation results also verify our analytical justifications.
{"title":"Almost-optimum signature matrices in binary-input synchronous overloaded CDMA","authors":"M. H. Khoozani, A. Rashidinejad, M. H. L. Froushani, P. Pad, F. Marvasti","doi":"10.1109/CTS.2011.5898917","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898917","url":null,"abstract":"The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary, rather than Gaussian, input distributions. Since design based on channel capacity is computationally expensive, we have focused on introducing a set of alternative criteria that not only speed up the matrix formation procedure, but also maintain optimality. The Bit Error Rate (BER) and Constellation measures are our main criteria propositions. Simulation results also verify our analytical justifications.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127947641","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-11-11DOI: 10.1109/CTS.2011.5898948
A. Ayremlou, M. Tofighi, F. Marvasti
A modular method was suggested before to recover a band limited signal from the sample and hold and linearly interpolated (or, in general, an nth-order-hold) version of the regular samples. In this paper a novel approach for compensating the distortion of any interpolation based on modular method has been proposed. In this method the performance of the modular method is optimized by adding only some simply calculated coefficients. This approach causes drastic improvement in terms of signal-to-noise ratios with fewer modules compared to the classical modular method. Simulation results clearly confirm the improvement of the proposed method and also its superior robustness against additive noise.
{"title":"Compensating interpolation distortion by new optimized modular method","authors":"A. Ayremlou, M. Tofighi, F. Marvasti","doi":"10.1109/CTS.2011.5898948","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898948","url":null,"abstract":"A modular method was suggested before to recover a band limited signal from the sample and hold and linearly interpolated (or, in general, an nth-order-hold) version of the regular samples. In this paper a novel approach for compensating the distortion of any interpolation based on modular method has been proposed. In this method the performance of the modular method is optimized by adding only some simply calculated coefficients. This approach causes drastic improvement in terms of signal-to-noise ratios with fewer modules compared to the classical modular method. Simulation results clearly confirm the improvement of the proposed method and also its superior robustness against additive noise.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115362103","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-01-25DOI: 10.1109/CTS.2011.5898919
Ali Mousavi, P. Pad, F. Marvasti
Recently, a new class of binary codes for overloaded CDMA systems are proposed that not only has the ability of errorless communication but also suitable for detecting active users. These codes are called COWDA. In [1], a Maximum Likelihood (ML) decoder is proposed for this class of codes. Although the proposed scheme for coding/decoding shows impressive performance, the decoder can be significantly improved. In this paper, by assuming practical conditions for the traffic in the system, we suggest and prove an algorithm that increases the performance of the decoder several orders of magnitude (the Bit-Error-Rate (BER) is divided by a factor of about 400 in some Eb/N0's). The algorithm supposes the Poisson distribution for the time of activation/deactivation of the users.
{"title":"A new decoding scheme for errorless codes for overloaded CDMA with active user detection","authors":"Ali Mousavi, P. Pad, F. Marvasti","doi":"10.1109/CTS.2011.5898919","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898919","url":null,"abstract":"Recently, a new class of binary codes for overloaded CDMA systems are proposed that not only has the ability of errorless communication but also suitable for detecting active users. These codes are called COWDA. In [1], a Maximum Likelihood (ML) decoder is proposed for this class of codes. Although the proposed scheme for coding/decoding shows impressive performance, the decoder can be significantly improved. In this paper, by assuming practical conditions for the traffic in the system, we suggest and prove an algorithm that increases the performance of the decoder several orders of magnitude (the Bit-Error-Rate (BER) is divided by a factor of about 400 in some Eb/N0's). The algorithm supposes the Poisson distribution for the time of activation/deactivation of the users.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123761171","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
扫码关注我们
求助内容：
应助结果提醒方式：