While TCP (transmission control protocol) is an efficient transport protocol in the wired Internet, it performs poorly when used in wireless environments. This is because TCP couples the error and flow control by using packet loss to infer the network congestion and thus the random loss in wireless Internet can inevitably mislead TCP dropping its flow-control window unnecessarily, even if the network is not congested at all. To overcome this problem, we propose the second-order rate-based flow control and the decoupled window-based error-control schemes for high-throughput transport protocols over the wireless networks. The second-order rate control minimizes congestive losses by using the explicit congestion notification (ECN)-bit feedback to adapt the rate-gain parameter to the variations of the round-trip time (RTT) and cross-traffic flows. The error-control scheme detects and selectively retransmits the lost packets caused by either congestion or random-noise/handoffs on wireless links, which is decoupled from the flow control such that the rate control is independent of the random loss of wireless links. Using the fluid analysis, we establish the rate-control model, and derive expressions for throughput, losses, and link-transmission efficiency. Through extensive simulations, the proposed transport protocol is shown to possess the TCP-compatibility in bandwidth while coexisting with TCP-Reno traffics in the wired Internet. Our simulations also verify the analysis, and demonstrate the significant superiority of our scheme to TCP in terms of increasing the average throughput over wireless links and the robustness to the variation of wireless random-loss probability while minimizing the losses and retransmissions.
{"title":"Second-Order Rate-Control Based Transport Protocols Over Mobile Wireless Networks","authors":"Xi Zhang, Hsiao-Hwa Chen, M. Guizani","doi":"10.1109/WCNC.2007.681","DOIUrl":"https://doi.org/10.1109/WCNC.2007.681","url":null,"abstract":"While TCP (transmission control protocol) is an efficient transport protocol in the wired Internet, it performs poorly when used in wireless environments. This is because TCP couples the error and flow control by using packet loss to infer the network congestion and thus the random loss in wireless Internet can inevitably mislead TCP dropping its flow-control window unnecessarily, even if the network is not congested at all. To overcome this problem, we propose the second-order rate-based flow control and the decoupled window-based error-control schemes for high-throughput transport protocols over the wireless networks. The second-order rate control minimizes congestive losses by using the explicit congestion notification (ECN)-bit feedback to adapt the rate-gain parameter to the variations of the round-trip time (RTT) and cross-traffic flows. The error-control scheme detects and selectively retransmits the lost packets caused by either congestion or random-noise/handoffs on wireless links, which is decoupled from the flow control such that the rate control is independent of the random loss of wireless links. Using the fluid analysis, we establish the rate-control model, and derive expressions for throughput, losses, and link-transmission efficiency. Through extensive simulations, the proposed transport protocol is shown to possess the TCP-compatibility in bandwidth while coexisting with TCP-Reno traffics in the wired Internet. Our simulations also verify the analysis, and demonstrate the significant superiority of our scheme to TCP in terms of increasing the average throughput over wireless links and the robustness to the variation of wireless random-loss probability while minimizing the losses and retransmissions.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121127718","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 performance of spatial pre-coding schemes depends on the amount of channel state information available at the transmitter. A novel approach is spatial pre-coding with phase flipping investigated in this paper. The scheme is referred to as spatial phase coding (SPQ). Two flipping criteria, the angle criterion (AC) and the absolute value criterion (AVC), are proposed which change the phase relation of the signals between multiple transmit antennas such that the probability of constructive superposition of the signals at the receiver antenna is increased. Compared to known pre-coding schemes, SPC AVC does not need knowledge about the channel from each transmit antenna for pre-coding. Instead, it requires only information about the absolute value of the superimposed channel. This paper shows that SPC can achieve an array gain additional to the diversity gain. This is not possible with schemes like transmitter antenna selection diversity (SD). The lower bounds for SPC are defined by equal gain transmission (EGT) and maximum ration transmission (MRT).
{"title":"Spatial Pre-Coding with Phase Flipping for Wireless Communications","authors":"S. Kaiser","doi":"10.1109/WCNC.2007.226","DOIUrl":"https://doi.org/10.1109/WCNC.2007.226","url":null,"abstract":"The performance of spatial pre-coding schemes depends on the amount of channel state information available at the transmitter. A novel approach is spatial pre-coding with phase flipping investigated in this paper. The scheme is referred to as spatial phase coding (SPQ). Two flipping criteria, the angle criterion (AC) and the absolute value criterion (AVC), are proposed which change the phase relation of the signals between multiple transmit antennas such that the probability of constructive superposition of the signals at the receiver antenna is increased. Compared to known pre-coding schemes, SPC AVC does not need knowledge about the channel from each transmit antenna for pre-coding. Instead, it requires only information about the absolute value of the superimposed channel. This paper shows that SPC can achieve an array gain additional to the diversity gain. This is not possible with schemes like transmitter antenna selection diversity (SD). The lower bounds for SPC are defined by equal gain transmission (EGT) and maximum ration transmission (MRT).","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127227913","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 propose a novel measure method of information utility for tracking and localization in wireless sensor networks (WSNs). The target moving arbitrarily in WSNs is modeled by Markov chains using a transition matrix. The proposed information utility measurement allows us to expect the next state of the target and identify the informative sensors. Further, compared with existing localization methods, the proposed power-aware sensor selection considers the energy constraint of WSNs. To conserve energy, subsets of sensor nodes are activated based on a combinative measurement including information utility, communication cost, and residual energy. We have implemented the proposed localization system on real motes and experimented in an obstacle-free environment. The experimental results demonstrate that the proposed method outperforms two popular baseline schemes, k-nearest-neighbor and stochastic schemes, at extending the network lifetime. In addition, it balances the energy level of sensors in the network so that energy consumption is spread uniformly over all the sensors.
{"title":"Power-Aware Markov Chain Based Tracking Approach for Wireless Sensor Networks","authors":"Hui Kang, Xiaolin Li, P. Moran","doi":"10.1109/WCNC.2007.769","DOIUrl":"https://doi.org/10.1109/WCNC.2007.769","url":null,"abstract":"We propose a novel measure method of information utility for tracking and localization in wireless sensor networks (WSNs). The target moving arbitrarily in WSNs is modeled by Markov chains using a transition matrix. The proposed information utility measurement allows us to expect the next state of the target and identify the informative sensors. Further, compared with existing localization methods, the proposed power-aware sensor selection considers the energy constraint of WSNs. To conserve energy, subsets of sensor nodes are activated based on a combinative measurement including information utility, communication cost, and residual energy. We have implemented the proposed localization system on real motes and experimented in an obstacle-free environment. The experimental results demonstrate that the proposed method outperforms two popular baseline schemes, k-nearest-neighbor and stochastic schemes, at extending the network lifetime. In addition, it balances the energy level of sensors in the network so that energy consumption is spread uniformly over all the sensors.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127448429","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 network resilience has been studied as a fault tolerance measure in wired networks for decades; however, little effort has been made to analyze the resilience of wireless multi-hop networks, especially in the presence of misbehaving nodes. In this work, we study such a problem: whether there exists an overlay achieving "strong" resilience when misbehaving nodes are present in the underlying wireless multi-hop network. To address this problem, we first introduce two new metrics, k-connected survivability and resilience capacity. The former metric is used to measure the network connectivity probabilistically; while the latter one is used to evaluate the ability of accommodating misbehaving nodes deterministically. We then derive an approximate representation of the k-connected survivability, and provide the close-form representations of resilience capacity for k = 1 and k = 2 and a heuristic algorithm to calculate it when k ges 3. Finally, based on our analytical results, we prove that an overlay can achieve the derived resilience by satisfying three conditions: (i) containing all and only cooperative nodes of the original network; (ii) keeping the minimum cooperative degree at least k; (iii) having Theta (log2 N) neighbors of each node in average.
{"title":"Analyzing Resilience to Node Misbehaviors in Wireless Multi-Hop Networks","authors":"Fei Xing, Wenye Wang","doi":"10.1109/WCNC.2007.640","DOIUrl":"https://doi.org/10.1109/WCNC.2007.640","url":null,"abstract":"The network resilience has been studied as a fault tolerance measure in wired networks for decades; however, little effort has been made to analyze the resilience of wireless multi-hop networks, especially in the presence of misbehaving nodes. In this work, we study such a problem: whether there exists an overlay achieving \"strong\" resilience when misbehaving nodes are present in the underlying wireless multi-hop network. To address this problem, we first introduce two new metrics, k-connected survivability and resilience capacity. The former metric is used to measure the network connectivity probabilistically; while the latter one is used to evaluate the ability of accommodating misbehaving nodes deterministically. We then derive an approximate representation of the k-connected survivability, and provide the close-form representations of resilience capacity for k = 1 and k = 2 and a heuristic algorithm to calculate it when k ges 3. Finally, based on our analytical results, we prove that an overlay can achieve the derived resilience by satisfying three conditions: (i) containing all and only cooperative nodes of the original network; (ii) keeping the minimum cooperative degree at least k; (iii) having Theta (log2 N) neighbors of each node in average.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"18 782 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127455240","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 first overview the least square (LS) space-time joint channel estimation in filtered multi-tone (FMT) system in multi-input multi-output (MIMO) system. Then the design of pilots aiming at mitigating the inter-cell interference in MIMO FMT systems is addressed. It is shown that if the pilots which result in a zero variation coefficient of the estimation error are used, the better performance on system level was obtained. The properties of these pilots are described, and the simulation results are presented.
{"title":"Pilot Sequence Design for Inter-cell Interference Mitigation in MIMO FMT Systems","authors":"Yu Yang, Guixia Kang, Jichao Liu, Ping Zhang","doi":"10.1109/WCNC.2007.230","DOIUrl":"https://doi.org/10.1109/WCNC.2007.230","url":null,"abstract":"In this paper, we first overview the least square (LS) space-time joint channel estimation in filtered multi-tone (FMT) system in multi-input multi-output (MIMO) system. Then the design of pilots aiming at mitigating the inter-cell interference in MIMO FMT systems is addressed. It is shown that if the pilots which result in a zero variation coefficient of the estimation error are used, the better performance on system level was obtained. The properties of these pilots are described, and the simulation results are presented.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127527919","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}
Yun Rui, Mingqi Li, Xiaodong Zhang, L. Tang, Songlin Feng
A noise variance optimization method is proposed for the time and frequency dimension separate (2 times 1D) Wiener-filtered channel estimation of OFDM based systems. According to Wiener-filter theory, the noise variance is necessary to achieve optimal solution. For 2 times 1D Wiener-filtered channel estimation, the Wiener-filtering will be applied twice respectively in time and frequency dimension. However, the effect of variety of noise variance induced by the first filter should be considered on the second filter in this method. In the proposed method, the noise variance used by the second filter is optimized according to the mean square error (MSE) of channel estimation by the first filter. The exact MSE of channel estimation is derived in this paper. Moreover, the channel estimation performance is evaluated with different noise variance optimizing criteria. The simulation results show that the performance of the proposed method is better than the 2 times 1D filters method without noise variance optimization, and is very close to that of the Wiener 2D filter.
{"title":"A Noise Variance Optimization Method for 2x1-Dimensional Wiener Filtered Channel Estimation","authors":"Yun Rui, Mingqi Li, Xiaodong Zhang, L. Tang, Songlin Feng","doi":"10.1109/WCNC.2007.49","DOIUrl":"https://doi.org/10.1109/WCNC.2007.49","url":null,"abstract":"A noise variance optimization method is proposed for the time and frequency dimension separate (2 times 1D) Wiener-filtered channel estimation of OFDM based systems. According to Wiener-filter theory, the noise variance is necessary to achieve optimal solution. For 2 times 1D Wiener-filtered channel estimation, the Wiener-filtering will be applied twice respectively in time and frequency dimension. However, the effect of variety of noise variance induced by the first filter should be considered on the second filter in this method. In the proposed method, the noise variance used by the second filter is optimized according to the mean square error (MSE) of channel estimation by the first filter. The exact MSE of channel estimation is derived in this paper. Moreover, the channel estimation performance is evaluated with different noise variance optimizing criteria. The simulation results show that the performance of the proposed method is better than the 2 times 1D filters method without noise variance optimization, and is very close to that of the Wiener 2D filter.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"42 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124867515","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 time of arrival (TOA)-based indoor geolocation systems ranging error is a function of the bandwidth of the system and the availability of the direct path between the transmitter and the receiver. With a detected direct path (DDP) conditions and ultra wideband (UWB) transmission, precise range estimates are feasible while in undetected direct path (UDP) conditions large ranging errors occur which can not be cured with the increase of the transmission power or bandwidth. UDP conditions are caused by large metallic objects between the transmitter and the receiver or increase in the distance of the transmitter and the receiver so that the direct path fades away but the receiver still receives signal from other paths. For a given location of the transmitter, with respect to the huge metallic objects, the probability of occurrence of the UDP conditions changes. This paper provides an analytical method for calculation of the overall statistics of the ranging error for different location of the transmitter in a typical indoor environment. Results can be used for the analysis of the performance of precise RF localization techniques for sensor networks. Based on this model we show that the IEEE P802.15.3 recommended model is not adequate to represent the behavior of the ranging errors in typical indoor environments.
{"title":"A New Statistical Model for the Behavior of Ranging Errors in TOA-Based Indoor Localization","authors":"M. Heidari, K. Pahlavan","doi":"10.1109/WCNC.2007.477","DOIUrl":"https://doi.org/10.1109/WCNC.2007.477","url":null,"abstract":"In time of arrival (TOA)-based indoor geolocation systems ranging error is a function of the bandwidth of the system and the availability of the direct path between the transmitter and the receiver. With a detected direct path (DDP) conditions and ultra wideband (UWB) transmission, precise range estimates are feasible while in undetected direct path (UDP) conditions large ranging errors occur which can not be cured with the increase of the transmission power or bandwidth. UDP conditions are caused by large metallic objects between the transmitter and the receiver or increase in the distance of the transmitter and the receiver so that the direct path fades away but the receiver still receives signal from other paths. For a given location of the transmitter, with respect to the huge metallic objects, the probability of occurrence of the UDP conditions changes. This paper provides an analytical method for calculation of the overall statistics of the ranging error for different location of the transmitter in a typical indoor environment. Results can be used for the analysis of the performance of precise RF localization techniques for sensor networks. Based on this model we show that the IEEE P802.15.3 recommended model is not adequate to represent the behavior of the ranging errors in typical indoor environments.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124869612","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}
This paper presents a distributed flow-based access scheme for slotted-time protocols that approximates proportional-fairness in ad hoc wireless networks and does not have a significant implementation overhead. We say a medium access control algorithm is proportionally fair with respect to individual end-to-end flows in a network, if the product of the end-to-end flow-success probabilities is maximized. The proposed scheme is implemented using a slotted-time protocol - ST-MAC (Singh, 2004). The authors then compare the performance of the ST-MAC protocol with that of the 802.11-MAC using ns2 simulations of random networks of various sizes. For dense-networks, in terms of packet-delivery-ratios and throughput, the ST-MAC protocol presents an improvement over 802.11-MAC, with comparable end-to-end delay.
{"title":"Approximating Flow-Based Proportional Fairness in Ad-hoc Wireless Networks","authors":"Nikhil Singh, R. Sreenivas","doi":"10.1109/WCNC.2007.33","DOIUrl":"https://doi.org/10.1109/WCNC.2007.33","url":null,"abstract":"This paper presents a distributed flow-based access scheme for slotted-time protocols that approximates proportional-fairness in ad hoc wireless networks and does not have a significant implementation overhead. We say a medium access control algorithm is proportionally fair with respect to individual end-to-end flows in a network, if the product of the end-to-end flow-success probabilities is maximized. The proposed scheme is implemented using a slotted-time protocol - ST-MAC (Singh, 2004). The authors then compare the performance of the ST-MAC protocol with that of the 802.11-MAC using ns2 simulations of random networks of various sizes. For dense-networks, in terms of packet-delivery-ratios and throughput, the ST-MAC protocol presents an improvement over 802.11-MAC, with comparable end-to-end delay.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125969097","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-input multiple output (MIMO) techniques can be applied to radio systems to enhance performance in fading channels, to exploit spatial and temporal diversity, and to increase the potential transmission rate. Here we investigate the combination of decision feedback equalizers (DFE's) with Alamouti space-time block codes (STBQ) in time-varying wideband channels. Most prior work considers the use of STBC in flat-fading channels. However, for many mobile applications, time and frequency selectivity in the wireless channel must be included in the analysis. As a result of delay spread and terminal mobility, the transmitted data stream can suffer from severe time varying inter symbol interference (ISI) which requires a form of channel equalization. For a quasi-static environment Alamouti's linear combining scheme provides a reliable and low complexity MIMO solution when perfect channel state information (CSI) is available. In this paper we address the mitigation of wideband channels effects on Alamouti STBC codes. The study considers the minimum mean square error (MMSE) performance as a function of channel estimation error for maximum likelihood (ML) and DFE equalizers.
{"title":"Impact of Channel Estimation Errors on the Performance of DFE Equalizers with Space Time Block Codes in Wideband Fading Channels","authors":"Mohamed Noune, A. Nix","doi":"10.1109/WCNC.2007.419","DOIUrl":"https://doi.org/10.1109/WCNC.2007.419","url":null,"abstract":"Multiple-input multiple output (MIMO) techniques can be applied to radio systems to enhance performance in fading channels, to exploit spatial and temporal diversity, and to increase the potential transmission rate. Here we investigate the combination of decision feedback equalizers (DFE's) with Alamouti space-time block codes (STBQ) in time-varying wideband channels. Most prior work considers the use of STBC in flat-fading channels. However, for many mobile applications, time and frequency selectivity in the wireless channel must be included in the analysis. As a result of delay spread and terminal mobility, the transmitted data stream can suffer from severe time varying inter symbol interference (ISI) which requires a form of channel equalization. For a quasi-static environment Alamouti's linear combining scheme provides a reliable and low complexity MIMO solution when perfect channel state information (CSI) is available. In this paper we address the mitigation of wideband channels effects on Alamouti STBC codes. The study considers the minimum mean square error (MMSE) performance as a function of channel estimation error for maximum likelihood (ML) and DFE equalizers.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123322695","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}
R. Wang, Sujeet Pradhanang, P. Manandhar, Qian Zhang
The consultative committee for space data systems (CCSDS) file delivery protocol (CFDP) operates in a store-and-forward model to ensure the efficient transfer of information in a wide variety of mission configurations, from relatively low earth-orbiting spacecrafts to complex arrangements of inter-planetary space links. The performance of CFDP in the deferred NAK mode has been evaluated in a theoretical manner. In this paper, we present an experimental performance evaluation of CFDP in the deferred NAK mode over direct point to point low earth orbit (LEO)-satellite links simulated using a test-bed. We compare CFDP/TCP with the commonly used TCP and space communication protocol standards (SCPS) protocol stacks to see which one is more effective over a LEO-satellite link. The evaluation results show that CFDP outperform other two protocols over lossy and asymmetric channels. We found that CFDP is more tolerant of heavy noise and asymmetric channel rate. The superior performance of CFDP over lossy links is attributed to that data are stored pending transmission opportunity and portions of file can be made available to the user as soon as they arrive and its ability to minimize link traffic because of aggregated selective negative acknowledgements.
{"title":"Performance Evaluation of CFDP in Deferred NAK Mode over Point-to-Point LEO-Satellite Links","authors":"R. Wang, Sujeet Pradhanang, P. Manandhar, Qian Zhang","doi":"10.1109/WCNC.2007.679","DOIUrl":"https://doi.org/10.1109/WCNC.2007.679","url":null,"abstract":"The consultative committee for space data systems (CCSDS) file delivery protocol (CFDP) operates in a store-and-forward model to ensure the efficient transfer of information in a wide variety of mission configurations, from relatively low earth-orbiting spacecrafts to complex arrangements of inter-planetary space links. The performance of CFDP in the deferred NAK mode has been evaluated in a theoretical manner. In this paper, we present an experimental performance evaluation of CFDP in the deferred NAK mode over direct point to point low earth orbit (LEO)-satellite links simulated using a test-bed. We compare CFDP/TCP with the commonly used TCP and space communication protocol standards (SCPS) protocol stacks to see which one is more effective over a LEO-satellite link. The evaluation results show that CFDP outperform other two protocols over lossy and asymmetric channels. We found that CFDP is more tolerant of heavy noise and asymmetric channel rate. The superior performance of CFDP over lossy links is attributed to that data are stored pending transmission opportunity and portions of file can be made available to the user as soon as they arrive and its ability to minimize link traffic because of aggregated selective negative acknowledgements.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"27 3-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123580260","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
扫码关注我们
求助内容：
应助结果提醒方式：