This paper presents a comparison between some of the most used ranging localization methods based on the Received Signal Strength Indicator (RSSI) in low-power IEEE 802.15.4 wireless sensor networks. In particular, the Trilateration, the Min-Max and the Maximum-Likelihood algorithms have been compared using only a limited number of reference nodes. In order to perform an exhaustive comparison we carried out tests in an indoor environment: dozens of RSSI values for every estimation have been gathered and cleaned from outliers values. Our results show that it is possible to some extent to obtain positioning information from nodes equipped with IEEE 802.15.4 radio modules, given the position and the number of reference nodes.
{"title":"Experimental analysis of RSSI-based indoor localization with IEEE 802.15.4","authors":"E. Goldoni, A. Savioli, Marco Risi, P. Gamba","doi":"10.1109/EW.2010.5483396","DOIUrl":"https://doi.org/10.1109/EW.2010.5483396","url":null,"abstract":"This paper presents a comparison between some of the most used ranging localization methods based on the Received Signal Strength Indicator (RSSI) in low-power IEEE 802.15.4 wireless sensor networks. In particular, the Trilateration, the Min-Max and the Maximum-Likelihood algorithms have been compared using only a limited number of reference nodes. In order to perform an exhaustive comparison we carried out tests in an indoor environment: dozens of RSSI values for every estimation have been gathered and cleaned from outliers values. Our results show that it is possible to some extent to obtain positioning information from nodes equipped with IEEE 802.15.4 radio modules, given the position and the number of reference nodes.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114969180","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}
We have focused on SC-FDMA based resource allocation in uplink cellular systems. Subchannel and power allocation constraints specific to SC-FDMA are considered. We considered a binary integer programming-based solution recently proposed for weighted sum rate maximization and extended it to different problems. We considered problems such as rate constraint satisfaction with minimum number subchannels and sum-power minimization subject to rate constraints. Besides stating the binary integer programming formulations for these problems, we propose simpler greedy algorithms for the three problems. Numerical evaluations show that the greedy algorithms perform very close to the optimal solution, with much less computation time.
{"title":"Uplink resource allocation algorithms for Single-Carrier FDMA systems","authors":"Fatma Sokmen, Tolga Girici","doi":"10.1109/EW.2010.5483441","DOIUrl":"https://doi.org/10.1109/EW.2010.5483441","url":null,"abstract":"We have focused on SC-FDMA based resource allocation in uplink cellular systems. Subchannel and power allocation constraints specific to SC-FDMA are considered. We considered a binary integer programming-based solution recently proposed for weighted sum rate maximization and extended it to different problems. We considered problems such as rate constraint satisfaction with minimum number subchannels and sum-power minimization subject to rate constraints. Besides stating the binary integer programming formulations for these problems, we propose simpler greedy algorithms for the three problems. Numerical evaluations show that the greedy algorithms perform very close to the optimal solution, with much less computation time.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121279789","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}
Non-binary LDPC codes have excellent error-correcting performance but have not yet been widely adopted due to the high decoder implementation complexity. Stochastic decoding has been proposed as a low-complexity decoding algorithm for non-binary LDPC codes. In this paper we present a new stochastic decoding algorithm for non-binary LDPC codes using tracking forecast memories that has higher throughput and lower latency than previous stochastic decoders.
{"title":"Reduced-latency stochastic decoding of LDPC codes over GF(q)","authors":"Gabi Sarkis, W. Gross","doi":"10.1109/EW.2010.5483537","DOIUrl":"https://doi.org/10.1109/EW.2010.5483537","url":null,"abstract":"Non-binary LDPC codes have excellent error-correcting performance but have not yet been widely adopted due to the high decoder implementation complexity. Stochastic decoding has been proposed as a low-complexity decoding algorithm for non-binary LDPC codes. In this paper we present a new stochastic decoding algorithm for non-binary LDPC codes using tracking forecast memories that has higher throughput and lower latency than previous stochastic decoders.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"7 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270768","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}
Use of multiple frequency channels offers great potential to improve the capacity of wireless ad hoc networks if advanced MAC protocols are employed to assign channels to radio interfaces. An efficient multichannel protocol must exploit a channel assignment strategy which assures fairness and high performance with a low signaling overhead. When multiple radio interfaces are available on each node, a good channel assignment allows a node to use multiple channels simultaneously. The present work proposes a new multichannel multi-interface MAC protocol, based on the Balanced Incomplete Block Design (BIBD) theory. In details, the protocol is time slotted, collision free, and assures a fair distribution of both available frequency channels and time slots, thanks to the BIBD resolvability feature. Finally, analytical results are shown which highlight very high channel utilization, throughput and global energy saving.
{"title":"A multi-channel multi-interface MAC for collision-free communication in wireless ad hoc networks","authors":"C. Cormio, P. Camarda, G. Boggia, L. Grieco","doi":"10.1109/EW.2010.5483436","DOIUrl":"https://doi.org/10.1109/EW.2010.5483436","url":null,"abstract":"Use of multiple frequency channels offers great potential to improve the capacity of wireless ad hoc networks if advanced MAC protocols are employed to assign channels to radio interfaces. An efficient multichannel protocol must exploit a channel assignment strategy which assures fairness and high performance with a low signaling overhead. When multiple radio interfaces are available on each node, a good channel assignment allows a node to use multiple channels simultaneously. The present work proposes a new multichannel multi-interface MAC protocol, based on the Balanced Incomplete Block Design (BIBD) theory. In details, the protocol is time slotted, collision free, and assures a fair distribution of both available frequency channels and time slots, thanks to the BIBD resolvability feature. Finally, analytical results are shown which highlight very high channel utilization, throughput and global energy saving.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126623041","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}
Kevin C. Borries, Xiaohui Wang, Glenn Judd, P. Steenkiste, D. Stancil
The evaluation of wireless research is challenging because signals traveling through the ether are affected by the physical environment, including movement by people and objects. As a result, testbed experiments are hard to control and are non-repeatable. We have developed a wireless networking testbed based on digital signal propagation emulation that provides control over the signal propagation environment. The testbed has been in regular use for research and education since early 2007. In this paper we present measurements illustrating the properties of the emulator testbed. We also compare the results of various experiments on the emulator with simulation results to shed some light on when the increased accuracy of the emulator testbed is important. Finally, we use the experience gained on the emulator to identify classes of experiments for which the emulator is well suited, compared with other evaluation platforms.
{"title":"Experience with a wireless network testbed based on signal propagation emulation","authors":"Kevin C. Borries, Xiaohui Wang, Glenn Judd, P. Steenkiste, D. Stancil","doi":"10.1109/EW.2010.5483538","DOIUrl":"https://doi.org/10.1109/EW.2010.5483538","url":null,"abstract":"The evaluation of wireless research is challenging because signals traveling through the ether are affected by the physical environment, including movement by people and objects. As a result, testbed experiments are hard to control and are non-repeatable. We have developed a wireless networking testbed based on digital signal propagation emulation that provides control over the signal propagation environment. The testbed has been in regular use for research and education since early 2007. In this paper we present measurements illustrating the properties of the emulator testbed. We also compare the results of various experiments on the emulator with simulation results to shed some light on when the increased accuracy of the emulator testbed is important. Finally, we use the experience gained on the emulator to identify classes of experiments for which the emulator is well suited, compared with other evaluation platforms.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122288988","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}
Interference is a performance limiting factor for both reliable data estimation and synchronization, especially at the cell edge of wireless communications systems targeting a frequency reuse factor of one. In this paper we address time synchronization algorithms applicable to the beyond 3G standard 3GPP-LTE. To get rid of the interference problem, multi-link synchronization methods are proposed, which exploit information about the mobile station position and the channel state. Simulations, investigating the time synchronization performance for the S-SCH of an 3GPP-LTE downlink FDD frame, show that the combination of both location and channel state information provide remarkable timing performance gains at the cell border compared to single-link synchronization.
{"title":"On the benefit of location and channel state information for synchronization in 3GPP-LTE","authors":"A. Dammann, C. Mensing, S. Sand","doi":"10.1109/EW.2010.5483460","DOIUrl":"https://doi.org/10.1109/EW.2010.5483460","url":null,"abstract":"Interference is a performance limiting factor for both reliable data estimation and synchronization, especially at the cell edge of wireless communications systems targeting a frequency reuse factor of one. In this paper we address time synchronization algorithms applicable to the beyond 3G standard 3GPP-LTE. To get rid of the interference problem, multi-link synchronization methods are proposed, which exploit information about the mobile station position and the channel state. Simulations, investigating the time synchronization performance for the S-SCH of an 3GPP-LTE downlink FDD frame, show that the combination of both location and channel state information provide remarkable timing performance gains at the cell border compared to single-link synchronization.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122543337","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 consider the problem of waveform design for radar sensors that operate in a noncooperative network. This is a system in which multiple radars share some common features, but they do not cooperate in the detection stage of processing. Our goal is to increase the performance of an element of the sensor network, and, at the same time, to limit the interference induced by this element of interest on remaining sensors. The resulting problem is Nondeterministic Polynomial hard, namely an optimal solution can not be calculated in polynomial time. However, it is possible to relax the original problem into a Semidefinite Programming Problem, which is convex. This convex problem can be solved in polynomial time. Starting from an optimal solution to the relaxed problem, we construct a near-optimal solution of the original nonconvex problem, and evaluate its quality via the approximation bound. The proposed technique, referred to as “Waveform Design in Noncooperative Environment” (WDNE), enjoys the benefits of polynomial time complexity. Finally, we analyze via simulation the performance of the WDNE procedure.
{"title":"Fast code design for sensors in noncooperative networks","authors":"S. De Nicola, A. De Maio, A. Farina, M. Wicks","doi":"10.1109/EW.2010.5483457","DOIUrl":"https://doi.org/10.1109/EW.2010.5483457","url":null,"abstract":"In this paper, we consider the problem of waveform design for radar sensors that operate in a noncooperative network. This is a system in which multiple radars share some common features, but they do not cooperate in the detection stage of processing. Our goal is to increase the performance of an element of the sensor network, and, at the same time, to limit the interference induced by this element of interest on remaining sensors. The resulting problem is Nondeterministic Polynomial hard, namely an optimal solution can not be calculated in polynomial time. However, it is possible to relax the original problem into a Semidefinite Programming Problem, which is convex. This convex problem can be solved in polynomial time. Starting from an optimal solution to the relaxed problem, we construct a near-optimal solution of the original nonconvex problem, and evaluate its quality via the approximation bound. The proposed technique, referred to as “Waveform Design in Noncooperative Environment” (WDNE), enjoys the benefits of polynomial time complexity. Finally, we analyze via simulation the performance of the WDNE procedure.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122250985","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 sum capacity of the multiple input multiple output (MIMO) broadcast channel can be approached by a linear precoding technique called block diagonalization (BD) and by its recent extension that accounts for both in-cell and other-cell interference. In this paper we consider the problem of minimizing the transmitted power subject to a capacity constraint (the power control problem) and maximizing the sum information rate subject to a power constraint (the capacity problem) for the MIMO broadcast channel using BD precoding. Unlike previous works, we do not assume that a minimum signal-to-interference-plus-noise ratio (SINR) value is prescribed for each user but impose a fairness constraint on the user SINRs. Our approach preserves the degree of freedom of optimizing the SINR targets (in both problems) and thereby it allows to improve the system performance. We use the Augmented Lagrangian Penalty Function (ALPF) method to solve the respective constrained non-convex optimization problems and study the impact of different fairness constraints on the achievable maximum sum rate or minimum transmitted power. We find that BD with target SINR selection is a promising technique for the power control as well as the capacity problem.
{"title":"Opportunistic target SINR setting for the MIMO broadcast channel","authors":"Norbert Reider, Gábor Fodor, A. Rácz","doi":"10.1109/EW.2010.5483406","DOIUrl":"https://doi.org/10.1109/EW.2010.5483406","url":null,"abstract":"The sum capacity of the multiple input multiple output (MIMO) broadcast channel can be approached by a linear precoding technique called block diagonalization (BD) and by its recent extension that accounts for both in-cell and other-cell interference. In this paper we consider the problem of minimizing the transmitted power subject to a capacity constraint (the power control problem) and maximizing the sum information rate subject to a power constraint (the capacity problem) for the MIMO broadcast channel using BD precoding. Unlike previous works, we do not assume that a minimum signal-to-interference-plus-noise ratio (SINR) value is prescribed for each user but impose a fairness constraint on the user SINRs. Our approach preserves the degree of freedom of optimizing the SINR targets (in both problems) and thereby it allows to improve the system performance. We use the Augmented Lagrangian Penalty Function (ALPF) method to solve the respective constrained non-convex optimization problems and study the impact of different fairness constraints on the achievable maximum sum rate or minimum transmitted power. We find that BD with target SINR selection is a promising technique for the power control as well as the capacity problem.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117285467","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 new technique for detection and discrimination of stationary or slow-moving over-resolved targets on the ground, based upon a Hotelling T-squared test/generalized inner product (GIP) approach to signal analysis is presented. This robust detector separates radar returns from interference via a coherent process. This GIP-based processing can be applied to single-receiver channel systems, multiple spatial channel systems, multiple polarization channel systems or systems with multiple spatial and polarization channels.
{"title":"A Hotelling T-squared GIP test for detection of over resolved targets","authors":"M. Wicks, Yuhong Zhang, R. Schneible, J. Browning","doi":"10.1109/EW.2010.5483455","DOIUrl":"https://doi.org/10.1109/EW.2010.5483455","url":null,"abstract":"A new technique for detection and discrimination of stationary or slow-moving over-resolved targets on the ground, based upon a Hotelling T-squared test/generalized inner product (GIP) approach to signal analysis is presented. This robust detector separates radar returns from interference via a coherent process. This GIP-based processing can be applied to single-receiver channel systems, multiple spatial channel systems, multiple polarization channel systems or systems with multiple spatial and polarization channels.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117301697","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 IEEE 802.11 standard supports a variety of modulation and coding schemes (MCSs). In 802.11-based wireless mesh networks (WMNs) it is hence possible to adapt the link rate to the channel conditions. In particular, smaller link rates may be accepted for an increased spatial reuse. In an earlier study, we showed that this effect is suitable for increasing the max-min fair share throughput in a WMN operating with a TDMA channel access scheme. In this work, we investigate if the use of smaller link rates is also suitable for increasing the throughput of a WMN using a contention-based channel access mechanism. For this purpose, we analytically derive a guideline for link rate assignment as protection against hidden nodes and compute the costs and benefits of this mechanism in terms of MAC layer efficiency. A simulation study shows however that in a medium-sized WMN this strategy is less advantageous than assumed and allows to give advices for practical mesh network deployments.
{"title":"Effects of link rate assignment in IEEE 802.11 mesh networks","authors":"B. Staehle, D. Staehle, R. Pries","doi":"10.1109/EW.2010.5483427","DOIUrl":"https://doi.org/10.1109/EW.2010.5483427","url":null,"abstract":"The IEEE 802.11 standard supports a variety of modulation and coding schemes (MCSs). In 802.11-based wireless mesh networks (WMNs) it is hence possible to adapt the link rate to the channel conditions. In particular, smaller link rates may be accepted for an increased spatial reuse. In an earlier study, we showed that this effect is suitable for increasing the max-min fair share throughput in a WMN operating with a TDMA channel access scheme. In this work, we investigate if the use of smaller link rates is also suitable for increasing the throughput of a WMN using a contention-based channel access mechanism. For this purpose, we analytically derive a guideline for link rate assignment as protection against hidden nodes and compute the costs and benefits of this mechanism in terms of MAC layer efficiency. A simulation study shows however that in a medium-sized WMN this strategy is less advantageous than assumed and allows to give advices for practical mesh network deployments.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129442491","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
扫码关注我们
求助内容：
应助结果提醒方式：