A novel framework is proposed to introduce the game theory into power control in UWB network. Firstly, the power control problem is modeled as a cooperation potential game. Secondly, a novel utility function and potential function are introduced for UWB network. Finally, the process of power control is expressed as the process of maximum potential function for each active link. For the application of the framework, a new algorithm is also proposed. The algorithm converges to an exact Nash equilibrium by the theoretical proving. Through the simulation which compares the performance of our algorithm and the traditional scheme, the result shows that our algorithm performed better in both convergence and fairness, and also saved power consumed.
{"title":"Adaptive Power Control for Cooperative UWB Network Using Potential Game Theory","authors":"Fangmin Xu, Luyong Zhang, Zheng Zhou, Qilian Liang","doi":"10.1109/WCNC.2007.305","DOIUrl":"https://doi.org/10.1109/WCNC.2007.305","url":null,"abstract":"A novel framework is proposed to introduce the game theory into power control in UWB network. Firstly, the power control problem is modeled as a cooperation potential game. Secondly, a novel utility function and potential function are introduced for UWB network. Finally, the process of power control is expressed as the process of maximum potential function for each active link. For the application of the framework, a new algorithm is also proposed. The algorithm converges to an exact Nash equilibrium by the theoretical proving. Through the simulation which compares the performance of our algorithm and the traditional scheme, the result shows that our algorithm performed better in both convergence and fairness, and also saved power consumed.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"47 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":"116571018","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}
In this paper, a new achievable rate region for general interference channels with common information is presented. Our result improves upon by applying simultaneous superposition coding over sequential superposition coding. A detailed computation and comparison of the achievable rate region for the Gaussian case is conducted. The proposed achievable rate region is shown to coincide with the capacity region of the strong interference case.
{"title":"A New Achievable Rate Region for Interference Channels with Common Information","authors":"Yi Cao, Biao Chen, Junshan Zhang","doi":"10.1109/WCNC.2007.388","DOIUrl":"https://doi.org/10.1109/WCNC.2007.388","url":null,"abstract":"In this paper, a new achievable rate region for general interference channels with common information is presented. Our result improves upon by applying simultaneous superposition coding over sequential superposition coding. A detailed computation and comparison of the achievable rate region for the Gaussian case is conducted. The proposed achievable rate region is shown to coincide with the capacity region of the strong interference case.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"89 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":"122497192","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}
We present a tandem queueing model for performance analysis and engineering of multihop wireless networks. To solve the queueing model, a direct (or exact) method and a decomposition method are proposed. The proposed decomposition method reduces the computational complexity significantly which requires us to solve L single queues instead of a full tandem system of L queues. The tandem queue model captures a batch arrival process and multi-rate transmission achieved by adaptive modulation and coding. We obtain the queue length distribution and derive all end-to-end performance measures including loss probability, average delay. The proposed decomposition approach is validated and some interesting insights into the system performance and guidelines for system design are highlighted.
{"title":"A Tandem Queue Model for Performance Analysis in Multihop Wireless Networks","authors":"L. Le, A. Nguyen, E. Hossain","doi":"10.1109/WCNC.2007.552","DOIUrl":"https://doi.org/10.1109/WCNC.2007.552","url":null,"abstract":"We present a tandem queueing model for performance analysis and engineering of multihop wireless networks. To solve the queueing model, a direct (or exact) method and a decomposition method are proposed. The proposed decomposition method reduces the computational complexity significantly which requires us to solve L single queues instead of a full tandem system of L queues. The tandem queue model captures a batch arrival process and multi-rate transmission achieved by adaptive modulation and coding. We obtain the queue length distribution and derive all end-to-end performance measures including loss probability, average delay. The proposed decomposition approach is validated and some interesting insights into the system performance and guidelines for system design are highlighted.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"221 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":"122861977","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}
Due to the energy limitation, sensor networks may schedule sensor activities so that some nodes may enter the sleeping mode to minimize energy consumption. However, sensor networks may face the constraints about sensing coverage introduced by the scheduling. From the coverage perspective, it is not always preferable to use short path for routing, especially when communications only happen among few nodes. We propose a density-based d-hop connected d-dominating sets routing algorithm which may evenly distribute energy consumption to the whole network and, hence, prolong the lifetime. We also prove the approach can be recovered within d hops of the failed d-dominating node. Our simulation results show that our approach can evenly distribute energy consumption when communications only happen among few nodes.
{"title":"Using Density-based d-Hop Connected d-Dominating Sets Routing Scheme to Achieve Load Balancing for Wireless Sensor Networks","authors":"Ren-Song Ko, Chi-Hung Huang","doi":"10.1109/WCNC.2007.770","DOIUrl":"https://doi.org/10.1109/WCNC.2007.770","url":null,"abstract":"Due to the energy limitation, sensor networks may schedule sensor activities so that some nodes may enter the sleeping mode to minimize energy consumption. However, sensor networks may face the constraints about sensing coverage introduced by the scheduling. From the coverage perspective, it is not always preferable to use short path for routing, especially when communications only happen among few nodes. We propose a density-based d-hop connected d-dominating sets routing algorithm which may evenly distribute energy consumption to the whole network and, hence, prolong the lifetime. We also prove the approach can be recovered within d hops of the failed d-dominating node. Our simulation results show that our approach can evenly distribute energy consumption when communications only happen among few nodes.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"26 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":"114604370","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}
Nowadays on-board wireless broadband connectivity in mass transport vehicles, like trains and light rails, are being trialed around the world. These solutions depend on existing mobile network or satellite coverage to maintain a broadband Internet connection to these vehicles. However these technologies lack coverage in underground areas or tunnels, and an alternative "gap filler" technology is needed to keep the train connected. In this paper we discuss the architecture and design of a WLAN based gap filler network solution for rail vehicles, which is able to provide a reliable broadband connection, even at high speed.
{"title":"Underground Broadband: Design of a Reliable WLAN Gap Filler Solution","authors":"T. V. Leeuwen, I. Moerman, P. Demeester","doi":"10.1109/WCNC.2007.719","DOIUrl":"https://doi.org/10.1109/WCNC.2007.719","url":null,"abstract":"Nowadays on-board wireless broadband connectivity in mass transport vehicles, like trains and light rails, are being trialed around the world. These solutions depend on existing mobile network or satellite coverage to maintain a broadband Internet connection to these vehicles. However these technologies lack coverage in underground areas or tunnels, and an alternative \"gap filler\" technology is needed to keep the train connected. In this paper we discuss the architecture and design of a WLAN based gap filler network solution for rail vehicles, which is able to provide a reliable broadband connection, even at high speed.","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":"117288865","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}
It is proved that the intercarrier interference matrix in orthogonal frequency division multiplexing systems is unitary for an arbitrary value of frequency offset and any number of subcarriers. The benefit of a recently published precoding scheme in practical applications is thereby established.
{"title":"ICI Mitigation in MIMO OFDM Systems","authors":"P. Tan, N. Beaulieu","doi":"10.1109/WCNC.2007.161","DOIUrl":"https://doi.org/10.1109/WCNC.2007.161","url":null,"abstract":"It is proved that the intercarrier interference matrix in orthogonal frequency division multiplexing systems is unitary for an arbitrary value of frequency offset and any number of subcarriers. The benefit of a recently published precoding scheme in practical applications is thereby established.","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":"117322831","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}
Flooding methods have been widely used by routing protocols to disseminate route information and control messages in wireless ad hoc and sensor networks both. However, most of the efficient flooding approaches proposed in the research literature are designed for ad hoc networks only, and they might not be suitable for wireless sensor networks due to their higher node densities, constrained energy and memory resources in sensor nodes. In this paper, we present a distributed low-cost flooding algorithm that is designed particularly for wireless sensor networks. We prove that our new algorithm has O(n + Delta) time and O(n) signaling message complexity, where n is the total number of nodes in a network and Delta is the maximum node degree. Moreover, we show that our low-cost algorithm has a constant approximation ratio, and its signaling message size is also bounded by a constant. Our simulation study demonstrates that our new algorithm not only generates fewer forwarding nodes, but it also uses much less number of signaling messages and has significantly smaller signaling message size than other algorithms published in the literature.
{"title":"A Low-Cost Flooding Algorithm for Wireless Sensor Networks","authors":"Ou Liang, Y. Sekercioglu, N. Mani","doi":"10.1109/WCNC.2007.641","DOIUrl":"https://doi.org/10.1109/WCNC.2007.641","url":null,"abstract":"Flooding methods have been widely used by routing protocols to disseminate route information and control messages in wireless ad hoc and sensor networks both. However, most of the efficient flooding approaches proposed in the research literature are designed for ad hoc networks only, and they might not be suitable for wireless sensor networks due to their higher node densities, constrained energy and memory resources in sensor nodes. In this paper, we present a distributed low-cost flooding algorithm that is designed particularly for wireless sensor networks. We prove that our new algorithm has O(n + Delta) time and O(n) signaling message complexity, where n is the total number of nodes in a network and Delta is the maximum node degree. Moreover, we show that our low-cost algorithm has a constant approximation ratio, and its signaling message size is also bounded by a constant. Our simulation study demonstrates that our new algorithm not only generates fewer forwarding nodes, but it also uses much less number of signaling messages and has significantly smaller signaling message size than other algorithms published in the literature.","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":"129505675","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}
M. E. Rivero-Angeles, D. Lara-Rodríguez, F. A. Cruz-Pérez
In this paper, a mathematical analysis method to simultaneously evaluate throughput and access delay considering an infinite population model is considered. Most of the previous related research has been done considering both finite population and saturation conditions where all the nodes in the system have always a packet ready to be transmitted and the transmission queue of each station is assumed to be always nonempty. This assumption is a good approximation for a local area network working at full capacity; however, in a cellular system the assumptions of finite population and that every node in a cell has always a packet to transmit is not very realistic. Here, analytical results considering a S-ALOHA random access protocol with a Poisson arrival process - more suitable for the traffic model in a cellular system - for the users in the cells is presented. Using the geometrical backoff (GB) strategy, two approaches to find the optimum retransmission probabilities are developed; in the first one, the number of backlogged packets is required while a simpler and efficient alternative method requires only the knowledge of the new packet arrival rate.
{"title":"Optimal Retransmission Probability for S-ALOHA Under the Infinite Population Model","authors":"M. E. Rivero-Angeles, D. Lara-Rodríguez, F. A. Cruz-Pérez","doi":"10.1109/WCNC.2007.447","DOIUrl":"https://doi.org/10.1109/WCNC.2007.447","url":null,"abstract":"In this paper, a mathematical analysis method to simultaneously evaluate throughput and access delay considering an infinite population model is considered. Most of the previous related research has been done considering both finite population and saturation conditions where all the nodes in the system have always a packet ready to be transmitted and the transmission queue of each station is assumed to be always nonempty. This assumption is a good approximation for a local area network working at full capacity; however, in a cellular system the assumptions of finite population and that every node in a cell has always a packet to transmit is not very realistic. Here, analytical results considering a S-ALOHA random access protocol with a Poisson arrival process - more suitable for the traffic model in a cellular system - for the users in the cells is presented. Using the geometrical backoff (GB) strategy, two approaches to find the optimum retransmission probabilities are developed; in the first one, the number of backlogged packets is required while a simpler and efficient alternative method requires only the knowledge of the new packet arrival rate.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"18 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":"129753836","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}
Use of space-frequency block coded (SFBC) OFDM signals is advantageous in high-mobility broadband wireless access, where the channel is highly time- as well as frequency-selective because of which the receiver experiences both inter-symbol interference (ISI) as well as inter-carrier interference (ICI). ISI occurs due to the violation of the 'quasi-static' fading assumption caused due to frequency- and/or time-selectivity of the channel. In addition, ICI occurs due to time-selectivity of the channel which results in loss of orthogonality among the subcarriers. This paper is concerned with the detection of SFBC-OFDM signals on time- and frequency-selective MIMO channels. Specifically, the performance of an interference cancelling receiver for SFBC-OFDM which alleviates the effects of ISI and ICI in highly time- and frequency-selective channels was proposed and evaluated.
{"title":"Detection of SFBC-OFDM Signals in Frequency and Time-Selective MIMO Channels","authors":"D. Sreedhar, A. Chockalingam","doi":"10.1109/WCNC.2007.162","DOIUrl":"https://doi.org/10.1109/WCNC.2007.162","url":null,"abstract":"Use of space-frequency block coded (SFBC) OFDM signals is advantageous in high-mobility broadband wireless access, where the channel is highly time- as well as frequency-selective because of which the receiver experiences both inter-symbol interference (ISI) as well as inter-carrier interference (ICI). ISI occurs due to the violation of the 'quasi-static' fading assumption caused due to frequency- and/or time-selectivity of the channel. In addition, ICI occurs due to time-selectivity of the channel which results in loss of orthogonality among the subcarriers. This paper is concerned with the detection of SFBC-OFDM signals on time- and frequency-selective MIMO channels. Specifically, the performance of an interference cancelling receiver for SFBC-OFDM which alleviates the effects of ISI and ICI in highly time- and frequency-selective channels was proposed and evaluated.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"9 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":"128216758","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 lot of realistic applications in sensor networks adopt hierarchical architecture in which sensor nodes are grouped into clusters, with each cluster relying on a gateway node for local data aggregation and long-distance radio transmission. Compared to normal sensor nodes, the gateway nodes, also called application nodes (ANs), are equipped with relatively powerful transceivers and have more energy. Nevertheless, since an AN is the main gateway for sensor nodes within its cluster, its energy may be depleted more quickly than normal sensor nodes. As such, it is important to find methods to save energy for ANs. This paper presents and evaluates an energy efficient coarse-grained scheduling scheme for ANs.
{"title":"Coarse-Grained Scheduling for Gateway Nodes in Wireless Sensor Networks","authors":"Kui Wu, Chong Liu, Yang Xiao, Jiangchuan Liu","doi":"10.1109/WCNC.2007.490","DOIUrl":"https://doi.org/10.1109/WCNC.2007.490","url":null,"abstract":"A lot of realistic applications in sensor networks adopt hierarchical architecture in which sensor nodes are grouped into clusters, with each cluster relying on a gateway node for local data aggregation and long-distance radio transmission. Compared to normal sensor nodes, the gateway nodes, also called application nodes (ANs), are equipped with relatively powerful transceivers and have more energy. Nevertheless, since an AN is the main gateway for sensor nodes within its cluster, its energy may be depleted more quickly than normal sensor nodes. As such, it is important to find methods to save energy for ANs. This paper presents and evaluates an energy efficient coarse-grained scheduling scheme for ANs.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"42 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":"128365991","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
扫码关注我们
求助内容：
应助结果提醒方式：