Distributed heuristics for connected dominating sets in wireless ad hoc networks

Alzoubi, Khaled M.; Wan, Peng‐Jun; Frieder, Ophir

doi:10.1109/jcn.2002.6596929

Cited by 207 publications

(160 citation statements)

References 14 publications

Supporting

Mentioning

149

Contrasting

Unclassified

Order By: Relevance

“…While one way of TC is by controlling the transmission range of nodes, backbone based solutions exercise TC by turning off unnecessary nodes while preserving network connectivity and communication coverage. In [2,11] distributed algorithms for constructing CDSs in unit disk graphs (UDGs) were first proposed. These algorithms consist of two phases to form a CDS.…”

Section: Related Workmentioning

confidence: 99%

“…In the worst case scenario, in order to find the complexity, we need to compare N 2 message paths of length L to find at least two common nodes in each iteration. Consequently, the worst case complexity of the searching algorithm will be O((NL) 2 all the message paths and are concerned with only a subset, this reduces the complexity significantly. If d is the divisor for the message paths into the number of subsets considered, then the complexity will be O((NL/D) 2 ).…”

Section: Poly3: Complexity Analysismentioning

confidence: 99%

See 1 more Smart Citation

Adding the Reliability on Tree Based Topology Construction Algorithms for Wireless Sensor Networks

Fiaz

Yousaf

Hanfi

et al. 2013

Wireless Pers Commun

View full text Add to dashboard Cite

This is the accepted version of the paper.This version of the publication may differ from the final published version. Abstract Topology control is a technique used in wireless sensor networks to maximize energy efficiency and network lifetime. In previous literature, many tree based techniques have been proposed to save energy and increase the network lifetime. In tree based algorithms, the most promising solution is the formation of a network backbone, which serves on behalf of rest of the nodes in the network and therefore leading towards Connected Dominating Set (CDS) formulation. However, one imminent problem with all tree based solution is a compromise on network reliability. Therefore, to address reliability issues in tree based solutions, in this paper, we propose Poly3 which maintains cliques of size three in order to achieve network reliability on top of the CDS algorithm. This makes the network more robust to link removal. Our empirical and mathematical analysis reveals that Poly3 provides better reliability than algorithms of the same kind. Permanent repository link

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Poly3: Complexity Analysismentioning

confidence: 99%

Adding the Reliability on Tree Based Topology Construction Algorithms for Wireless Sensor Networks

Fiaz

Yousaf

Hanfi

et al. 2013

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Most of the distributed algorithms find an MIS and connect this set to form a CDS. The authors in [10]- [12] first proposed distributed algorithms for constructing CDSs in unit disk graphs (UDGs), which consists of two phases to form the CDS. They form a spanning tree and then utilize nodes in the tree to find an MIS.…”

Section: Related Workmentioning

confidence: 99%

A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks

Rizvi

Qureshi

Khayam

et al. 2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

This is the unspecified version of the paper.This version of the publication may differ from the final published version. by the large number of algorithms, techniques, and protocols that have been developed to save energy, and thereby extend the lifetime of the network. However, in the context of WSN's routing and dissemination, Connected Dominating Set (CDS) principle has emerged as the most popular method for energy-efficient topology control (TC) in WSN's. In a CDS-based topology control technique, a virtual backbone is formed which allows communication between any arbitrary pair of nodes in the network. In this paper, we present a CDS based topology control protocol -A1 -which forms an energy efficient virtual backbone. In our simulations, we compare the performance of A1 with three prominent CDS-based protocols namely Energy-efficient CDS (EECDS), CDS Rule K and A3. The results demonstrate that A1 performs consistently better in terms of message overhead and other selected metrics. Moreover, the A1 protocol not only achieves better connectivity under topology maintenance but also provides better sensing coverage when compared with the other protocols. Permanent repository link

show abstract

“…One is to reduce the backbone complexity by building a small connected graph in the network. Building a backbone that has good approximation ratio to the ideal Minimum Connected Dominating Set (MCDS) has been the research focus of ad hoc clustering in recent years [22][23][24][25][26][27][28]. Another method is to reduce the protocol overhead forwarded on the backbone.…”

Section: Pros and Cons Of Backbone Routingmentioning

confidence: 99%

Routing Transient Traffic in Mobile Ad Hoc Networks

Cai

Feeley

Hutchinson

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Recent research shows that the traffic in public wireless networks is mostly transient and bursty. There is good reason to believe that ad-hoc traffic will follow the same pattern as its popularity grows. Unfortunately transient traffic generates route discoveries much more frequently than the well-studied long-term, constant-bit-rate traffic, causing network congestion problems for existing routing protocols. This paper describes the design of a new routing algorithm, called ECBR, that uses hybrid backbone routing in a manner that is well suited to workloads that include transient traffic. Our simulation results show that ECBR outperforms one of the main reactive algorithms (i.e., DSR). We also explain three key features of our algorithm and demonstrate their roles in substantially improving the performance compared to existing backbone routing techniques.

show abstract

Distributed heuristics for connected dominating sets in wireless ad hoc networks

Cited by 207 publications

References 14 publications

Adding the Reliability on Tree Based Topology Construction Algorithms for Wireless Sensor Networks

Adding the Reliability on Tree Based Topology Construction Algorithms for Wireless Sensor Networks

A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks

Routing Transient Traffic in Mobile Ad Hoc Networks

Contact Info

Product

Resources

About