Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets

Rieck, Michael Q.; Pai, Sukesh; Dhar, Subhankar

doi:10.1016/j.comnet.2004.09.005

Cited by 42 publications

(44 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The probabilistic bound on the number of forward nodes in DSP does not apply to DSP-SP. On the other hand, the transmission cost of DSP-SP is comparable to the omnidirectional self-pruning [31], which is significantly lower than similar schemes using omnidirectional antennas [23], [32]. higher id than v. Therefore, v must forward in the direction of d, and d will receive the packet in the (i þ 1)th round.…”

Section: Dsp With Shortest Pathsmentioning

confidence: 99%

Efficient broadcasting in ad hoc wireless networks using directional antennas

Dai

2006

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-Using directional antennas to conserve bandwidth and energy consumption in ad hoc wireless networks (or simply ad hoc networks) is becoming popular in recent years. However, applications of directional antennas for broadcasting have been limited. We propose a novel broadcast protocol called directional self-pruning (DSP) for ad hoc wireless networks using directional antennas. DSP is a nontrivial generalization of an existing localized deterministic broadcast protocol using omnidirectional antennas. Compared with its omnidirectional predecessor, DSP uses about the same number of forward nodes to relay the broadcast packet, while the number of forward directions that each forward node uses in transmission is significantly reduced. With the lower broadcast redundancy, DSP is more bandwidth and energy-efficient. DSP is based on 2-hop neighborhood information and does not rely on location or angle-ofarrival (AoA) information. Two special cases of DSP are discussed: the first one preserves shortest paths in reactive routing discoveries; the second one uses the directional reception mode to minimize broadcast redundancy. DSP is a localized protocol. Its expected number of forward nodes is Oð1Þ times the optimal value. An extensive simulation study using both custom and ns2 simulators shows that DSP significantly outperforms both omnidirectional broadcast protocols and existing directional broadcast protocols.

show abstract

Section: Dsp With Shortest Pathsmentioning

confidence: 99%

Efficient broadcasting in ad hoc wireless networks using directional antennas

Dai

2006

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Several researchers have used minimum connected dominating sets to do routing in ad hoc wireless networks (Alzoubi et al 2002;Chen and Liestman 2002;Rieck et al 2002;Wu and Dai 2003;Wu 2002). The dominating set induces a virtual connected backbone.…”

mentioning

confidence: 99%

VLSI implementation of greedy-based distributed routing schemes for ad hoc networks

2006

View full text Add to dashboard Cite

We describe a VLSI implementation based on a FPGA of a new greedy algorithm for approximating minimum set covering in ad hoc wireless network applications. The implementation makes the algorithm suitable for embedded and real-time architectures. The algorithm, while not randomized, is based on a probability distribution that leads the greedy choice. The algorithm has been specifically tailored to run on platforms with minimal computational hardware.

show abstract

“…Most of them, except for Rieck's algorithm [13] and SBA [10], were shown to be special cases of the coverage condition [21] and are briefly discussed here for the sake of completeness. All seven protocols are simulated and compared with blind flooding and a new protocol derived from the generic scheme in the next section.…”

Section: Existing Self-pruning Protocolsmentioning

confidence: 99%

“…Span cannot ensure a CDS since two coordinators may simultaneously change back to noncoordinators and the remaining coordinators may not form a CDS. Rieck's algorithm (static): Rieck et al [13] recently proposed a CDS algorithm that can be viewed as a special case of the enhanced Span. In Rieck's algorithm, a node v is in the CDS if it has two neighbors that are not directly connected or indirectly connected via one intermediate node with higher priority than v. Unlike Span, the case that two neighbors are indirectly connected via two intermediate nodes with higher priorities is not considered.…”

Section: Existing Self-pruning Protocolsmentioning

confidence: 99%

“…Unlike flooding, in self-pruning-based broadcast protocols [2], [3], [10], [13], [16], [17], [22], each node collects neighborhood topology information (i.e., static information) via exchanging "Hello" messages and extracts broadcast history information (i.e., dynamic information) from incoming broadcast packets. Each node decides its role in a specific broadcasting: it either becomes a forward node and forwards the broadcast packet, or becomes a nonforward node (i.e., is self-pruned) and does nothing.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Performance analysis of broadcast protocols in ad hoc networks based on self-pruning

Dai

2004

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-Self-pruning is an effective scheme for efficient broadcasting in ad hoc wireless networks. In a self-pruning broadcast protocol, a node may not forward a broadcast packet if a certain self-pruning condition is satisfied based on the neighborhood information. In a static network with an ideal MAC layer, only a subset of nodes forward the broadcast packet and still guarantee the complete network delivery. Various protocols have been proposed with different self-pruning conditions. Recently, a generic selfpruning protocol was proposed by Wu and Dai [21], which combines the strength of previous conditions and is more effective. In this paper, we first propose an enhanced version of the generic protocol, which is more elegant in interpreting existing protocols and has a simpler correctness proof. Then, we evaluate the performance of the family of self-pruning protocols under various network situations with ns2. The objective is to observe the efficiency and reliability of these protocols as a function of network density, congestion, and mobility, and provide a guideline of implementation in the "real world." Our performance analysis reveals that the protocol reliability is barely affected by packet collision. However, most self-pruning protocols suffer from low delivery ratio in highly mobile networks. We further explore various techniques that improve the delivery ratio and show that both high efficiency and reliability can be achieved in highly mobile networks.

show abstract

Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets

Cited by 42 publications

References 9 publications

Efficient broadcasting in ad hoc wireless networks using directional antennas

Efficient broadcasting in ad hoc wireless networks using directional antennas

VLSI implementation of greedy-based distributed routing schemes for ad hoc networks

Performance analysis of broadcast protocols in ad hoc networks based on self-pruning

Contact Info

Product

Resources

About