Pub Date : 2012-04-01DOI: 10.1109/WCNC.2012.6214433
Amal Hyadi, M. Benjillali, Mohamed-Slim Alouini
This paper investigates a new constrained relay selection scheme for two-way relaying systems where two end terminals communicate simultaneously via a relay. The introduced technique is based on the maximization of the weighted sum rate of both users. To evaluate the performance of the proposed system, the outage probability is derived in a general case (where an arbitrary channel is considered), and then over independently but not necessarily identically distributed (i.n.i.d.) Rayleigh fading channels. The analytical results are verified through simulations.
{"title":"Outage performance of two-way DF relaying systems with a new relay selection metric","authors":"Amal Hyadi, M. Benjillali, Mohamed-Slim Alouini","doi":"10.1109/WCNC.2012.6214433","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214433","url":null,"abstract":"This paper investigates a new constrained relay selection scheme for two-way relaying systems where two end terminals communicate simultaneously via a relay. The introduced technique is based on the maximization of the weighted sum rate of both users. To evaluate the performance of the proposed system, the outage probability is derived in a general case (where an arbitrary channel is considered), and then over independently but not necessarily identically distributed (i.n.i.d.) Rayleigh fading channels. The analytical results are verified through simulations.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130119070","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214234
A. H. Phan, H. Tuan
Total relay transmit power minimization in Amplify-forward (AF) MIMO relay beamforming is naturally formulated as an indefinite quadratic (nonconvex) program and then semidefinite relaxation (SDR) technique can be used to locate their optimal solutions. Indeed, SDR often gives rank-one optimal solution within a low number of relaying antennas and communicating users. However, as the antennas number increases, the computational complexity of SDR grows up explosively that requires a huge amount of additional variables. In this paper, a more efficient problem formulation is introduced, which needs a much reduced number of auxiliary variables but the optimal solutions are still achieved iteratively. Furthermore, it works as well as for max-min relay power optimization, for which SDR seems to be powerless for solution. Simulation shows the viability of the proposed approach.
{"title":"Optimized beamforming problem in Amplify-forward wireless MIMO relay networks","authors":"A. H. Phan, H. Tuan","doi":"10.1109/WCNC.2012.6214234","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214234","url":null,"abstract":"Total relay transmit power minimization in Amplify-forward (AF) MIMO relay beamforming is naturally formulated as an indefinite quadratic (nonconvex) program and then semidefinite relaxation (SDR) technique can be used to locate their optimal solutions. Indeed, SDR often gives rank-one optimal solution within a low number of relaying antennas and communicating users. However, as the antennas number increases, the computational complexity of SDR grows up explosively that requires a huge amount of additional variables. In this paper, a more efficient problem formulation is introduced, which needs a much reduced number of auxiliary variables but the optimal solutions are still achieved iteratively. Furthermore, it works as well as for max-min relay power optimization, for which SDR seems to be powerless for solution. Simulation shows the viability of the proposed approach.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122525637","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214397
Qi Yao, Yi Yuan, A. Ghazal, Chengxiang Wang, Longyuan Luan, Xiaofeng Lu
For the design and performance evaluation of advanced wireless communication systems employing multiple-input multiple-output (MIMO) technologies, realistic MIMO channel models with a good tradeoff between accuracy and complexity are indispensable. This paper compares the statistical properties of the two latest standardized MIMO channel models: Long Term Evolution-Advanced (LTE-A) and IMT-Advanced (IMT-A) channel models. Closed-from expressions are derived for the spatial cross-correlation function (CCF), temporal autocorrelation function (ACF), envelope level-crossing rate (LCR), average fading duration (AFD), power delay profile (PDP), and frequency correlation function (FCF) for both models. Simulation results are provided which can match the corresponding theoretical derivations very well, demonstrating the correctness of both theoretical and simulation results. The LTE-A channel model is simple but has significant flaws in terms of the accuracy. It can only support system bandwidths up to 50 MHz, not the claimed 100 MHz, and only describes the average spatial-temporal properties of MIMO channels. The IMT-A channel model is complex with more model parameters but has better accuracy. It allows us to simulate the variations of different MIMO channel realizations and can indeed support system bandwidths up to 100 MHz.
{"title":"Comparison of the statistical properties of the LTE-A and IMT-A channel models","authors":"Qi Yao, Yi Yuan, A. Ghazal, Chengxiang Wang, Longyuan Luan, Xiaofeng Lu","doi":"10.1109/WCNC.2012.6214397","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214397","url":null,"abstract":"For the design and performance evaluation of advanced wireless communication systems employing multiple-input multiple-output (MIMO) technologies, realistic MIMO channel models with a good tradeoff between accuracy and complexity are indispensable. This paper compares the statistical properties of the two latest standardized MIMO channel models: Long Term Evolution-Advanced (LTE-A) and IMT-Advanced (IMT-A) channel models. Closed-from expressions are derived for the spatial cross-correlation function (CCF), temporal autocorrelation function (ACF), envelope level-crossing rate (LCR), average fading duration (AFD), power delay profile (PDP), and frequency correlation function (FCF) for both models. Simulation results are provided which can match the corresponding theoretical derivations very well, demonstrating the correctness of both theoretical and simulation results. The LTE-A channel model is simple but has significant flaws in terms of the accuracy. It can only support system bandwidths up to 50 MHz, not the claimed 100 MHz, and only describes the average spatial-temporal properties of MIMO channels. The IMT-A channel model is complex with more model parameters but has better accuracy. It allows us to simulate the variations of different MIMO channel realizations and can indeed support system bandwidths up to 100 MHz.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122569655","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214117
Chih-Ming Hsieh, Zhonglei Wang, J. Henkel
This paper presents an energy-aware execution environment, called Energy-aware Collaborative Organic Execution Environment (ECO/ee), for Wireless Sensor Networks (WSN). ECO/ee provides an energy-aware and autonomous data routing scheme. It can dynamically adapt to the user's queries and efficiently determine the energy-abundant delivery paths. The fundamental concepts are inspired by the forage and task allocation mechanisms of honey bees as well as the interaction between the honey bee colony and the bee keeper. The experiments show that our approach outperforms the state-of-the-art in terms of energy efficiency and adaptability to the user requirements.
{"title":"ECO/ee: Energy-aware Collaborative Organic execution environment for wireless sensor networks","authors":"Chih-Ming Hsieh, Zhonglei Wang, J. Henkel","doi":"10.1109/WCNC.2012.6214117","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214117","url":null,"abstract":"This paper presents an energy-aware execution environment, called Energy-aware Collaborative Organic Execution Environment (ECO/ee), for Wireless Sensor Networks (WSN). ECO/ee provides an energy-aware and autonomous data routing scheme. It can dynamically adapt to the user's queries and efficiently determine the energy-abundant delivery paths. The fundamental concepts are inspired by the forage and task allocation mechanisms of honey bees as well as the interaction between the honey bee colony and the bee keeper. The experiments show that our approach outperforms the state-of-the-art in terms of energy efficiency and adaptability to the user requirements.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131399196","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214101
C. Zhai, Xiaohui Li, Y. Hei
A novel decomposed transceiver design scheme is developed for multiuser non-regenerative MIMO relay downlink systems. With a decomposed relay structure, the whole system can be decomposed into a point-to-point and a point-to-multipoint systems, thus the transceiver design can be individually proceeded for the first and second hop. In the first hop, the transceiver is derived to minimize the mean square error (MSE) of symbol estimations with equal MSEs of all data streams. While for the second hop, a modified block diagonalization (BD) and geometric mean decomposition (GMD) based scheme is proposed to design the transceiver. Simulation results demonstrate the proposed method can effectively improve the BER performance.
{"title":"A novel decomposed transceiver design for multiuser MIMO relay downlink systems","authors":"C. Zhai, Xiaohui Li, Y. Hei","doi":"10.1109/WCNC.2012.6214101","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214101","url":null,"abstract":"A novel decomposed transceiver design scheme is developed for multiuser non-regenerative MIMO relay downlink systems. With a decomposed relay structure, the whole system can be decomposed into a point-to-point and a point-to-multipoint systems, thus the transceiver design can be individually proceeded for the first and second hop. In the first hop, the transceiver is derived to minimize the mean square error (MSE) of symbol estimations with equal MSEs of all data streams. While for the second hop, a modified block diagonalization (BD) and geometric mean decomposition (GMD) based scheme is proposed to design the transceiver. Simulation results demonstrate the proposed method can effectively improve the BER performance.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131707066","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214194
Abhinav Kumar, R. Mallik, R. Schober
In the presence of several wireless local area network (WLAN) service providers, the users have to make a choice. The price charged and the congestion experienced by the users play an important role in making this choice. In this paper, we analyze the duopoly price competition between two WLAN service providers in the presence of four types of users. We prove that the distribution of heterogeneous user demand is governed by the Wardrop equilibrium. We also show the existence of the Nash equilibrium between competing WLAN service providers. It is further shown through analysis that the social welfare in Nash equilibrium is close to its maximal value. We find that compared to a strictly regulated monopoly, an unregulated WLAN duopoly market results in significant transfer of the surplus from service providers to users with negligible losses in efficiency.
{"title":"Duopoly price competition of WLAN service providers in presence of heterogeneous user demand","authors":"Abhinav Kumar, R. Mallik, R. Schober","doi":"10.1109/WCNC.2012.6214194","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214194","url":null,"abstract":"In the presence of several wireless local area network (WLAN) service providers, the users have to make a choice. The price charged and the congestion experienced by the users play an important role in making this choice. In this paper, we analyze the duopoly price competition between two WLAN service providers in the presence of four types of users. We prove that the distribution of heterogeneous user demand is governed by the Wardrop equilibrium. We also show the existence of the Nash equilibrium between competing WLAN service providers. It is further shown through analysis that the social welfare in Nash equilibrium is close to its maximal value. We find that compared to a strictly regulated monopoly, an unregulated WLAN duopoly market results in significant transfer of the surplus from service providers to users with negligible losses in efficiency.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132578099","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214443
S. Kundu, D. Pados, Weifeng Su, R. Grover
We present a new 4×4 Hadamard-precoded Quasi-Orthogonal Space-Time Block Code (QO-STBC) that enables reliability-based prioritized symbol detection using linear filters. Approximate block-error-rate analysis is carried out and used to optimize the code rotation angles. For benchmarking purposes, the maximum-likelihood (ML) code detector is also derived with complexity of the order of joint two-real-symbol decoding. Numerical and simulation studies compare linear filter decoding against ML decoding.
{"title":"Makings of the 4 × 4 space-time block code of choice","authors":"S. Kundu, D. Pados, Weifeng Su, R. Grover","doi":"10.1109/WCNC.2012.6214443","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214443","url":null,"abstract":"We present a new 4×4 Hadamard-precoded Quasi-Orthogonal Space-Time Block Code (QO-STBC) that enables reliability-based prioritized symbol detection using linear filters. Approximate block-error-rate analysis is carried out and used to optimize the code rotation angles. For benchmarking purposes, the maximum-likelihood (ML) code detector is also derived with complexity of the order of joint two-real-symbol decoding. Numerical and simulation studies compare linear filter decoding against ML decoding.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133227123","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214175
R. Lopes, A. Boukerche, B. Beijnum, E. Moreira
This paper address the challenge of design a feasible social-based mechanism to manage wireless mobile connectivity. In a previous work, we proposed a methodology to share connectivity experiences among mobile users inside on-line social networks [11]. The aim was explore peoples social circles to enhance their wireless connectivity experiences e.g., QoS metrics such as: throughput, latency and signal quality. In this paper, details of the mashups, between wireless connectivity context data and location-based social media, are provided. We report how this data is handled using complex networks metrics e.g., vertex's strength and centrality degree, to identify high density handover areas, define the mobile users' reputation and to reveal the networks' coverage. Real experiments showed that collaboration can improve QoS metrics from ~18 to ~30% if compared to just use a mobility predictor or a modern operational system, respectively. The discussion unfolds with focus on the collaboration's efficiency as function of time, number of users, discovered area size and mobility patterns.
{"title":"Social and location-based collaboration mechanism to manage wireless connectivity context data","authors":"R. Lopes, A. Boukerche, B. Beijnum, E. Moreira","doi":"10.1109/WCNC.2012.6214175","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214175","url":null,"abstract":"This paper address the challenge of design a feasible social-based mechanism to manage wireless mobile connectivity. In a previous work, we proposed a methodology to share connectivity experiences among mobile users inside on-line social networks [11]. The aim was explore peoples social circles to enhance their wireless connectivity experiences e.g., QoS metrics such as: throughput, latency and signal quality. In this paper, details of the mashups, between wireless connectivity context data and location-based social media, are provided. We report how this data is handled using complex networks metrics e.g., vertex's strength and centrality degree, to identify high density handover areas, define the mobile users' reputation and to reveal the networks' coverage. Real experiments showed that collaboration can improve QoS metrics from ~18 to ~30% if compared to just use a mobility predictor or a modern operational system, respectively. The discussion unfolds with focus on the collaboration's efficiency as function of time, number of users, discovered area size and mobility patterns.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133528181","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214484
S. Misra, Anshima Gupta, P. V. Krishna, Harshit Agarwal, M. Obaidat
Internet of Things (IOT) is a wireless ad-hoc network of everyday objects collaborating and cooperating with one other in order to accomplish some shared objectives. The envisioned high degrees of association of humans with IOT nodes require equally high degrees of reliability of the network. In order to render this reliability to IOT networks, it is necessary to make them tolerant to faults. In this paper, we propose mixed cross-layered and learning automata (LA)-based fault-tolerant routing protocol for IOTs, which assures successful delivery of packets even in the presence of faults between a pair of source and destination nodes. As this work concerns IOT, the algorithm designed should be highly scalable and should be able to deliver high degrees of performance in a heterogeneous environment. The LA and cross-layer concepts adopted in the proposed approach endow this flexibility to the algorithm so that the same standard can be used across the network. It dynamically adopts itself to the changing environment and, hence, chooses the optimal action. Since energy is a major concern in IOTs, the algorithm performs energy-aware fault-tolerant routing. To save on energy, all the nodes lying in the unused path are put to sleep. Again this sleep scheduling is dynamic and adaptive. The simulation results of the proposed strategy shows an increase in the overall energy-efficiency of the network and decrease in overhead, as compared to the existing protocols we have considered as benchmarks in this study.
{"title":"An adaptive learning approach for fault-tolerant routing in Internet of Things","authors":"S. Misra, Anshima Gupta, P. V. Krishna, Harshit Agarwal, M. Obaidat","doi":"10.1109/WCNC.2012.6214484","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214484","url":null,"abstract":"Internet of Things (IOT) is a wireless ad-hoc network of everyday objects collaborating and cooperating with one other in order to accomplish some shared objectives. The envisioned high degrees of association of humans with IOT nodes require equally high degrees of reliability of the network. In order to render this reliability to IOT networks, it is necessary to make them tolerant to faults. In this paper, we propose mixed cross-layered and learning automata (LA)-based fault-tolerant routing protocol for IOTs, which assures successful delivery of packets even in the presence of faults between a pair of source and destination nodes. As this work concerns IOT, the algorithm designed should be highly scalable and should be able to deliver high degrees of performance in a heterogeneous environment. The LA and cross-layer concepts adopted in the proposed approach endow this flexibility to the algorithm so that the same standard can be used across the network. It dynamically adopts itself to the changing environment and, hence, chooses the optimal action. Since energy is a major concern in IOTs, the algorithm performs energy-aware fault-tolerant routing. To save on energy, all the nodes lying in the unused path are put to sleep. Again this sleep scheduling is dynamic and adaptive. The simulation results of the proposed strategy shows an increase in the overall energy-efficiency of the network and decrease in overhead, as compared to the existing protocols we have considered as benchmarks in this study.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134360230","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 : 2012-04-01DOI: 10.1109/WCNC.2012.6214067
Jeffery P. Hansen, S. Hissam, Daniel Plakosh, L. Wrage
In high criticality crisis scenarios, such as disaster management, ad hoc wireless networks are quickly assembled in the field to support decision makers through situational awareness using messaging-, voice-, and video-based applications. These applications cannot afford the luxury of stalling or failing due to overwhelming bandwidth demand on these networks as this could contribute to overall mission failure. This paper describes an approach for satisfying application-specific Quality of Service (QoS) expectations operating on ad hoc wireless networks where available bandwidth fluctuates. The proposed algorithm, D-Q-RAM (Distributed QoS Resource Allocation Model) incorporates a distributed optimization heuristic that results in near optimal adaptation without the need to know, estimate, or predict available bandwidth at any moment in time.
{"title":"Adaptive Quality of Service in ad hoc wireless networks","authors":"Jeffery P. Hansen, S. Hissam, Daniel Plakosh, L. Wrage","doi":"10.1109/WCNC.2012.6214067","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214067","url":null,"abstract":"In high criticality crisis scenarios, such as disaster management, ad hoc wireless networks are quickly assembled in the field to support decision makers through situational awareness using messaging-, voice-, and video-based applications. These applications cannot afford the luxury of stalling or failing due to overwhelming bandwidth demand on these networks as this could contribute to overall mission failure. This paper describes an approach for satisfying application-specific Quality of Service (QoS) expectations operating on ad hoc wireless networks where available bandwidth fluctuates. The proposed algorithm, D-Q-RAM (Distributed QoS Resource Allocation Model) incorporates a distributed optimization heuristic that results in near optimal adaptation without the need to know, estimate, or predict available bandwidth at any moment in time.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134591117","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
扫码关注我们
求助内容：
应助结果提醒方式：