Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291624
V. Sukumaran, U. Mukherji
Average-delay optimal scheduling of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.
{"title":"Average-delay optimal policies for the point-to-point channel","authors":"V. Sukumaran, U. Mukherji","doi":"10.1109/WIOPT.2009.5291624","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291624","url":null,"abstract":"Average-delay optimal scheduling of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"68 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":"124860338","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.5291594
S. Higuchi
We propose a statistical physics inspired algorithm to solve locked occupation problems, which are hard discrete constraint satisfaction problems defined on random networks. The algorithm consists of finding correlation among variables and using that information for reducing the problem to a smaller one. Namely one replaces the problem at hand with the one with less variables and slightly smaller set of solutions until the problem becomes simple enough for analysis by enumeration. The result of numerical experiments suggests that it performs efficiently even when the set of solutions is disconnected for the random factor graphs with the truncated Poisson degree distribution.
{"title":"Decimation algorithm based on correlations for constraint satisfaction problems on random networks","authors":"S. Higuchi","doi":"10.1109/WIOPT.2009.5291594","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291594","url":null,"abstract":"We propose a statistical physics inspired algorithm to solve locked occupation problems, which are hard discrete constraint satisfaction problems defined on random networks. The algorithm consists of finding correlation among variables and using that information for reducing the problem to a smaller one. Namely one replaces the problem at hand with the one with less variables and slightly smaller set of solutions until the problem becomes simple enough for analysis by enumeration. The result of numerical experiments suggests that it performs efficiently even when the set of solutions is disconnected for the random factor graphs with the truncated Poisson degree distribution.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"73 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":"125878307","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.5291572
F. Voss, C. Gloaguen, V. Schmidt
We investigate Cox processes of random point patterns in the Euclidean plane, which are located on the edges of random geometric graphs. Such Cox processes have applications in the performance analysis and strategic planning of both wireless and wired telecommunication networks. They simultaneously allow to represent the underlying infrastructure of the network together with the locations of network components. In particular, we analyze the Palm version X* of stationary Cox processes X living on random graphs that are built by the edges of an iterated random tessellation T. We derive a representation formula for the Palm version T* of T which includes the initial tessellation T0 and the component tessellation T1 of T as well as their Palm versions T*0 and T*1. Using this formula, we are able to construct a simulation algorithm for X* if both T0, T1 and their Palm versions T*0, T*1 can be simulated. This algorithm for X* extends earlier results for Cox processes on simpler (non-iterated) tessellations. It can be used, for example, in order to estimate the probability densities of various connection distances, which are important performance characteristics of telecommunication networks. In a numerical study we consider the particular case that T0 is a Poisson-Voronoi tessellation and T1 is a Poisson line tessellation.
{"title":"Palm calculus for stationary Cox processes on iterated random tessellations","authors":"F. Voss, C. Gloaguen, V. Schmidt","doi":"10.1109/WIOPT.2009.5291572","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291572","url":null,"abstract":"We investigate Cox processes of random point patterns in the Euclidean plane, which are located on the edges of random geometric graphs. Such Cox processes have applications in the performance analysis and strategic planning of both wireless and wired telecommunication networks. They simultaneously allow to represent the underlying infrastructure of the network together with the locations of network components. In particular, we analyze the Palm version X* of stationary Cox processes X living on random graphs that are built by the edges of an iterated random tessellation T. We derive a representation formula for the Palm version T* of T which includes the initial tessellation T0 and the component tessellation T1 of T as well as their Palm versions T*0 and T*1. Using this formula, we are able to construct a simulation algorithm for X* if both T0, T1 and their Palm versions T*0, T*1 can be simulated. This algorithm for X* extends earlier results for Cox processes on simpler (non-iterated) tessellations. It can be used, for example, in order to estimate the probability densities of various connection distances, which are important performance characteristics of telecommunication networks. In a numerical study we consider the particular case that T0 is a Poisson-Voronoi tessellation and T1 is a Poisson line tessellation.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"20 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":"125954201","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.5291592
H. Tembine, J. Boudec, R. E. Azouzi, E. Altman
We consider evolving games with finite number of players, in which each player interacts with other randomly selected players. The types and actions of each player in an interaction together determine the instantaneous payoff for all involved players. They also determine the rate of transition between type-actions. We provide a rigorous derivation of the asymptotic behavior of this system as the size of the population grows. We show that the large population asymptotic of the microscopic model is equivalent to a macroscopic evolutionary game in which a local interaction is described by a single player against an evolving population profile. We derive various classes of evolutionary game dynamics. We apply these results to spatial random access games in wireless networks.
{"title":"From mean field interaction to evolutionary game dynamics","authors":"H. Tembine, J. Boudec, R. E. Azouzi, E. Altman","doi":"10.1109/WIOPT.2009.5291592","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291592","url":null,"abstract":"We consider evolving games with finite number of players, in which each player interacts with other randomly selected players. The types and actions of each player in an interaction together determine the instantaneous payoff for all involved players. They also determine the rate of transition between type-actions. We provide a rigorous derivation of the asymptotic behavior of this system as the size of the population grows. We show that the large population asymptotic of the microscopic model is equivalent to a macroscopic evolutionary game in which a local interaction is described by a single player against an evolving population profile. We derive various classes of evolutionary game dynamics. We apply these results to spatial random access games in wireless networks.","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":"132789290","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.5291582
Lei Bao, M. Skoglund, C. Fischione, K. Johansson
To achieve satisfactory overall performance, optimal rate allocation in a networked control system with highly limited communication resources is instrumental. In this paper, a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall cost is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. It is shown that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations.
{"title":"Rate allocation for quantized control over noisy channels","authors":"Lei Bao, M. Skoglund, C. Fischione, K. Johansson","doi":"10.1109/WIOPT.2009.5291582","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291582","url":null,"abstract":"To achieve satisfactory overall performance, optimal rate allocation in a networked control system with highly limited communication resources is instrumental. In this paper, a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall cost is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. It is shown that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"124 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":"131106692","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.5291576
Dedi Rahmawan Putra, Kai-Wei Ke, Ho-Ting Wu
WiMAX features several QoS service classes to schedule different types of traffic. In this paper, we will assess the existence of self-similar traffic for each service class. The experiment starts by capturing the traffic data with a dedicated SNMP-based Network Management System (NMS). NMS manages the deployment of fixed WiMAX network defined in IEEE 802.16d-2004 Standard and records the inbound and outbound traffic for specific object IDs (OIDs). We consider several criteria to generate the traffic for our WiMAX test-bed network such as QoS service class, traffic intensity, and application type. The recorded traffic then will be analyzed using variance plot, and RS-plot. The result shows various degree of self-similarity for different types of QoS service classes and traffic intensities.
{"title":"Self-similar traffic assessment on QoS service classes of WiMAX network","authors":"Dedi Rahmawan Putra, Kai-Wei Ke, Ho-Ting Wu","doi":"10.1109/WIOPT.2009.5291576","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291576","url":null,"abstract":"WiMAX features several QoS service classes to schedule different types of traffic. In this paper, we will assess the existence of self-similar traffic for each service class. The experiment starts by capturing the traffic data with a dedicated SNMP-based Network Management System (NMS). NMS manages the deployment of fixed WiMAX network defined in IEEE 802.16d-2004 Standard and records the inbound and outbound traffic for specific object IDs (OIDs). We consider several criteria to generate the traffic for our WiMAX test-bed network such as QoS service class, traffic intensity, and application type. The recorded traffic then will be analyzed using variance plot, and RS-plot. The result shows various degree of self-similarity for different types of QoS service classes and traffic intensities.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"15 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":"133405483","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.5291560
Aditya Mahajan, S. Tatikonda
A graphical model for sequential teams is presented. This model is easy to understand, and at the same time, is general enough to model any finite horizon sequential team with finite valued system variables and unconstrained decision rules. The model can also be represented as a directed acyclic factor graph. This representation makes it easier to visualize and understand the functional dependencies between different system variables. It also helps in identifying data that is irrelevant for a decision maker to take an optimal decision. Such irrelevant data can be identified using algorithms from graphical models. Thus, the structural properties of optimal decision makers in this model for a sequential team can be identified in an automated manner using the directed acyclic factor graph representation of the sequential team.
{"title":"A Graphical modeling approach to simplifying sequential teams","authors":"Aditya Mahajan, S. Tatikonda","doi":"10.1109/WIOPT.2009.5291560","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291560","url":null,"abstract":"A graphical model for sequential teams is presented. This model is easy to understand, and at the same time, is general enough to model any finite horizon sequential team with finite valued system variables and unconstrained decision rules. The model can also be represented as a directed acyclic factor graph. This representation makes it easier to visualize and understand the functional dependencies between different system variables. It also helps in identifying data that is irrelevant for a decision maker to take an optimal decision. Such irrelevant data can be identified using algorithms from graphical models. Thus, the structural properties of optimal decision makers in this model for a sequential team can be identified in an automated manner using the directed acyclic factor graph representation of the sequential team.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"17 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":"115627192","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.5291561
A. Nayyar, D. Teneketzis
We consider a sequential problem in decentralized detection. Two observers can make repeated noisy observations of a binary hypothesis on the state of the environment. At any time, observer 1 can stop and send a final message to observer 2 or it may continue to take more measurements. Every time observer 1 postpones its final message to observer 2, it incurs a penalty. We consider observer 2's operation under two different scenarios. In the first scenario, observer 2 waits to receive the final message from observer 1 and then starts taking measurements of its own. It is then faced with a stopping problem on whether to stop and declare a decision on the hypothesis or to continue taking measurements. In the second scenario, observer 2 starts taking measurements from the beginning. It is then faced with a different stopping problem. At any time, observer 2 can decide whether to stop and declare a decision on the hypothesis or to continue to take more measurements and wait for observer 1 to send its final message. We obtain parametric characterization of optimal policies for the two observers under both scenarios. We then extend these characterizations to a problem with multiple peripheral sensors that each send a single final message to a coordinating sensor who makes the final decision on the hypothesis.
{"title":"A sequential problem in decentralized detection with communication","authors":"A. Nayyar, D. Teneketzis","doi":"10.1109/WIOPT.2009.5291561","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291561","url":null,"abstract":"We consider a sequential problem in decentralized detection. Two observers can make repeated noisy observations of a binary hypothesis on the state of the environment. At any time, observer 1 can stop and send a final message to observer 2 or it may continue to take more measurements. Every time observer 1 postpones its final message to observer 2, it incurs a penalty. We consider observer 2's operation under two different scenarios. In the first scenario, observer 2 waits to receive the final message from observer 1 and then starts taking measurements of its own. It is then faced with a stopping problem on whether to stop and declare a decision on the hypothesis or to continue taking measurements. In the second scenario, observer 2 starts taking measurements from the beginning. It is then faced with a different stopping problem. At any time, observer 2 can decide whether to stop and declare a decision on the hypothesis or to continue to take more measurements and wait for observer 1 to send its final message. We obtain parametric characterization of optimal policies for the two observers under both scenarios. We then extend these characterizations to a problem with multiple peripheral sensors that each send a single final message to a coordinating sensor who makes the final decision on the hypothesis.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"168 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":"116314617","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.5291586
Sreenath Ramanath, E. Altman, Vinod Kumar, M. Debbah
In this paper, we present a systematic study of the uplink capacity and coverage of pico-cell wireless networks. Both the one dimensional as well as the two dimensional cases are investigated. Our goal is to compute the size of pico-cells that maximizes the spatial throughput density. To achieve this goal, we consider fluid models that allow us to obtain explicit expressions for the interference and the total received power at a base station. We study the impact of various parameters on the performance: the path loss factor, the spatial reuse factor and the receiver structure (matched filter or multiuser detector). We relate the performance of the fluid models to that of the original discrete system and show that the fluid model provides a bound for the discrete one.
{"title":"Optimizing cell size in Pico-cell networks","authors":"Sreenath Ramanath, E. Altman, Vinod Kumar, M. Debbah","doi":"10.1109/WIOPT.2009.5291586","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291586","url":null,"abstract":"In this paper, we present a systematic study of the uplink capacity and coverage of pico-cell wireless networks. Both the one dimensional as well as the two dimensional cases are investigated. Our goal is to compute the size of pico-cells that maximizes the spatial throughput density. To achieve this goal, we consider fluid models that allow us to obtain explicit expressions for the interference and the total received power at a base station. We study the impact of various parameters on the performance: the path loss factor, the spatial reuse factor and the receiver structure (matched filter or multiuser detector). We relate the performance of the fluid models to that of the original discrete system and show that the fluid model provides a bound for the discrete one.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"59 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":"116399561","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.5291613
Jingping Ji, Wei Yu
This paper aims to quantify the performance improvement due to the use of fixed relays in the uplink of a wireless cellular network. Consider an orthogonal frequency division multiplex (OFDM) based cellular network in which each cell consists of a base station, multiple mobile users, and a number of relays. The questions of which frequency tones each link should use, whether the mobile station should communicate directly to the base station or though a relay, and how much power should be allocated on each frequency tone, form a simultaneous routing, frequency planning, and power allocation problem. This paper presents a dual decomposition approach to this problem and illustrates that while the use of relays does not necessarily increase the total cell throughput, it significantly improves the minimum common rate achievable across all the mobile users. Thus, the main benefit for deploying relays is in the improvement in fairness, rather than the total throughput.
{"title":"Bandwidth and routing optimization in wireless cellular networks with relays","authors":"Jingping Ji, Wei Yu","doi":"10.1109/WIOPT.2009.5291613","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291613","url":null,"abstract":"This paper aims to quantify the performance improvement due to the use of fixed relays in the uplink of a wireless cellular network. Consider an orthogonal frequency division multiplex (OFDM) based cellular network in which each cell consists of a base station, multiple mobile users, and a number of relays. The questions of which frequency tones each link should use, whether the mobile station should communicate directly to the base station or though a relay, and how much power should be allocated on each frequency tone, form a simultaneous routing, frequency planning, and power allocation problem. This paper presents a dual decomposition approach to this problem and illustrates that while the use of relays does not necessarily increase the total cell throughput, it significantly improves the minimum common rate achievable across all the mobile users. Thus, the main benefit for deploying relays is in the improvement in fairness, rather than the total throughput.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"1 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":"128336483","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
扫码关注我们
求助内容：
应助结果提醒方式：