Scaling laws on multicast capacity of large scale wireless networks

Wang, Congyan; Li, X.-Y.; Jiang, Changjun; Tang, Shaojie; Liu, Y.; Zhao, Jianqiang

doi:10.1109/infcom.2009.5062107

Cited by 29 publications

(41 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The communication of each link in EST(˜, ) is routed via the highway system similar to that in [24], if applicable. However, intuitively, the routing paths might be broken by the active PAs in some (or even all) time slots.…”

Section: A Overview Of Multicast Strategymentioning

confidence: 99%

“…For an A-Type PA, its status (active or inactive) is determined by the routing and transmission scheduling adopted by PhN. To achieve the optimal order of throughput for PhN, we assume that the multicast strategy in [24] is adopted in PhN. The strategy is divided into two phases.…”

Section: B When Phn Adopts Pure Ad Hoc Strategymentioning

confidence: 99%

“…In this phase, the strategy is designed based on the scheme lattice ( √ , , 4 ), where > 0 is a constant defined in [24]. The routing is constructed based on the first-class highways (FHs) consisting of the short links of constant length; and those short links are scheduled by a TDMA scheme.…”

Section: B When Phn Adopts Pure Ad Hoc Strategymentioning

confidence: 99%

“…The routing is constructed based on the first-class highways (FHs) consisting of the short links of constant length; and those short links are scheduled by a TDMA scheme. Assume that the constant scheduling period is 2 1 ( 1 = 3 in [24]). Denote the routing scheme in the second phase in PhN as ℧ 2 and the transmission scheduling as ℧ 2 .…”

Section: B When Phn Adopts Pure Ad Hoc Strategymentioning

confidence: 99%

“…Denote the routing scheme in the second phase in PhN as ℧ 2 and the transmission scheduling as ℧ 2 . In this phase, the strategy is designed based on the scheme lattice ( √ , √ log − , 0), where is a constant defined in Lemma 4 of [24] and is an adjusting constant to ensure the value of √ /( √ log − ) to be an integer; the routing is constructed based on the second-class highways (SHs) consisting of the links of length of order Θ( √ log ); and those links are also scheduled by a TDMA scheme of constant period 2 2 ( 2 = 4 in [24]). An important method is called the parallel transmission scheduling under which Θ(log ) links initiating from each active cell are simultaneously scheduled.…”

Section: B When Phn Adopts Pure Ad Hoc Strategymentioning

confidence: 99%

See 4 more Smart Citations

Multicast capacity scaling for cognitive networks: General extended primary network

Wang

Tang

et al. 2010

The 7th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (IEEE MASS 2010)

View full text Add to dashboard Cite

Abstract-We study the capacity scaling laws for the cognitive network that consists of the primary hybrid network (PhN) and secondary ad hoc network (SaN). PhN is further comprised of an ad hoc network and a base station based (BS-based) network. SaN and PhN are overlapping in the same deployment region, operate on the same spectrum, but are independent with each other in terms of communication requirements. The primary users (PUs), i.e., the ad hoc nodes in PhN, have the priority to access the spectrum. The secondary users (SUs), i.e., the ad hoc nodes in SaN, are equipped with cognitive radios, and have the functionalities to sense the idle spectrum and obtain the necessary information of primary nodes in PhN. We assume that PhN adopts one out of three classical types of strategies, i.e., pure ad hoc strategy, BS-based strategy, and hybrid strategy. We aim to directly derive multicast capacity for SaN to unify the unicast and broadcast capacity under two basic principles: (1) The throughput for PhN cannot be undermined in order sense due to the presence of SaN. (2) The protocol adopted by PhN does not alter in the interest of SaN, anyway. Depending on which type of strategy is adopted in PhN, we design the optimal-throughput strategy for SaN. We show that there exists a threshold of the density of SUs according to the density of PUs beyond which it can be proven that: (1) when PhN adopts the pure ad hoc strategy or hybrid strategy, SaN can achieve the multicast capacity of the same order as it is stand-alone; (2) when PhN adopts the BS-based strategy, SaN can asymptotically achieve the multicast capacity of the same order as if PhN were absent, if some conditions of the relations among the number of SUs, PUs, the destinations of each multicast sessions in SaN, and the base stations in PhN hold.

show abstract

Section: A Overview Of Multicast Strategymentioning

confidence: 99%

Section: B When Phn Adopts Pure Ad Hoc Strategymentioning

confidence: 99%