Filters








17,715 Hits in 5.0 sec

Scalable Capacity Bounding Models for Wireless Networks [article]

Jinfeng Du, Muriel Medard, Ming Xiao, Mikael Skoglund
2015 arXiv   pre-print
Based on the network equivalence framework, this paper presents scalable upper and lower bounding models for wireless networks with potentially many nodes.  ...  to calculate the outer (resp. inner) bounds for the capacity region of the original noisy network.  ...  wireless channels with symmetric fading coefficients, scalable lower bounding models for general transmission tasks over wireless networks are still not available.  ... 
arXiv:1401.4189v2 fatcat:v4h4lhgbr5evzf4dzk4dw7v72a

Scalable Capacity Bounding Models for Wireless Networks

Jinfeng Du, Muriel Medard, Ming Xiao, Mikael Skoglund
2016 IEEE Transactions on Information Theory  
Based on the network equivalence framework, this paper presents scalable upper and lower bounding models for wireless networks with potentially many nodes.  ...  to calculate the outer (resp. inner) bounds for the capacity region of the original noisy network.  ...  wireless channels with symmetric fading coefficients, scalable lower bounding models for general transmission tasks over wireless networks are still not available.  ... 
doi:10.1109/tit.2015.2497410 fatcat:hbl6ctyedbdq3pdmegbw3byzfe

Enabling large-scale wireless broadband

R. Karrer, A. Sabharwal, E. Knightly
2004 Computer communication review  
searches for fundamental information-theoretic tradeoffs between protocol overhead and capacity.  ...  However, while high-speed wireless access is easy to achieve in an enterprise network via low-cost IEEE 802.11 (WiFi) access points, wireless technology in public spaces is in its infancy.  ...  THE CASE FOR TAPS Premise 1: Designing a wireless Internet that simultaneously achieves deployability, scalability, high-performance, and a cost-effective economic model requires a new architecture.  ... 
doi:10.1145/972374.972380 fatcat:v5gutl63p5akfhs5yfzbcnh3w4

On the Capacity and Scalability of Wireless Mesh Networks

Yonghui Chen, Guangxi Zhu, Yongli Yang, Desheng Wang
2008 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing  
www.intechopen.comOn the Capacity and Scalability of Wireless Mesh NetworksFig. 5.  ...  The upper bound on capacity for unicast traffics Derived from "arbitrary networks" in (Gupta & Kumar 2000) and formula (23) , the upper bound capacity on the ideal unicast traffics happens to be while  ...  /on-the-capacity-and-scalability-of-wireless-meshnetworks © 2011 The Author(s).  ... 
doi:10.1109/wicom.2008.657 fatcat:af3353xjszahjlhmrhc6vommc4

On the Capacity and Scalability of Wireless Mesh Networks [chapter]

Yonghui Chen
2011 Wireless Mesh Networks  
www.intechopen.comOn the Capacity and Scalability of Wireless Mesh NetworksFig. 5.  ...  The upper bound on capacity for unicast traffics Derived from "arbitrary networks" in (Gupta & Kumar 2000) and formula (23) , the upper bound capacity on the ideal unicast traffics happens to be while  ...  /on-the-capacity-and-scalability-of-wireless-meshnetworks © 2011 The Author(s).  ... 
doi:10.5772/13752 fatcat:whjfsruntfcfhnicny3fkvwhv4

On How to Circumvent the Manet Scalability Curse

Chris Davis, Zygmunt Haas, Stuart Milner
2006 MILCOM 2006  
The upper bound is the simultaneous transmission capacity of the network domain, N1Q. With both models, N1Q is O(G/,/).  ...  Upper bound on AI and /%, for a circular network domain. Upper bound on A, and A for a spherical network domain.  ... 
doi:10.1109/milcom.2006.302358 fatcat:w6zpb4rvqbc5ndnrtjp66aehze

On the Capacity of Wireless Sensor Networks with Omnidirectional Antennas

O. Arpacioglu, Z.J. Haas
2004 Journal of Communication and Information Systems  
We establish some new results on the capacity of wireless sensor networks that employ single-user detection, and we present the implications of our results on the scalability of such networks.  ...  The second model is the physical model, which better represents realistic reception in practical wireless networks.  ...  His research interests include scalability and capacity of wireless networks.  ... 
doi:10.14209/jcis.2004.14 fatcat:pzgadvlwafc2vdqdiojx7xcdny

On the scalability of ad hoc networks: a traffic analysis at the center of a network

Byung-Jae Kwak, Nah-Oak Song, L.E. Miller
2004 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)  
From the result, the upper bound of the diameter of a network D = 2k, that guarantees the network is scalable, is obtained.  ...  The upper bound is given by C/r − 1, where C is the channel capacity available to each node and r is the packet arrival rate at each node.  ...  Grossglauser and Tse showed that the mobility of nodes increases the capacity of the wireless ad hoc networks [7] .  ... 
doi:10.1109/wcnc.2004.1311329 dblp:conf/wcnc/KwakSM04 fatcat:6lugetnmnvccjkpl6eojls7wyi

On the scalability and capacity of wireless networks with omnidirectional antennas

Onur Arpacioglu, Zygmunt J. Haas
2004 Proceedings of the third international symposium on Information processing in sensor networks - IPSN'04  
throughput, le, while using a general network model and a bounded propagation model.  ...  We consider a wireless network of N nodes equipped with omnidirectional antennas, and we extend the capacity results of some previous works by finding bounds on the maximum achievable per-node end-to-end  ...  On the Scalability and Capacity of Planar Wireless Networks with Omnidirectional Antennas.  ... 
doi:10.1145/984622.984648 dblp:conf/ipsn/ArpaciogluH04 fatcat:ify2itqv25hm3l7wfdn3ym56fm

Scalable algorithms for wireless link schedulings in multi-channel multi-radio wireless networks

Peng-Jun Wan, Xiaohua Jia, Guojun Dai, Hongwei Du, Zhiguo Wan, Ophir Frieder
2013 2013 Proceedings IEEE INFOCOM  
For wireless link scheduling in multi-channel multiradio wireless networks aiming at maximizing (concurrent) multiflow, constant-approximation algorithms have recently been developed in [11] .  ...  Such poor scalability stems intrinsically from the exploding size of the fine-grained network representation upon which those algorithms are built.  ...  RESTRICTED MULTIFLOW In this section, we present scalable approximation algorithms for MMF and MCMF. Consider an instance of MC-MR wireless network specified in Section II.  ... 
doi:10.1109/infcom.2013.6567014 dblp:conf/infocom/WanJDDWF13 fatcat:5a6jbtrn2jcalfpqg5urs522je

On the scalability and capacity of planar wireless networks with omnidirectional antennas

Onur Arpacioglu, Zygmunt J. Haas
2004 Wireless Communications and Mobile Computing  
We extend the previously well-known results on the capacity of wireless networks and present the implications of our results on network scalability.  ...  transmission capacity of the network domain, N Q t .  ...  In that paper, a theoretical framework to analyze the capacity of peerto-peer wireless networks was formalized through two network models.  ... 
doi:10.1002/wcm.216 fatcat:ugnyqmj23rfadcpwo7iszgdmmm

On the Scalability of Ad Hoc Networks

B.-J. Kwak, N.-O. Song, L.E. Miller
2004 IEEE Communications Letters  
From the result, the upper bound of the diameter of a network D = 2k, that guarantees the network is scalable, is obtained.  ...  The upper bound is given by C/r − 1, where C is the channel capacity available to each node and r is the packet arrival rate at each node.  ...  Grossglauser and Tse showed that the mobility of nodes increases the capacity of the wireless ad hoc networks [7] .  ... 
doi:10.1109/lcomm.2004.833846 fatcat:ka5xizkdjvd2zp7xv6tujd4l7m

Wireless Backhaul Networks: Capacity Bound, Scalability Analysis and Design Guidelines [article]

Harpreet S. Dhillon, Giuseppe Caire
2014 arXiv   pre-print
We first derive an information theoretic upper bound on the capacity of this network under a general propagation model, which provides a lower bound on the per-BS antenna requirement.  ...  This paper studies the scalability of a wireless backhaul network modeled as a random extended network with multi-antenna base stations (BSs), where the number of antennas per BS is allowed to scale as  ...  In Section III, we derive an information theoretic upper bound on the capacity of the wireless backhaul network.  ... 
arXiv:1406.2738v1 fatcat:ngi2xw2z4vgdvmilt4mwynid4a

Drift: A highly condensed emulation framework for mobile nodes in server clusters

Xinyu Zhang, Baochun Li
2008 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems  
Unlike existing emulation testbeds, Drift features a fully decentralized architecture, an efficient message processing unit, and more accurate network models for mobile wireless nodes.  ...  is neither flexible nor scalable.  ...  Modeling the lower layers has been a formidable barrier for the research community in wireless network emulation.  ... 
doi:10.1109/mahss.2008.4660048 dblp:conf/mass/ZhangL08 fatcat:s63s23j4hrc47jgoppbbzemi5i

Information theoretic upper bound on the capacity of wireless backhaul networks

Harpreet S. Dhillon, Giuseppe Caire
2014 2014 IEEE International Symposium on Information Theory  
We derive an information theoretic upper bound on the capacity of a wireless backhaul network modeled as a classical random extended network, except that we assume the number of antennas at each base station  ...  An important consequence of our result is a lower bound on the number of antennas per BS required for network scalability.  ...  INTRODUCTION Scaling laws provide a useful way to characterize capacity of large wireless networks.  ... 
doi:10.1109/isit.2014.6874833 dblp:conf/isit/DhillonC14 fatcat:34cf5if4yrgxzgr522czhyj7sa
« Previous Showing results 1 — 15 out of 17,715 results