Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291595
K. Takeuchi, R. Müller, Mikko Vehkaperä, Toshiyuki TANAKA
We propose a novel signaling scheme for wireless communication systems without channel state information (CSI). In that scheme, a bias of the occurrence probabilities of constellation points is utilized as pilot information known to the receiver, whereas pilot signals known to the receiver are sent in conventional pilot-based approaches. We evaluate the performance of the new scheme and conventional pilot-based schemes for a large direct-sequence code-division multiple-access (DS-CDMA) system, by using the replica method. It is shown that the new scheme outperforms the conventional pilot-based scheme when the amount of pilot information is large.
{"title":"A new signaling scheme for large DS-CDMA channels without CSI","authors":"K. Takeuchi, R. Müller, Mikko Vehkaperä, Toshiyuki TANAKA","doi":"10.1109/WIOPT.2009.5291595","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291595","url":null,"abstract":"We propose a novel signaling scheme for wireless communication systems without channel state information (CSI). In that scheme, a bias of the occurrence probabilities of constellation points is utilized as pilot information known to the receiver, whereas pilot signals known to the receiver are sent in conventional pilot-based approaches. We evaluate the performance of the new scheme and conventional pilot-based schemes for a large direct-sequence code-division multiple-access (DS-CDMA) system, by using the replica method. It is shown that the new scheme outperforms the conventional pilot-based scheme when the amount of pilot information is large.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115533679","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-06-23DOI: 10.1109/WIOPT.2009.5291605
Christos Papathanasiou, N. Dimitriou, L. Tassiulas
A dynamic resource allocation algorithm with beam steering is evaluated for providing broadband wireless access to mobile users of the emerging IEEE 802.16 m air interface standard. Thanks to our design, the coverage area and total throughput may be significantly enhanced, compared to the current IEEE 802.16 e standard. Our proposed solution supports high mobility, improves fairness among the users and is backward compatible to the mobile networks based on the 802.16 e. The simulation analysis determines the parameters which impact the system performance. Furthermore, our system presents low complexity hardware implementation and low power consumption.
{"title":"Downlink multi-user transmission for higher user speeds in IEEE 802.16m","authors":"Christos Papathanasiou, N. Dimitriou, L. Tassiulas","doi":"10.1109/WIOPT.2009.5291605","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291605","url":null,"abstract":"A dynamic resource allocation algorithm with beam steering is evaluated for providing broadband wireless access to mobile users of the emerging IEEE 802.16 m air interface standard. Thanks to our design, the coverage area and total throughput may be significantly enhanced, compared to the current IEEE 802.16 e standard. Our proposed solution supports high mobility, improves fairness among the users and is backward compatible to the mobile networks based on the 802.16 e. The simulation analysis determines the parameters which impact the system performance. Furthermore, our system presents low complexity hardware implementation and low power consumption.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129574964","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-06-23DOI: 10.1109/WIOPT.2009.5291626
Sébastien Doirieux, B. Baynat, Masood Maqbool, M. Coupechoux
In this paper, we present a simple and accurate analytical model for performance evaluation of WiMAX networks with multiple traffic profiles. This very promising access technology has been designed to support numerous kinds of applications having different traffic characteristics. One of the QoS parameters considered by the standard for traffic classes is the maximum sustained traffic rate (MSTR), which is an upper bound for user throughput. Taking into account MSTR implies the implementation of a throttling scheduling policy that regulates the user peak rate. Our models take into account this policy and provides closed-form expressions giving all the required performance parameters for each traffic profile at a click speed. The model is compared with extensive simulations that show its accuracy and robustness.
{"title":"An analytical model for WiMAX networks with multiple traffic profiles and throttling policy","authors":"Sébastien Doirieux, B. Baynat, Masood Maqbool, M. Coupechoux","doi":"10.1109/WIOPT.2009.5291626","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291626","url":null,"abstract":"In this paper, we present a simple and accurate analytical model for performance evaluation of WiMAX networks with multiple traffic profiles. This very promising access technology has been designed to support numerous kinds of applications having different traffic characteristics. One of the QoS parameters considered by the standard for traffic classes is the maximum sustained traffic rate (MSTR), which is an upper bound for user throughput. Taking into account MSTR implies the implementation of a throttling scheduling policy that regulates the user peak rate. Our models take into account this policy and provides closed-form expressions giving all the required performance parameters for each traffic profile at a click speed. The model is compared with extensive simulations that show its accuracy and robustness.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132175238","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-06-23DOI: 10.1109/WIOPT.2009.5291579
V. Rastogi, V. Ribeiro, Aditya D. Nayar
The ease of deployment and the self configurable aspect of wireless mesh networks has generated lot of interest in them during the recent years. The One Laptop per Child (OLPC) project uses mesh networking, closely adhering to IEEE 802.11s WLAN mesh standard, to provide networking in a classroom environment. Our work measures and analyzes the performance of OLPC mesh networks. It includes several experiments concerning performance of UDP and TCP across a range of network topologies. Our experiments provide useful information about several aspects of these networks, including connectivity range, effect of RTS/CTS and Tx/Rx capabilities.
{"title":"Measurements in OLPC mesh networks","authors":"V. Rastogi, V. Ribeiro, Aditya D. Nayar","doi":"10.1109/WIOPT.2009.5291579","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291579","url":null,"abstract":"The ease of deployment and the self configurable aspect of wireless mesh networks has generated lot of interest in them during the recent years. The One Laptop per Child (OLPC) project uses mesh networking, closely adhering to IEEE 802.11s WLAN mesh standard, to provide networking in a classroom environment. Our work measures and analyzes the performance of OLPC mesh networks. It includes several experiments concerning performance of UDP and TCP across a range of network topologies. Our experiments provide useful information about several aspects of these networks, including connectivity range, effect of RTS/CTS and Tx/Rx capabilities.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130258398","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-06-23DOI: 10.1109/WIOPT.2009.5291607
M. F. Munir, A. Kherani, F. Filali
We consider a wireless sensor network with n sensor nodes. The sensed data needs to be transferred in a multi-hop fashion to a common processing center. We consider the standard data sampling/sensing scheme where the sensor nodes have a sampling process independent of the transmission scheme. In this paper, we study the problem of optimizing the end-to-end delay in a multi-hop single-sink wireless sensor network. We prove that the delay-minimization objective function is strictly convex for the entire network. We then provide a distributed optimization framework to achieve the required objective. The approach is based on distributed convex optimization and deterministic distributed algorithm without feedback control. Only local knowledge is used to update the algorithmic steps. Specifically, we formulate the objective as a network level delay minimization function where the constraints are the reception-capacity and service-rate probabilities. Using the Lagrangian dual composition method, we derive a distributed primal-dual algorithm to minimize the delay in the network.We further develop a stochastic delay control primal-dual algorithm in the presence of noisy conditions. We also present its convergence and rate of convergence. The proposal is extensively evaluated by analysis and simulations.
{"title":"Distributed algorithm for minimizing delay in multi-hop wireless sensor networks","authors":"M. F. Munir, A. Kherani, F. Filali","doi":"10.1109/WIOPT.2009.5291607","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291607","url":null,"abstract":"We consider a wireless sensor network with n sensor nodes. The sensed data needs to be transferred in a multi-hop fashion to a common processing center. We consider the standard data sampling/sensing scheme where the sensor nodes have a sampling process independent of the transmission scheme. In this paper, we study the problem of optimizing the end-to-end delay in a multi-hop single-sink wireless sensor network. We prove that the delay-minimization objective function is strictly convex for the entire network. We then provide a distributed optimization framework to achieve the required objective. The approach is based on distributed convex optimization and deterministic distributed algorithm without feedback control. Only local knowledge is used to update the algorithmic steps. Specifically, we formulate the objective as a network level delay minimization function where the constraints are the reception-capacity and service-rate probabilities. Using the Lagrangian dual composition method, we derive a distributed primal-dual algorithm to minimize the delay in the network.We further develop a stochastic delay control primal-dual algorithm in the presence of noisy conditions. We also present its convergence and rate of convergence. The proposal is extensively evaluated by analysis and simulations.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126058516","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-06-23DOI: 10.1109/WIOPT.2009.5291559
P. Grover, A. Sahai, Se Yong Park
Recently, we considered a vector version of Witsenhausen's counterexample and used a new lower bound to show that in that limit of infinite vector length, certain quantization-based strategies are provably within a constant factor of the optimal cost for all possible problem parameters. In this paper, finite vector lengths are considered with the vector length being viewed as an additional problem parameter. By applying the “sphere-packing” philosophy, a lower bound to the optimal cost for this finite-length problem is derived that uses appropriate shadows of the infinite-length bounds. We also introduce latticebased quantization strategies for any finite length. Using the new finite-length lower bound, we show that the lattice-based strategies achieve within a constant factor of the optimal cost uniformly over all possible problem parameters, including the vector length. For Witsenhausen's original problem — which corresponds to the scalar case — lattice-based strategies attain within a factor of 8 of the optimal cost. Based on observations in the scalar case and the infinite-dimensional case, we also conjecture what the optimal strategies could be for any finite vector length.
{"title":"The finite-dimensional Witsenhausen counterexample","authors":"P. Grover, A. Sahai, Se Yong Park","doi":"10.1109/WIOPT.2009.5291559","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291559","url":null,"abstract":"Recently, we considered a vector version of Witsenhausen's counterexample and used a new lower bound to show that in that limit of infinite vector length, certain quantization-based strategies are provably within a constant factor of the optimal cost for all possible problem parameters. In this paper, finite vector lengths are considered with the vector length being viewed as an additional problem parameter. By applying the “sphere-packing” philosophy, a lower bound to the optimal cost for this finite-length problem is derived that uses appropriate shadows of the infinite-length bounds. We also introduce latticebased quantization strategies for any finite length. Using the new finite-length lower bound, we show that the lattice-based strategies achieve within a constant factor of the optimal cost uniformly over all possible problem parameters, including the vector length. For Witsenhausen's original problem — which corresponds to the scalar case — lattice-based strategies attain within a factor of 8 of the optimal cost. Based on observations in the scalar case and the infinite-dimensional case, we also conjecture what the optimal strategies could be for any finite vector length.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130359720","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-06-23DOI: 10.1109/WIOPT.2009.5291568
B. Houlding, Arnab Bhattacharya, Simon P. Wilson, T. Forde
This paper considers the use of a recently developed Bayesian statistical approximation technique that leads to very fast determination of highly accurate estimates for latent radio signal power. Following suitable data analysis, a first order non-stationary auto-regressive process is considered for latent radio signal and the fast approximation technique is then used to provide accurate estimates of the hidden model parameters. These estimates are based on having received several noisy, but spatially correlated, observations of the true latent signal. The implication of this technique for real time decision analysis and the problem of finding, and making use of, so-called radio spectrum holes is also discussed.
{"title":"A fast Bayesian model for latent radio signal prediction","authors":"B. Houlding, Arnab Bhattacharya, Simon P. Wilson, T. Forde","doi":"10.1109/WIOPT.2009.5291568","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291568","url":null,"abstract":"This paper considers the use of a recently developed Bayesian statistical approximation technique that leads to very fast determination of highly accurate estimates for latent radio signal power. Following suitable data analysis, a first order non-stationary auto-regressive process is considered for latent radio signal and the fast approximation technique is then used to provide accurate estimates of the hidden model parameters. These estimates are based on having received several noisy, but spatially correlated, observations of the true latent signal. The implication of this technique for real time decision analysis and the problem of finding, and making use of, so-called radio spectrum holes is also discussed.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121454495","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-06-23DOI: 10.1109/WIOPT.2009.5291644
T. Bonald, Ali Ibrahim, James W. Roberts
This paper contributes to the definition of an association policy for a multi-channel, multiple AP WLAN that depends on both physical rate and realised throughput. We show that existing proposals are inefficient when several APs share the same channel and define a new policy that is demonstrated to be close to optimal. Policies are compared through their traffic capacity defined as the network stability limit. We determine this capacity analytically using the fluid limit method for some simple network configurations deriving insight into the structure of the optimal policy. The quasi-optimality of our proposal is verified by simulation of a more complex network configuration.
{"title":"The impact of association on the capacity of WLANs","authors":"T. Bonald, Ali Ibrahim, James W. Roberts","doi":"10.1109/WIOPT.2009.5291644","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291644","url":null,"abstract":"This paper contributes to the definition of an association policy for a multi-channel, multiple AP WLAN that depends on both physical rate and realised throughput. We show that existing proposals are inefficient when several APs share the same channel and define a new policy that is demonstrated to be close to optimal. Policies are compared through their traffic capacity defined as the network stability limit. We determine this capacity analytically using the fluid limit method for some simple network configurations deriving insight into the structure of the optimal policy. The quasi-optimality of our proposal is verified by simulation of a more complex network configuration.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117081001","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-06-23DOI: 10.1109/WIOPT.2009.5291581
G. Como, S. Yüksel
We provide a single letter characterization of the capacity region for independent, identically distributed, finite-state channels, with partial (quantized) state information, when the channel state information is available at the receiver. The partial state information is asymmetric at the encoders. The problem is practically relevant, and provides a tractable optimization problem. We also consider the case where the channel has memory.
{"title":"On the capacity of finite state multiple access channels with asymmetric partial state feedback","authors":"G. Como, S. Yüksel","doi":"10.1109/WIOPT.2009.5291581","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291581","url":null,"abstract":"We provide a single letter characterization of the capacity region for independent, identically distributed, finite-state channels, with partial (quantized) state information, when the channel state information is available at the receiver. The partial state information is asymmetric at the encoders. The problem is practically relevant, and provides a tractable optimization problem. We also consider the case where the channel has memory.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128964172","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-06-23DOI: 10.1109/WIOPT.2009.5291575
Scott M. Raynel, A. McGregor, Murray A. Jorgensen
Low power devices such as common wireless router platforms are not capable of performing reliable full packet capture due to resource constraints. In order for such devices to be used to perform link-level measurement on IEEE 802.11 networks, a packet sampling technique is required in order to reliably capture a representative sample of frames. The traditional Berkeley Packet Filter mechanism found in UNIX-like operating systems does not directly support packet sampling as it provides no way of generating pseudo-random numbers and does not allow a filter program to keep state between invocations. This paper explores the use of the IEEE 802.11 Frame Check Sequence as a source of pseudo-random numbers for use when deciding whether to sample a packet. This theory is tested by analysing the distribution of Frame Check Sequences from a large, real world capture. Finally, a BPF program fragment is presented which can be used to efficiently select packets for sampling.
{"title":"Using the IEEE 802.11 Frame Check Sequence as a pseudo random number for packet sampling in wireless networks","authors":"Scott M. Raynel, A. McGregor, Murray A. Jorgensen","doi":"10.1109/WIOPT.2009.5291575","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291575","url":null,"abstract":"Low power devices such as common wireless router platforms are not capable of performing reliable full packet capture due to resource constraints. In order for such devices to be used to perform link-level measurement on IEEE 802.11 networks, a packet sampling technique is required in order to reliably capture a representative sample of frames. The traditional Berkeley Packet Filter mechanism found in UNIX-like operating systems does not directly support packet sampling as it provides no way of generating pseudo-random numbers and does not allow a filter program to keep state between invocations. This paper explores the use of the IEEE 802.11 Frame Check Sequence as a source of pseudo-random numbers for use when deciding whether to sample a packet. This theory is tested by analysing the distribution of Frame Check Sequences from a large, real world capture. Finally, a BPF program fragment is presented which can be used to efficiently select packets for sampling.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"35 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120883869","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
扫码关注我们
求助内容：
应助结果提醒方式：