Pub Date : 2010-05-23DOI: 10.1109/ICC.2010.5501942
M. Rupp, J. García-Naya, C. Mehlführer, S. Caban, L. Castedo
This paper has two major contributions. First, we present measured frequency selective wireless channels and show that there is only a small difference between mutual information and capacity. For single-antenna channels the maximum difference is about 0.15 bit/s/Hz, but typical differences are much smaller. These differences are increased with the number of transmit and receive antennas, achieving a maximum of about 0.4 bit/s/Hz for 2x2 MIMO channels and about 1.8 bit/s/Hz for 4x4 MIMO channels. The second contribution is a simple two-parameter channel model for frequency selective wireless channels, exhibiting the identical behavior in terms of capacity and mutual information than the measured channels. Due to its simplicity, this so-called poor-rich model is especially suitable for fast simulations and for analytical research in the field of information theory.
{"title":"On Mutual Information and Capacity in Frequency Selective Wireless Channels","authors":"M. Rupp, J. García-Naya, C. Mehlführer, S. Caban, L. Castedo","doi":"10.1109/ICC.2010.5501942","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501942","url":null,"abstract":"This paper has two major contributions. First, we present measured frequency selective wireless channels and show that there is only a small difference between mutual information and capacity. For single-antenna channels the maximum difference is about 0.15 bit/s/Hz, but typical differences are much smaller. These differences are increased with the number of transmit and receive antennas, achieving a maximum of about 0.4 bit/s/Hz for 2x2 MIMO channels and about 1.8 bit/s/Hz for 4x4 MIMO channels. The second contribution is a simple two-parameter channel model for frequency selective wireless channels, exhibiting the identical behavior in terms of capacity and mutual information than the measured channels. Due to its simplicity, this so-called poor-rich model is especially suitable for fast simulations and for analytical research in the field of information theory.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"41 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79304964","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-05-23DOI: 10.1109/ICC.2010.5502124
Charisis Brouzioutis, V. Vitsas, P. Chatzimisios
IEEE 802.11 is world widely established as the most popular protocol for Wireless Local Area Networks (WLANs). Voice over IP (VoIP) applications are widely spread due to their relatively low cost. Applying VoIP traffic on IEEE 802.11 WLANs introduces significant delays in the wireless medium due to the small size of voice packets. In this paper, we develop an analytical model for the IEEE 802.11 Distributed Coordination Function (DCF) considering voice and data stations transmitting simultaneously. Our new model calculates IEEE 802.11 DCF performance in terms of average delay, delay variation (jitter) and drop probability for voice packets. Metric values that constitute good voice quality are identified and based on these we develop a methodology for assessing the network's capacity in terms of good quality voice calls. The proposed analytical model is validated by comparing analytical results against simulation outcome. Finally, we study the impact of data transmissions on voice capacity and show that for every data session (a data station and a TCP-ACK station) added to a 802.11b WLAN, its voice capacity drops by 2 voice sessions (4 voice stations).
{"title":"Studying the Impact of Data Traffic on Voice Capacity in IEEE 802.11 WLANs","authors":"Charisis Brouzioutis, V. Vitsas, P. Chatzimisios","doi":"10.1109/ICC.2010.5502124","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502124","url":null,"abstract":"IEEE 802.11 is world widely established as the most popular protocol for Wireless Local Area Networks (WLANs). Voice over IP (VoIP) applications are widely spread due to their relatively low cost. Applying VoIP traffic on IEEE 802.11 WLANs introduces significant delays in the wireless medium due to the small size of voice packets. In this paper, we develop an analytical model for the IEEE 802.11 Distributed Coordination Function (DCF) considering voice and data stations transmitting simultaneously. Our new model calculates IEEE 802.11 DCF performance in terms of average delay, delay variation (jitter) and drop probability for voice packets. Metric values that constitute good voice quality are identified and based on these we develop a methodology for assessing the network's capacity in terms of good quality voice calls. The proposed analytical model is validated by comparing analytical results against simulation outcome. Finally, we study the impact of data transmissions on voice capacity and show that for every data session (a data station and a TCP-ACK station) added to a 802.11b WLAN, its voice capacity drops by 2 voice sessions (4 voice stations).","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"25 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81283215","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-05-23DOI: 10.1109/ICC.2010.5502040
J. Vía, I. Santamaría, V. Elvira, R. Eickhoff
In this paper, we propose a general beamforming criterion for pre-FFT processing in orthogonal frequency division multiplexing (OFDM) systems with multiple transmit and receive antennas. The proposed criterion depends on a single parameter α, which establishes a tradeoff between the energy of the equivalent SISO channel (after Tx-Rx beamforming) and its spectral flatness. The proposed cost function embraces most reasonable criteria for designing Tx-Rx pre-FFT beamformers. Hence, for particular values of α the proposed criterion reduces to the minimization of the mean square error (MSE), the maximization of the system capacity, or the maximization of the received signal-to-noise ratio (SNR). In general, the proposed criterion results in a non convex optimization problem. However, we show that the problem can be approximately solved by semidefinite relaxation (SDR) techniques. Additionally, since the computational cost of SDR for this problem is rather high, we propose a simple yet efficient gradient search algorithm which provides satisfactory solutions with a moderate computational cost for OFDM-based WLAN standards such as 802.11a. Finally, the good performance of the proposed technique is illustrated by means of some numerical results.
{"title":"A General Pre-FFT Criterion for MIMO-OFDM Beamforming","authors":"J. Vía, I. Santamaría, V. Elvira, R. Eickhoff","doi":"10.1109/ICC.2010.5502040","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502040","url":null,"abstract":"In this paper, we propose a general beamforming criterion for pre-FFT processing in orthogonal frequency division multiplexing (OFDM) systems with multiple transmit and receive antennas. The proposed criterion depends on a single parameter α, which establishes a tradeoff between the energy of the equivalent SISO channel (after Tx-Rx beamforming) and its spectral flatness. The proposed cost function embraces most reasonable criteria for designing Tx-Rx pre-FFT beamformers. Hence, for particular values of α the proposed criterion reduces to the minimization of the mean square error (MSE), the maximization of the system capacity, or the maximization of the received signal-to-noise ratio (SNR). In general, the proposed criterion results in a non convex optimization problem. However, we show that the problem can be approximately solved by semidefinite relaxation (SDR) techniques. Additionally, since the computational cost of SDR for this problem is rather high, we propose a simple yet efficient gradient search algorithm which provides satisfactory solutions with a moderate computational cost for OFDM-based WLAN standards such as 802.11a. Finally, the good performance of the proposed technique is illustrated by means of some numerical results.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"28 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84543721","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-05-23DOI: 10.1109/ICC.2010.5502340
Guoliang Chen, Yu Zhu, K. Letaief
Due to its lower peak-to-average power ratio (PAPR) compared with orthogonal frequency division multiple access (OFDMA), single carrier frequency division multiple access (SC-FDMA) has been recently accepted as the uplink multiple access scheme in the Long Term Evolution (LTE) of cellular systems by the Third Generation Partnership Project (3GPP). However, similar to OFDMA, carrier frequency offset (CFO) can destroy the orthogonality among subcarriers and degrade the performance of SC-FDMA. To mitigate the effect of CFOs, we propose a combined minimum mean square error frequencydomain equalization (MMSE-FDE) and interference cancellation scheme. In this scheme, joint FDE with CFO compensation (JFC) is utilized to obtain the initial estimation for each user. In contrast to previous schemes, where the FDE and CFO compensation are done separately, in JFC, the MMSE FDE is designed to suppress the MUI after CFO compensation. To further eliminate the MUI, we combine JFC with parallel interference cancellation (PIC). In particular, we iteratively design the MMSE FDE equalizer to suppress the remaining MUI at each stage and obtain better estimation. Simulation results show that the proposed scheme can significantly improve the system performance.
{"title":"Combined MMSE-FDE and Interference Cancellation for Uplink SC-FDMA with Carrier Frequency Offsets","authors":"Guoliang Chen, Yu Zhu, K. Letaief","doi":"10.1109/ICC.2010.5502340","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502340","url":null,"abstract":"Due to its lower peak-to-average power ratio (PAPR) compared with orthogonal frequency division multiple access (OFDMA), single carrier frequency division multiple access (SC-FDMA) has been recently accepted as the uplink multiple access scheme in the Long Term Evolution (LTE) of cellular systems by the Third Generation Partnership Project (3GPP). However, similar to OFDMA, carrier frequency offset (CFO) can destroy the orthogonality among subcarriers and degrade the performance of SC-FDMA. To mitigate the effect of CFOs, we propose a combined minimum mean square error frequencydomain equalization (MMSE-FDE) and interference cancellation scheme. In this scheme, joint FDE with CFO compensation (JFC) is utilized to obtain the initial estimation for each user. In contrast to previous schemes, where the FDE and CFO compensation are done separately, in JFC, the MMSE FDE is designed to suppress the MUI after CFO compensation. To further eliminate the MUI, we combine JFC with parallel interference cancellation (PIC). In particular, we iteratively design the MMSE FDE equalizer to suppress the remaining MUI at each stage and obtain better estimation. Simulation results show that the proposed scheme can significantly improve the system performance.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"135 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84926198","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-05-23DOI: 10.1109/ICC.2010.5502156
Bashir Yahya, J. Ben-othman
This paper presents an energy efficient multipath routing protocol specifically designed for wireless sensor networks (referred as RELAX). RELAX protocol tries to utilize the relaxation phenomenon of certain batteries to increase the battery lifetime and hence increasing the overall lifetime of the sensor network. Relaxation periods enable the battery to recover a portion of its lost power; it has been proven that the intermittent operation of some alkaline batteries increases its lifespan by about 28%. RELAX uses a link cost function that depends on current residual energy, available buffer size, and link quality (in terms of Signal-to-Noise ratio) to predict the best next hop during the path construction phase. RELAX routes data across multiple paths to balance the energy consumed across multiple nodes and to increase the throughput as well as minimizing packet end-to-end delay. Before transmitting the data, RELAX protocol adds data redundancy through a light weight Forward Error Correction (FEC) technique to increase the protocol reliability and resiliency to path failures. Many simulation experiments have been cried out to evaluate the protocol performance. Results show that RELAX protocol achieves lower energy consumption, lower packet delay, higher throughput, and long node lifetime duration compared to other protocols.
{"title":"RELAX: An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks","authors":"Bashir Yahya, J. Ben-othman","doi":"10.1109/ICC.2010.5502156","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502156","url":null,"abstract":"This paper presents an energy efficient multipath routing protocol specifically designed for wireless sensor networks (referred as RELAX). RELAX protocol tries to utilize the relaxation phenomenon of certain batteries to increase the battery lifetime and hence increasing the overall lifetime of the sensor network. Relaxation periods enable the battery to recover a portion of its lost power; it has been proven that the intermittent operation of some alkaline batteries increases its lifespan by about 28%. RELAX uses a link cost function that depends on current residual energy, available buffer size, and link quality (in terms of Signal-to-Noise ratio) to predict the best next hop during the path construction phase. RELAX routes data across multiple paths to balance the energy consumed across multiple nodes and to increase the throughput as well as minimizing packet end-to-end delay. Before transmitting the data, RELAX protocol adds data redundancy through a light weight Forward Error Correction (FEC) technique to increase the protocol reliability and resiliency to path failures. Many simulation experiments have been cried out to evaluate the protocol performance. Results show that RELAX protocol achieves lower energy consumption, lower packet delay, higher throughput, and long node lifetime duration compared to other protocols.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"25 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85731117","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-05-23DOI: 10.1109/ICC.2010.5502282
S. R. Rosa, A. Drummond, N. Fonseca
Traditional protection schemes guarantees 100% reliability in case of single link failure which demands resources while differentiated reliability provides a granular protection scheme. Moreover, if the signal quality in a path is below acceptable values, a path cannot be used by incoming requests for lighpath establishment. Therefore, the signal quality needs to be checked by the routing and wavelength assignment algorithm (RWA). This paper investigates shared path protection with differentiated reliability taking into account the PMD and the ASE impairments in path selection. The efficacy of the algorithm proposed is compared to that of its impairment unaware counterpart.
{"title":"Shared Path Protection with Differentiated Reliability in Transmission Impaired WDM Networks","authors":"S. R. Rosa, A. Drummond, N. Fonseca","doi":"10.1109/ICC.2010.5502282","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502282","url":null,"abstract":"Traditional protection schemes guarantees 100% reliability in case of single link failure which demands resources while differentiated reliability provides a granular protection scheme. Moreover, if the signal quality in a path is below acceptable values, a path cannot be used by incoming requests for lighpath establishment. Therefore, the signal quality needs to be checked by the routing and wavelength assignment algorithm (RWA). This paper investigates shared path protection with differentiated reliability taking into account the PMD and the ASE impairments in path selection. The efficacy of the algorithm proposed is compared to that of its impairment unaware counterpart.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76969192","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}
Multiple channels in Wireless Sensor Networks (WSNs) are often exploited to support parallel transmission and reduce interference. However, there are many challenges, such as extra communication overhead, posed to the energy constraint of WSNs by the multi-channel usage coordination. In this paper, we propose a Regret Matching based Channel Assignment algorithm (RMCA) to address those challenges. The advantage of RMCA is that it is highly distributed and requires very limited information exchanges among sensor nodes. It converges almost surely to the set of correlated equilibrium. Moreover, RMCA can adapt the channel assignment among sensor nodes to the time-variant flows and network topology. Simulations show that RMCA achieves good network performance in terms of both delivery ratio and packet latency.
{"title":"Regret Matching Based Channel Assignment for Wireless Sensor Networks","authors":"Qing Yu, Jiming Chen, Youxian Sun, Yanfei Fan, Xuemin Shen","doi":"10.1109/ICC.2010.5502547","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502547","url":null,"abstract":"Multiple channels in Wireless Sensor Networks (WSNs) are often exploited to support parallel transmission and reduce interference. However, there are many challenges, such as extra communication overhead, posed to the energy constraint of WSNs by the multi-channel usage coordination. In this paper, we propose a Regret Matching based Channel Assignment algorithm (RMCA) to address those challenges. The advantage of RMCA is that it is highly distributed and requires very limited information exchanges among sensor nodes. It converges almost surely to the set of correlated equilibrium. Moreover, RMCA can adapt the channel assignment among sensor nodes to the time-variant flows and network topology. Simulations show that RMCA achieves good network performance in terms of both delivery ratio and packet latency.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"86 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77146017","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-05-23DOI: 10.1109/ICC.2010.5502341
Tong Shu, Min Liu, Zhongcheng Li, Anfu Zhou
In wireless mesh networks with frequency-agile radios, an algorithm of dynamically combining consecutive channels has recently been proposed. However, the available channel widths are limited in the algorithm. In order to further improve the fairness or the throughput under given fairness, we propose a joint variable width spectrum allocation and link scheduling optimization algorithm. Our algorithm is composed of time division multiple access for no interface conflict and frequency division multiple access for no signal interference. In the first phase, we use as few time slots as possible to assign at least one time slots to each radio link with Max-Min fairness. In the second phase, our design jointly allocates the lengths of time slots as well as the spectral widths and center frequencies of radio links in each time slot. Numerical results indicate that compared to the existing algorithm, our algorithm significantly increases the fairness or the throughput under given fairness.
{"title":"Joint Variable Width Spectrum Allocation and Link Scheduling for Wireless Mesh Networks","authors":"Tong Shu, Min Liu, Zhongcheng Li, Anfu Zhou","doi":"10.1109/ICC.2010.5502341","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502341","url":null,"abstract":"In wireless mesh networks with frequency-agile radios, an algorithm of dynamically combining consecutive channels has recently been proposed. However, the available channel widths are limited in the algorithm. In order to further improve the fairness or the throughput under given fairness, we propose a joint variable width spectrum allocation and link scheduling optimization algorithm. Our algorithm is composed of time division multiple access for no interface conflict and frequency division multiple access for no signal interference. In the first phase, we use as few time slots as possible to assign at least one time slots to each radio link with Max-Min fairness. In the second phase, our design jointly allocates the lengths of time slots as well as the spectral widths and center frequencies of radio links in each time slot. Numerical results indicate that compared to the existing algorithm, our algorithm significantly increases the fairness or the throughput under given fairness.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"63 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80998327","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-05-23DOI: 10.1109/ICC.2010.5502321
Stefania Bartoletti, A. Conti, A. Giorgetti
Radar sensor networks (RSNs) are gaining importance in the context of passive localization and tracking. The performance of RSNs is affected by disturbances, system's parameters, network topology, and the number of radar elements. In this paper, we derive a unified analytical framework that takes all this aspects into account and allows the derivation of probability of detection and localization uncertainty. The results enable the system designer to have a clear understanding on the effects of each system parameter and the trade-off between performance and complexity. Moreover, the potential for high-accuracy passive localization of ultrawide bandwidth (UWB) systems is shown.
{"title":"Analysis of UWB Radar Sensor Networks","authors":"Stefania Bartoletti, A. Conti, A. Giorgetti","doi":"10.1109/ICC.2010.5502321","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502321","url":null,"abstract":"Radar sensor networks (RSNs) are gaining importance in the context of passive localization and tracking. The performance of RSNs is affected by disturbances, system's parameters, network topology, and the number of radar elements. In this paper, we derive a unified analytical framework that takes all this aspects into account and allows the derivation of probability of detection and localization uncertainty. The results enable the system designer to have a clear understanding on the effects of each system parameter and the trade-off between performance and complexity. Moreover, the potential for high-accuracy passive localization of ultrawide bandwidth (UWB) systems is shown.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81122420","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-05-23DOI: 10.1109/ICC.2010.5501953
T. Bian, R. Venkatesan, Cheng Li
An accurate localization scheme is essential to many underwater sensor applications. However, due to the persistent existence of uncertainties and measurement errors, an accurate localization is very difficult to achieve. To mitigate this problem, multi-iteration measurement and least squares scheme are often adopted in terrestrial applications to find a good estimate. But, in underwater applications the multi-iteration scheme is not practical due to high communication cost. Meanwhile, it has been observed that the errors in distance measurement often follow a certain pattern, which can be utilized to further improve on localization accuracy. In the paper, we analyze and utilize the measurement error distributions to better improve localization accuracy. An analytical model is developed for performance evaluation, along with extensive simulations. Both uniform error distribution and normal error distribution are considered in our research. Our results indicate that our proposed probabilistic localization method can significantly improve the localization accuracy over the commonly adopted least squares estimate (LSE) scheme.
{"title":"An Improved Localization Method Using Error Probability Distribution for Underwater Sensor Networks","authors":"T. Bian, R. Venkatesan, Cheng Li","doi":"10.1109/ICC.2010.5501953","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501953","url":null,"abstract":"An accurate localization scheme is essential to many underwater sensor applications. However, due to the persistent existence of uncertainties and measurement errors, an accurate localization is very difficult to achieve. To mitigate this problem, multi-iteration measurement and least squares scheme are often adopted in terrestrial applications to find a good estimate. But, in underwater applications the multi-iteration scheme is not practical due to high communication cost. Meanwhile, it has been observed that the errors in distance measurement often follow a certain pattern, which can be utilized to further improve on localization accuracy. In the paper, we analyze and utilize the measurement error distributions to better improve localization accuracy. An analytical model is developed for performance evaluation, along with extensive simulations. Both uniform error distribution and normal error distribution are considered in our research. Our results indicate that our proposed probabilistic localization method can significantly improve the localization accuracy over the commonly adopted least squares estimate (LSE) scheme.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"45 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78572648","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
扫码关注我们
求助内容：
应助结果提醒方式：