Pub Date : 2007-06-10DOI: 10.1109/LANMAN.2007.4295997
Sarat Chandra, A. Sahoo
Scheduling and call admission control (CAC) in IEEE 802.16 system play a vital role in the performance of the system. The 802.16 standard does not specify any scheduling architecture or CAC. Many proposals assume a bandwidth based CAC which only provides bandwidth guarantee, but cannot fulfill delay and jitter requirements. In this paper, we propose a CAC that ensures QoS guarantee in terms of bandwidth, delay and jitter. We also present a novel method of estimating bandwidth requirement of variable bit rate application to increase the resource utilization of the system. We present our simulation result to show the effectiveness of bandwidth estimation and better performance over bandwidth based CAC.
{"title":"An Efficient Call Admission Control for IEEE 802.16 Networks","authors":"Sarat Chandra, A. Sahoo","doi":"10.1109/LANMAN.2007.4295997","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295997","url":null,"abstract":"Scheduling and call admission control (CAC) in IEEE 802.16 system play a vital role in the performance of the system. The 802.16 standard does not specify any scheduling architecture or CAC. Many proposals assume a bandwidth based CAC which only provides bandwidth guarantee, but cannot fulfill delay and jitter requirements. In this paper, we propose a CAC that ensures QoS guarantee in terms of bandwidth, delay and jitter. We also present a novel method of estimating bandwidth requirement of variable bit rate application to increase the resource utilization of the system. We present our simulation result to show the effectiveness of bandwidth estimation and better performance over bandwidth based CAC.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121390276","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295988
Jingyuan Sun
This paper studies system uplink capacity in multi-hop cellular networks with mobile nodes as relays. And according to simulation and analysis results, author provides an enhanced architecture in CDMA Two-Hop Cellular Networks (THCN) with relay capability limitation. We analyze the real relay capability request in the general layered multi-hop cellular networks, which provide relay capability is an indispensable factor when set up a multi-hop cellular system. Simulations show that mobile and fixed relay capability limitation will decide the enhancement of system uplink capacity. We provide the maximum system uplink capacity in a CDMA THCN cell. And then compare the different scenarios with lack of relay capability in uplink, we get single-hop mobile user percentage should be 10-40% if there is no or less fixed relay nodes. Considering detects of the general architecture, we propose a new enhanced architecture, which is more effective with relay capability limitation. Simulation results show that it will enhance the system uplink capacity by about 21.4%, while about 17% with relay limitation. Simulation also shows that when enlarging single-hop user area, the total system capacity will be kept and the sending power in uplink will be saved.
{"title":"Uplink Capacity Enhancement In Two-Hop Cellular Networks With Limited Mobile Relays","authors":"Jingyuan Sun","doi":"10.1109/LANMAN.2007.4295988","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295988","url":null,"abstract":"This paper studies system uplink capacity in multi-hop cellular networks with mobile nodes as relays. And according to simulation and analysis results, author provides an enhanced architecture in CDMA Two-Hop Cellular Networks (THCN) with relay capability limitation. We analyze the real relay capability request in the general layered multi-hop cellular networks, which provide relay capability is an indispensable factor when set up a multi-hop cellular system. Simulations show that mobile and fixed relay capability limitation will decide the enhancement of system uplink capacity. We provide the maximum system uplink capacity in a CDMA THCN cell. And then compare the different scenarios with lack of relay capability in uplink, we get single-hop mobile user percentage should be 10-40% if there is no or less fixed relay nodes. Considering detects of the general architecture, we propose a new enhanced architecture, which is more effective with relay capability limitation. Simulation results show that it will enhance the system uplink capacity by about 21.4%, while about 17% with relay limitation. Simulation also shows that when enlarging single-hop user area, the total system capacity will be kept and the sending power in uplink will be saved.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128165987","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295983
M. Karaliopoulos, M. Papadopouli, Elias Raftopoulos, Haipeng Shen
Models of traffic demand are fundamental inputs to the design and engineering of data networks. In this paper we address this requirement in the context of large-scale wireless infrastructures using real measurement data from the University of North Carolina (UNC) wireless campus network. Our modeling effort focuses on capturing the demand variation in both the spatial and temporal domain in a way that scales well with the size of the wireless network. The network traffic dynamics are studied over two different week-long monitoring periods at various levels of spatial aggregation, from individual buildings to the whole network. We model traffic workload in terms of wireless sessions and network flows and find several modeling elements that are reusable in both temporal and spatial dimensions. The same set of parametric distributions for the session-and flow-related traffic variables capture the network traffic demand in both monitoring periods. Even more interestingly, these same distributions can characterize traffic dynamics at finer spatial scales, such as a single building or a group of buildings. We use our models to generate synthetic traffic and compare with trace data. The comparison clearly illustrates the trade-off between model scalability and reusability, on the one hand, and accuracy in capturing local-scale traffic dynamics on the other. Our main contribution is a novel behavioral approach for traffic demand modeling in large wireless networks that features high flexibility in the exploitation of the spatial and temporal resolution available in data traces.
{"title":"On scalable measurement-driven modeling of traffic demand in large WLANs","authors":"M. Karaliopoulos, M. Papadopouli, Elias Raftopoulos, Haipeng Shen","doi":"10.1109/LANMAN.2007.4295983","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295983","url":null,"abstract":"Models of traffic demand are fundamental inputs to the design and engineering of data networks. In this paper we address this requirement in the context of large-scale wireless infrastructures using real measurement data from the University of North Carolina (UNC) wireless campus network. Our modeling effort focuses on capturing the demand variation in both the spatial and temporal domain in a way that scales well with the size of the wireless network. The network traffic dynamics are studied over two different week-long monitoring periods at various levels of spatial aggregation, from individual buildings to the whole network. We model traffic workload in terms of wireless sessions and network flows and find several modeling elements that are reusable in both temporal and spatial dimensions. The same set of parametric distributions for the session-and flow-related traffic variables capture the network traffic demand in both monitoring periods. Even more interestingly, these same distributions can characterize traffic dynamics at finer spatial scales, such as a single building or a group of buildings. We use our models to generate synthetic traffic and compare with trace data. The comparison clearly illustrates the trade-off between model scalability and reusability, on the one hand, and accuracy in capturing local-scale traffic dynamics on the other. Our main contribution is a novel behavioral approach for traffic demand modeling in large wireless networks that features high flexibility in the exploitation of the spatial and temporal resolution available in data traces.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129320234","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295972
D. Britz, Robert R. Miller
The popularity of wireless LANs for Ethernet-speed home and business broadband connectivity has propelled their expansion into public applications such as "hot spots", "hot zones", and more recently, city-wide Internet access systems. As these outdoor WLAN-evolved 4G "nanocellular" networks grow, unconventional backhaul methods will need to be employed to bolster throughput as more users connect and begin to exchange richer multimedia content. In this paper we examine use of mesh-connected free-space optical links as a backhaul supplement to wireless, metallic and fiber media for such Neighborhood Area and city wide wireless networks.
{"title":"Mesh Free Space Optical Systems: A Method to Improve Broadband Neighborhood Area Network Backhaul","authors":"D. Britz, Robert R. Miller","doi":"10.1109/LANMAN.2007.4295972","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295972","url":null,"abstract":"The popularity of wireless LANs for Ethernet-speed home and business broadband connectivity has propelled their expansion into public applications such as \"hot spots\", \"hot zones\", and more recently, city-wide Internet access systems. As these outdoor WLAN-evolved 4G \"nanocellular\" networks grow, unconventional backhaul methods will need to be employed to bolster throughput as more users connect and begin to exchange richer multimedia content. In this paper we examine use of mesh-connected free-space optical links as a backhaul supplement to wireless, metallic and fiber media for such Neighborhood Area and city wide wireless networks.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121641710","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295967
Lijun Qian, Xiangfang Li, J. Attia, Z. Gajic
While FCC proposes spectrum sharing between a legacy TV system and a cognitive radio network to increase spectrum utilization, one of the major concerns is that the interference from the cognitive radio network should not violate the QoS requirements of the primary users. In this paper, we consider the scenario where the cognitive radio network is formed by secondary users with low power personal/portable devices and when both systems are operating simultaneously. A power control problem is formulated for the cognitive radio network to maximize the energy efficiency of the secondary users and guarantee the QoS of both the primary users and the secondary users. The feasibility condition of the problem is derived and both centralized and distributed solutions are provided. Because the co-channel interference are from heterogeneous systems, a joint power control and admission control procedure is suggested such that the priority of the primary users is always ensured. The simulation results demonstrate the effectiveness of the proposed schemes.
{"title":"Power Control for Cognitive Radio Ad Hoc Networks","authors":"Lijun Qian, Xiangfang Li, J. Attia, Z. Gajic","doi":"10.1109/LANMAN.2007.4295967","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295967","url":null,"abstract":"While FCC proposes spectrum sharing between a legacy TV system and a cognitive radio network to increase spectrum utilization, one of the major concerns is that the interference from the cognitive radio network should not violate the QoS requirements of the primary users. In this paper, we consider the scenario where the cognitive radio network is formed by secondary users with low power personal/portable devices and when both systems are operating simultaneously. A power control problem is formulated for the cognitive radio network to maximize the energy efficiency of the secondary users and guarantee the QoS of both the primary users and the secondary users. The feasibility condition of the problem is derived and both centralized and distributed solutions are provided. Because the co-channel interference are from heterogeneous systems, a joint power control and admission control procedure is suggested such that the priority of the primary users is always ensured. The simulation results demonstrate the effectiveness of the proposed schemes.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"318 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133288518","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295974
Srihari Narlanka, Ranveer Chandra, P. Bahl, J. I. Ferrell
The Federal Communications Commission (FCC) is currently exploring the use of TV bands for unlicensed communication. This step has sparked significant interest in the research and corporate community as it opens up new possibilities for high speed and long range wireless communication. In this paper, we present the design and implementation of a complete system that can detect the presence of TV signals, and perform high-speed data communication in an available TV band without interfering with neighboring TV bands. To the best of our knowledge, this is the first known system with all the above capabilities.
{"title":"A Hardware Platform for Utilizing TV Bands With a Wi-Fi Radio","authors":"Srihari Narlanka, Ranveer Chandra, P. Bahl, J. I. Ferrell","doi":"10.1109/LANMAN.2007.4295974","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295974","url":null,"abstract":"The Federal Communications Commission (FCC) is currently exploring the use of TV bands for unlicensed communication. This step has sparked significant interest in the research and corporate community as it opens up new possibilities for high speed and long range wireless communication. In this paper, we present the design and implementation of a complete system that can detect the presence of TV signals, and perform high-speed data communication in an available TV band without interfering with neighboring TV bands. To the best of our knowledge, this is the first known system with all the above capabilities.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132909178","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295970
This paper presents RTMAC, a realtime MAC protocol for wireless sensor network that can provide delay guarantee. RTMAC is based on TDMA protocol, but it is carefully designed to overcome the high latency of traditional TDMA protocols. It also conserves energy when a node may not be transmitting or receiving packets. We discuss the details of time slot assignment procedure of RTMAC and then present delay analysis of the protocol. We compare the performance of RTMAC with the well known energy efficient MAC protocol S-MAC using simulation. The simulation results show that RTMAC is better than S-MAC in terms of providing delay guarantee to packets.
{"title":"An Energy Efficient MAC in Wireless Sensor Networks to Provide Delay Guarantee","authors":"","doi":"10.1109/LANMAN.2007.4295970","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295970","url":null,"abstract":"This paper presents RTMAC, a realtime MAC protocol for wireless sensor network that can provide delay guarantee. RTMAC is based on TDMA protocol, but it is carefully designed to overcome the high latency of traditional TDMA protocols. It also conserves energy when a node may not be transmitting or receiving packets. We discuss the details of time slot assignment procedure of RTMAC and then present delay analysis of the protocol. We compare the performance of RTMAC with the well known energy efficient MAC protocol S-MAC using simulation. The simulation results show that RTMAC is better than S-MAC in terms of providing delay guarantee to packets.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121362449","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295991
S. Kasera
To aid security in the Internet, we propose a new connection oriented architecture to restrict reachability in the Internet to only those end hosts that explicitly request it. We first describe the various components of our architecture. Next, using qualitative arguments, and some preliminary computations, we show the benefits of our architecture. We also present viable strategies for minimizing connection state at routers, and discuss relevant security issues.
{"title":"A Connection Oriented Internet Architecture for Restricting Reachability","authors":"S. Kasera","doi":"10.1109/LANMAN.2007.4295991","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295991","url":null,"abstract":"To aid security in the Internet, we propose a new connection oriented architecture to restrict reachability in the Internet to only those end hosts that explicitly request it. We first describe the various components of our architecture. Next, using qualitative arguments, and some preliminary computations, we show the benefits of our architecture. We also present viable strategies for minimizing connection state at routers, and discuss relevant security issues.","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125795107","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295982
M. Rabby, K. Ravindran
The paper discusses the dynamics of bandwidth allocations that occur in an end-to-end QoS-aware data transport system over a LAN-MAN. Here, the controlled object is a logical connection that carries the application-level data flows over the service provider's data transport infrastructure. The goal is to allocate just-enough bandwidth, in order to maximize the service-provider revenues. Accurate control of bandwidth allocations with a revenue-oriented goal is quite complex, due to the interactions among various data flows that dynamically share the network capacity in the system. So, we employ an on-line monitor-and-control scheme, aided by heuristics, that iteratively adjusts the bandwidth allocation based on the observed packet loss rate. The bandwidth allocation is increased when the observed packet loss rate exceeds a user-specified threshold, with the increase being proportional to the loss rate (i.e., multiplicative increase). The bandwidth is decreased additively when the loss rate falls below a safe limit. We describe this MIAD-based bandwidth allocation scheme, and study its dynamics. When the LAN-MAN environments provide bandwidth capacities in a stable manner, our MIAD scheme can achieve an optimal bandwidth allocation (in the sense of user-level QoS and service-provider revenues).
{"title":"Dynamics of End-to-End Bandwidth Allocations in QoS-adaptive Data Connections","authors":"M. Rabby, K. Ravindran","doi":"10.1109/LANMAN.2007.4295982","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295982","url":null,"abstract":"The paper discusses the dynamics of bandwidth allocations that occur in an end-to-end QoS-aware data transport system over a LAN-MAN. Here, the controlled object is a logical connection that carries the application-level data flows over the service provider's data transport infrastructure. The goal is to allocate just-enough bandwidth, in order to maximize the service-provider revenues. Accurate control of bandwidth allocations with a revenue-oriented goal is quite complex, due to the interactions among various data flows that dynamically share the network capacity in the system. So, we employ an on-line monitor-and-control scheme, aided by heuristics, that iteratively adjusts the bandwidth allocation based on the observed packet loss rate. The bandwidth allocation is increased when the observed packet loss rate exceeds a user-specified threshold, with the increase being proportional to the loss rate (i.e., multiplicative increase). The bandwidth is decreased additively when the loss rate falls below a safe limit. We describe this MIAD-based bandwidth allocation scheme, and study its dynamics. When the LAN-MAN environments provide bandwidth capacities in a stable manner, our MIAD scheme can achieve an optimal bandwidth allocation (in the sense of user-level QoS and service-provider revenues).","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116599322","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 : 2007-06-10DOI: 10.1109/LANMAN.2007.4295968
A. Dua, N. Bambos
We address the problem of distributed power control for supporting packetized traffic in wireless ad hoc networks (e.g. 802.11 based wireless LANs). The interference experienced by a link coexisting with other links in a shared wireless medium is responsive to the actions of the transmitter on the link. Consequently, the evolution of seemingly independent queues at autonomously acting transmitters is tightly entangled through the shared wireless channel. Thus, an exact analysis of the distributed power control problem which also incorporates queuing dynamics is intractable. To establish a performance benchmark, we first design the optimal centralized backlog aware power control algorithm (Oracle) in a dynamic programming (DP) framework. We then propose a heuristic backlog aware distributed power control algorithm (BDD). The implementation of BDD is based on randomized selection from lookup tables which are computed offline at each transmitter. The computational complexity and memory requirements for BDD are independent of the network size and topology, making it attractive from a practical perspective. Experimental results demonstrate that BDD closely matches Oracle in performance and enhances system throughput by 20-30% compared to benchmark backlog insensitive power control algorithms (e.g. Foschini-Miljanic).
{"title":"Distributed Backlog-Driven Power Control in Wireless Networking","authors":"A. Dua, N. Bambos","doi":"10.1109/LANMAN.2007.4295968","DOIUrl":"https://doi.org/10.1109/LANMAN.2007.4295968","url":null,"abstract":"We address the problem of distributed power control for supporting packetized traffic in wireless ad hoc networks (e.g. 802.11 based wireless LANs). The interference experienced by a link coexisting with other links in a shared wireless medium is responsive to the actions of the transmitter on the link. Consequently, the evolution of seemingly independent queues at autonomously acting transmitters is tightly entangled through the shared wireless channel. Thus, an exact analysis of the distributed power control problem which also incorporates queuing dynamics is intractable. To establish a performance benchmark, we first design the optimal centralized backlog aware power control algorithm (Oracle) in a dynamic programming (DP) framework. We then propose a heuristic backlog aware distributed power control algorithm (BDD). The implementation of BDD is based on randomized selection from lookup tables which are computed offline at each transmitter. The computational complexity and memory requirements for BDD are independent of the network size and topology, making it attractive from a practical perspective. Experimental results demonstrate that BDD closely matches Oracle in performance and enhances system throughput by 20-30% compared to benchmark backlog insensitive power control algorithms (e.g. Foschini-Miljanic).","PeriodicalId":347028,"journal":{"name":"2007 15th IEEE Workshop on Local & Metropolitan Area Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128892635","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
扫码关注我们
求助内容：
应助结果提醒方式：