2009 IEEE Wireless Communications and Networking Conference最新文献_第4页

Local Scheduling Scheme for Opportunistic Routing 机会路由的本地调度方案

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917786

Yanhua Li, Yuan’an Liu, Li Li, P. Luo

引用次数: 7

Optimal Resource Allocation for Energy Efficient Transmissions with QoS Constrains in Coded Cooperative Networks 编码合作网络中具有QoS约束的节能传输的最优资源分配

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917868

Yan Zhang, Min Sheng, Jiandong Li, Ye Tian, Junliang Yao, Di Tang

引用次数: 1

Resource Allocation for OFDMA Relay-Enhanced System with Cooperative Selection Diversity 协作选择分集OFDMA中继增强系统的资源分配

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917947

Liping Wang, Yusheng Ji, Fuqiang Liu

{"title":"Resource Allocation for OFDMA Relay-Enhanced System with Cooperative Selection Diversity","authors":"Liping Wang, Yusheng Ji, Fuqiang Liu","doi":"10.1109/WCNC.2009.4917947","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917947","url":null,"abstract":"The cooperative selection diversity (CSD) scheme which dynamically selects the best transmission scheme between decode-and-forward relaying and direct transmission outperforms the other complex cooperative diversity schemes in terms of throughput and implementation complexity. In this paper, we formulate the optimal resource allocation problem with a fairness constraint in the downlink of OFDMA relay-enhanced system when CSD based transmissions are considered. The problem is linearized into a binary integer programming problem by using a constant power allocation. To solve the linear programming problem, we proposed a heuristic joint path selection and sub-channel allocation algorithm. Moreover, a void filling algorithm is designed to make full use of the resources. Simulation results demonstrate that our path selection rule based on the end-to-end achievable data rate and the void filling algorithm achieve more system throughput especially when the proportion of the two zones used in the two-slot relaying pattern is far away from the optimal value. The heuristic resource allocation algorithm provides a suboptimal solution to gain a tradeoff between system throughput maximization and fairness.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"15 Suppl 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114859663","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}

引用次数: 16

Distributed Spectrum Sensing in Cognitive Radio Networks 认知无线电网络中的分布式频谱感知

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917679

Zhiqiang Li, F. Richard Yu, Minyi Huang

引用次数: 24

Joint Source/Relay Precoder Design in Amplify-and-Forward Relay Systems Using an MMSE Criterion 基于MMSE准则的放大转发中继系统联合源/中继预编码器设计

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917775

F. Tseng, Wen-Rong Wu, Jwo-Yuh Wu

引用次数: 7

Optimum Power Allocation for Expected Achievable Rate Maximization with Outage Constraints in Cooperative Relay Networks 基于中断约束的合作中继网络期望可达速率最大化的最优功率分配

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917873

James C. F. Li, S. Dey

{"title":"Optimum Power Allocation for Expected Achievable Rate Maximization with Outage Constraints in Cooperative Relay Networks","authors":"James C. F. Li, S. Dey","doi":"10.1109/WCNC.2009.4917873","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917873","url":null,"abstract":"In this paper, we study an optimum power allocation problem for expected achievable rate maximization in a typical three node cooperative relay network with slow block fading channels. A long term average power and an outage probability threshold serve as the constraints on the problem. This is motivated by the fact that in many applications, a mixture of delay-sensitive and -insensitive data are transmitted and either maximizing expected achievable rate or minimizing the outage probability would probably not provide the desired solution. The problem considered in this paper (known as the \"service outage based rate and power allocation\" problem in literature) thus achieves a tradeoff between the two extremes of ergodic capacity and outage capacity. We show that the optimum power allocation scheme is a switched policy between two deterministic policies. Extensive numerical results are presented to demonstrate the benefits of cooperation as opposed to that of non-cooperation or direct transmission. We study the performance of the two simple but popular relaying schemes, namely, the amplify-and-forward and decode-and-forward protocols. It is seen that these relaying protocols are extremely resilient against demanding outage probability constraints over a range of basic rate requirements and average power constraints.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"323 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132457791","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}

引用次数: 1

Admission Control Based on Dynamic Rate Constraints in Multi-Hop Networks 基于动态速率约束的多跳网络准入控制

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917565

S. Odou, Steven Martin, K. A. Agha

{"title":"Admission Control Based on Dynamic Rate Constraints in Multi-Hop Networks","authors":"S. Odou, Steven Martin, K. A. Agha","doi":"10.1109/WCNC.2009.4917565","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917565","url":null,"abstract":"This paper presents an admission control algorithm based on dynamic constraints for multi-hop networks. Assuming each node knows the topology and flow reservations within its radio range, local constraints on flow rates can be computed. As long as these constraints are satisfied, flows are accepted. Since computing optimal constraints is not practical, existing approaches compute a system of either necessary or sufficient constraints. In practice, the approach based on necessary constraints tends to overload the network whereas in the latter approach, a significant part of the bandwidth remains unused. In addition, these works assume that the interference model and the sublayers are optimal. In this paper, we propose to take into account the channel state in the constraints computation and, thus, to adjust them according to model relevance. Therefore we give a probabilistic model to evaluate the time spent by the channel in the idle state. By comparing this estimation with the measure value, we evaluate the model accuracy and include the corresponding error rate in the constraints of the admission control. Simulations show that our admission control algorithm outperforms previous work.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130190356","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}

引用次数: 4

Deflect Routing for Throughput Improvement in Multi-Hop Millimeter-Wave WPAN System 改进多跳毫米波WPAN系统吞吐量的偏转路由

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917660

Z. Lan, C. Sum, Junyi Wang, T. Baykaş, Jing Gao, H. Nakase, H. Harada, S. Kato

{"title":"Deflect Routing for Throughput Improvement in Multi-Hop Millimeter-Wave WPAN System","authors":"Z. Lan, C. Sum, Junyi Wang, T. Baykaş, Jing Gao, H. Nakase, H. Harada, S. Kato","doi":"10.1109/WCNC.2009.4917660","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917660","url":null,"abstract":"In this paper, we propose a cross-layer deflect routing scheme that improves effective throughput of multi-hop millimeter-wave wireless personal area network (mmWave WPAN) system. The upcoming mmWave WPAN is designed to provide Gbps-order transmission capability, targeting applications like high definition TV (HDTV) transmission, high speed wireless docking and gaming etc. Adopting multi-hop relay offers solutions to the issues existing in mmWave WPAN system such as limited coverage range caused by the significant path loss, dramatic communication link change due to the unexpected blockage of the line-of-sight (LOS) path etc. However, multi-hop relay on the other hand decreases the effective throughput because of the required extra time. As a result, the compromised throughput may not be able to support the above applications which are greedy for data rate. Inspired by the fact that the significant path loss of millimeter-wave environment can provide good space isolation, our proposed scheme manages to improve the multi-hop throughput by sharing time slots for relay path with direct path for other transmissions. We also propose two algorithms, namely random fit deflect routing (RFDR) and best fit deflect routing (BFDR), to find the relay path on which the interference due to time slot sharing is low enough to guarantee the concurrent transmissions. Computer simulations show that, in realistic 60GHz environment, the effective multi-hop throughput can be improved up to 45%.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134215529","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}

引用次数: 14

Fair Flow Control in Solar Powered WLAN Mesh Networks 太阳能无线局域网网状网络的公平流量控制

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917720

Ghada H. Badawy, A. Sayegh, T. D. Todd

{"title":"Fair Flow Control in Solar Powered WLAN Mesh Networks","authors":"Ghada H. Badawy, A. Sayegh, T. D. Todd","doi":"10.1109/WCNC.2009.4917720","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917720","url":null,"abstract":"Wireless LAN mesh networks are used to provide Wi-Fi access for temporary events. In this type of application it is sometimes necessary to operate some of the mesh nodes using an energy sustainable source, such as solar power. When the network is deployed, each mesh node is equipped with a solar panel and battery combination which is sufficient to prevent network outage using an assumed traffic design profile. During post-deployment network operation however, the actual traffic flows may be different from that for which the nodes were originally provisioned. To prevent node outage, the network must flow control the inputs, and this should be done in as fair a manner as possible. In this paper we propose a mechanism for achieving fair flow control on a per-flow basis. We first formulate a bound which achieves the best max-min fair flow control subject to eliminating network outage. This bound is non-causal in that it uses knowledge of future solar insolation and traffic flows to determine the optimum flow control. The bound motivates a proposed causal flow control algorithm whose operation uses prediction based on access to on-line historical weather data. Our results show that the proposed algorithm eliminates node outage and performs very well compared to the optimum flow control bound for a variety of network scenarios.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134415424","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}

引用次数: 6

A Clean-Slate Architecture for Reliable Data Delivery in Wireless Mesh Networks 无线网状网络中可靠数据传输的全新架构

2009 IEEE Wireless Communications and Networking Conference Pub Date : 2009-04-05 DOI: 10.1109/WCNC.2009.4917490

Sherif M. ElRakabawy, C. Lindemann

引用次数: 6