Pub Date : 2008-12-04DOI: 10.1109/ACSSC.2008.5074454
T. Michel, S. Hensley
Synthetic Aperture Radar systems provide raw data that need focusing to achieve full-resolution imaging. Current SAR applications, including interferometry, require accurate, phase-preserving, and precisely co-registered coherent images over large ground swaths with the highest achievable resolution. In addition to these challenges, stripmap SAR data may be acquired with an off-broadside (squinted) geometry, either by design or through platform motion. The precise batch focusing of these large aperture and wide bandwidth data sets is known to require a 2D frequency processing approach. The standard wave domain focusing algorithm, however, is only exact for data acquired on a rectilinear trajectory. We investigate a generalization of the standard omega-k focusing formulation that allows curved data acquisition tracks. The new formulation can be used in conjunction with a known extension for conical, squinted imaging grids. The approximations necessary to allow the generalized geometry are analysed to determines the range of applicability of the proposed algorithm. The theory is validated using data simulated with parameters similar to the UAVSAR L-band SAR system.
{"title":"Wavenumber domain focusing of squinted SAR data with a curved orbit geometry","authors":"T. Michel, S. Hensley","doi":"10.1109/ACSSC.2008.5074454","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074454","url":null,"abstract":"Synthetic Aperture Radar systems provide raw data that need focusing to achieve full-resolution imaging. Current SAR applications, including interferometry, require accurate, phase-preserving, and precisely co-registered coherent images over large ground swaths with the highest achievable resolution. In addition to these challenges, stripmap SAR data may be acquired with an off-broadside (squinted) geometry, either by design or through platform motion. The precise batch focusing of these large aperture and wide bandwidth data sets is known to require a 2D frequency processing approach. The standard wave domain focusing algorithm, however, is only exact for data acquired on a rectilinear trajectory. We investigate a generalization of the standard omega-k focusing formulation that allows curved data acquisition tracks. The new formulation can be used in conjunction with a known extension for conical, squinted imaging grids. The approximations necessary to allow the generalized geometry are analysed to determines the range of applicability of the proposed algorithm. The theory is validated using data simulated with parameters similar to the UAVSAR L-band SAR system.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280075","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 : 2008-12-01DOI: 10.1109/ACSSC.2008.5074672
R. Vaze, R. Heath
Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Assuming a low-rate feedback link from the destination to each relay stage and the source, this paper proposes end-to-end antenna selection strategies to achieve maximum diversity gain in a multi-hop relay channel. For the full-duplex case, end-to-end antenna selection strategies are designed and proven to achieve maximum diversity gain by using a single antenna path (using single antenna of the source, each relay stage and the destination) with the maximum signal-to-noise ratio at the destination. For the half-duplex case, two paths with the two best signal-to-noise ratios in alternate time slots are used to overcome the rate loss with half-duplex nodes, with a small diversity gain penalty. To increase the multiplexing gain, a multiple stream end-to-end antenna selection strategy for full-duplex multi-hop relay channel is also proposed, where multiple data streams are transmitted simultaneously using multiple paths from the source to the destination.
{"title":"End-to-end antenna selection strategies for multi-hop relay channels","authors":"R. Vaze, R. Heath","doi":"10.1109/ACSSC.2008.5074672","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074672","url":null,"abstract":"Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Assuming a low-rate feedback link from the destination to each relay stage and the source, this paper proposes end-to-end antenna selection strategies to achieve maximum diversity gain in a multi-hop relay channel. For the full-duplex case, end-to-end antenna selection strategies are designed and proven to achieve maximum diversity gain by using a single antenna path (using single antenna of the source, each relay stage and the destination) with the maximum signal-to-noise ratio at the destination. For the half-duplex case, two paths with the two best signal-to-noise ratios in alternate time slots are used to overcome the rate loss with half-duplex nodes, with a small diversity gain penalty. To increase the multiplexing gain, a multiple stream end-to-end antenna selection strategy for full-duplex multi-hop relay channel is also proposed, where multiple data streams are transmitted simultaneously using multiple paths from the source to the destination.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123934015","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 : 2008-12-01DOI: 10.1109/ACSSC.2008.5074659
H. Ganapathy, J. Andrews, C. Caramanis
Consider a multi-cell relay-assisted time-division uplink system, i.e. one active user per time slot per cell with a relay serving that user. In this paper, we are concerned with heterogeneous networks (networks with unbalanced spatial loads) and we are interested in techniques for increasing the data rate in a congested cell. We propose inter-cell relay cooperation with single-cell decoding as one such solution. In this technique, relays of different cells cooperate to determine optimum precoding weights, but the base stations do not communicate. We compare this strategy to another technique of current interest: base station cooperation through multi-cell decoding, where each cell has a single relay that amplifies and forwards the desired transmission to the base station, and all the base stations cooperatively decode the signals received at each. There will be distinct architectural and implementation consequences for each approach, and inter-cell relay cooperation with single-cell decoding may require less overhead and expense than base station cooperation through multi-cell decoding. Despite this, we see that in some likely channel and interference scenarios, the former actually outperforms the latter. The key contribution of this paper is to propose inter-cell relay cooperation as a promising technology for increasing data rates in heterogeneous cellular uplink networks.
{"title":"Inter-cell relay cooperation in heterogeneous cellular uplink systems","authors":"H. Ganapathy, J. Andrews, C. Caramanis","doi":"10.1109/ACSSC.2008.5074659","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074659","url":null,"abstract":"Consider a multi-cell relay-assisted time-division uplink system, i.e. one active user per time slot per cell with a relay serving that user. In this paper, we are concerned with heterogeneous networks (networks with unbalanced spatial loads) and we are interested in techniques for increasing the data rate in a congested cell. We propose inter-cell relay cooperation with single-cell decoding as one such solution. In this technique, relays of different cells cooperate to determine optimum precoding weights, but the base stations do not communicate. We compare this strategy to another technique of current interest: base station cooperation through multi-cell decoding, where each cell has a single relay that amplifies and forwards the desired transmission to the base station, and all the base stations cooperatively decode the signals received at each. There will be distinct architectural and implementation consequences for each approach, and inter-cell relay cooperation with single-cell decoding may require less overhead and expense than base station cooperation through multi-cell decoding. Despite this, we see that in some likely channel and interference scenarios, the former actually outperforms the latter. The key contribution of this paper is to propose inter-cell relay cooperation as a promising technology for increasing data rates in heterogeneous cellular uplink networks.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132800421","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 : 2008-12-01DOI: 10.1109/ACSSC.2008.5074767
T. K. Liang, Toshiyuki Tanaka, Hidetoshi Nakamura, T. Shirahata, H. Sugiura
Chronic obstructive pulmonary disease (COPD) is a disease in which the airways and tiny air sacs (alveoli) inside the lungs are partially obstructed or destroyed. Emphysema is what occurs as more and more of the walls between air sacs get destroyed. Computed tomography (CT) image has been a useful modality for assessing diffuse lung diseases, particularly, emphysema. At present, diagnosis of emphysema is done by using spirometry, X-rays, spiral chest computed tomography (CT)-scan, bronchoscopy, blood tests and pulse oximetry. In this study, we extracted the two-dimensional emphysematous lung tissues in the lung CT automatically using digital image processing techniques, then we visualized the extracted emphysematous lung tissues by implementing a three-dimensional (3D) lung model which was computed using 55 pre-processed CT images, and finally we divided the lung model into eight sub-volumes and classified each sub-volume into five classes of emphysema related severity using an artificial neural network. The performance of the classifier was assessed using the leave-one-out method on 120 sub-volumes of the lungs generated from 15 COPD-verified patients' CT data sets.
{"title":"An automated three-dimensional visualization and classification of emphysema using neural network","authors":"T. K. Liang, Toshiyuki Tanaka, Hidetoshi Nakamura, T. Shirahata, H. Sugiura","doi":"10.1109/ACSSC.2008.5074767","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074767","url":null,"abstract":"Chronic obstructive pulmonary disease (COPD) is a disease in which the airways and tiny air sacs (alveoli) inside the lungs are partially obstructed or destroyed. Emphysema is what occurs as more and more of the walls between air sacs get destroyed. Computed tomography (CT) image has been a useful modality for assessing diffuse lung diseases, particularly, emphysema. At present, diagnosis of emphysema is done by using spirometry, X-rays, spiral chest computed tomography (CT)-scan, bronchoscopy, blood tests and pulse oximetry. In this study, we extracted the two-dimensional emphysematous lung tissues in the lung CT automatically using digital image processing techniques, then we visualized the extracted emphysematous lung tissues by implementing a three-dimensional (3D) lung model which was computed using 55 pre-processed CT images, and finally we divided the lung model into eight sub-volumes and classified each sub-volume into five classes of emphysema related severity using an artificial neural network. The performance of the classifier was assessed using the leave-one-out method on 120 sub-volumes of the lungs generated from 15 COPD-verified patients' CT data sets.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122420589","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 : 2008-12-01DOI: 10.1109/ACSSC.2008.5074802
Yang Liu, Tong Zhang, K. Parhi
This work concerns the design of low power signal processing systems at overscaled supply voltage, in which the behavior of computer arithmetic units in response to overscaled voltage plays an importance role. We show that different hardware implementations of the same computer arithmetic function may respond to overscaled voltage very differently and result in different energy saving potential. Therefore, we develop an analytical approach to estimate the statistics of computer arithmetic computation errors due to supply voltages overscaling. Compared with computation intensive circuit simulations, this analytical approach can be several orders of magnitude faster and meanwhile achieve a reasonable accuracy.
{"title":"Analysis of voltage overscaled computer arithmetics in low power signal processing systems","authors":"Yang Liu, Tong Zhang, K. Parhi","doi":"10.1109/ACSSC.2008.5074802","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074802","url":null,"abstract":"This work concerns the design of low power signal processing systems at overscaled supply voltage, in which the behavior of computer arithmetic units in response to overscaled voltage plays an importance role. We show that different hardware implementations of the same computer arithmetic function may respond to overscaled voltage very differently and result in different energy saving potential. Therefore, we develop an analytical approach to estimate the statistics of computer arithmetic computation errors due to supply voltages overscaling. Compared with computation intensive circuit simulations, this analytical approach can be several orders of magnitude faster and meanwhile achieve a reasonable accuracy.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123788159","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 : 2008-12-01DOI: 10.1109/ACSSC.2008.5074392
A. Petropulu, Yaojiang Yu, H. Poor
A distributed MIMO radar is considered, in which the transmit and receive antennas belong to nodes of a small scale wireless network. The transmit waveforms could be uncorrelated, or correlated in order to achieve a desirable beampattern. The concept of compressive sampling is employed at the receive nodes in order to perform direction of arrival (DOA) estimation. According to the theory of compressive sampling, a signal that is sparse in some domain can be recovered based on far fewer samples than required by the Nyquist sampling theorem. The DOAs of targets form a sparse vector in the angle space, and therefore, compressive sampling can be applied for DOA estimation. The proposed approach achieves the superior resolution of MIMO radar with far fewer samples than other approaches. This is particularly useful in a distributed scenario, in which the results at each receive node need to be transmitted to a fusion center.
{"title":"Distributed MIMO radar using compressive sampling","authors":"A. Petropulu, Yaojiang Yu, H. Poor","doi":"10.1109/ACSSC.2008.5074392","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074392","url":null,"abstract":"A distributed MIMO radar is considered, in which the transmit and receive antennas belong to nodes of a small scale wireless network. The transmit waveforms could be uncorrelated, or correlated in order to achieve a desirable beampattern. The concept of compressive sampling is employed at the receive nodes in order to perform direction of arrival (DOA) estimation. According to the theory of compressive sampling, a signal that is sparse in some domain can be recovered based on far fewer samples than required by the Nyquist sampling theorem. The DOAs of targets form a sparse vector in the angle space, and therefore, compressive sampling can be applied for DOA estimation. The proposed approach achieves the superior resolution of MIMO radar with far fewer samples than other approaches. This is particularly useful in a distributed scenario, in which the results at each receive node need to be transmitted to a fusion center.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130564434","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 : 2008-12-01DOI: 10.1109/ACSSC.2008.5074677
Chao Cheng, K. Parhi
In this paper, a novel pipelined algorithm is applied in the hardware implementation of Smith-Waterman algorithm. The proposed algorithm can cut down the computation time from O(m+n) to O(m+n/J), where J is the pipeline level, m and n are the lengths of the query sequence and subject sequence respectively. It's obvious that if the length of subject sequence is much larger than the query sequence, i.e., n>>m, the computation of scanning protein sequences will be speeded up by a factor of J.
{"title":"High-speed implementation of Smith-Waterman algorithm for DNA sequence scanning in VLSI","authors":"Chao Cheng, K. Parhi","doi":"10.1109/ACSSC.2008.5074677","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074677","url":null,"abstract":"In this paper, a novel pipelined algorithm is applied in the hardware implementation of Smith-Waterman algorithm. The proposed algorithm can cut down the computation time from O(m+n) to O(m+n/J), where J is the pipeline level, m and n are the lengths of the query sequence and subject sequence respectively. It's obvious that if the length of subject sequence is much larger than the query sequence, i.e., n>>m, the computation of scanning protein sequences will be speeded up by a factor of J.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132884838","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 : 2008-12-01DOI: 10.1109/ACSSC.2008.5074599
Hao Zhu, A. Cano, G. Giannakis
This paper deals with demodulation of space-time transmissions from a multi-antenna access point to a network of spatially distributed wireless sensors. Distributed demodulation algorithms are developed by achieving network-wide consensus on the average of (cross-) covariances of locally available per sensor received data vectors with the channel matrix, which constitute sufficient statistics for maximum likelihood demodulation. By reaching consensus on such average terms, each sensor can attain demodulation performance as if all the information was available at a centralized unit. Different from existing distributed hypotheses testing schemes whose complexity grows exponentially with the problem dimension, the novel consensus-based demodulator incurs quadratic complexity. Inter-sensor link imperfections due to additive noise and random link failures are also accounted for. Consensus in these cases is achieved in the mean sense with bounded variance, and in the mean-square error sense, respectively. Simulated tests verify the analytical claims. Interestingly, only a few consensus iterations suffice for the novel distributed demodulator to approach the performance of its centralized benchmark.
{"title":"Distributed demodulation using consensus averaging in wireless sensor networks","authors":"Hao Zhu, A. Cano, G. Giannakis","doi":"10.1109/ACSSC.2008.5074599","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074599","url":null,"abstract":"This paper deals with demodulation of space-time transmissions from a multi-antenna access point to a network of spatially distributed wireless sensors. Distributed demodulation algorithms are developed by achieving network-wide consensus on the average of (cross-) covariances of locally available per sensor received data vectors with the channel matrix, which constitute sufficient statistics for maximum likelihood demodulation. By reaching consensus on such average terms, each sensor can attain demodulation performance as if all the information was available at a centralized unit. Different from existing distributed hypotheses testing schemes whose complexity grows exponentially with the problem dimension, the novel consensus-based demodulator incurs quadratic complexity. Inter-sensor link imperfections due to additive noise and random link failures are also accounted for. Consensus in these cases is achieved in the mean sense with bounded variance, and in the mean-square error sense, respectively. Simulated tests verify the analytical claims. Interestingly, only a few consensus iterations suffice for the novel distributed demodulator to approach the performance of its centralized benchmark.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126135245","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 : 2008-12-01DOI: 10.1109/ACSSC.2008.5074464
G. Fudge, Ross E. Bland, M. Chivers, Sujit Ravindran, J. Haupt, Phillip E. Pace
Many radar and communications applications require detection and estimation of signal information across an extremely wide radio frequency (RF) bandwidth. In practice, however, direct digitization of this broadband RF environment is problematic. Physical limitations in analog-to-digital converter (ADC) technology restrict the total bandwidth that can be digitized, as well as the ability to digitize high RF signals directly. This paper describes a novel ldquoanalog-to-informationrdquo receiver, motivated by recent developments in compressed sensing (CS), which overcomes both of these challenges in certain settings. The proposed receiver performs frequency modulated pulsed sampling at sub-Nyquist/Shannon rates to compress a broadband RF environment into an analog interpolation filter. The RF sample clock modulation induces a Nyquist-zone dependent frequency modulation on the received signals, allowing separation and recovery of the signal information from a sparse broadband RF environment.
{"title":"A Nyquist folding analog-to-information receiver","authors":"G. Fudge, Ross E. Bland, M. Chivers, Sujit Ravindran, J. Haupt, Phillip E. Pace","doi":"10.1109/ACSSC.2008.5074464","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074464","url":null,"abstract":"Many radar and communications applications require detection and estimation of signal information across an extremely wide radio frequency (RF) bandwidth. In practice, however, direct digitization of this broadband RF environment is problematic. Physical limitations in analog-to-digital converter (ADC) technology restrict the total bandwidth that can be digitized, as well as the ability to digitize high RF signals directly. This paper describes a novel ldquoanalog-to-informationrdquo receiver, motivated by recent developments in compressed sensing (CS), which overcomes both of these challenges in certain settings. The proposed receiver performs frequency modulated pulsed sampling at sub-Nyquist/Shannon rates to compress a broadband RF environment into an analog interpolation filter. The RF sample clock modulation induces a Nyquist-zone dependent frequency modulation on the received signals, allowing separation and recovery of the signal information from a sparse broadband RF environment.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128317942","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 : 2008-10-26DOI: 10.1109/ACSSC.2008.5074538
Hyunchul Kim, H. Sadjadpour, J. Garcia-Luna-Aceves
In this paper, we compute the throughput capacity of wireless ad hoc network when nodes are capable of multi-packet reception (MPR) under the physical model. Earlier results show that the optimistic protocol model [1] provides a tight bound of Theta(D(n)) where D(n) and n denote the decoding range and the number of nodes in the network respectively. On the other hand, the throughput capacity under the more practical physical model using successive interference cancelation (SIC) [2] has a tight bound of Theta(D(n)(1-2/Theta)/n1/Theta) where Theta is the path loss parameter. Motivated by the fact that protocol model provides higher throughput capacity than physical model, we investigated the throughput capacity with MPR in physical model utilizing maximum likelihood decoding(MLD) algorithm. Using this optimum decoding strategy, we demonstrate that the physical and protocol models render the same capacity.
{"title":"A closer look at the physical and protocol models for wireless ad hoc networks with multi-packet reception","authors":"Hyunchul Kim, H. Sadjadpour, J. Garcia-Luna-Aceves","doi":"10.1109/ACSSC.2008.5074538","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074538","url":null,"abstract":"In this paper, we compute the throughput capacity of wireless ad hoc network when nodes are capable of multi-packet reception (MPR) under the physical model. Earlier results show that the optimistic protocol model [1] provides a tight bound of Theta(D(n)) where D(n) and n denote the decoding range and the number of nodes in the network respectively. On the other hand, the throughput capacity under the more practical physical model using successive interference cancelation (SIC) [2] has a tight bound of Theta(D(n)(1-2/Theta)/n1/Theta) where Theta is the path loss parameter. Motivated by the fact that protocol model provides higher throughput capacity than physical model, we investigated the throughput capacity with MPR in physical model utilizing maximum likelihood decoding(MLD) algorithm. Using this optimum decoding strategy, we demonstrate that the physical and protocol models render the same capacity.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125519004","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
扫码关注我们
求助内容：
应助结果提醒方式：