Understanding the maximum end-to-end throughput available with any given wireless multi-hop network is an important, but very challenging task. It may be approximated up to certain degree for several simplified topologies such as chain, cross, and others. Typically, in case of chain-topology wireless multi-hop networks employing IEEE 802.11 DCF (distributed coordination function), the maximum throughput can be derived by calculating 1-hop average throughput considering the so-called bottleneck region. However, this approximation method that utilizes only the 1-hop average throughput is limited in terms of accuracy. Thus, in this paper, after verifying the limitation of 1-hop average approximation for the throughput calculation of chain-topology multi-hop wireless networks, a refined calculation scheme is proposed by additionally considering the deviation of throughput. Especially, we focus on the fact that the throughput deviation could lead to collisions, and the throughput deviation happens due to the summation of uniformly distributed backoff times of IEEE 802.11 DCF. With several ns-2-based network simulations, we verify the impact of selected temporal variations to the throughput calculation and thus validate the improved accuracy of proposed calculation scheme.
{"title":"Maximum End-to-End Throughput of Chain-Topology Wireless Multi-Hop Networks","authors":"Jae-Yong Yoo, JongWon Kim","doi":"10.1109/WCNC.2007.781","DOIUrl":"https://doi.org/10.1109/WCNC.2007.781","url":null,"abstract":"Understanding the maximum end-to-end throughput available with any given wireless multi-hop network is an important, but very challenging task. It may be approximated up to certain degree for several simplified topologies such as chain, cross, and others. Typically, in case of chain-topology wireless multi-hop networks employing IEEE 802.11 DCF (distributed coordination function), the maximum throughput can be derived by calculating 1-hop average throughput considering the so-called bottleneck region. However, this approximation method that utilizes only the 1-hop average throughput is limited in terms of accuracy. Thus, in this paper, after verifying the limitation of 1-hop average approximation for the throughput calculation of chain-topology multi-hop wireless networks, a refined calculation scheme is proposed by additionally considering the deviation of throughput. Especially, we focus on the fact that the throughput deviation could lead to collisions, and the throughput deviation happens due to the summation of uniformly distributed backoff times of IEEE 802.11 DCF. With several ns-2-based network simulations, we verify the impact of selected temporal variations to the throughput calculation and thus validate the improved accuracy of proposed calculation scheme.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"12 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":"124534535","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}
Active queue management (AQM) algorithm is important to manage buffers and transfer packets for wired/wireless networks. However, the unresponsive flows to the network congestion control are dangerous to the network equilibrium and quality of service (QoS), especially from the point of network resource allocation. In some certain scenarios, the limited network resource (buffers) can be occupied by the unresponsive flows easily, which results in reduction of quality (RoQ). In this paper, a new AQM algorithm - Clue (compare and limited unresponsive flows) is proposed in order to strengthen the robustness of Internet against unresponsive flows. As a sort of scheduling algorithm, Clue relies on the detection and punishment of unresponsive flows and gets the elastics control of unresponsive flows, which benefit the buffer queue with the high performance. Via the comparison and evaluation experiments, it has been proved that Clue can detect and restrain unresponsive flows more accurately compared to other AQM algorithms.
{"title":"Improving Unresponsive Flow Control by Active Queue Management Algorithm","authors":"Jun Zheng, Liyuan Zhao, Zhang Tao","doi":"10.1109/WCNC.2007.795","DOIUrl":"https://doi.org/10.1109/WCNC.2007.795","url":null,"abstract":"Active queue management (AQM) algorithm is important to manage buffers and transfer packets for wired/wireless networks. However, the unresponsive flows to the network congestion control are dangerous to the network equilibrium and quality of service (QoS), especially from the point of network resource allocation. In some certain scenarios, the limited network resource (buffers) can be occupied by the unresponsive flows easily, which results in reduction of quality (RoQ). In this paper, a new AQM algorithm - Clue (compare and limited unresponsive flows) is proposed in order to strengthen the robustness of Internet against unresponsive flows. As a sort of scheduling algorithm, Clue relies on the detection and punishment of unresponsive flows and gets the elastics control of unresponsive flows, which benefit the buffer queue with the high performance. Via the comparison and evaluation experiments, it has been proved that Clue can detect and restrain unresponsive flows more accurately compared to other AQM algorithms.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"85 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":"126241633","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}
Wan Choi, N. Himayat, S. Talwar, J. Kim, A. Koo, Jane Choi, Yujin Noh, Josep Kim
This paper investigates the interaction between multiuser diversity and spatial diversity in an interference-limited environment based on post-receiver-processing signal-to-interference-plus-noise ratio (SINR) distributions. If opportunistic scheduling is employed, spatial diversity effects limit the achievable multiuser diversity gain. This paper quantifies the interaction by using order statistic theory and shows a spatial diversity technique with a larger SINR variance can be more effective under opportunistic scheduling. Through analysis and simulations, the authors show that the cyclic delay diversity technique gets the most benefit from the opportunistic scheduling among likely spatial diversity techniques and outperforms space time block coding (STBC), even though STBC is generally considered the most effective transmit diversity technique in a noise-limited environment.
{"title":"Interactions Between Multiuser Diversity and Spatial Diversity Techniques in an Interference-Limited Environment","authors":"Wan Choi, N. Himayat, S. Talwar, J. Kim, A. Koo, Jane Choi, Yujin Noh, Josep Kim","doi":"10.1109/WCNC.2007.337","DOIUrl":"https://doi.org/10.1109/WCNC.2007.337","url":null,"abstract":"This paper investigates the interaction between multiuser diversity and spatial diversity in an interference-limited environment based on post-receiver-processing signal-to-interference-plus-noise ratio (SINR) distributions. If opportunistic scheduling is employed, spatial diversity effects limit the achievable multiuser diversity gain. This paper quantifies the interaction by using order statistic theory and shows a spatial diversity technique with a larger SINR variance can be more effective under opportunistic scheduling. Through analysis and simulations, the authors show that the cyclic delay diversity technique gets the most benefit from the opportunistic scheduling among likely spatial diversity techniques and outperforms space time block coding (STBC), even though STBC is generally considered the most effective transmit diversity technique in a noise-limited environment.","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":"126244196","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}
Yan Chen, Peng Cheng, Peiliang Qiu, Zhaoyang Zhang
Cooperative communication has emerged as a promising technique to enhance system reliability and performances in resource-limited wireless networks. Before any kind of cooperation ever starts, nodes in the network have to find someone to cooperate with and the helping node is so called partner. This paper concerns about the partner selection problem in centralized networks, where an AP assigns partner for each node and schedules all the transmission. Three optimal partner selection strategies with different aims are proposed and analyzed under fixed and variable transmit power respectively. They are the maximum total utility (MTU) strategy, the maximum minimum utility (MMU) strategy and the maximum product utility (MPU) strategy. Simulation results show that with variable transmit power, both system-level efficiency and node-level fairness can be greatly improved, and the three strategies successfully achieve their goals respectively.
{"title":"Optimal Partner Selection Strategies in Wireless Cooperative Networks with Fixed and Variable Transmit Power","authors":"Yan Chen, Peng Cheng, Peiliang Qiu, Zhaoyang Zhang","doi":"10.1109/WCNC.2007.745","DOIUrl":"https://doi.org/10.1109/WCNC.2007.745","url":null,"abstract":"Cooperative communication has emerged as a promising technique to enhance system reliability and performances in resource-limited wireless networks. Before any kind of cooperation ever starts, nodes in the network have to find someone to cooperate with and the helping node is so called partner. This paper concerns about the partner selection problem in centralized networks, where an AP assigns partner for each node and schedules all the transmission. Three optimal partner selection strategies with different aims are proposed and analyzed under fixed and variable transmit power respectively. They are the maximum total utility (MTU) strategy, the maximum minimum utility (MMU) strategy and the maximum product utility (MPU) strategy. Simulation results show that with variable transmit power, both system-level efficiency and node-level fairness can be greatly improved, and the three strategies successfully achieve their goals respectively.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"48 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":"128033709","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}
Bo Xing, Mayur Deshpande, N. Venkatasubramanian, S. Mehrotra, D. Bren
Application data broadcast in ad hoc networks is an important primitive that has received little systematic research - the main focus of prior research being on control data broadcast. In this paper, we show why control data broadcast and even multicast techniques are insufficient for reliable application data broadcast; in fact their reliability degrades sharply with increasing application data size. We discover the root cause of this to be IP fragmenting the application data but not providing good reliability control on the fragments. We hence propose READ (reliable and efficient application-data dissemination), a protocol based on higher-layer fragmentation with fragment-level reliability control. READ splits a data packet into fragments, and disseminates them separately at dynamically adaptive intervals. Receivers piggyback implicit NACKs when propagating the fragments, and retrieve missing fragments from neighbors. Through experiments, we show that READ consistently achieves high delivery ratio and short latency, outperforming all other examined protocols.
{"title":"Towards Reliable Application Data Broadcast in Wireless Ad Hoc Networks","authors":"Bo Xing, Mayur Deshpande, N. Venkatasubramanian, S. Mehrotra, D. Bren","doi":"10.1109/WCNC.2007.742","DOIUrl":"https://doi.org/10.1109/WCNC.2007.742","url":null,"abstract":"Application data broadcast in ad hoc networks is an important primitive that has received little systematic research - the main focus of prior research being on control data broadcast. In this paper, we show why control data broadcast and even multicast techniques are insufficient for reliable application data broadcast; in fact their reliability degrades sharply with increasing application data size. We discover the root cause of this to be IP fragmenting the application data but not providing good reliability control on the fragments. We hence propose READ (reliable and efficient application-data dissemination), a protocol based on higher-layer fragmentation with fragment-level reliability control. READ splits a data packet into fragments, and disseminates them separately at dynamically adaptive intervals. Receivers piggyback implicit NACKs when propagating the fragments, and retrieve missing fragments from neighbors. Through experiments, we show that READ consistently achieves high delivery ratio and short latency, outperforming all other examined protocols.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"32 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":"128109532","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}
Motivated by the desirable attributes of unitary space-time (ST) codes and constant envelope modulations, we introduce an ST continuous phase modulation (CPM) methodology and its companion noncoherent receiver. We consider M-ary full-response CPMs, with a modulation index of 1/M and multiple transmit antennas. Through careful selection of an underlying differential group code, the defining characteristics of the CPM transmissions (constant envelope and spectral bandwidth) are effectively maintained. Using a set of interference suppressed statistics and taking advantage of the underlying ST differential encoding, the receiver performs conventional differential detection (CDD). Results for M = 2 with four transmit antennas show that the proposed CDD performs within 4 dB of the coherent detection lower bound, at a symbol-error-rate of 10-. Furthermore, due to the underlying unitary structure of the ST-CPM, the CDD achieves a diversity order comparable to that of coherent detection at high SNR.
{"title":"Differential Group Space-Time Block Coded CPM","authors":"M. Riediger, P. Ho","doi":"10.1109/WCNC.2007.115","DOIUrl":"https://doi.org/10.1109/WCNC.2007.115","url":null,"abstract":"Motivated by the desirable attributes of unitary space-time (ST) codes and constant envelope modulations, we introduce an ST continuous phase modulation (CPM) methodology and its companion noncoherent receiver. We consider M-ary full-response CPMs, with a modulation index of 1/M and multiple transmit antennas. Through careful selection of an underlying differential group code, the defining characteristics of the CPM transmissions (constant envelope and spectral bandwidth) are effectively maintained. Using a set of interference suppressed statistics and taking advantage of the underlying ST differential encoding, the receiver performs conventional differential detection (CDD). Results for M = 2 with four transmit antennas show that the proposed CDD performs within 4 dB of the coherent detection lower bound, at a symbol-error-rate of 10-. Furthermore, due to the underlying unitary structure of the ST-CPM, the CDD achieves a diversity order comparable to that of coherent detection at high SNR.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"38 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":"121792804","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}
With the rapid development of wireless mesh networks (WMNs) technology, more and more commercial products and even solutions are provided in trial applications. Especially, the 802.11-based WMNs are considered as one of the best networking technology to extend the coverage of wireless LAN. However, few practical optimization tools are available for the planning and design of commercial WMNs. In this paper, the channel assignment tool (CAT) designed for the optimized backhaul networking of multi-radio multi-channel (MRMC) WMNs is presented. In the proposed channel assignment algorithm, several crucial factors affecting real networking performance are taken into account. Besides, the CAT is implemented as a flexible software module, which can be easily combined with other optimization and planning tool, as well as works independently. Furthermore, through the outdoor test taken on the test-bed consisting of commercial wireless mesh routers, the optimal channel assignment scheme figured out by the CAT is verified to perform best in the real MRMC WMN.
{"title":"Implementation and Evaluation of Channel Assignment Tool for Multi-Radio Multi-Channel Wireless Mesh Networks","authors":"Wei Xie, Mingbo Xiao, Felix Zhao, Yan Yao","doi":"10.1109/WCNC.2007.518","DOIUrl":"https://doi.org/10.1109/WCNC.2007.518","url":null,"abstract":"With the rapid development of wireless mesh networks (WMNs) technology, more and more commercial products and even solutions are provided in trial applications. Especially, the 802.11-based WMNs are considered as one of the best networking technology to extend the coverage of wireless LAN. However, few practical optimization tools are available for the planning and design of commercial WMNs. In this paper, the channel assignment tool (CAT) designed for the optimized backhaul networking of multi-radio multi-channel (MRMC) WMNs is presented. In the proposed channel assignment algorithm, several crucial factors affecting real networking performance are taken into account. Besides, the CAT is implemented as a flexible software module, which can be easily combined with other optimization and planning tool, as well as works independently. Furthermore, through the outdoor test taken on the test-bed consisting of commercial wireless mesh routers, the optimal channel assignment scheme figured out by the CAT is verified to perform best in the real MRMC WMN.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"27 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":"115983272","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}
A new closed-form formula of the joint probability density function (joint probability density function) of the EGC (equal gain combining) diversity with arbitrary correlation coefficients in terms of the generalized Laguerre polynomial is adopted to analyze the error probability for the performance of a MC-CDMA (multi-carrier coded-division multiple-access) system in this investigation. For the shake of avoiding the difficulty of explicitly obtaining the pdf, for example, determining the CF (characteristic functions), of the SNR (signal-to-noise ratio) at the EGC output. The results from the numerical and the simulation work with some of the assumed parameters of correlated Nakagami-m pdf with different correlation coefficients are conduct for validation purpose. The results obviously prove that the superior system performance is obtained for the MC-CDMA system, which is in frequency selective environments with branches correlation, when properly consider and get rid of the impact of branches correlation of fading channels.
{"title":"Performance Evaluation of MC-CDMA Systems with EGC Diversity over Correlated Selective Fading Channels","authors":"J. Chen, C. Liou","doi":"10.1109/WCNC.2007.764","DOIUrl":"https://doi.org/10.1109/WCNC.2007.764","url":null,"abstract":"A new closed-form formula of the joint probability density function (joint probability density function) of the EGC (equal gain combining) diversity with arbitrary correlation coefficients in terms of the generalized Laguerre polynomial is adopted to analyze the error probability for the performance of a MC-CDMA (multi-carrier coded-division multiple-access) system in this investigation. For the shake of avoiding the difficulty of explicitly obtaining the pdf, for example, determining the CF (characteristic functions), of the SNR (signal-to-noise ratio) at the EGC output. The results from the numerical and the simulation work with some of the assumed parameters of correlated Nakagami-m pdf with different correlation coefficients are conduct for validation purpose. The results obviously prove that the superior system performance is obtained for the MC-CDMA system, which is in frequency selective environments with branches correlation, when properly consider and get rid of the impact of branches correlation of fading channels.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"67 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":"131951661","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 concept of a hybrid wireless-optical broadband access network (referred to as WOBAN here) is a very attractive one. This is because it may be costly in several situations to run fiber to every home from the telecom central office (CO); also, providing wireless access from the CO to every end user may not be possible because of limited spectrum. Thus, running fiber as far as possible from the CO towards the end user and then having wireless access technologies take over may be an excellent compromise. How far should fiber penetrate before wireless takes over is an interesting engineering design and optimization problem, which our study is focussing on. We propose and investigate the characteristics of a "mixed integer programming (MIP)" model for optimum placements of base stations (BS) and optical network units (ONU) in a WOBAN (primal problem). We develop several constraints to be satisfied: BS and ONU installation, user and channel assignment, and signal-quality and interference constraints. To solve this MIP with reasonable accuracy, we use "Lagrangean relaxation" to obtain the corresponding "Lagrangean dual" problem. Via simulation experiments, we verify how sensitive is the placement problem with respect to a set of chosen metrics.
{"title":"A Mixed Integer Programming Model for Optimum Placement of Base Stations and Optical Network Units in a Hybrid Wireless-Optical Broadband Access Network (WOBAN)","authors":"S. Sarkar, Hong-Hsu Yen, S. Dixit, B. Mukherjee","doi":"10.1109/WCNC.2007.714","DOIUrl":"https://doi.org/10.1109/WCNC.2007.714","url":null,"abstract":"The concept of a hybrid wireless-optical broadband access network (referred to as WOBAN here) is a very attractive one. This is because it may be costly in several situations to run fiber to every home from the telecom central office (CO); also, providing wireless access from the CO to every end user may not be possible because of limited spectrum. Thus, running fiber as far as possible from the CO towards the end user and then having wireless access technologies take over may be an excellent compromise. How far should fiber penetrate before wireless takes over is an interesting engineering design and optimization problem, which our study is focussing on. We propose and investigate the characteristics of a \"mixed integer programming (MIP)\" model for optimum placements of base stations (BS) and optical network units (ONU) in a WOBAN (primal problem). We develop several constraints to be satisfied: BS and ONU installation, user and channel assignment, and signal-quality and interference constraints. To solve this MIP with reasonable accuracy, we use \"Lagrangean relaxation\" to obtain the corresponding \"Lagrangean dual\" problem. Via simulation experiments, we verify how sensitive is the placement problem with respect to a set of chosen metrics.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"29 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":"132422198","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}
Y. Takizawa, N. Taniguchi, S. Yamanaka, A. Yamaguchi, S. Obana
In emerging wireless communication environments, a variety of wireless systems will coexist using a variety of applications. On the other hand, concern is increasing that the growing use of wireless systems will exhaust finite radio resources. Cognitive radio, which aims to optimize the utilization efficiency of radio resources by combining multiple wireless systems, has been proposed as a solution to this problem. In a cognitive wireless network composed of nodes equipped with multiple wireless systems, we have proposed a traffic control method that decreases delay and increases throughput by using wireless link aggregation. In this paper, our proposed method is presented, and its performance is shown through evaluation with IEEE802.11 and IEEE802.16.
{"title":"Traffic Control for Cognitive Wireless Networks Composed of IEEE802.11 and IEEE802.16","authors":"Y. Takizawa, N. Taniguchi, S. Yamanaka, A. Yamaguchi, S. Obana","doi":"10.1109/WCNC.2007.701","DOIUrl":"https://doi.org/10.1109/WCNC.2007.701","url":null,"abstract":"In emerging wireless communication environments, a variety of wireless systems will coexist using a variety of applications. On the other hand, concern is increasing that the growing use of wireless systems will exhaust finite radio resources. Cognitive radio, which aims to optimize the utilization efficiency of radio resources by combining multiple wireless systems, has been proposed as a solution to this problem. In a cognitive wireless network composed of nodes equipped with multiple wireless systems, we have proposed a traffic control method that decreases delay and increases throughput by using wireless link aggregation. In this paper, our proposed method is presented, and its performance is shown through evaluation with IEEE802.11 and IEEE802.16.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"21 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":"132498866","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
扫码关注我们
求助内容：
应助结果提醒方式：