2010 Proceedings IEEE INFOCOM 2010
DOI: 10.1109/infcom.2010.5461903
|View full text |Cite
|
Sign up to set email alerts
|

The Capacity of Ad Hoc Networks with Heterogeneous Traffic Using Cooperation

Abstract: Abstract-We study the scaling laws for wireless ad hoc networks in which the distribution of n nodes in the network is homogeneous but the traffic they carry is heterogeneous. More specifically, we consider the case in which a given node is the data-gathering sink for k sources sending different information to it, while the rest of the s = n − k nodes participate in unicast sessions with random destinations chosen uniformly. We present a separation theorem for heterogeneous traffic showing that the optimum ord… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…Liu et al in [25], extend this result by considering that not every node has data to send and not every node can be a destination. In [26], the authors extend [13] for the case in which a destination node is the sink for k source nodes, while the rest of the s = n − k nodes participate in unicast sessions. Liu and Wang in [27], investigate the heterogeneous network with multicast and unicast traffic.…”
Section: B Wdcs Scalabilitymentioning
confidence: 99%
“…Liu et al in [25], extend this result by considering that not every node has data to send and not every node can be a destination. In [26], the authors extend [13] for the case in which a destination node is the sink for k source nodes, while the rest of the s = n − k nodes participate in unicast sessions. Liu and Wang in [27], investigate the heterogeneous network with multicast and unicast traffic.…”
Section: B Wdcs Scalabilitymentioning
confidence: 99%
“…The optimised power values in (30) are energy efficient for the two-hop single-relay systems. Moreover, the energy efficient joint source-relay PA study can be generalised to the more complicated relaying systems such as the multi-hop relaying networks and the multi-relaying system as in [31]. Take in the multi-hop relaying system as an example.…”
Section: Calculation Of Lagrangian Multipliermentioning
confidence: 99%
“…Cooperative transmitting was introduced to improve multicast capacity in [11] and [16]. Rahul et al developed a system [17] that could dynamically increase the capacity with user demand.…”
Section: Related Workmentioning
confidence: 99%