Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291642
Kwanghun Han, Youngkyu Choi, Dongmyoung Kim, Minsoo Na, Sunghyun Choi, Kiyoung Han
Femto BS (Base Station) is emerging as a key technology to secure the coverage and capacity in indoor environments. However, since the existing macrocell network is overlaid on femtocell networks utilizing the same set of frequency channels, femtocell networks can originate severe co-channel interference to the macrocell network unless the femtocell network is carefully configured. Therefore, according to a desired network-wide objective, we optimize the femtocell network with constraints such that the service connectivity with a femto BS is secured in the target indoor area while the signal emitted out of the building, playing as interference to the outdoor users, should be controlled with an appropriate strength in order not to interrupt the communication between macro BS and outdoor users. Each optimization problem is formulated as a mixed integer programming, and as the results, we obtain not only the transmit power and operational frequency channel of each femto BS, but also the optimal femto BS-to-user association pair at each geographical position.
{"title":"Optimization of femtocell network configuration under interference constraints","authors":"Kwanghun Han, Youngkyu Choi, Dongmyoung Kim, Minsoo Na, Sunghyun Choi, Kiyoung Han","doi":"10.1109/WIOPT.2009.5291642","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291642","url":null,"abstract":"Femto BS (Base Station) is emerging as a key technology to secure the coverage and capacity in indoor environments. However, since the existing macrocell network is overlaid on femtocell networks utilizing the same set of frequency channels, femtocell networks can originate severe co-channel interference to the macrocell network unless the femtocell network is carefully configured. Therefore, according to a desired network-wide objective, we optimize the femtocell network with constraints such that the service connectivity with a femto BS is secured in the target indoor area while the signal emitted out of the building, playing as interference to the outdoor users, should be controlled with an appropriate strength in order not to interrupt the communication between macro BS and outdoor users. Each optimization problem is formulated as a mixed integer programming, and as the results, we obtain not only the transmit power and operational frequency channel of each femto BS, but also the optimal femto BS-to-user association pair at each geographical position.","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":"122465938","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.5291604
Jun Luo, A. Girard, C. Rosenberg
We focus on efficient algorithms for resource allocation problems in large wireless networks. We first investigate the link scheduling problem and identify the properties that make it possible to compute solutions efficiently. We then show that the node on-off scheduling problem shares these features and is amenable to the same type of solution method. Numerical results confirm the efficiency of our technique for large scale problems. We also extend the technique to the case where the objective function is nonlinear showing that our technique blends smoothly with a sequential linear programming approach. Numerical results for a cross-layer design with a nonlinear fairness utility show that it is possible to compute optimal solutions for large wireless networks in reasonable CPU time.
{"title":"Efficient algorithms to solve a class of resource allocation problems in large wireless networks","authors":"Jun Luo, A. Girard, C. Rosenberg","doi":"10.1109/WIOPT.2009.5291604","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291604","url":null,"abstract":"We focus on efficient algorithms for resource allocation problems in large wireless networks. We first investigate the link scheduling problem and identify the properties that make it possible to compute solutions efficiently. We then show that the node on-off scheduling problem shares these features and is amenable to the same type of solution method. Numerical results confirm the efficiency of our technique for large scale problems. We also extend the technique to the case where the objective function is nonlinear showing that our technique blends smoothly with a sequential linear programming approach. Numerical results for a cross-layer design with a nonlinear fairness utility show that it is possible to compute optimal solutions for large wireless networks in reasonable CPU time.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"7 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":"130536841","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.5291569
R. Ganti, M. Haenggi
In a wireless network, the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Analyzing the connectivity of such a network using static graphs would lead to pessimistic performance results. In this paper, we consider an ad hoc network with half-duplex radios that uses multihop routing and slotted ALOHA for the network MAC contention and introduce a random dynamic multi-digraph to model its connectivity. We first provide analytical results about the degree distribution of the graph. Next, defining the path formation time as the minimum time required for a causal path to form between the source and destination on the dynamic graph, we derive the distributional properties of the connection delay using techniques from first-passage percolation and epidemic processes.We show that the delay scales linearly with the distance and provide asymptotic results (with respect to time) for the positions of the nodes which are able to receive information from a transmitter located at the origin. We also provide simulation results to support the theoretical results.
{"title":"Bounds on the information propagation delay in interference-limited ALOHA networks","authors":"R. Ganti, M. Haenggi","doi":"10.1109/WIOPT.2009.5291569","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291569","url":null,"abstract":"In a wireless network, the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Analyzing the connectivity of such a network using static graphs would lead to pessimistic performance results. In this paper, we consider an ad hoc network with half-duplex radios that uses multihop routing and slotted ALOHA for the network MAC contention and introduce a random dynamic multi-digraph to model its connectivity. We first provide analytical results about the degree distribution of the graph. Next, defining the path formation time as the minimum time required for a causal path to form between the source and destination on the dynamic graph, we derive the distributional properties of the connection delay using techniques from first-passage percolation and epidemic processes.We show that the delay scales linearly with the distance and provide asymptotic results (with respect to time) for the positions of the nodes which are able to receive information from a transmitter located at the origin. We also provide simulation results to support the theoretical results.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"150 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":"115551101","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.5291630
R. Subramanian, B. Vellambi, F. Fekri
Consider a mobile network wherein nodes are confined to move and communicate in a given area. The network is assumed to be sparse, wherein a direct communication path from a source node via multiple hops to a destination node almost never exists. The nodes resort to storing, carrying, and forwarding packets when a contact occurs, as a means of communication. This paper investigates the question of computing the throughput capacity of the resulting network, in other words, the rate at which a source node can send packets to a destination node using the other nodes in the network as relays. It proposes an accurate generalized framework valid for any mobility model that exhibits stationarity. The framework uses the embedded Markov-Chain approach using which the capacity of such a network can be accurately determined by computing certain well-defined characteristic parameters from the mobility model. Constraints posed by limited node storage and contention between nodes for the wireless channel are also considered in order to obtain a realistic model for the throughput. The paper also illustrates the proposed framework under two specific cases: the random walk, random waypoint, and restricted random waypoint mobility models, and validates the same using simulations.
{"title":"A generalized framework for throughput analysis in sparse mobile networks","authors":"R. Subramanian, B. Vellambi, F. Fekri","doi":"10.1109/WIOPT.2009.5291630","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291630","url":null,"abstract":"Consider a mobile network wherein nodes are confined to move and communicate in a given area. The network is assumed to be sparse, wherein a direct communication path from a source node via multiple hops to a destination node almost never exists. The nodes resort to storing, carrying, and forwarding packets when a contact occurs, as a means of communication. This paper investigates the question of computing the throughput capacity of the resulting network, in other words, the rate at which a source node can send packets to a destination node using the other nodes in the network as relays. It proposes an accurate generalized framework valid for any mobility model that exhibits stationarity. The framework uses the embedded Markov-Chain approach using which the capacity of such a network can be accurately determined by computing certain well-defined characteristic parameters from the mobility model. Constraints posed by limited node storage and contention between nodes for the wireless channel are also considered in order to obtain a realistic model for the throughput. The paper also illustrates the proposed framework under two specific cases: the random walk, random waypoint, and restricted random waypoint mobility models, and validates the same using simulations.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"137 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":"124314755","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.5291578
V. Visoottiviseth, Thanakom Piroonsith, S. Siwamogsatham
The empirical performance studies on the emerging IEEE 802.11n technology by an independent and vendor-neutral party have not really been explored. In this paper, we conduct performance measurements for the IEEE 802.11n network using a mixture of commercially available IEEE 802.11n devices from various manufacturers. With the same standard 20-MHz channel width configuration, the results demonstrate that IEEE 802.11n significantly outperforms the IEEE 802.11g network. The performance improvements of IEEE 802.11n are measured to be roughly about 85% for the downlink UDP traffic, 68% for the downlink TCP traffic, 50% for the uplink UDP traffic, and 90% for the uplink TCP traffic. We also observe that the UDP throughputs are largely imbalanced for the uplink and downlink traffics in most test networks, while the downlink and uplink TCP throughput results are quite balanced for all test networks. In addition, the 40-MHz channel configurations only provide marginal performance improvements. Unlike other existing work, here we also capture and analyze the IEEE 802.11n packets transferred during the performance tests in order to technically explain the measured performance results. It is observed that when the frame aggregation and block acknowledgement mechanisms are utilized, the superior performance results are achieved. However, the decisions on how and when to use these mechanisms are very hardware dependent.
{"title":"An empirical study on achievable throughputs of IEEE 802.11n devices","authors":"V. Visoottiviseth, Thanakom Piroonsith, S. Siwamogsatham","doi":"10.1109/WIOPT.2009.5291578","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291578","url":null,"abstract":"The empirical performance studies on the emerging IEEE 802.11n technology by an independent and vendor-neutral party have not really been explored. In this paper, we conduct performance measurements for the IEEE 802.11n network using a mixture of commercially available IEEE 802.11n devices from various manufacturers. With the same standard 20-MHz channel width configuration, the results demonstrate that IEEE 802.11n significantly outperforms the IEEE 802.11g network. The performance improvements of IEEE 802.11n are measured to be roughly about 85% for the downlink UDP traffic, 68% for the downlink TCP traffic, 50% for the uplink UDP traffic, and 90% for the uplink TCP traffic. We also observe that the UDP throughputs are largely imbalanced for the uplink and downlink traffics in most test networks, while the downlink and uplink TCP throughput results are quite balanced for all test networks. In addition, the 40-MHz channel configurations only provide marginal performance improvements. Unlike other existing work, here we also capture and analyze the IEEE 802.11n packets transferred during the performance tests in order to technically explain the measured performance results. It is observed that when the frame aggregation and block acknowledgement mechanisms are utilized, the superior performance results are achieved. However, the decisions on how and when to use these mechanisms are very hardware dependent.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"8 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":"122346326","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.5291600
J. Kélif, M. Coupechoux
In this paper, we establish a closed form formula of the other-cell interference factor f for omni-directional and sectored cellular networks. That formula is based on a fluid model that approximates the discrete base stations (BS) entities by a continuum of transmitters which are spatially distributed in the network. Simulations show that the obtained closed-form formula is a very good approximation, even for the traditional hexagonal network. From f, we are able to derive the outage probability on the downlink as a function of the mobile density and the coverage range. From a maximum acceptable outage probability, we can deduce the link between cell coverage and mobile density and thus highlight with a new, easy and fast method the notion of cell breathing. At last, we show how an operator can use this approach in order to evaluate the impact of sectorization or BS densification on the cell coverage.
{"title":"Cell breathing, sectorization and densification in cellular networks","authors":"J. Kélif, M. Coupechoux","doi":"10.1109/WIOPT.2009.5291600","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291600","url":null,"abstract":"In this paper, we establish a closed form formula of the other-cell interference factor f for omni-directional and sectored cellular networks. That formula is based on a fluid model that approximates the discrete base stations (BS) entities by a continuum of transmitters which are spatially distributed in the network. Simulations show that the obtained closed-form formula is a very good approximation, even for the traditional hexagonal network. From f, we are able to derive the outage probability on the downlink as a function of the mobile density and the coverage range. From a maximum acceptable outage probability, we can deduce the link between cell coverage and mobile density and thus highlight with a new, easy and fast method the notion of cell breathing. At last, we show how an operator can use this approach in order to evaluate the impact of sectorization or BS densification on the cell coverage.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"63 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":"116898322","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.5291611
E. Altman, T. Başar, Ishai Menache, H. Tembine
We study a dynamic random access game with a finite number of opportunities for transmission and with energy constraints. We provide sufficient conditions for feasible strategies and for existence of Nash-Pareto solutions and show that finding Nash-Pareto policies of the dynamic random access game is equivalent to partitioning the set of time slot opportunities with constraints into a set of terminals. We further derive upper bounds for pure Nash-Pareto policies, and extend the study to non-integer energy constraints and unknown termination time, where Time Division Multiplexing policies can be suboptimal. We show that the dynamic random access game has several strong equilibria (resilient to coalition of any size), and we compute them explicitly. We introduce the (strong) price of anarchy concept to measure the gap between the payoff under strong equilibria and the social optimum.
{"title":"A dynamic random access game with energy constraints","authors":"E. Altman, T. Başar, Ishai Menache, H. Tembine","doi":"10.1109/WIOPT.2009.5291611","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291611","url":null,"abstract":"We study a dynamic random access game with a finite number of opportunities for transmission and with energy constraints. We provide sufficient conditions for feasible strategies and for existence of Nash-Pareto solutions and show that finding Nash-Pareto policies of the dynamic random access game is equivalent to partitioning the set of time slot opportunities with constraints into a set of terminals. We further derive upper bounds for pure Nash-Pareto policies, and extend the study to non-integer energy constraints and unknown termination time, where Time Division Multiplexing policies can be suboptimal. We show that the dynamic random access game has several strong equilibria (resilient to coalition of any size), and we compute them explicitly. We introduce the (strong) price of anarchy concept to measure the gap between the payoff under strong equilibria and the social optimum.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"23 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":"124101717","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.5291587
S. Naik, H. Boche
We utilize axiomatic bargaining theory to depict certain implications of continuity properties of resource allocation strategies in wireless systems. Feasible utility sets are characterized as sub-level sets of interference functions. The collective choice function is used to represent resource allocation strategies. We use an axiomatic framework to emulate certain desirable properties of resource allocation strategies. We focus on the axiom of feasible set continuity, to emulate robustness of the resource allocation strategy to channel estimation and prediction errors. The connection between the axiom of feasible set continuity, lower semi-continuity and upper semi-continuity is elucidated. We investigate continuity properties, which allow a resource allocation strategy to be a strict monotone path collective choice function (MPCCF). We provide a result, which displays the practical importance of the axiom of feasible set continuity to develop bounds on the uncertainty region, resulting from channel estimation and prediction errors. We provide examples to show that the strict MPCCF is a useful tool to characterize solution outcomes of resource allocation strategies, e.g. egalitarian solution and dictatorial solution.
{"title":"Practical implications of continuity properties of resource allocation strategies in wireless systems","authors":"S. Naik, H. Boche","doi":"10.1109/WIOPT.2009.5291587","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291587","url":null,"abstract":"We utilize axiomatic bargaining theory to depict certain implications of continuity properties of resource allocation strategies in wireless systems. Feasible utility sets are characterized as sub-level sets of interference functions. The collective choice function is used to represent resource allocation strategies. We use an axiomatic framework to emulate certain desirable properties of resource allocation strategies. We focus on the axiom of feasible set continuity, to emulate robustness of the resource allocation strategy to channel estimation and prediction errors. The connection between the axiom of feasible set continuity, lower semi-continuity and upper semi-continuity is elucidated. We investigate continuity properties, which allow a resource allocation strategy to be a strict monotone path collective choice function (MPCCF). We provide a result, which displays the practical importance of the axiom of feasible set continuity to develop bounds on the uncertainty region, resulting from channel estimation and prediction errors. We provide examples to show that the strict MPCCF is a useful tool to characterize solution outcomes of resource allocation strategies, e.g. egalitarian solution and dictatorial solution.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"64 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":"131253303","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.5291645
Caleb T. Phillips, D. Sicker, D. Grunwald, Suresh Singh
In the design of wireless networking protocols and systems, simulation has become the primary form of initial validation and performance evaluation. Hence, ensuring the realism of simulators and simulation methods is fundamental for simulated results to be interpretable. In this paper, we provide a simulation framework for infrastructure wireless network traffic that allows researchers to use publicly available captured traces as a primary or background traffic source. We investigate the question of trace classification as a necessary task for these traces to be useful and apply our framework to a well-known power-saving application, showing that the use of real traffic provides substantially different results as compared to traffic generated from an application-specific fitted model or contrived source. Additionally, we show how trace classification provides unique insights into application behavior in both typical and extreme scenarios.
{"title":"Techniques for simulation of realistic infrastructure wireless network traffic","authors":"Caleb T. Phillips, D. Sicker, D. Grunwald, Suresh Singh","doi":"10.1109/WIOPT.2009.5291645","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291645","url":null,"abstract":"In the design of wireless networking protocols and systems, simulation has become the primary form of initial validation and performance evaluation. Hence, ensuring the realism of simulators and simulation methods is fundamental for simulated results to be interpretable. In this paper, we provide a simulation framework for infrastructure wireless network traffic that allows researchers to use publicly available captured traces as a primary or background traffic source. We investigate the question of trace classification as a necessary task for these traces to be useful and apply our framework to a well-known power-saving application, showing that the use of real traffic provides substantially different results as compared to traffic generated from an application-specific fitted model or contrived source. Additionally, we show how trace classification provides unique insights into application behavior in both typical and extreme scenarios.","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":"130817487","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.5291591
M. Sigelle, Ian H. Jermyn, S. Perreau, A. Jayasuriya
We describe basic properties of Markov chains on finite state spaces and their application to Green functions, partial differential equations, and their (approximate) solution using random walks on a graph. Attention is paid to the influence of boundary conditions (Dirichlet/von Neumann). We apply these ideas to the study of traffic propagation and distribution in ad hoc networks.
{"title":"Lattice Green functions and diffusion for modelling traffic routing in ad hoc networks","authors":"M. Sigelle, Ian H. Jermyn, S. Perreau, A. Jayasuriya","doi":"10.1109/WIOPT.2009.5291591","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291591","url":null,"abstract":"We describe basic properties of Markov chains on finite state spaces and their application to Green functions, partial differential equations, and their (approximate) solution using random walks on a graph. Attention is paid to the influence of boundary conditions (Dirichlet/von Neumann). We apply these ideas to the study of traffic propagation and distribution in ad hoc networks.","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":"130893984","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
扫码关注我们
求助内容：
应助结果提醒方式：