Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917786
Yanhua Li, Yuan’an Liu, Li Li, P. Luo
Opportunistic routing is a new design trend of wireless routing, which can dramatically improve the end-to-end throughput over traditional routing by judiciously utilizing the broadcasting nature of wireless network. However, the global scheduling scheme it adopts restricts its application in large-scale wireless network, due to the big waste of the end-to-end transmission latency and the computation cost. So, how to schedule the transmissions of different forwarders is essentially an important issue of the opportunistic routing scheme design. In this paper, we propose a graph partition based local scheduling (GPLS) scheme for opportunistic routing. It partitions the wireless topology into several subgraphs, and realizes the local forwarding in each subgraph. Simulation results show that our local forwarding scheme can significantly improve the network performances in large-scale network over existing opportunistic routing schemes, in terms of the end-to-end delay and the life time of the wireless node.
{"title":"Local Scheduling Scheme for Opportunistic Routing","authors":"Yanhua Li, Yuan’an Liu, Li Li, P. Luo","doi":"10.1109/WCNC.2009.4917786","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917786","url":null,"abstract":"Opportunistic routing is a new design trend of wireless routing, which can dramatically improve the end-to-end throughput over traditional routing by judiciously utilizing the broadcasting nature of wireless network. However, the global scheduling scheme it adopts restricts its application in large-scale wireless network, due to the big waste of the end-to-end transmission latency and the computation cost. So, how to schedule the transmissions of different forwarders is essentially an important issue of the opportunistic routing scheme design. In this paper, we propose a graph partition based local scheduling (GPLS) scheme for opportunistic routing. It partitions the wireless topology into several subgraphs, and realizes the local forwarding in each subgraph. Simulation results show that our local forwarding scheme can significantly improve the network performances in large-scale network over existing opportunistic routing schemes, in terms of the end-to-end delay and the life time of the wireless node.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"46 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":"120918759","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917868
Yan Zhang, Min Sheng, Jiandong Li, Ye Tian, Junliang Yao, Di Tang
In this paper, we propose the optimal resource allocation strategies for energy constrained coded cooperative networks. By combining power control and multi-relays selection with LOC adjustment, our schemes aim at providing higher QoS and extending network lifetime. We consider the TDMA based scenario where one node acts as the source and the other nodes can be selected as relay nodes in a time slot and each node is limited by separate power constraint. Firstly, we build an optimization model for minimizing and balancing the energy consumption under QoS constrains. After that, when the LOC is constant, a closed form optimal solution is got by KKT conditions, which results in a dynamic resource allocation strategy. Moreover, based on solution for the fixed LOC, a suboptimal scheme is further proposed for a variable LOC via one dimension searching. The simulation results show that our schemes can improve network QoS and prolong network lifetime dramatically comparing with other existing cooperative resource allocation schemes.
{"title":"Optimal Resource Allocation for Energy Efficient Transmissions with QoS Constrains in Coded Cooperative Networks","authors":"Yan Zhang, Min Sheng, Jiandong Li, Ye Tian, Junliang Yao, Di Tang","doi":"10.1109/WCNC.2009.4917868","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917868","url":null,"abstract":"In this paper, we propose the optimal resource allocation strategies for energy constrained coded cooperative networks. By combining power control and multi-relays selection with LOC adjustment, our schemes aim at providing higher QoS and extending network lifetime. We consider the TDMA based scenario where one node acts as the source and the other nodes can be selected as relay nodes in a time slot and each node is limited by separate power constraint. Firstly, we build an optimization model for minimizing and balancing the energy consumption under QoS constrains. After that, when the LOC is constant, a closed form optimal solution is got by KKT conditions, which results in a dynamic resource allocation strategy. Moreover, based on solution for the fixed LOC, a suboptimal scheme is further proposed for a variable LOC via one dimension searching. The simulation results show that our schemes can improve network QoS and prolong network lifetime dramatically comparing with other existing cooperative resource allocation schemes.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"21 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":"121484213","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917947
Liping Wang, Yusheng Ji, Fuqiang Liu
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.
{"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}
Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917679
Zhiqiang Li, F. Richard Yu, Minyi Huang
In cognitive radio networks, secondary users can cooperatively sense the spectrum to detect the presence of primary users. In this paper, we propose a fully distributed and scalable cooperative spectrum sensing scheme based on recent advances in consensus algorithms. In the proposed scheme, the secondary users can maintain coordination based on only local information exchange without a centralized common receiver. Simulation results show that the proposed consensus scheme can have significant lower missing detection probabilities and false alarm probabilities in cognitive radio networks. It is also demonstrated that the proposed scheme has proven sensitivity in detecting the primary user's presence.
{"title":"Distributed Spectrum Sensing in Cognitive Radio Networks","authors":"Zhiqiang Li, F. Richard Yu, Minyi Huang","doi":"10.1109/WCNC.2009.4917679","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917679","url":null,"abstract":"In cognitive radio networks, secondary users can cooperatively sense the spectrum to detect the presence of primary users. In this paper, we propose a fully distributed and scalable cooperative spectrum sensing scheme based on recent advances in consensus algorithms. In the proposed scheme, the secondary users can maintain coordination based on only local information exchange without a centralized common receiver. Simulation results show that the proposed consensus scheme can have significant lower missing detection probabilities and false alarm probabilities in cognitive radio networks. It is also demonstrated that the proposed scheme has proven sensitivity in detecting the primary user's presence.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"27 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":"124449329","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917775
F. Tseng, Wen-Rong Wu, Jwo-Yuh Wu
This paper addresses the joint source/relay precoder design problem in amplify-and-forward (AF) cooperative communication systems where multiple antennas are equipped at the source, the relay, and the destination. Existing solutions to the problem only consider the relay link and, thus, do not fully exploit all the available link resource. Using a minimum-mean-squared-error (MMSE) criterion, we propose a joint precoder design method, taking both the direct and relay links into account. It is shown that the MMSE is a highly nonlinear function of the precoder matrices, and a direct minimization is not feasible. To facilitate analysis, we propose to design the precoders toward first diagonalizing the MSE matrix of the relay link. This imposes certain structural constraints on both precoders that allow us to derive an analytically tractable MSE upper bound. By conducting minimization with respect to this upper bound, the solution can be obtained by an iterative waterfilling technique. Simulations show that the proposed design can significantly enhance the performance of MIMO AF cooperative systems.
{"title":"Joint Source/Relay Precoder Design in Amplify-and-Forward Relay Systems Using an MMSE Criterion","authors":"F. Tseng, Wen-Rong Wu, Jwo-Yuh Wu","doi":"10.1109/WCNC.2009.4917775","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917775","url":null,"abstract":"This paper addresses the joint source/relay precoder design problem in amplify-and-forward (AF) cooperative communication systems where multiple antennas are equipped at the source, the relay, and the destination. Existing solutions to the problem only consider the relay link and, thus, do not fully exploit all the available link resource. Using a minimum-mean-squared-error (MMSE) criterion, we propose a joint precoder design method, taking both the direct and relay links into account. It is shown that the MMSE is a highly nonlinear function of the precoder matrices, and a direct minimization is not feasible. To facilitate analysis, we propose to design the precoders toward first diagonalizing the MSE matrix of the relay link. This imposes certain structural constraints on both precoders that allow us to derive an analytically tractable MSE upper bound. By conducting minimization with respect to this upper bound, the solution can be obtained by an iterative waterfilling technique. Simulations show that the proposed design can significantly enhance the performance of MIMO AF cooperative systems.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"102 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":"132250966","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917873
James C. F. Li, S. Dey
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.
{"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}
Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917565
S. Odou, Steven Martin, K. A. Agha
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.
{"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}
Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917660
Z. Lan, C. Sum, Junyi Wang, T. Baykaş, Jing Gao, H. Nakase, H. Harada, S. Kato
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%.
{"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}
Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917720
Ghada H. Badawy, A. Sayegh, T. D. Todd
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.
{"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}
Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917490
Sherif M. ElRakabawy, C. Lindemann
In this paper, we introduce a clean-slate architecture for improving the delivery of data packets in IEEE 802.11 wireless mesh networks. Opposed to the rigid TCP/IP layer architecture which exhibits serious deficiencies in such networks, we propose a unitary layer approach that combines both routing and transport functionalities in a single layer. The new Mesh Transmission Layer (MTL) incorporates cross-interacting routing and transport modules for a reliable data delivery based on the loss probabilities of wireless links. Due to the significant drawbacks of standard TCP over IEEE 802.11, we particularly focus on the transport module, proposing a pure rate-based approach for transmitting data packets according to the current contention in the network. By considering the IEEE 802.11 spatial reuse constraint and employing a novel acknowledgment scheme, the new transport module improves both goodput and fairness in wireless mesh networks. In a comparative performance study, we show that MTL achieves up to 48% more goodput and up to 100% less packet drops than TCP/IP, while maintaining excellent fairness results.
{"title":"A Clean-Slate Architecture for Reliable Data Delivery in Wireless Mesh Networks","authors":"Sherif M. ElRakabawy, C. Lindemann","doi":"10.1109/WCNC.2009.4917490","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917490","url":null,"abstract":"In this paper, we introduce a clean-slate architecture for improving the delivery of data packets in IEEE 802.11 wireless mesh networks. Opposed to the rigid TCP/IP layer architecture which exhibits serious deficiencies in such networks, we propose a unitary layer approach that combines both routing and transport functionalities in a single layer. The new Mesh Transmission Layer (MTL) incorporates cross-interacting routing and transport modules for a reliable data delivery based on the loss probabilities of wireless links. Due to the significant drawbacks of standard TCP over IEEE 802.11, we particularly focus on the transport module, proposing a pure rate-based approach for transmitting data packets according to the current contention in the network. By considering the IEEE 802.11 spatial reuse constraint and employing a novel acknowledgment scheme, the new transport module improves both goodput and fairness in wireless mesh networks. In a comparative performance study, we show that MTL achieves up to 48% more goodput and up to 100% less packet drops than TCP/IP, while maintaining excellent fairness results.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"108 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":"131706221","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
扫码关注我们
求助内容：
应助结果提醒方式：