Pub Date : 2005-03-13DOI: 10.1109/INFCOM.2005.1498512
S. Ganguly, Akhilesh Saxena, S. Bhatnagar, R. Izmailov, Suman Banerjee
We present SPIDER-a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private network. In order to exploit spatial diversity of the underlying network, SPIDER uses an overlay structure composed of dedicated transit nodes (TNs). The data transport mechanism in SPIDER leverages this overlay structure to provide a coordinated approach that minimizes the maximum time to replicate to all destination sites (the make span of content replication). In order to achieve this objective, SPIDER employs two orthogonal components: a) creation of multiple dynamic distribution trees using the transit nodes b) end-to-end reliable data transport with flow control on these trees by chaining point-to-point TCPs. We further present simulations based results to quantify benefits of tree construction algorithms in random topologies. We evaluate the real implementation of the SPIDER in Planet Lab and observe a 2-6 times speed up compared to different existing schemes.
{"title":"Fast replication in content distribution overlays","authors":"S. Ganguly, Akhilesh Saxena, S. Bhatnagar, R. Izmailov, Suman Banerjee","doi":"10.1109/INFCOM.2005.1498512","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498512","url":null,"abstract":"We present SPIDER-a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private network. In order to exploit spatial diversity of the underlying network, SPIDER uses an overlay structure composed of dedicated transit nodes (TNs). The data transport mechanism in SPIDER leverages this overlay structure to provide a coordinated approach that minimizes the maximum time to replicate to all destination sites (the make span of content replication). In order to achieve this objective, SPIDER employs two orthogonal components: a) creation of multiple dynamic distribution trees using the transit nodes b) end-to-end reliable data transport with flow control on these trees by chaining point-to-point TCPs. We further present simulations based results to quantify benefits of tree construction algorithms in random topologies. We evaluate the real implementation of the SPIDER in Planet Lab and observe a 2-6 times speed up compared to different existing schemes.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"4 1","pages":"2246-2256 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77949626","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498494
M. Durvy, Patrick Thiran
We present a new scheme that mimics pattern formation in biological systems to create transmission patterns in multi-hop ad hoc networks. Our scheme is decentralized and relies exclusively on local interactions between the network nodes to create global transmission patterns. A transmission inhibits other transmissions in its immediate surrounding and encourages nodes located further away to transmit. The transmission patterns created by our medium access control scheme combine the efficiency of allocation-based schemes at high traffic loads and the flexibility of random access schemes. Moreover, we show that with appropriately chosen parameters our scheme converges to collision free transmission patterns that guarantee some degree of spatial reuse.
{"title":"Reaction-diffusion based transmission patterns for ad hoc networks","authors":"M. Durvy, Patrick Thiran","doi":"10.1109/INFCOM.2005.1498494","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498494","url":null,"abstract":"We present a new scheme that mimics pattern formation in biological systems to create transmission patterns in multi-hop ad hoc networks. Our scheme is decentralized and relies exclusively on local interactions between the network nodes to create global transmission patterns. A transmission inhibits other transmissions in its immediate surrounding and encourages nodes located further away to transmit. The transmission patterns created by our medium access control scheme combine the efficiency of allocation-based schemes at high traffic loads and the flexibility of random access schemes. Moreover, we show that with appropriately chosen parameters our scheme converges to collision free transmission patterns that guarantee some degree of spatial reuse.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"1 1","pages":"2195-2205 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77987324","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498359
A. Tang, Jiantao Wang, S. Low, M. Chiang
When heterogeneous congestion control protocols that react to different pricing signals share the same network, the resulting equilibrium may no longer be interpreted as a solution to the standard utility maximization problem. We prove the existence of equilibrium under mild assumptions. Then we show that multi-protocol networks whose equilibria are locally non-unique or infinite in number can only form a set of measure zero. Multiple locally unique equilibria can arise in two ways. First, unlike in the single-protocol case, the set of bottleneck links can be non-unique with heterogeneous protocols even when the routing matrix has full row rank. The equilibria associated with different sets of bottleneck links are necessarily distinct. Second, even when there is a unique set of bottleneck links, network equilibrium can still be non-unique, but is always finite and odd in number. They cannot all be locally stable unless it is globally unique. Finally, we provide various sufficient conditions for global uniqueness. Numerical examples are used throughout the paper to illustrate these results.
{"title":"Network equilibrium of heterogeneous congestion control protocols","authors":"A. Tang, Jiantao Wang, S. Low, M. Chiang","doi":"10.1109/INFCOM.2005.1498359","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498359","url":null,"abstract":"When heterogeneous congestion control protocols that react to different pricing signals share the same network, the resulting equilibrium may no longer be interpreted as a solution to the standard utility maximization problem. We prove the existence of equilibrium under mild assumptions. Then we show that multi-protocol networks whose equilibria are locally non-unique or infinite in number can only form a set of measure zero. Multiple locally unique equilibria can arise in two ways. First, unlike in the single-protocol case, the set of bottleneck links can be non-unique with heterogeneous protocols even when the routing matrix has full row rank. The equilibria associated with different sets of bottleneck links are necessarily distinct. Second, even when there is a unique set of bottleneck links, network equilibrium can still be non-unique, but is always finite and odd in number. They cannot all be locally stable unless it is globally unique. Finally, we provide various sufficient conditions for global uniqueness. Numerical examples are used throughout the paper to illustrate these results.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"1 1","pages":"1338-1349 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82392194","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497923
Sara Alouf, E. Altman, J. Galtier, Jean-François Lalande, Corinne Touati
This paper presents an algorithm for resource allocation in satellite networks. It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under interference constraints. Our objective is to maximize the system throughput while guaranteeing that the different types of demands are satisfied, each type using a different amount of bandwidth. The proposed algorithm relies on two main techniques. The first generates admissible configurations for the interference constraints, whereas the second uses linear and integer programming with column generation. The obtained solution estimates a possible allocation plan with optimality guarantees, and highlights the frequency interferences which degrade the construction of good solutions.
{"title":"Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites","authors":"Sara Alouf, E. Altman, J. Galtier, Jean-François Lalande, Corinne Touati","doi":"10.1109/INFCOM.2005.1497923","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497923","url":null,"abstract":"This paper presents an algorithm for resource allocation in satellite networks. It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under interference constraints. Our objective is to maximize the system throughput while guaranteeing that the different types of demands are satisfied, each type using a different amount of bandwidth. The proposed algorithm relies on two main techniques. The first generates admissible configurations for the interference constraints, whereas the second uses linear and integer programming with column generation. The obtained solution estimates a possible allocation plan with optimality guarantees, and highlights the frequency interferences which degrade the construction of good solutions.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"89 1","pages":"560-571 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81461359","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497875
X. Wang, K. Kar
In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: firstly, a throughput model based on Markovian analysis is proposed for the CSMA/CA network with a general topology. Simulation investigations are presented to verify its performance. Secondly, fairness issues in CSMA/CA networks are discussed based on the throughput model. The origin of unfairness is explained and the trade-off between throughput and fairness is illustrated. Thirdly, throughput approximations based on local topology information are proposed and their performances are investigated. Fourthly, three different fairness metrics are presented and their distributed implementations, based on the throughput approximation, are proposed.
{"title":"Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks","authors":"X. Wang, K. Kar","doi":"10.1109/INFCOM.2005.1497875","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497875","url":null,"abstract":"In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: firstly, a throughput model based on Markovian analysis is proposed for the CSMA/CA network with a general topology. Simulation investigations are presented to verify its performance. Secondly, fairness issues in CSMA/CA networks are discussed based on the throughput model. The origin of unfairness is explained and the trade-off between throughput and fairness is illustrated. Thirdly, throughput approximations based on local topology information are proposed and their performances are investigated. Fourthly, three different fairness metrics are presented and their distributed implementations, based on the throughput approximation, are proposed.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"87 1","pages":"23-34 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82473502","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497915
Honghai Zhang, J. Hou
In this paper, we investigate the minimum total power (termed as critical total power) required to ensure asymptotic k-connectivity in heterogeneous wireless networks where nodes may transmit using different levels of power. We show that under the assumption that wireless nodes form a homogeneous Poisson point process with density /spl lambda/ on a unit square region [0, 1]/sup 2/ and the Toroidal model [M.D. Penrose, 1997], the critical total power required for maintaining k-connectivity is /spl theta/((/spl Gamma/(e/2+k))/((k-1)l)/spl lambda//sup 1-e/2/) with probability approaching one as /spl lambda/ goes to infinity, where e is the path loss exponent. Compared with the results that all nodes use a common critical transmission power for maintaining k-connectivity [M.D. Penrose, 1999], [P.-J. Wan and C. Yi, 2004], we show that the critical total power can be reduced by an order of (log /spl lambda/)e/2 by allowing nodes to optimally choose different levels of transmission power. This result is not subject to any specific power/topology control algorithm, but rather a fundamental property in wireless networks.
{"title":"On the critical total power for asymptotic k-connectivity in wireless networks","authors":"Honghai Zhang, J. Hou","doi":"10.1109/INFCOM.2005.1497915","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497915","url":null,"abstract":"In this paper, we investigate the minimum total power (termed as critical total power) required to ensure asymptotic k-connectivity in heterogeneous wireless networks where nodes may transmit using different levels of power. We show that under the assumption that wireless nodes form a homogeneous Poisson point process with density /spl lambda/ on a unit square region [0, 1]/sup 2/ and the Toroidal model [M.D. Penrose, 1997], the critical total power required for maintaining k-connectivity is /spl theta/((/spl Gamma/(e/2+k))/((k-1)l)/spl lambda//sup 1-e/2/) with probability approaching one as /spl lambda/ goes to infinity, where e is the path loss exponent. Compared with the results that all nodes use a common critical transmission power for maintaining k-connectivity [M.D. Penrose, 1999], [P.-J. Wan and C. Yi, 2004], we show that the critical total power can be reduced by an order of (log /spl lambda/)e/2 by allowing nodes to optimally choose different levels of transmission power. This result is not subject to any specific power/topology control algorithm, but rather a fundamental property in wireless networks.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"86 1","pages":"466-476 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76356748","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498330
C. Wu, N. Rao
The capacities of Internet backbone links have been continuously improving over the last decade, but such improvements have not been fully realized at the application level, particularly in high-performance applications. The complicated and monolithic TCP-AIMD dynamics are responsible to a large degree for low throughputs as a result of the difficulty in optimally configuring its parameters such as buffer sizes, AIMD coefficients, and slow-start transition points. In this paper, we propose a new class of UDP-based transport protocols that utilize a rate control scheme founded on the stochastic approximation method to achieve high throughputs at the application level. These protocols operate around a local maximum of the throughput regression curve by dynamically adjusting the source rate in response to acknowledgements and losses based on the statistical behavior of the network connection. We analytically show that this protocol generates a TCP-friendly flow, and also stochastically converges to the maximum throughput under a monotone loss rate condition. Our implementation achieved very robust performance over diverse Internet connections with different characteristics: it tracked the peak throughput in presence of time-varying cross traffic and consistently achieved 2-5 times the throughput of default TCP without significantly affecting the concurrent regular traffic.
{"title":"A class of reliable UDP-based transport protocols based on stochastic approximation","authors":"C. Wu, N. Rao","doi":"10.1109/INFCOM.2005.1498330","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498330","url":null,"abstract":"The capacities of Internet backbone links have been continuously improving over the last decade, but such improvements have not been fully realized at the application level, particularly in high-performance applications. The complicated and monolithic TCP-AIMD dynamics are responsible to a large degree for low throughputs as a result of the difficulty in optimally configuring its parameters such as buffer sizes, AIMD coefficients, and slow-start transition points. In this paper, we propose a new class of UDP-based transport protocols that utilize a rate control scheme founded on the stochastic approximation method to achieve high throughputs at the application level. These protocols operate around a local maximum of the throughput regression curve by dynamically adjusting the source rate in response to acknowledgements and losses based on the statistical behavior of the network connection. We analytically show that this protocol generates a TCP-friendly flow, and also stochastically converges to the maximum throughput under a monotone loss rate condition. Our implementation achieved very robust performance over diverse Internet connections with different characteristics: it tracked the peak throughput in presence of time-varying cross traffic and consistently achieved 2-5 times the throughput of default TCP without significantly affecting the concurrent regular traffic.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"49 1","pages":"1013-1024 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76094973","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497917
D. Miorandi, E. Altman
In this paper, we present an analytical procedure for the computation of the node isolation probability in an ad hoc network in the presence of channel randomness, with applications to shadowing and fading phenomena. Such a probability coincides with the complement of the coverage probability, given that nodes are distributed according to a Poisson point process. These results are used to obtain an estimate of the connectivity features for very dense networks. For the case of superimposed lognormal shadowing and Rayleigh fading, the connectivity improvements achievable by means of diversity schemes are investigated.
{"title":"Coverage and connectivity of ad hoc networks presence of channel randomness","authors":"D. Miorandi, E. Altman","doi":"10.1109/INFCOM.2005.1497917","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497917","url":null,"abstract":"In this paper, we present an analytical procedure for the computation of the node isolation probability in an ad hoc network in the presence of channel randomness, with applications to shadowing and fading phenomena. Such a probability coincides with the complement of the coverage probability, given that nodes are distributed according to a Poisson point process. These results are used to obtain an estimate of the connectivity features for very dense networks. For the case of superimposed lognormal shadowing and Rayleigh fading, the connectivity improvements achievable by means of diversity schemes are investigated.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"77 1","pages":"491-502 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87782045","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498484
F. Hao, M. Kodialam, T. V. Lakshman, Hui Zhang
We consider the problem of fast, estimation of flow rates in backbone network links with possibly millions of flows. Accurate flow rate estimation is necessary for network traffic management, network planning, measuring compliance to service level agreements, and network security. Ideally, a rate estimation scheme should have short estimation times with provable bounds on estimation error, be low in memory usage, and be easily implementable in hardware for operation at high speeds. We develop such a scheme, and achieve up to two orders of magnitude speed-up in estimation time over the previously proposed two-runs-based RATE scheme [Kodialam, M et al., 2004]. The speedups are achieved without a significant increase in memory usage, by using coincidences instead of runs. Counting coincidences has a higher processing overhead than detecting two-runs, but this higher overhead is not significant for a hardware implementation. We show that the proposed scheme is faster and more accurate than other recently proposed schemes such as ACCEL-RATE [Hao, F et al., 2004] and smart sampling [Duffield, N et al., 2004]. The faster estimation time of the new scheme has many benefits including quicker detection of incipient denial of service attacks. We prove bounds on the scheme's accuracy, memory needs, and also show that it performs well by simulations that use both synthetic and real traffic traces.
我们考虑了在可能有数以百万计的流量的骨干网络链路中快速估计流量的问题。准确的流量估计对于网络流量管理、网络规划、衡量服务水平协议的遵从性和网络安全都是必要的。理想情况下，速率估计方案应该具有较短的估计时间和可证明的估计误差界限，内存使用率低，并且易于在硬件中实现以高速运行。我们开发了这样一种方案，与之前提出的基于两次运行的RATE方案相比，估计时间加快了两个数量级[Kodialam, M et al.， 2004]。通过使用巧合而不是运行，在没有显著增加内存使用的情况下实现了速度提升。与检测两次运行相比，计算巧合的处理开销更高，但这种更高的开销对于硬件实现来说并不重要。我们表明，所提出的方案比最近提出的其他方案(如ACCEL-RATE [Hao, F等，2004]和智能采样[Duffield, N等，2004])更快，更准确。新方案具有更快的估计时间，包括更快地检测早期拒绝服务攻击。我们证明了该方案的精度和内存需求的界限，并通过使用合成和真实流量轨迹的仿真表明它具有良好的性能。
{"title":"Fast, memory-efficient traffic estimation by coincidence counting","authors":"F. Hao, M. Kodialam, T. V. Lakshman, Hui Zhang","doi":"10.1109/INFCOM.2005.1498484","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498484","url":null,"abstract":"We consider the problem of fast, estimation of flow rates in backbone network links with possibly millions of flows. Accurate flow rate estimation is necessary for network traffic management, network planning, measuring compliance to service level agreements, and network security. Ideally, a rate estimation scheme should have short estimation times with provable bounds on estimation error, be low in memory usage, and be easily implementable in hardware for operation at high speeds. We develop such a scheme, and achieve up to two orders of magnitude speed-up in estimation time over the previously proposed two-runs-based RATE scheme [Kodialam, M et al., 2004]. The speedups are achieved without a significant increase in memory usage, by using coincidences instead of runs. Counting coincidences has a higher processing overhead than detecting two-runs, but this higher overhead is not significant for a hardware implementation. We show that the proposed scheme is faster and more accurate than other recently proposed schemes such as ACCEL-RATE [Hao, F et al., 2004] and smart sampling [Duffield, N et al., 2004]. The faster estimation time of the new scheme has many benefits including quicker detection of incipient denial of service attacks. We prove bounds on the scheme's accuracy, memory needs, and also show that it performs well by simulations that use both synthetic and real traffic traces.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"61 1","pages":"2080-2090 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88383090","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497914
Honghai Zhang, J. Hou
In this paper, we study how the achievable throughput scales in a wireless network with randomly located nodes as the number of nodes increases, under a communication model where (i) each node has a maximum transmission power W/sub O/ and is capable of utilizing B Hz of bandwidth and (ii) each link can obtain a channel throughput according to the Shannon capacity. Under the limit case that B tends to infinity, we show that each node can obtain a throughput of /spl theta/(n/sup (/spl alpha/-1)/2/) where n is the density of the nodes and /spl alpha/ > 1 is the path loss exponent. Both the upper bound and lower bound are derived through percolation theory. In order to derive the capacity bounds, we have also derived an important result on random geometric graphs: if the distance between two points in a Poisson point process with density n is non-diminishing, the minimum power route requires a power rate at least /spl Omega/(n/sup (1-/spl alpha/)/2/). Our results show that the most promising approach to improving the capacity bounds in wireless ad hoc networks is to employ unlimited bandwidth resources, such as the ultra wide band (UWB).
{"title":"Capacity of wireless ad-hoc networks under ultra wide band with power constraint","authors":"Honghai Zhang, J. Hou","doi":"10.1109/INFCOM.2005.1497914","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497914","url":null,"abstract":"In this paper, we study how the achievable throughput scales in a wireless network with randomly located nodes as the number of nodes increases, under a communication model where (i) each node has a maximum transmission power W/sub O/ and is capable of utilizing B Hz of bandwidth and (ii) each link can obtain a channel throughput according to the Shannon capacity. Under the limit case that B tends to infinity, we show that each node can obtain a throughput of /spl theta/(n/sup (/spl alpha/-1)/2/) where n is the density of the nodes and /spl alpha/ > 1 is the path loss exponent. Both the upper bound and lower bound are derived through percolation theory. In order to derive the capacity bounds, we have also derived an important result on random geometric graphs: if the distance between two points in a Poisson point process with density n is non-diminishing, the minimum power route requires a power rate at least /spl Omega/(n/sup (1-/spl alpha/)/2/). Our results show that the most promising approach to improving the capacity bounds in wireless ad hoc networks is to employ unlimited bandwidth resources, such as the ultra wide band (UWB).","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"31 1","pages":"455-465 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83668388","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
扫码关注我们
求助内容：
应助结果提醒方式：