ACM Home Page
Please provide us with feedback. Feedback
Broadcast capacity in multihop wireless networks
Full text PdfPdf (425 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 12th annual international conference on Mobile computing and networking table of contents
Los Angeles, CA, USA
SESSION: Wireless fundamentals table of contents
Pages: 239 - 250  
Year of Publication: 2006
ISBN:1-59593-286-0
Authors
Alireza Keshavarz-Haddad  Rice University
Vinay Ribeiro  Rice University
Rudolf Riedi  Rice University
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 200,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1161089.1161117
What is a DOI?

ABSTRACT

In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such that all nodes receive the packets successfully in a limited time. We employ the Protocol Model for successful packet reception usually adopted in network capacity studies and provide novel upper and lower bounds for the broadcast capacity for arbitrary connected networks. In a homogeneous dense network these bounds simplify to Θ(W/max(1,Δd)) where W is the wireless channel capacity, Δ the interference parameter, and d the number of dimensions of space in which the network lies. Interestingly, we show that the broadcast capacity does not change by more than a constant factor when we vary the number of nodes, the radio range, the area of the network, and even the node mobility. To address the achievability of capacity, we demonstrate that any broadcast scheme based on a backbone of size proportional to the Minimum Connected Dominating Set guarantees a throughput within a constant factor of the broadcast capacity. Finally, we demonstrate that broadcast capacity, in stark contrast to unicast capacity, does not depend on the choice of source nodes or the dimension of the network.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
X. Hong, K. Xu, and M. Gerla, "Scalable routing protocols for mobile ad hoc networks," IEEE Network, vol. 16, pp. 11--21, 2002.
 
2
P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388--404, 2000.
3
 
4
M. Franceschetti, O. Dousse, D. Tse, and P. Thiran, "On the throughput capacity of random wireless networks," IEEE Transactions on Information Theory, 2004.
 
5
M. Grossglauser and D. N. C. Tse, "Mobility increases the capacity of ad-hoc wireless networks," in INFOCOM, 2001, pp. 1360--1369.
 
6
R. Negi and A. Rajeswaran, "Capacity of power constrained ad-hoc networks," in INFOCOM, 2004.
 
7
S. Toumpis and A. J. Goldsmith, "Large wireless networks under fading, mobility, and delay constraints," in INFOCOM, 2004.
 
8
B. Liu, Z. Liu, and D. F. Towsley, "On the capacity of hybrid wireless networks," in INFOCOM, 2003.
9
 
10
R. Zheng, "Information dissemination in power-constrained wireless network," in INFOCOM, 2006.
 
11
P. Gupta and P. Kumar, "Internets in the sky: The capacity of three dimensional wireless networks," Communications in Information and Systems, vol. 1, no. 1, pp. 33--50, 2001.
 
12
S. R. Kulkarni and P. Viswanath, "A deterministic approach to throughput scaling in wireless networks," IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1041--1049, 2004.
13
14
15
 
16
W. Lou and J. Wu, Localized Broadcasting in Mobile Ad Hoc Networks Using Neighbor Designation. in Mobile Computing Handbook, CRC Press, 2005, ch. 28.
 
17
I. Stojmenovic and J. Wu, Mobile Ad Hoc Networking. IEEE Press, 2004, ch. 7, pp. 20--230.
 
18
G. Grimmett, Percolation. Second edition, Springer Verlag, 1999.
 
19
G. Sharma, R. R. Mazumdar, and N. B. Shroff, "Delay and capacity trade-offs in mobile ad hoc networks: A global perspective," in INFOCOM, 2006.
 
20
M. J. Neely and E. Modiano, "Capacity and delay tradeoffs for ad hoc mobile networks," IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 1917--1937, 2005.
 
21
S. N. Diggavi, M. Grossglauser, and D. N. C. Tse, "Even one-dimensional mobility increases the capacity of wireless networks," IEEE Transactions on Information Theory, vol. 51, no. 11, pp. 3947--3954, 2005.
 
22
X. Lin and N. Shroff, "Towards achieving the maximum capacity in large mobile wireless networks. under delay constraints," Journal of Communications and Networks, vol. 6, no. 4, p. 352--361, 2004.
 
23
G. Sharma and R. Mazumdar, "On achievable delay/capacity trade-offs in mobile ad hoc networks," in WiOpt, 2004.
 
24
A. E. Gamal, J. P. Mammen, B. Prabhakar, and D. Shah, "Throughput-delay trade-off in wireless networks," in INFOCOM, 2004.
 
25
N. Bansal and Z. Liu, "Capacity, delay and mobility in wireless ad-hoc networks," in INFOCOM, 2003.
 
26
P. Gupta and P. R. Kumar, "Towards an information theory of large networks: an achievable rate region," IEEE Transactions on Information Theory, vol. 49, no. 8, pp. 1877--1894, 2003.
 
27
M. Gastpar and M. Vetterli, "On the capacity of wireless networks: The relay case," in INFOCOM, 2002.
 
28
 
29
R. B. Ellis, J. L. Martin, and C. Yan, "Random geometric graph diameter in the unit ball," to appear Algorithmica, 2005.
 
30
C. R. Lin and M. Gerla, "Adaptive clustering for mobile wireless networks," IEEE Journal on Selected Areas in Communications, vol. 15, no. 7, pp. 1265--1275, 1997.
 
31
32
 
33
 
34
 
35
 
36
 
37
A. Keshavarz-Haddad, V. Ribeiro, and R. Riedi, "Color-based broadcasting for ad hoc networks," in WiOpt, 2006.

CITED BY  10

Collaborative Colleagues:
Alireza Keshavarz-Haddad: colleagues
Vinay Ribeiro: colleagues
Rudolf Riedi: colleagues