Pub Date : 2010-05-23DOI: 10.1109/ICC.2010.5501776
Yue Chen, I. Bajić
Predictive video decoding is a technique for reducing end-to-end delay and/or concealing frame loss in video communications. In this paper, we propose an improved predictive decoding technique that incorporates the estimation of the ordinal depth of moving regions, and uses it to compose the predicted frame. Ordinal depth information enables occlusion prediction in the future frame, allowing the predictor to synthesize a more realistic frame. Experimental results show that the proposed method achieves better subjective and objective quality of synthesized frames compared to a state-of-the-art block-based frame prediction approach.
{"title":"Predictive Video Decoding Based on Ordinal Depth of Moving Regions","authors":"Yue Chen, I. Bajić","doi":"10.1109/ICC.2010.5501776","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501776","url":null,"abstract":"Predictive video decoding is a technique for reducing end-to-end delay and/or concealing frame loss in video communications. In this paper, we propose an improved predictive decoding technique that incorporates the estimation of the ordinal depth of moving regions, and uses it to compose the predicted frame. Ordinal depth information enables occlusion prediction in the future frame, allowing the predictor to synthesize a more realistic frame. Experimental results show that the proposed method achieves better subjective and objective quality of synthesized frames compared to a state-of-the-art block-based frame prediction approach.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"59 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":"79729619","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.5502121
Vineet Kulkarni, M. Devetsikiotis
A significant portion of the HTTP multimedia traffic on the Internet comes from sites like Youtube which serve short videos. Caching of Youtube-like multimedia content, when possible, can reduce traffic on the backbone while providing faster access. The performance of such a caching system will depend on identifying the videos which should be cached and the appropriate duration. In this paper, we look at both of these questions from a social network perspective. We propose that the decision to cache a video should be based on the combined popularity of the individual as well as related videos rather than simply based on individual popularity of a video. We identify timescales at which the inter-relationships between the videos can change through a longitudinal data set. Using the concepts of centrality of nodes, we rank the set of videos in the data set according to their perceived importance. In doing so, we compare three centrality techniques - degree, closeness and betweenness. We evaluate how these centralities affect the performance of a cache. We show that ``Closeness" centrality always performs at least as well as the other two in all cases. Finally, we show that a distributed cache mechanism employing the centrality method to rank videos can reduce the load on the network significantly for even moderate content cache sizes.
{"title":"Communication Timescales, Structure and Popularity: Using Social Network Metrics for Youtube-Like Multimedia Content Distribution","authors":"Vineet Kulkarni, M. Devetsikiotis","doi":"10.1109/ICC.2010.5502121","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502121","url":null,"abstract":"A significant portion of the HTTP multimedia traffic on the Internet comes from sites like Youtube which serve short videos. Caching of Youtube-like multimedia content, when possible, can reduce traffic on the backbone while providing faster access. The performance of such a caching system will depend on identifying the videos which should be cached and the appropriate duration. In this paper, we look at both of these questions from a social network perspective. We propose that the decision to cache a video should be based on the combined popularity of the individual as well as related videos rather than simply based on individual popularity of a video. We identify timescales at which the inter-relationships between the videos can change through a longitudinal data set. Using the concepts of centrality of nodes, we rank the set of videos in the data set according to their perceived importance. In doing so, we compare three centrality techniques - degree, closeness and betweenness. We evaluate how these centralities affect the performance of a cache. We show that ``Closeness\" centrality always performs at least as well as the other two in all cases. Finally, we show that a distributed cache mechanism employing the centrality method to rank videos can reduce the load on the network significantly for even moderate content cache sizes.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"44 174 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":"83271900","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.5502654
P. Du, A. Nakao
In this paper, we propose a DDoS defense architecture, named NEIF (Network Egress and Ingress Filtering), which is deployed at the Internet Service Provider's (ISP) edge routers to prohibit DDoS attacks into and from the ISPs' networks. The main challenge is how to implement NEIF with a small fixed amount of memory and low implementation complexity so that it may be acceptable by ISPs. We first design a bloom filter based data structure to identify and measure a few relatively large flows instead of all flows, where the amount of required memory is independent of link speeds and the number of flows. Then, the relatively large flows are rate-limited to their fair share based on the packet symmetry-the ratio of received and transmitted packets of a host. The dropping decisions of each flow are made on the observed counters directly that are with low implementation complexity. Finally, we implement NEIF with Click and perform experiments on PlanetLab. The experimental results validate our analysis and show that the Internet can benefit from NEIF even under partial deployment.
{"title":"DDoS Defense Deployment with Network Egress and Ingress Filtering","authors":"P. Du, A. Nakao","doi":"10.1109/ICC.2010.5502654","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502654","url":null,"abstract":"In this paper, we propose a DDoS defense architecture, named NEIF (Network Egress and Ingress Filtering), which is deployed at the Internet Service Provider's (ISP) edge routers to prohibit DDoS attacks into and from the ISPs' networks. The main challenge is how to implement NEIF with a small fixed amount of memory and low implementation complexity so that it may be acceptable by ISPs. We first design a bloom filter based data structure to identify and measure a few relatively large flows instead of all flows, where the amount of required memory is independent of link speeds and the number of flows. Then, the relatively large flows are rate-limited to their fair share based on the packet symmetry-the ratio of received and transmitted packets of a host. The dropping decisions of each flow are made on the observed counters directly that are with low implementation complexity. Finally, we implement NEIF with Click and perform experiments on PlanetLab. The experimental results validate our analysis and show that the Internet can benefit from NEIF even under partial deployment.","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":"81191589","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.5502656
J. Alonso-Zarate, C. Verikoukis, E. Kartsakli, L. Alonso
We describe in this paper a methodology to facilitate the coexistence of the Distributed Queuing Medium Access Control (MAC) protocol for Ad hoc Networks (DQMAN) with the IEEE 802.11 Standard MAC protocol. By using dual terminals which can operate with the two MAC protocols, it is possible to run a hybrid network with legacy and novel terminals. In addition, it is possible to enable the intercommunication between all the terminals of the network. Computer simulations have been carried out to assess the performance and the feasibility of such dual operation. The main conclusion of the study is that the use of dual terminals allows the integration of DQMAN within legacy networks without degrading the performance of IEEE 802.11 terminals. In addition, the mechanism presented in this paper can be used to enable the coexistence of any cluster-based distributed MAC protocol within IEEE 802.11 networks.
{"title":"Coexistence of a Novel Medium Access Control Protocol for Wireless Ad Hoc Networks and the IEEE 802.11","authors":"J. Alonso-Zarate, C. Verikoukis, E. Kartsakli, L. Alonso","doi":"10.1109/ICC.2010.5502656","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502656","url":null,"abstract":"We describe in this paper a methodology to facilitate the coexistence of the Distributed Queuing Medium Access Control (MAC) protocol for Ad hoc Networks (DQMAN) with the IEEE 802.11 Standard MAC protocol. By using dual terminals which can operate with the two MAC protocols, it is possible to run a hybrid network with legacy and novel terminals. In addition, it is possible to enable the intercommunication between all the terminals of the network. Computer simulations have been carried out to assess the performance and the feasibility of such dual operation. The main conclusion of the study is that the use of dual terminals allows the integration of DQMAN within legacy networks without degrading the performance of IEEE 802.11 terminals. In addition, the mechanism presented in this paper can be used to enable the coexistence of any cluster-based distributed MAC protocol within IEEE 802.11 networks.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"27 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":"83398992","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.5502001
D. Morero, M. Hueda
In this paper we present a theory of the bit error rate (BER) of Euclidean metric-based maximum likelihood sequence detectors (EM-MLSD) in the presence of channel mismatch caused by nongaussian noise. Although the theory is general, here we focus on the effects of quantization noise (QN) added by the front-end analog-to-digital converter (ADC) typically used in DSP based implementations of the receiver. Numerical results show a close agreement between the predictions of the theoretical analysis and computer simulations. As a practical application of the proposed theory, we investigate the performance of EM-MLSD in 10Gb/s Ethernet receivers for multimode optical fibers. Since the BER required in this application is below 10^-12, which precludes the use of computer simulations to estimate BER, a theoretical study of the MLSD performance including the combined effects of the channel dispersion and QN, becomes necessary. We present numerical results for the three stressors specified by the 10GBASE-LRM standard. Our study shows that the impact of the QN added by the ADC on the performance depends strongly on the channel dispersion (i.e., the stressor).
{"title":"Performance of Euclidean-Metric MLSD Receiver in the Presence of Channel Mismatch Caused by Nongaussian Noise","authors":"D. Morero, M. Hueda","doi":"10.1109/ICC.2010.5502001","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502001","url":null,"abstract":"In this paper we present a theory of the bit error rate (BER) of Euclidean metric-based maximum likelihood sequence detectors (EM-MLSD) in the presence of channel mismatch caused by nongaussian noise. Although the theory is general, here we focus on the effects of quantization noise (QN) added by the front-end analog-to-digital converter (ADC) typically used in DSP based implementations of the receiver. Numerical results show a close agreement between the predictions of the theoretical analysis and computer simulations. As a practical application of the proposed theory, we investigate the performance of EM-MLSD in 10Gb/s Ethernet receivers for multimode optical fibers. Since the BER required in this application is below 10^-12, which precludes the use of computer simulations to estimate BER, a theoretical study of the MLSD performance including the combined effects of the channel dispersion and QN, becomes necessary. We present numerical results for the three stressors specified by the 10GBASE-LRM standard. Our study shows that the impact of the QN added by the ADC on the performance depends strongly on the channel dispersion (i.e., the stressor).","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"4 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":"84647801","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.5502248
G. Bacci, M. Luise
This paper proposes a game-theoretic approach to the problem of resource allocation for a CDMA wireless communication network, focusing on code synchronization. To capture the tradeoff between obtaining good synchronization performance and saving as much energy as possible, we propose a noncooperative game in which each pair transmitter-receiver in the network seeks to maximize the ratio of the probability of detection to the transmitted energy per bit by setting its transmit power and its optimum detection threshold, under a constraint on the maximum probability of spurious code locks. This framework also considers the coexistence between different types of synchronizers in the network and different QoS requirements. The Nash solution of the game is investigated and closed-form expressions are derived and compared with simulation results for a decentralized resource control algorithm.
{"title":"A Game-Theoretic Perspective on Code Acquisition in CDMA Wireless Systems","authors":"G. Bacci, M. Luise","doi":"10.1109/ICC.2010.5502248","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502248","url":null,"abstract":"This paper proposes a game-theoretic approach to the problem of resource allocation for a CDMA wireless communication network, focusing on code synchronization. To capture the tradeoff between obtaining good synchronization performance and saving as much energy as possible, we propose a noncooperative game in which each pair transmitter-receiver in the network seeks to maximize the ratio of the probability of detection to the transmitted energy per bit by setting its transmit power and its optimum detection threshold, under a constraint on the maximum probability of spurious code locks. This framework also considers the coexistence between different types of synchronizers in the network and different QoS requirements. The Nash solution of the game is investigated and closed-form expressions are derived and compared with simulation results for a decentralized resource control algorithm.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"5 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":"88506814","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.5502045
O. Oyerinde, S. Mneney
Iterative Decision Directed Channel Estimation (DDCE) scheme is proposed in this paper for bit interleaved coded modulation (BICM)-based MIMO-OFDM systems. The proposed scheme employs Variable Step Size Normalized Least Mean Square (VSSNLMS) algorithm to implement its temporary Channel Transfer Function (CTF) Estimator and Adaptive Channel Impulse Response (CIR) predictor modules, while Fast Data Projection Method (FDPM) algorithm is employed to track the time domain CIR of the MIMO channel. The proposed iterative DDCE operates in an iterative mode in conjunction with MIMO demappers and the Turbo decoder at receiver of the MIMO-OFDM system. The achievable performances of the proposed scheme in terms of both mean square error (MSE) and bit error rate (BER) are presented. Comparative performances between the DDCE scheme employing FDPM algorithm and another one employing deflated Projection Approximation Subspace Tracking (PASTd) algorithm are also given. The simulations results presented indicate better performances of the proposed scheme.
{"title":"Iterative Decision Directed Channel Estimation for BICM-Based MIMO-OFDM Systems","authors":"O. Oyerinde, S. Mneney","doi":"10.1109/ICC.2010.5502045","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502045","url":null,"abstract":"Iterative Decision Directed Channel Estimation (DDCE) scheme is proposed in this paper for bit interleaved coded modulation (BICM)-based MIMO-OFDM systems. The proposed scheme employs Variable Step Size Normalized Least Mean Square (VSSNLMS) algorithm to implement its temporary Channel Transfer Function (CTF) Estimator and Adaptive Channel Impulse Response (CIR) predictor modules, while Fast Data Projection Method (FDPM) algorithm is employed to track the time domain CIR of the MIMO channel. The proposed iterative DDCE operates in an iterative mode in conjunction with MIMO demappers and the Turbo decoder at receiver of the MIMO-OFDM system. The achievable performances of the proposed scheme in terms of both mean square error (MSE) and bit error rate (BER) are presented. Comparative performances between the DDCE scheme employing FDPM algorithm and another one employing deflated Projection Approximation Subspace Tracking (PASTd) algorithm are also given. The simulations results presented indicate better performances of the proposed scheme.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"30 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":"88802412","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.5502376
F. Ciucu, O. Hohlfeld
The stochastic network calculus is an analytical tool which was mainly developed to compute tail bounds on backlogs and delays. From these, bounds on average backlogs and delays are derived in the literature by integration. This paper improves such bounds on average backlogs by using Jensen's inequality; improved bounds on average delays follow immediately from Little's Law. The gain factor can be substantial especially at high utilizations, e.g., of order ${Omega}left(frac{1}{1-rho}right)$ when $rhorightarrow 1$. This gain is further numerically illustrated for Markov-modulated On-Off arrival processes. Moreover, the paper shows how to improve standard stochastic network calculus performance bounds by suitably using FIFO service curves.
{"title":"On Computing Bounds on Average Backlogs and Delays with Network Calculus","authors":"F. Ciucu, O. Hohlfeld","doi":"10.1109/ICC.2010.5502376","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502376","url":null,"abstract":"The stochastic network calculus is an analytical tool which was mainly developed to compute tail bounds on backlogs and delays. From these, bounds on average backlogs and delays are derived in the literature by integration. This paper improves such bounds on average backlogs by using Jensen's inequality; improved bounds on average delays follow immediately from Little's Law. The gain factor can be substantial especially at high utilizations, e.g., of order ${Omega}left(frac{1}{1-rho}right)$ when $rhorightarrow 1$. This gain is further numerically illustrated for Markov-modulated On-Off arrival processes. Moreover, the paper shows how to improve standard stochastic network calculus performance bounds by suitably using FIFO service curves.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"24 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":"89333678","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.5502053
Liang-Ying Chen, B. Krongold, J. Evans
This paper investigates Orthogonal Frequency- Division Multiplexing (OFDM) transmission in intensity modulated, direct-detected (IM/DD) optical systems. Due to the unipolarity of the IM/DD optical channel, DC biasing and associated nonlinear clipping distortion (NLCD) is inevitable, unless an anti-periodic signal is created by limiting bit loading to only half of the available bandwidth. To generalize this idea, we first provide a class of such signals generated with different subchannel combinations. Using the theoretical characterization of NLCD on these signals, we show that by parallel transmission and successive decoding, a set of anti-periodic OFDM signals can be transmitted simultaneously and recovered without a distortion penalty. The proposed method requires minimum change on the existing optical plant, and has the potential to achieve both high power and high spectral efficiencies.
{"title":"Successive Decoding of Anti-Periodic OFDM Signals in IM/DD Optical Channel","authors":"Liang-Ying Chen, B. Krongold, J. Evans","doi":"10.1109/ICC.2010.5502053","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502053","url":null,"abstract":"This paper investigates Orthogonal Frequency- Division Multiplexing (OFDM) transmission in intensity modulated, direct-detected (IM/DD) optical systems. Due to the unipolarity of the IM/DD optical channel, DC biasing and associated nonlinear clipping distortion (NLCD) is inevitable, unless an anti-periodic signal is created by limiting bit loading to only half of the available bandwidth. To generalize this idea, we first provide a class of such signals generated with different subchannel combinations. Using the theoretical characterization of NLCD on these signals, we show that by parallel transmission and successive decoding, a set of anti-periodic OFDM signals can be transmitted simultaneously and recovered without a distortion penalty. The proposed method requires minimum change on the existing optical plant, and has the potential to achieve both high power and high spectral efficiencies.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"6 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":"84806198","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.5502668
Xun Yang, Z. Rosberg, Zhenzhen Cao, R. Liu
The major objective of an admission control in wireless mesh networks is to prevent excessive real-time traffic from over-utilizing the bandwidth resources. A key component of an admission control is an accurate estimator of the bandwidth available at each node and of the actual bandwidth (including the MAC overhead) required by a new flow. This estimation problem is particularly difficult when node localization information is not available. We propose a novel admission control based on active neighbor bandwidth reservation (AC-ANBR), by which active neighbors periodically broadcast bandwidth reservation information and flow setup requests carry their bandwidth reservation states. Our proposed AC-ANBR accurately estimates the available bandwidth at each node, as well as the bandwidth required by each new flow. The effectiveness of AC-ANBR in multi-hop wireless networks is demonstrated by NS-2 simulations.
{"title":"Admission Control for Wireless Mesh Networks Based on Active Neighbor Bandwidth Reservations","authors":"Xun Yang, Z. Rosberg, Zhenzhen Cao, R. Liu","doi":"10.1109/ICC.2010.5502668","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502668","url":null,"abstract":"The major objective of an admission control in wireless mesh networks is to prevent excessive real-time traffic from over-utilizing the bandwidth resources. A key component of an admission control is an accurate estimator of the bandwidth available at each node and of the actual bandwidth (including the MAC overhead) required by a new flow. This estimation problem is particularly difficult when node localization information is not available. We propose a novel admission control based on active neighbor bandwidth reservation (AC-ANBR), by which active neighbors periodically broadcast bandwidth reservation information and flow setup requests carry their bandwidth reservation states. Our proposed AC-ANBR accurately estimates the available bandwidth at each node, as well as the bandwidth required by each new flow. The effectiveness of AC-ANBR in multi-hop wireless networks is demonstrated by NS-2 simulations.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"86 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":"85246912","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
扫码关注我们
求助内容：
应助结果提醒方式：