Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291571
S. T. Aditya, P. Manohar, D. Manjunath
We consider k-coverage of a line by a twodimensional, non homogeneous Poisson-Boolean model. This has applications in sensor networks. We extend the analysis of [1] to the case for k ≫ 1. The extension requires us to define a vector Markov process that tracks the k segments that have the longest residual coverage at a point. This process is used to determine the probability of a segment of the line being completely covered by k or more sensors. We illustrate the extension by considering the case of k = 2.
{"title":"On the k-coverage of line segments by a non homogeneous Poisson-Boolean model","authors":"S. T. Aditya, P. Manohar, D. Manjunath","doi":"10.1109/WIOPT.2009.5291571","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291571","url":null,"abstract":"We consider k-coverage of a line by a twodimensional, non homogeneous Poisson-Boolean model. This has applications in sensor networks. We extend the analysis of [1] to the case for k ≫ 1. The extension requires us to define a vector Markov process that tracks the k segments that have the longest residual coverage at a point. This process is used to determine the probability of a segment of the line being completely covered by k or more sensors. We illustrate the extension by considering the case of k = 2.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"545 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":"123377579","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.5291588
A. Giovanidis, S. Stańczak
In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). Errors occur due to outages and a success probability function is related to each link, which can be controlled by power and rate allocation. We first derive the expression for the network's capacity region. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into (a) the input rate control problem and (b) the scheduling problem. The NUM problem can be solved in a fully decentralized manner if (b) is solved distributedly. Use of supermodular game theory suggests a price based algorithm that requires minimum information exchange between interfering nodes and converges to a power allocation which satisfies the necessary optimality conditions of (b). Simulations illustrate that the suggested algorithm brings near optimal results.
{"title":"Retransmission aware congestion control and distributed power allocation in MANETs","authors":"A. Giovanidis, S. Stańczak","doi":"10.1109/WIOPT.2009.5291588","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291588","url":null,"abstract":"In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). Errors occur due to outages and a success probability function is related to each link, which can be controlled by power and rate allocation. We first derive the expression for the network's capacity region. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into (a) the input rate control problem and (b) the scheduling problem. The NUM problem can be solved in a fully decentralized manner if (b) is solved distributedly. Use of supermodular game theory suggests a price based algorithm that requires minimum information exchange between interfering nodes and converges to a power allocation which satisfies the necessary optimality conditions of (b). Simulations illustrate that the suggested algorithm brings near optimal results.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"96 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":"133083914","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.5291641
Haibo Zhang, Pablo Soldati, M. Johansson
Convergecast, in which data from a set of sources is routed toward one data sink, is a critical functionality for wireless networks deployed for industrial monitoring and control. We address the joint link scheduling and channel assignment problem for convergecast in networks operating according to the recent WirelessHART standard. For a linear network with N single-buffer devices, we demonstrate that the minimum time to complete convergecast is 2N-1 time-slots, and that the minimum number of channels required for this operation is ⌈N/2⌉. When the devices are allowed to buffer multiple packets, we prove that the optimal convergecast time remains the same while the number of required channels can be reduced to . For both cases, we present jointly time- and channel-optimal scheduling policies with complexity O(N2). Numerical results demonstrate that our schemes are also efficient in terms of memory utilization.
{"title":"Optimal link scheduling and channel assignment for convergecast in linear WirelessHART networks","authors":"Haibo Zhang, Pablo Soldati, M. Johansson","doi":"10.1109/WIOPT.2009.5291641","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291641","url":null,"abstract":"Convergecast, in which data from a set of sources is routed toward one data sink, is a critical functionality for wireless networks deployed for industrial monitoring and control. We address the joint link scheduling and channel assignment problem for convergecast in networks operating according to the recent WirelessHART standard. For a linear network with N single-buffer devices, we demonstrate that the minimum time to complete convergecast is 2N-1 time-slots, and that the minimum number of channels required for this operation is ⌈N/2⌉. When the devices are allowed to buffer multiple packets, we prove that the optimal convergecast time remains the same while the number of required channels can be reduced to . For both cases, we present jointly time- and channel-optimal scheduling policies with complexity O(N2). Numerical results demonstrate that our schemes are also efficient in terms of memory utilization.","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":"132334272","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.5291621
K. Pelechrinis, Christos Koufogiannakis, S. Krishnamurthy
Frequency hopping has been the most popularly considered approach for alleviating the effects of jamming attacks. In this paper, we provide a novel, measurement-driven, game theoretic framework that captures the interactions between a communication link and an adversarial jammer, possibly with multiple jamming devices, in a wireless network employing frequency hopping (FH). The framework can be used to quantify the efficacy of FH as a jamming countermeasure. Our model accounts for two important factors that affect the aforementioned interactions: (a) the number of orthogonal channels available for use and (b) the frequency separation between these orthogonal bands. If the latter is small, then the energy spill over between two adjacent channels (considered orthogonal) is high; as a result a jammer on an orthogonal band that is adjacent to that used by a legitimate communication, can be extremely effective. We account for both these factors and using our framework we provide bounds on the performance of proactive frequency hopping in alleviating the impact of a jammer. The main contributions of our work are: (a) Construction of a measurement driven game theoretic framework which models the interactions between a jammer and a communication link that employ FH. (b) Extensive experimentation on our indoor testbed in order to quantify the impact of a jammer in a 802.11a/g network. (c) Application of our framework to quantify the efficacy of proactive FH across a variety of 802.11 network configurations. (d) Formal derivation of the optimal strategies for both the link and the jammer in 802.11 networks. Our results demonstrate that frequency hopping is largely inadequate in coping with jamming attacks in current 802.11 networks. In particular, we show that if current systems were to support hundreds of additional channels, FH would form a robust jamming countermeasure1.
{"title":"Gaming the jammer: Is frequency hopping effective?","authors":"K. Pelechrinis, Christos Koufogiannakis, S. Krishnamurthy","doi":"10.1109/WIOPT.2009.5291621","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291621","url":null,"abstract":"Frequency hopping has been the most popularly considered approach for alleviating the effects of jamming attacks. In this paper, we provide a novel, measurement-driven, game theoretic framework that captures the interactions between a communication link and an adversarial jammer, possibly with multiple jamming devices, in a wireless network employing frequency hopping (FH). The framework can be used to quantify the efficacy of FH as a jamming countermeasure. Our model accounts for two important factors that affect the aforementioned interactions: (a) the number of orthogonal channels available for use and (b) the frequency separation between these orthogonal bands. If the latter is small, then the energy spill over between two adjacent channels (considered orthogonal) is high; as a result a jammer on an orthogonal band that is adjacent to that used by a legitimate communication, can be extremely effective. We account for both these factors and using our framework we provide bounds on the performance of proactive frequency hopping in alleviating the impact of a jammer. The main contributions of our work are: (a) Construction of a measurement driven game theoretic framework which models the interactions between a jammer and a communication link that employ FH. (b) Extensive experimentation on our indoor testbed in order to quantify the impact of a jammer in a 802.11a/g network. (c) Application of our framework to quantify the efficacy of proactive FH across a variety of 802.11 network configurations. (d) Formal derivation of the optimal strategies for both the link and the jammer in 802.11 networks. Our results demonstrate that frequency hopping is largely inadequate in coping with jamming attacks in current 802.11 networks. In particular, we show that if current systems were to support hundreds of additional channels, FH would form a robust jamming countermeasure1.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"25 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":"115721089","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.5291570
Chi-Kin Chau
Random geometric graphs are widely-used for modelling wireless ad hoc networks, where nodes are randomly deployed with each covering a finite region. The fundamental properties of random geometric graphs are often studied in the literature, such as the probability of connectivity and random coverage area. While there are numerous asymptotic results that concern the related scaling laws in very large random geometric graphs, more accurate estimation for the finite cases with moderate-sized networks remains challenging. In this paper, we present a remarkably good approximation relationship for the probability of connectivity and random coverage area between the random geometric graphs induced by circular and square coverage models, under suitable normalisation. We also provide analytical results towards justifying the good approximation relationship. This relationship is then exploited, combining with the results from reliability studies, to obtain more accurate estimation for the probability of connectivity in finite random geometric graphs.
{"title":"Finite random geometric graphs by circular and square coverage","authors":"Chi-Kin Chau","doi":"10.1109/WIOPT.2009.5291570","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291570","url":null,"abstract":"Random geometric graphs are widely-used for modelling wireless ad hoc networks, where nodes are randomly deployed with each covering a finite region. The fundamental properties of random geometric graphs are often studied in the literature, such as the probability of connectivity and random coverage area. While there are numerous asymptotic results that concern the related scaling laws in very large random geometric graphs, more accurate estimation for the finite cases with moderate-sized networks remains challenging. In this paper, we present a remarkably good approximation relationship for the probability of connectivity and random coverage area between the random geometric graphs induced by circular and square coverage models, under suitable normalisation. We also provide analytical results towards justifying the good approximation relationship. This relationship is then exploited, combining with the results from reliability studies, to obtain more accurate estimation for the probability of connectivity in finite random geometric graphs.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"6 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":"125525148","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.5291602
Yan Chen, V. Lau, Shunqing Zhang, Peiliang Qiu
Cognitive and cooperative technologies are two core components in the design of next generation wireless networks. One key issue associated with cognitive transmission is the inefficient spectrum sharing of the secondary system, especially for secondary communications separated by long distance. To boost the spectrum sharing efficiency, cognitive multi-relay system appears to be an attractive solution for the cognitive transmission systems. In this paper, we consider a cognitive multi-relay (CMR) system and propose a novel CMR buffered decode-and-forward protocol that exploit the buffers in the source and each relay node. Moreover, we derive the closed-form average end-to-end delay and the stability region by exploiting the birth-death nature of the queue dynamics and the methods of state aggregation and queue dominance. Comparing with the baseline protocols through analytical and numerical results, the proposed CMR-BDF scheme can dynamically adjust the cognitive transmission to exploit the spatial PU burstiness while simultaneously benefits from the advantage of double-sided selection diversity in both the source-relay and relay-destination interfaces.
{"title":"Exploiting buffers in cognitive multi-relay systems for delay-sensitive applications","authors":"Yan Chen, V. Lau, Shunqing Zhang, Peiliang Qiu","doi":"10.1109/WIOPT.2009.5291602","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291602","url":null,"abstract":"Cognitive and cooperative technologies are two core components in the design of next generation wireless networks. One key issue associated with cognitive transmission is the inefficient spectrum sharing of the secondary system, especially for secondary communications separated by long distance. To boost the spectrum sharing efficiency, cognitive multi-relay system appears to be an attractive solution for the cognitive transmission systems. In this paper, we consider a cognitive multi-relay (CMR) system and propose a novel CMR buffered decode-and-forward protocol that exploit the buffers in the source and each relay node. Moreover, we derive the closed-form average end-to-end delay and the stability region by exploiting the birth-death nature of the queue dynamics and the methods of state aggregation and queue dominance. Comparing with the baseline protocols through analytical and numerical results, the proposed CMR-BDF scheme can dynamically adjust the cognitive transmission to exploit the spatial PU burstiness while simultaneously benefits from the advantage of double-sided selection diversity in both the source-relay and relay-destination interfaces.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"21 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":"134090316","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.5291631
Wen Wang, L. Ong, M. Motani
Half duplex devices are widely used in today's wireless networks. These devices can only send or receive, but not do both at the same time. In this paper, we use cooperative decode-forward relay strategies to increase the throughput of half-duplex wireless networks. Due to the half duplex constraint, relays need to carefully choose their transmission states in order to maximize the throughput. We show that the transmission schedule optimization can be formulated as a linear programming problem. Although the number of possible states grows exponentially as the number of relays increases, only a small subset of these states needs to be used in the optimal transmission schedule. This observation allows us to use heuristic algorithms to solve for near-optimal schedule in large networks. Our numerical results show that the decode-forward strategy can provide nearly 3 times more throughput than the traditional multi-hop relaying strategy in half duplex wireless networks.
{"title":"Transmission schedule optimization for half-duplex multiple-relay networks","authors":"Wen Wang, L. Ong, M. Motani","doi":"10.1109/WIOPT.2009.5291631","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291631","url":null,"abstract":"Half duplex devices are widely used in today's wireless networks. These devices can only send or receive, but not do both at the same time. In this paper, we use cooperative decode-forward relay strategies to increase the throughput of half-duplex wireless networks. Due to the half duplex constraint, relays need to carefully choose their transmission states in order to maximize the throughput. We show that the transmission schedule optimization can be formulated as a linear programming problem. Although the number of possible states grows exponentially as the number of relays increases, only a small subset of these states needs to be used in the optimal transmission schedule. This observation allows us to use heuristic algorithms to solve for near-optimal schedule in large networks. Our numerical results show that the decode-forward strategy can provide nearly 3 times more throughput than the traditional multi-hop relaying strategy in half duplex wireless networks.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"10 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":"114263092","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.5291614
J. Brehmer, W. Utschick
We consider the problem of bargaining over block fading interference channels, where interaction between players takes place over multiple channel realizations. Based on the assumption that the transmitters have conflicting objectives, we use axiomatic bargaining theory to derive optimal rate allocations in each block. In the setup under consideration, the Nash bargaining solution (NBS) is non-causal, i.e., cannot be implemented in a real-world system. We argue that the invariance axiom is superfluous when bargaining over a rate region. Without the invariance axiom, an equivalent solution follows from the maximization of a sum of utilities under minimum utility constraints. This alternative solution is also non-causal. We propose causal approximations to the optimal solutions. The sum utility solution allows for a more systematic approximation than the NBS. Thus, dropping the invariance axiom makes it possible to choose a solution which can be better approximated. We provide numerical results to illustrate the performance of the proposed solutions.
{"title":"Bargaining over fading interference channels","authors":"J. Brehmer, W. Utschick","doi":"10.1109/WIOPT.2009.5291614","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291614","url":null,"abstract":"We consider the problem of bargaining over block fading interference channels, where interaction between players takes place over multiple channel realizations. Based on the assumption that the transmitters have conflicting objectives, we use axiomatic bargaining theory to derive optimal rate allocations in each block. In the setup under consideration, the Nash bargaining solution (NBS) is non-causal, i.e., cannot be implemented in a real-world system. We argue that the invariance axiom is superfluous when bargaining over a rate region. Without the invariance axiom, an equivalent solution follows from the maximization of a sum of utilities under minimum utility constraints. This alternative solution is also non-causal. We propose causal approximations to the optimal solutions. The sum utility solution allows for a more systematic approximation than the NBS. Thus, dropping the invariance axiom makes it possible to choose a solution which can be better approximated. We provide numerical results to illustrate the performance of the proposed solutions.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"106 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":"117227028","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.5291634
Neeraj Jaggi, K. Kar
Sensor networks have major applications in environmental monitoring, relief operations, surveillance, health-care and defense. Future sensor networks would comprise of sensing devices with energy harvesting capabilities from renewable energy sources such as solar power. Multiple sensor nodes deployed in the region of interest would collaborate to achieve a global objective, such as detection of application specific events. This paper focuses on the design of efficient algorithms for multi-sensor activation in order to optimize the overall event detection probability. The recharge-discharge dynamics of the individual rechargeable sensor nodes, along with temporally correlated nature of event occurrences makes the optimal multi-sensor event detection question very challenging. We formulate the dynamic multi-sensor event detection question in a stochastic optimization framework, and design efficient sensor activation algorithms. Particularly, we analyze certain classes of threshold activation policies and show that they achieve near-optimal performance when the threshold is chosen carefully. Specifically, we show that a time-invariant threshold policy, which attempts to maintain a fixed number (appropriately chosen) of sensors active at all times, is optimal in absence of temporal correlations. Moreover, the same energy-balancing time-invariant threshold policy approaches optimality in presence of temporal correlations as well, albeit under certain limiting assumptions. Through simulation studies, we compare the performance of this time-invariant policy with energy-balancing correlation-dependent policies, and observe that although the latter perform better, the performance difference is rather small.
{"title":"Multi-sensor event detection under temporal correlations with renewable energy sources","authors":"Neeraj Jaggi, K. Kar","doi":"10.1109/WIOPT.2009.5291634","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291634","url":null,"abstract":"Sensor networks have major applications in environmental monitoring, relief operations, surveillance, health-care and defense. Future sensor networks would comprise of sensing devices with energy harvesting capabilities from renewable energy sources such as solar power. Multiple sensor nodes deployed in the region of interest would collaborate to achieve a global objective, such as detection of application specific events. This paper focuses on the design of efficient algorithms for multi-sensor activation in order to optimize the overall event detection probability. The recharge-discharge dynamics of the individual rechargeable sensor nodes, along with temporally correlated nature of event occurrences makes the optimal multi-sensor event detection question very challenging. We formulate the dynamic multi-sensor event detection question in a stochastic optimization framework, and design efficient sensor activation algorithms. Particularly, we analyze certain classes of threshold activation policies and show that they achieve near-optimal performance when the threshold is chosen carefully. Specifically, we show that a time-invariant threshold policy, which attempts to maintain a fixed number (appropriately chosen) of sensors active at all times, is optimal in absence of temporal correlations. Moreover, the same energy-balancing time-invariant threshold policy approaches optimality in presence of temporal correlations as well, albeit under certain limiting assumptions. Through simulation studies, we compare the performance of this time-invariant policy with energy-balancing correlation-dependent policies, and observe that although the latter perform better, the performance difference is rather small.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"12 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":"121232200","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.5291567
Kostas Stamatiou, F. Rossetto, M. Haenggi, T. Javidi, J. Zeidler, M. Zorzi
We consider a network where each route comprises a backlogged source, a number of relays and a destination at a finite distance. The locations of the sources and the relays are realizations of independent Poisson point processes. Given that the nodes observe a TDMA/ALOHA MAC protocol, our objective is to determine the number of relays and their placement such that the mean end-to-end delay in a typical route of the network is minimized.We first study an idealistic network model where all routes have the same number of hops, the same distance per hop and their own dedicated relays. Combining tools from queueing theory and stochastic geometry, we provide a precise characterization of the mean end-to-end delay. We find that the delay is minimized if the first hop is much longer than the remaining hops and that the optimal number of hops scales sublinearly with the source-destination distance. Simulating the original network scenario reveals that the analytical results are accurate, provided that the density of the relay process is sufficiently large. We conclude that, given the considered MAC protocol, our analysis provides a delay-minimizing routing strategy for random, multihop networks involving a small number of hops.
{"title":"A delay-minimizing routing strategy for wireless multi-hop networks","authors":"Kostas Stamatiou, F. Rossetto, M. Haenggi, T. Javidi, J. Zeidler, M. Zorzi","doi":"10.1109/WIOPT.2009.5291567","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291567","url":null,"abstract":"We consider a network where each route comprises a backlogged source, a number of relays and a destination at a finite distance. The locations of the sources and the relays are realizations of independent Poisson point processes. Given that the nodes observe a TDMA/ALOHA MAC protocol, our objective is to determine the number of relays and their placement such that the mean end-to-end delay in a typical route of the network is minimized.We first study an idealistic network model where all routes have the same number of hops, the same distance per hop and their own dedicated relays. Combining tools from queueing theory and stochastic geometry, we provide a precise characterization of the mean end-to-end delay. We find that the delay is minimized if the first hop is much longer than the remaining hops and that the optimal number of hops scales sublinearly with the source-destination distance. Simulating the original network scenario reveals that the analytical results are accurate, provided that the density of the relay process is sufficiently large. We conclude that, given the considered MAC protocol, our analysis provides a delay-minimizing routing strategy for random, multihop networks involving a small number of hops.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"48 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120943081","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
扫码关注我们
求助内容：
应助结果提醒方式：