We analyze a four node wireless network in which the transmit nodes help each other acting as relays during the periods in which they do not transmit their own information. In order to help the other node, each node has to use a part of its available power. The network is modeled as a non-cooperative game in which each player (node) maximizes its own utility function (information rate). The goal of the game designer (network provider) is to maximize the objective function (in this case the sum rate) in order to get better network efficiency. Here we analyze the so called price of anarchy, as the ratio between the objective function at the worst Nash equilibrium and the optimal objective function. In this scenario, the Nash equilibrium is achieved by selfish (non-cooperative) behavior between the players. In other words, in order to maximize its own utility function each node chooses a strategy to use its available power only for itself, and not helping the other node. Our results show that there is a big possibility for improvement of the sum rate at the Nash equilibrium if the players are ldquoencouragedrdquo to cooperate or to choose a strategy (power policy) that is not selfish. The network operator, therefore, can design a mechanism in which both players maximize their own utilities but also the sum rate at the Nash equilibrium is much closer to the optimal sum rate.
{"title":"Game theoretic analysis of a cooperative communication system","authors":"N. Marina","doi":"10.1109/EW.2008.4623877","DOIUrl":"https://doi.org/10.1109/EW.2008.4623877","url":null,"abstract":"We analyze a four node wireless network in which the transmit nodes help each other acting as relays during the periods in which they do not transmit their own information. In order to help the other node, each node has to use a part of its available power. The network is modeled as a non-cooperative game in which each player (node) maximizes its own utility function (information rate). The goal of the game designer (network provider) is to maximize the objective function (in this case the sum rate) in order to get better network efficiency. Here we analyze the so called price of anarchy, as the ratio between the objective function at the worst Nash equilibrium and the optimal objective function. In this scenario, the Nash equilibrium is achieved by selfish (non-cooperative) behavior between the players. In other words, in order to maximize its own utility function each node chooses a strategy to use its available power only for itself, and not helping the other node. Our results show that there is a big possibility for improvement of the sum rate at the Nash equilibrium if the players are ldquoencouragedrdquo to cooperate or to choose a strategy (power policy) that is not selfish. The network operator, therefore, can design a mechanism in which both players maximize their own utilities but also the sum rate at the Nash equilibrium is much closer to the optimal sum rate.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124701391","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}
G. Anastasi, Andrea Bacioccola, C. Cicconetti, L. Lenzini, E. Mingozzi, C. Vallati
Reduced energy consumption is a crucial aspect of mobile Broadband Wireless Access (BWA) networks, which are expected to be populated by battery-operated devices, like mobile phones and palmtops. For this reason the IEEE 802.16e, which is one of the front-runner competitors in this field, specifies a set of power saving mechanisms to be employed by the Base Station (BS) and Mobile Stations (MSs) to reduce the amount of time the latter spend with the wireless interface on. These mechanisms are classified into three class types, which are designed for different types of applications. In this paper we focus on class type I, which fits the typical requirements of best-effort traffic. With class type I, an MS with power saving enabled alternates between sleep and listening periods. The duration of the sleep periods increases by a factor 2 each time listening period ends, up to a maximum sleep window size. Since the standard does not provide guidelines for setting the above parameters, which are negotiated between the BS and MSs when setting up a power saving class, we evaluate via simulation their impact on the performance, in terms of both application-specific metric, i.e. delay or throughput depending on the type of traffic, and the amount of energy saved.
{"title":"Performance evaluation of power management for best effort applications in IEEE 802.16 networks","authors":"G. Anastasi, Andrea Bacioccola, C. Cicconetti, L. Lenzini, E. Mingozzi, C. Vallati","doi":"10.1109/EW.2008.4623923","DOIUrl":"https://doi.org/10.1109/EW.2008.4623923","url":null,"abstract":"Reduced energy consumption is a crucial aspect of mobile Broadband Wireless Access (BWA) networks, which are expected to be populated by battery-operated devices, like mobile phones and palmtops. For this reason the IEEE 802.16e, which is one of the front-runner competitors in this field, specifies a set of power saving mechanisms to be employed by the Base Station (BS) and Mobile Stations (MSs) to reduce the amount of time the latter spend with the wireless interface on. These mechanisms are classified into three class types, which are designed for different types of applications. In this paper we focus on class type I, which fits the typical requirements of best-effort traffic. With class type I, an MS with power saving enabled alternates between sleep and listening periods. The duration of the sleep periods increases by a factor 2 each time listening period ends, up to a maximum sleep window size. Since the standard does not provide guidelines for setting the above parameters, which are negotiated between the BS and MSs when setting up a power saving class, we evaluate via simulation their impact on the performance, in terms of both application-specific metric, i.e. delay or throughput depending on the type of traffic, and the amount of energy saved.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124834688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Y. H. Chen, Jun-Horng Chen, Peng Chia Hsien, D. Chang, Jung-Hao Huang
Performance evaluation of a mobile WiMAX beam forming network(BFN) and design algorithm of using the RF digital Step attenuator (DSA) for implemeting the BFN are described. The architecture of the BFN controller and the steering operation modes of the BFN are also introduced. Optimization of the antenna element spacing in considering of the mutual coupling against the grating lobe suppression is analyzed. The simulated performance evaluation in measuring a tested Butler matric array antenna by BFN is evaluated. Relevant equations of the phase and amplitude error parameters used in the Monte-Carlo simulation are derived.
{"title":"Performance evaluation of mobile WiMAX beam forming network implemented by RF digital step attenuators","authors":"Y. H. Chen, Jun-Horng Chen, Peng Chia Hsien, D. Chang, Jung-Hao Huang","doi":"10.1109/EW.2008.4623910","DOIUrl":"https://doi.org/10.1109/EW.2008.4623910","url":null,"abstract":"Performance evaluation of a mobile WiMAX beam forming network(BFN) and design algorithm of using the RF digital Step attenuator (DSA) for implemeting the BFN are described. The architecture of the BFN controller and the steering operation modes of the BFN are also introduced. Optimization of the antenna element spacing in considering of the mutual coupling against the grating lobe suppression is analyzed. The simulated performance evaluation in measuring a tested Butler matric array antenna by BFN is evaluated. Relevant equations of the phase and amplitude error parameters used in the Monte-Carlo simulation are derived.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124984480","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}
60 GHz wireless networks have the potential to support high data rate applications, but have short range transmission limitations due to larger propagation losses and reduced diffraction around obstacles. On the other hand, directional antennas are easier to implement at millimeter wavelengths and can provide benefits such as spatial reuse and higher transmission range. This paper proposes a network architecture for 60 GHz wireless personal area networks (WPANs) using directional antennas. It describes protocols for neighbor discovery, medium access, and multi-hop route establishment that exploit directional antennas to improve network performance and maintain connectivity. As a result, the proposed method can be used as a practical, low-cost solution to overcome the difficulty of short range and large propagation loss in 60 GHz systems.
{"title":"Wireless networking with directional antennas for 60 GHz systems","authors":"Z. Fan","doi":"10.1109/EW.2008.4623893","DOIUrl":"https://doi.org/10.1109/EW.2008.4623893","url":null,"abstract":"60 GHz wireless networks have the potential to support high data rate applications, but have short range transmission limitations due to larger propagation losses and reduced diffraction around obstacles. On the other hand, directional antennas are easier to implement at millimeter wavelengths and can provide benefits such as spatial reuse and higher transmission range. This paper proposes a network architecture for 60 GHz wireless personal area networks (WPANs) using directional antennas. It describes protocols for neighbor discovery, medium access, and multi-hop route establishment that exploit directional antennas to improve network performance and maintain connectivity. As a result, the proposed method can be used as a practical, low-cost solution to overcome the difficulty of short range and large propagation loss in 60 GHz systems.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115209858","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}
Media-based services often require a multicast-enabled transport that guarantees quasi error free transmission under strict delay constraints. In packet based networks, furthermore, both multicast and delay constraints deeply influence the architecture of erasure error recovery. Therefore, we propose a general architecture and study its optimization in this paper. Since the Gilbert-Elliot (GE) erasure error model has been proven to be valid for a wide range of packet based wireless networks, in this paper, we present the generalized architecture and its optimization based on the GE channel model. The architecture integrates nearly all existing erasure error recovery techniques: Automatic Repeat Request, Forward Error Correction and Hybrid ARQ techniques. Through the optimization, the total needed redundancy information can be minimized by choosing the best scheme automatically among the entire schemes included in the architecture.
{"title":"On the architecture of erasure error recovery under strict delay constraints","authors":"Guoping Tan, T. Herfet","doi":"10.1109/EW.2008.4623882","DOIUrl":"https://doi.org/10.1109/EW.2008.4623882","url":null,"abstract":"Media-based services often require a multicast-enabled transport that guarantees quasi error free transmission under strict delay constraints. In packet based networks, furthermore, both multicast and delay constraints deeply influence the architecture of erasure error recovery. Therefore, we propose a general architecture and study its optimization in this paper. Since the Gilbert-Elliot (GE) erasure error model has been proven to be valid for a wide range of packet based wireless networks, in this paper, we present the generalized architecture and its optimization based on the GE channel model. The architecture integrates nearly all existing erasure error recovery techniques: Automatic Repeat Request, Forward Error Correction and Hybrid ARQ techniques. Through the optimization, the total needed redundancy information can be minimized by choosing the best scheme automatically among the entire schemes included in the architecture.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131600506","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}
Kyungchul Kwak, Sungeun Lee, Myonghee Park, D. Hong
Error propagation of source-relay (S-R) link limits the performance of decode-and-forward (DF) relay system and prohibits cooperative DF relay system from achieving full diversity gain. In order to resolve these problems, we first derive the criterion to achieve full diversity. It explains why the SNR of S-R link would be better than other links. Using the criterion, the proposed strategy of positioning the relay achieves full diversity and minimizes the error probability of cooperative DF relay system.
{"title":"Positioning the relay to achieve full diversity and minimize error probability in cooperative decode-and-forward relay systems","authors":"Kyungchul Kwak, Sungeun Lee, Myonghee Park, D. Hong","doi":"10.1109/EW.2008.4623876","DOIUrl":"https://doi.org/10.1109/EW.2008.4623876","url":null,"abstract":"Error propagation of source-relay (S-R) link limits the performance of decode-and-forward (DF) relay system and prohibits cooperative DF relay system from achieving full diversity gain. In order to resolve these problems, we first derive the criterion to achieve full diversity. It explains why the SNR of S-R link would be better than other links. Using the criterion, the proposed strategy of positioning the relay achieves full diversity and minimizes the error probability of cooperative DF relay system.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114681111","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, we construct an elementary spatial-temporal routing scheme that achieves the throughput capacity of a large ad hoc wireless network with high probability as the number of nodes increases. We consider a multicast type of traffic handling using a hierarchical routing with clustering. We investigate the scaling of throughput capacity versus the number of nodes and destinations. The derived lower bound on the throughput capacity under the proposed routing strategy holds with probability one as the number of nodes goes to infinity.
{"title":"Multicast ad hoc ntworks: A constructive lower bound on throughput capacity","authors":"Oualid Chaker, J. Conan","doi":"10.1109/EW.2008.4623842","DOIUrl":"https://doi.org/10.1109/EW.2008.4623842","url":null,"abstract":"In this paper, we construct an elementary spatial-temporal routing scheme that achieves the throughput capacity of a large ad hoc wireless network with high probability as the number of nodes increases. We consider a multicast type of traffic handling using a hierarchical routing with clustering. We investigate the scaling of throughput capacity versus the number of nodes and destinations. The derived lower bound on the throughput capacity under the proposed routing strategy holds with probability one as the number of nodes goes to infinity.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124298034","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. Alvarado, L. Szczecinski, E. Agrell, A. Svensson
In this paper we design interleavers for bit-interleaved coded modulation (BICM) based on popular convolutional codes and quadrature amplitude modulation with Gray mapping. We analyze the so-called modular interleavers where the outputs of the convolutional encoder are appropriately matched with the input bits of the modulator. To quantify the achievable improvements we develop bounds on the coded BER using the multidimensional weight distribution spectrum of a code together with an equivalent QAM channel model. Based on these bounds, we show that the assignment of the encoderpsilas output to the bit positions in the symbol significantly affects the system performance. The analytical developments are contrasted with numerical simulations. The improvements obtained through the proposed approach do not change the receiverpsilas complexity and, depending on the systempsilas parameters (rate, modulation, codepsilas memory), they may be up to 1.7 dB!
{"title":"On the design of interleavers for BICM transmission","authors":"A. Alvarado, L. Szczecinski, E. Agrell, A. Svensson","doi":"10.1109/EW.2008.4623839","DOIUrl":"https://doi.org/10.1109/EW.2008.4623839","url":null,"abstract":"In this paper we design interleavers for bit-interleaved coded modulation (BICM) based on popular convolutional codes and quadrature amplitude modulation with Gray mapping. We analyze the so-called modular interleavers where the outputs of the convolutional encoder are appropriately matched with the input bits of the modulator. To quantify the achievable improvements we develop bounds on the coded BER using the multidimensional weight distribution spectrum of a code together with an equivalent QAM channel model. Based on these bounds, we show that the assignment of the encoderpsilas output to the bit positions in the symbol significantly affects the system performance. The analytical developments are contrasted with numerical simulations. The improvements obtained through the proposed approach do not change the receiverpsilas complexity and, depending on the systempsilas parameters (rate, modulation, codepsilas memory), they may be up to 1.7 dB!","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124360048","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}
Recently, a new class of space-time trellis codes was proposed as having the best performance. These codes are dasiabalancedpsila because they use the points of the constellation with the same probability. In this correspondence, we propose a new and simpler method than existing method to design these class for QPSK modulation and several transmit antennas. New and better balanced codes for 3 and 4 transmit antennas are also proposed.
{"title":"An improved method to design QPSK Balanced Space-Time Trellis Codes","authors":"P. Viland, G. Zaharia, J. Hélard","doi":"10.1109/EW.2008.4623852","DOIUrl":"https://doi.org/10.1109/EW.2008.4623852","url":null,"abstract":"Recently, a new class of space-time trellis codes was proposed as having the best performance. These codes are dasiabalancedpsila because they use the points of the constellation with the same probability. In this correspondence, we propose a new and simpler method than existing method to design these class for QPSK modulation and several transmit antennas. New and better balanced codes for 3 and 4 transmit antennas are also proposed.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122903580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The hybrid hierarchical architecture (HHA) represents a particular case of wireless hybrid network, where sensor nodes transmit their samples to an infrastructure network through multiple hops. In the HHA, gateway terminals implementing both cellular and infrastructure-less air interfaces, allow integration of the two separate paradigms characterising the wireless sensor network (WSN) and the cellular network. In this paper, in particular we study a hierarchical network where an IEEE 802.15.4 WSN, organised in a tree-based topology, is connected, through a mobile gateway, to an infrastructure network using a cellular air interface like UMTS. In such scenario, the mobile gateway receives data from sensors with an inter-arrival time distribution which depends on the WSN topology, the number of sensors distributed, and the parameters which characterise the 802.15.4 medium access control protocol, such as the superframe order, the beacon order, the number of guaranteed time slots, etc. Such distribution is analysed in this paper through simulation. The outcome of this work provides useful hints to the characterisation of the traffic generated by the mobile gateway and provided to the infrastructure network. The design of the scheduling techniques implemented at the infrastructure side requires suitable knowledge of the characteristics of such traffic.
{"title":"A Hybrid Hierarchical Architecture: From a wireless sensor network to the fixed infrastructure","authors":"C. Buratti, R. Verdone","doi":"10.1109/EW.2008.4623902","DOIUrl":"https://doi.org/10.1109/EW.2008.4623902","url":null,"abstract":"The hybrid hierarchical architecture (HHA) represents a particular case of wireless hybrid network, where sensor nodes transmit their samples to an infrastructure network through multiple hops. In the HHA, gateway terminals implementing both cellular and infrastructure-less air interfaces, allow integration of the two separate paradigms characterising the wireless sensor network (WSN) and the cellular network. In this paper, in particular we study a hierarchical network where an IEEE 802.15.4 WSN, organised in a tree-based topology, is connected, through a mobile gateway, to an infrastructure network using a cellular air interface like UMTS. In such scenario, the mobile gateway receives data from sensors with an inter-arrival time distribution which depends on the WSN topology, the number of sensors distributed, and the parameters which characterise the 802.15.4 medium access control protocol, such as the superframe order, the beacon order, the number of guaranteed time slots, etc. Such distribution is analysed in this paper through simulation. The outcome of this work provides useful hints to the characterisation of the traffic generated by the mobile gateway and provided to the infrastructure network. The design of the scheduling techniques implemented at the infrastructure side requires suitable knowledge of the characteristics of such traffic.","PeriodicalId":237850,"journal":{"name":"2008 14th European Wireless Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122522541","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
扫码关注我们
求助内容：
应助结果提醒方式：