Broadcast capacity in multihop wireless networks

Keshavarz‐Haddad, Alireza; Ribeiro, Vinay J.; Riedi, Rudolf H.

doi:10.1145/1161089.1161117

Cited by 129 publications

(129 citation statements)

References 36 publications

(62 reference statements)

Supporting

Mentioning

121

Contrasting

Order By: Relevance

“…According to Assumption 3, SaN is indeed dense scaling [6], [14], [15], [21], [22], while PhN is an extended network [4], [5], [12], [23]- [25]. More discussions about two types of scaling networks can be found in Section II-B of our technical report [26].…”

Section: A Network Topologymentioning

confidence: 99%

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 Network Topologymentioning

confidence: 99%

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

show abstract

“…Keshavarz-Haddad et al [28] studied the broadcast capacity of an arbitrary network, and showed that the per-session broadcast capacity is only of Θ(1/n). Shakkottai et al [29] designed a novel routing scheme, called comb scheme, by which the per-session multicast throughput can be achieved of order Ω(…”

Section: Under Threshold-based Channel Modelmentioning

confidence: 99%

Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model

Wang

Tang

et al. 2009

2009 29th IEEE International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Abstract-We study the multicast capacity for hybrid wireless networks consisting of ordinary ad hoc nodes and base stations under Gaussian Channel model, which generalizes both the unicast capacity and broadcast capacity for hybrid wireless networks. Assume that all ordinary ad hoc nodes transmit at a constant power P , and the power decays along the path, with attenuation exponent α > 2. The data rate of a transmission is determined by the SINR (Signal to Interference plus Noise Ratio) at the receiver as B log(1 + SINR). The ordinary ad hoc nodes are placed in the square region A(a) of area a according to a Poisson point process of intensity n/a. Then, m additional base stations (BSs) acting as the relaying communication gateway are placed regularly in the region A(a), and are connected by a high-bandwidth wired network. Let a = n and a = 1, we construct the hybrid extended network (HEN) and hybrid dense network (HDN), respectively. We choose randomly and independently ns ordinary ad hoc nodes to be the sources of multicast sessions. We assume that each multicast session has n d randomly chosen terminals. Three broad categories of multicast strategies are proposed. The first one is the hybrid strategy, i.e., the multihop scheme with BSsupported, which further consists of two types of strategies called connectivity strategy and percolation strategy respectively. The second one is the ordinary ad hoc strategy, i.e., the multihop scheme without any BS-supported. The third one is the classical BSbased strategy under which any communications between ordinary ad hoc node pairs are relayed by some specific BSs. According to the different scenarios in terms of m, n and n d , we select the optimal scheme from the three categories of strategies, and derive the achievable multicast throughput based on the optimal decision.

show abstract

“…The selection which nodes should forward the data and which should only receive it is a challenging task. A few algorithms have been proposed in the literature, however previous papers refer to a simple topologies with small average number of neighboring nodes (2)(3)(4)(5). In wireless AMI networks the average number of nodes to which a node can communicate is considerably higher [8].…”

Section: Introductionmentioning

confidence: 99%

“…This algorithm is also very simple to implement but has disqualifying disadvantages: can be costly in terms of wasted bandwidth and can impose a large number of redundant transmissions. Flooding is also not practical in dense networks, as it greatly increases the required transmission time [4].…”

Section: Introductionmentioning

confidence: 99%

Global Queue Pruning Method for Efficient Broadcast in Multihop Wireless Networks

Nowak

Grochla

et al. 2016

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. The article proposes a novel broadcast algorithm for multihop wireless networks. We compare three reference algorithms: Counter Based, Scalable Broadcast and Dominant Pruning, and propose a novel Global Queue Pruning method, which limits the overhead of the transmission and provides assurance of the delivery of the messages to every node in the network. The developed algorithm creates the logical topology that consists of lower number of forwarders in comparison to the previous methods, the paths are shorter, and the 100 % coverage is guaranteed. This is achieved with the higher cost of propagation of the topology information in the initialisation phase.

show abstract

Broadcast capacity in multihop wireless networks

Cited by 129 publications

References 36 publications

Multicast capacity scaling for cognitive networks: General extended primary network

Multicast capacity scaling for cognitive networks: General extended primary network

Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model

Global Queue Pruning Method for Efficient Broadcast in Multihop Wireless Networks

Contact Info

Product

Resources

About