Pub Date : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578419
Seshan Srirangarajan, A. Tewfik
This paper addresses ranging in indoor quasi-static sensor environments and presents a time-of-arrival (TOA) based ranging algorithm. A statistical model of the multipath channel in the form of the signal return and noise characterization is derived, and utilized to distinguish signal components from noise. The algorithm then uses multiple signal receptions at each base station, to differentiate between line-of-sight (LOS) and non-LOS components, and to accurately estimate the position of the LOS component in the received multipath signal. The location is estimated through a mathematical programming problem formulation. Using a synthesized bandwidth of 2 GHz, a 4-bit analog-to-digital converter (ADC) and with 5-10 dB signal-to-noise ratio (SNR), range estimation with sub-meter accuracy is achieved. Furthermore, the associated range estimation error does not increase with increase in the transmitter-receiver range
{"title":"Localization in wireless sensor networks under non line-of-sight propagation","authors":"Seshan Srirangarajan, A. Tewfik","doi":"10.1109/GLOCOM.2005.1578419","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578419","url":null,"abstract":"This paper addresses ranging in indoor quasi-static sensor environments and presents a time-of-arrival (TOA) based ranging algorithm. A statistical model of the multipath channel in the form of the signal return and noise characterization is derived, and utilized to distinguish signal components from noise. The algorithm then uses multiple signal receptions at each base station, to differentiate between line-of-sight (LOS) and non-LOS components, and to accurately estimate the position of the LOS component in the received multipath signal. The location is estimated through a mathematical programming problem formulation. Using a synthesized bandwidth of 2 GHz, a 4-bit analog-to-digital converter (ADC) and with 5-10 dB signal-to-noise ratio (SNR), range estimation with sub-meter accuracy is achieved. Furthermore, the associated range estimation error does not increase with increase in the transmitter-receiver range","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130629681","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578286
Vikas Paliwal, B. Nandy, I. Lambadaris
The increasing need for enhanced data services in cellular networks requires sharing of scarce wireless channel resources among the mobile users by dynamic channel assignments. It has been shown in previous works that such a scheme causes queue management problems in the buffers shared by multiple mobiles, e.g. the input buffer at base station controller (BSC), when their rates are increased after a period of lower aggregate data rate in radio links. Traditionally buffer management techniques like random early detection (RED) are used for a single buffer only. In this paper, we extend the RED algorithm to an aggregated queueing algorithm (AQuA) that simultaneously regulates the queueing discipline in both the shared and individual link buffers so that buffer overflow problems after aggregate link rate increase do not occur. Our algorithm relies on standard information on queueing backlog in link buffers available at BSC to perform buffer management in a unified manner with shared buffer. Furthermore, we demonstrate that our approach provides significantly greater determinism in packet transit delays over BSC and greater throughputs and similar levels of fairness as RED mechanism in shared buffers in conjunction with unregulated link buffers
{"title":"AQuA: aggregated queueing algorithm for CDMA2000 base station controll","authors":"Vikas Paliwal, B. Nandy, I. Lambadaris","doi":"10.1109/GLOCOM.2005.1578286","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578286","url":null,"abstract":"The increasing need for enhanced data services in cellular networks requires sharing of scarce wireless channel resources among the mobile users by dynamic channel assignments. It has been shown in previous works that such a scheme causes queue management problems in the buffers shared by multiple mobiles, e.g. the input buffer at base station controller (BSC), when their rates are increased after a period of lower aggregate data rate in radio links. Traditionally buffer management techniques like random early detection (RED) are used for a single buffer only. In this paper, we extend the RED algorithm to an aggregated queueing algorithm (AQuA) that simultaneously regulates the queueing discipline in both the shared and individual link buffers so that buffer overflow problems after aggregate link rate increase do not occur. Our algorithm relies on standard information on queueing backlog in link buffers available at BSC to perform buffer management in a unified manner with shared buffer. Furthermore, we demonstrate that our approach provides significantly greater determinism in packet transit delays over BSC and greater throughputs and similar levels of fairness as RED mechanism in shared buffers in conjunction with unregulated link buffers","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"14 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133742878","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578042
Kun-Chien Hung, D. Lin
We develop an adaptive decision-feedback equalization algorithm that combines blind adaptation and decision-directed LMS in a dynamic manner according to the amount of equalizer output error. By observing how the mean-square blind equalization error depends on the adaptation step size, we obtain a way of continuously varying the adaptation speed of the overall algorithm with the equalizer output error as well as a way to shift the relative emphasis between blind and decision-directed LMS operation. We also describe the way to estimate the amount of equalizer output error in the algorithm. Simulation results show that the proposed algorithm can achieve faster convergence at a lower complexity than some recently proposed hybrid adaptation algorithms
{"title":"A hybrid variable step-size adaptive blind equalization algorithm for QAM signals","authors":"Kun-Chien Hung, D. Lin","doi":"10.1109/GLOCOM.2005.1578042","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578042","url":null,"abstract":"We develop an adaptive decision-feedback equalization algorithm that combines blind adaptation and decision-directed LMS in a dynamic manner according to the amount of equalizer output error. By observing how the mean-square blind equalization error depends on the adaptation step size, we obtain a way of continuously varying the adaptation speed of the overall algorithm with the equalizer output error as well as a way to shift the relative emphasis between blind and decision-directed LMS operation. We also describe the way to estimate the amount of equalizer output error in the algorithm. Simulation results show that the proposed algorithm can achieve faster convergence at a lower complexity than some recently proposed hybrid adaptation algorithms","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130716567","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578393
Jong-ok Kim, H. Tode, K. Murakami
One of the promising solutions to combat wireless channel fluctuations in IEEE 802.11 networks is to appropriately exploit multi-rate capability of the physical layer. The mechanism to adaptively select actual transmission rates based on channel condition is generally referred to as RA (rate adaptation). Recently, T-RA (throughput-based rate adaptation) has been proposed to maximize system capacity. On the other hand, for multimedia traffic, E-RA (error-based rate adaptation) has been proposed, which guarantees target error rate. In this paper, we newly propose S-RA (service-based rate adaptation) which dynamically selects an RA method suitable for the traffic type of transmission packets. T-RA is employed for best-effort data while E-RA for real-time multimedia. Thus, in S-RA, different RA schemes are adaptively chosen on per-packet basis. The proposed S-RA architecture can be incorporated into the 802.11e QoS MAC where traffics are classified into multiple classes by their QoS requirements. Combined with 802.11e, the S-RA architecture can contribute to better QoS enhancement of real-time traffic, while preserving consistent BE throughput when compared with only T-RA or E-RA
{"title":"Service-based rate adaptation architecture for IEEE 802.11e QoS networks","authors":"Jong-ok Kim, H. Tode, K. Murakami","doi":"10.1109/GLOCOM.2005.1578393","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578393","url":null,"abstract":"One of the promising solutions to combat wireless channel fluctuations in IEEE 802.11 networks is to appropriately exploit multi-rate capability of the physical layer. The mechanism to adaptively select actual transmission rates based on channel condition is generally referred to as RA (rate adaptation). Recently, T-RA (throughput-based rate adaptation) has been proposed to maximize system capacity. On the other hand, for multimedia traffic, E-RA (error-based rate adaptation) has been proposed, which guarantees target error rate. In this paper, we newly propose S-RA (service-based rate adaptation) which dynamically selects an RA method suitable for the traffic type of transmission packets. T-RA is employed for best-effort data while E-RA for real-time multimedia. Thus, in S-RA, different RA schemes are adaptively chosen on per-packet basis. The proposed S-RA architecture can be incorporated into the 802.11e QoS MAC where traffics are classified into multiple classes by their QoS requirements. Combined with 802.11e, the S-RA architecture can contribute to better QoS enhancement of real-time traffic, while preserving consistent BE throughput when compared with only T-RA or E-RA","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130957097","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578298
Takao Someya, T. Ohtsuki
In recent years, multiple-input multiple-output (MIMO) systems, which use several transmit and receive antennas, have attracted much attention for high performance radio systems. In MIMO systems, the channel estimation is important to distinguish transmit signals from multiple transmit antennas. While the space-alternating generalized expectation-maximization (SAGE) algorithm is known to offer good channel estimation and data detection. We proposed earlier the minimum mean square error (MMSE)-based SAGE algorithm for MIMO systems where the MMSE estimation is used for channel estimation. We showed that the proposed MMSE-based SAGE algorithm can achieve the better bit error rate (BER) than the maximum likelihood (ML) detection with training symbols. The MMSE channel estimation needs the knowledge of the maximum Doppler frequency Fd for deriving the covariance matrix of the channel and the variance sigma2 of additive white Gaussian noise (AWGN). Additionally, the computation of the MMSE channel estimation requires O(L3) operations where L is the transmitted frame length. Thus, its computational complexity is high. In this paper, we propose a zero-forcing (ZF)-based SAGE algorithm for channel estimation and data detection in MIMO systems that does not need the knowledge of Fd and sigma2. Since the computation of the proposed ZF-based SAGE algorithm requires O(N3) operations where N is the number of transmit antennas, its computational complexity is low. We show that the proposed ZF-based tracking SAGE algorithm with less computational complexity can achieve almost the same BER as that of the MMSE-based tracking SAGE algorithm
{"title":"Channel estimation and data detection with tracking channel variation in MIMO system using ZF-based SAGE algorithm","authors":"Takao Someya, T. Ohtsuki","doi":"10.1109/GLOCOM.2005.1578298","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578298","url":null,"abstract":"In recent years, multiple-input multiple-output (MIMO) systems, which use several transmit and receive antennas, have attracted much attention for high performance radio systems. In MIMO systems, the channel estimation is important to distinguish transmit signals from multiple transmit antennas. While the space-alternating generalized expectation-maximization (SAGE) algorithm is known to offer good channel estimation and data detection. We proposed earlier the minimum mean square error (MMSE)-based SAGE algorithm for MIMO systems where the MMSE estimation is used for channel estimation. We showed that the proposed MMSE-based SAGE algorithm can achieve the better bit error rate (BER) than the maximum likelihood (ML) detection with training symbols. The MMSE channel estimation needs the knowledge of the maximum Doppler frequency Fd for deriving the covariance matrix of the channel and the variance sigma2 of additive white Gaussian noise (AWGN). Additionally, the computation of the MMSE channel estimation requires O(L3) operations where L is the transmitted frame length. Thus, its computational complexity is high. In this paper, we propose a zero-forcing (ZF)-based SAGE algorithm for channel estimation and data detection in MIMO systems that does not need the knowledge of Fd and sigma2. Since the computation of the proposed ZF-based SAGE algorithm requires O(N3) operations where N is the number of transmit antennas, its computational complexity is low. We show that the proposed ZF-based tracking SAGE algorithm with less computational complexity can achieve almost the same BER as that of the MMSE-based tracking SAGE algorithm","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114548707","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578469
Tairan Wang, Yingwei Yao, G. Giannakis
User cooperation can provide spatial transmit diversity gains, enhance coverage and potentially increase capacity. Existing works have focused on two-user cooperative systems with perfect channel state information at the receivers. In this paper, we develop several distributed space-time processing schemes for general TV-user cooperative systems, which do not require channel state information at either relays or destination. We prove that full spatial diversity gain can be achieved in such systems. Simulations demonstrate that these cooperative schemes achieve significant performance gain
{"title":"Non-coherent distributed space-time processing for multiuser cooperative transmissions","authors":"Tairan Wang, Yingwei Yao, G. Giannakis","doi":"10.1109/GLOCOM.2005.1578469","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578469","url":null,"abstract":"User cooperation can provide spatial transmit diversity gains, enhance coverage and potentially increase capacity. Existing works have focused on two-user cooperative systems with perfect channel state information at the receivers. In this paper, we develop several distributed space-time processing schemes for general TV-user cooperative systems, which do not require channel state information at either relays or destination. We prove that full spatial diversity gain can be achieved in such systems. Simulations demonstrate that these cooperative schemes achieve significant performance gain","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124423561","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578082
Yoshikazu Takei, T. Ohtsuki
In multiple-input multiple-output (MIMO) systems, we need the scheme that attains high quality and high throughput data transmission. We proposed the throughput maximization transmission control scheme (TMTC) for MIMO systems. The proposed transmission control scheme selects a transmission scheme with maximum transmission rate based on signal to interference and noise ratio (SINR) and signal to noise ratio (SNR). In time-varying channels, however, the selected transmission scheme fed back to the transmitter becomes outdated. That is, there is a mismatch between "the selected transmission scheme at the receiver" and "the optimum transmission scheme at the transmitter." Therefore, the throughput performance of TMTC may decrease. In this paper, we propose TMTC using a minimum-mean square error (MMSE) channel prediction for MIMO systems. From the computer simulation, we show that even when the large feedback delay exists, the proposed scheme attains high throughput
{"title":"Throughput maximization transmission control scheme using channel prediction for MIMO systems","authors":"Yoshikazu Takei, T. Ohtsuki","doi":"10.1109/GLOCOM.2005.1578082","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578082","url":null,"abstract":"In multiple-input multiple-output (MIMO) systems, we need the scheme that attains high quality and high throughput data transmission. We proposed the throughput maximization transmission control scheme (TMTC) for MIMO systems. The proposed transmission control scheme selects a transmission scheme with maximum transmission rate based on signal to interference and noise ratio (SINR) and signal to noise ratio (SNR). In time-varying channels, however, the selected transmission scheme fed back to the transmitter becomes outdated. That is, there is a mismatch between \"the selected transmission scheme at the receiver\" and \"the optimum transmission scheme at the transmitter.\" Therefore, the throughput performance of TMTC may decrease. In this paper, we propose TMTC using a minimum-mean square error (MMSE) channel prediction for MIMO systems. From the computer simulation, we show that even when the large feedback delay exists, the proposed scheme attains high throughput","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128844587","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 : 2005-11-28DOI: 10.1109/GLOCOM.2005.1578221
Jae-Hoon Kim, Kwang-Soo Kim
Focusing on multicast transmission in a CDMA based 3G system, we address a soft-combine zone configuration problem. The problem is to find a limited number of cells supporting soft-combine such that each cell has at least one neighboring cell, which also supports soft-combine, while the sum of traffic demands of the selected cells is maximized. We show that this problem is NP-hard, introduce an integer programming formulation, and develop an algorithm generating upper and lower bounds for the soft-combine zone configuration problem, which enables the optimal zone configuration easy to solve in real-time fashion
{"title":"Dynamic soft-combine zone configuration in a multicast CDMA network","authors":"Jae-Hoon Kim, Kwang-Soo Kim","doi":"10.1109/GLOCOM.2005.1578221","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578221","url":null,"abstract":"Focusing on multicast transmission in a CDMA based 3G system, we address a soft-combine zone configuration problem. The problem is to find a limited number of cells supporting soft-combine such that each cell has at least one neighboring cell, which also supports soft-combine, while the sum of traffic demands of the selected cells is maximized. We show that this problem is NP-hard, introduce an integer programming formulation, and develop an algorithm generating upper and lower bounds for the soft-combine zone configuration problem, which enables the optimal zone configuration easy to solve in real-time fashion","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115726341","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 : 2005-11-28DOI: 10.1109/GLOCOM.2005.1577790
A. Boudani, Bernard A. Cousin
In this paper, we study multicast tree construction in MPLS network. We discuss the difficulty in combining multicast and MPLS in a network. We describe some MPLS proposals for the multicast traffic and we justify the need for defining a new protocol. Thereafter we propose MMT, the MPLS multicast tree protocol, which uses MPLS LSP (label switched path) between multicast tree branching nodes in order to reduce the multicast routing states in routers and to increase scalability. We present improvements to MMT protocol and we evaluate it in term of scalability and efficiency. Finally, we present simulation results to validate our evaluation and we conclude that the MMT protocol seems promising and well adapted to a possible implementation of multicast traffic engineering in the network.
{"title":"Multicast tree in MPLS network","authors":"A. Boudani, Bernard A. Cousin","doi":"10.1109/GLOCOM.2005.1577790","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577790","url":null,"abstract":"In this paper, we study multicast tree construction in MPLS network. We discuss the difficulty in combining multicast and MPLS in a network. We describe some MPLS proposals for the multicast traffic and we justify the need for defining a new protocol. Thereafter we propose MMT, the MPLS multicast tree protocol, which uses MPLS LSP (label switched path) between multicast tree branching nodes in order to reduce the multicast routing states in routers and to increase scalability. We present improvements to MMT protocol and we evaluate it in term of scalability and efficiency. Finally, we present simulation results to validate our evaluation and we conclude that the MMT protocol seems promising and well adapted to a possible implementation of multicast traffic engineering in the network.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125159113","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 : 2005-11-28DOI: 10.1109/GLOCOM.2005.1578263
Kyunghan Lee, S. Chong
In most of research works on the wireless ad-hoc network, it is often assumed that all nodes in the network are cooperative to relay packets. However, it is natural for nodes to be reluctant to cooperate by force due to the consumption of resources. Thus, a concept of noncooperative ad-hoc networks is being widely accepted in the latest research works. For the noncooperative ad-hoc networks, a framework which stimulates nodes to mutually cooperate was proposed by W. Yuen. It was shown that the framework utilizes more net capacity of the network than the multi-hop cooperative ad-hoc network does by exploiting data diversity and eliminating redundant bandwidth wastes for the multi-hop packet relays. In this paper, we suggest a content dissemination protocol which adopts currency and we show that adopting currency outperforms the previously proposed one through extensive simulations
{"title":"Currency boosts content dissemination in noncooperative ad-hoc networks","authors":"Kyunghan Lee, S. Chong","doi":"10.1109/GLOCOM.2005.1578263","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578263","url":null,"abstract":"In most of research works on the wireless ad-hoc network, it is often assumed that all nodes in the network are cooperative to relay packets. However, it is natural for nodes to be reluctant to cooperate by force due to the consumption of resources. Thus, a concept of noncooperative ad-hoc networks is being widely accepted in the latest research works. For the noncooperative ad-hoc networks, a framework which stimulates nodes to mutually cooperate was proposed by W. Yuen. It was shown that the framework utilizes more net capacity of the network than the multi-hop cooperative ad-hoc network does by exploiting data diversity and eliminating redundant bandwidth wastes for the multi-hop packet relays. In this paper, we suggest a content dissemination protocol which adopts currency and we show that adopting currency outperforms the previously proposed one through extensive simulations","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131056931","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
扫码关注我们
求助内容：
应助结果提醒方式：