Propagation and leader election in a multihop broadcast environment

Cidon, Israel; Mokryn, Osnat

doi:10.1007/bfb0056477

Cited by 61 publications

(33 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm has Wan et al [13] offer an algorithm based on the MIS to find CDS in UDG that was made up of three phases. In the first phase, the algorithm is employed distributed leader election method [14] to obtain a spanning tree of network graph. The concept of rank in the algorithm refers to level of node in the tree made out that root with the lowest rating level is zero.…”

Section: Previous Workmentioning

confidence: 99%

An energy-aware distributed algorithm for virtual backbone in wireless sensor network with different transmission range

Fakhar¹,

Tabbakh

2015

CeN

View full text Add to dashboard Cite

Since there is no fixed infrastructure or centralized management in Wireless Sensor Networks (WSNs), a Connected Dominating Set (CDS) has been proposed as a virtual backbone is efficient. A virtual backbone plays a major role in routing, broadcasting, coverage and activity scheduling. Wireless sensor networks to form a CDS usually by UDG (Unit Disk Graph) models that are used in this mod el, all nodes have the same message, but this article UDG model instead of a version that is closer to reality called DGB (Disk Graph with Bidirectional links) is used in which nodes can adopt different transmission intervals. In many applications, to reduce overh ead, increase network lifetime, and so on, to find the MCDS (minimum connected dominating set) is desirable, but the point is that MCDS UDG modelsand DGB, the problem is NP-hard. In addition to the analysis of algorithms, the new algorithm will provide and the efficiency of the algorithm, especially in terms of energy consumption, through theoretical analysis and simulation algorithms are available to be checked out.

show abstract

Section: Previous Workmentioning

confidence: 99%

An energy-aware distributed algorithm for virtual backbone in wireless sensor network with different transmission range

Fakhar¹,

Tabbakh

2015

CeN

View full text Add to dashboard Cite

show abstract

“…Only recently, a computationally efficient algorithm for scheduling transmissions under the physical interference model with a provable approximation bound has been proposed [4]. The physical interference model has been recently used in [9,23] to study the complexity of scheduling a set of link demands in the shortest possible time and of one-shot scheduling (scheduling as many transmissions as possible in a single communication slot), which are both shown to be NP complete for wireless networks in a 2-dimensional Euclidean space.Various distributed algorithms have been proposed for finding good approximations of minimum dominating sets in arbitrary graphs (see, for example, [8,19,20,22]). Alzoubiet al [3] presented the first constant approximation algorithm for the minimum connected dominating set problem in unit-disk graphs with O(n) and O(n log n) time and message complexity, respectively.…”

Section: Related Workmentioning

confidence: 99%

Algorithmic aspects for total connected dominating sets in Mobile Ad Hoc Wireless Networks

Guruprakash¹,

Mallikarjunaswamy²

2012

IJITCS

View full text Add to dashboard Cite

Abstract-A Total connected dominating set (TCDS)for a graph is a subset of V , such that each node in is adjacent to some node in and induces a connected subgraph.A TCDS has been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NP-hard to find a minimum connected dominating set (MCDS). Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a very poor approximation ratio, and from high time complexity and message complexity. Recently, new distributed heuristics for constructing a TCDS were developed, with constant approximation ratio of 8. These new heuristics are based on a construction of a spanning tree, which makes it very costly in terms of communication overhead to maintain the TCDS in the case of mobility and topology changes. In this paper, we propose the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a constant approximation ratio , and linear time and linear message complexity. This algorithm is fully localized, and does not depend on the spanning tree. Thus, the maintenance of the TCDS after changes of topology guarantees the maintenance of the same approximation ratio. In this algorithm each node requires knowledge of its single hop neighbors, and only a constant number of two-hop and three-hop neighbors. ) (n OIndex Terms-Total Connected Dominating Set, Independent Set, ad hoc networks, connected dominating set, maximal independent set, mobility.

show abstract

“…Specifically, Cidon and Mokryn constructed an arbitrarily rooted spanning tree T by the distributed leader-election algorithm in [16]. This algorithm has an OðnÞ time complexity and Oðn log nÞ message complexity, where n is the number of nodes in a given network.…”

Section: Distributed Version Of Tfamentioning

confidence: 99%

Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

Thai

Wang

Liú

et al. 2007

IEEE Trans. on Mobile Comput.

149

View full text Add to dashboard Cite

Abstract-Since there is no fixed infrastructure or centralized management in wireless ad hoc networks, a Connected Dominating Set (CDS) has been proposed to serve as a virtual backbone. The CDS of a graph representing a network has a significant impact on the efficient design of routing protocols in wireless networks. This problem has been studied extensively in Unit Disk Graphs (UDG), in which all nodes have the same transmission ranges. However, in practice, the transmission ranges of all nodes are not necessarily equal. In this paper, we model a network as a disk graph and introduce the CDS problem in disk graphs. We present two efficient approximation algorithms to obtain a minimum CDS. The performance ratio of these algorithms is constant if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded. These algorithms can be implemented as distributed algorithms. Furthermore, we show a size relationship between a maximal independent set and a CDS as well as a bound of the maximum number of independent neighbors of a node in disk graphs. The theoretical analysis and simulation results are also presented to verify our approaches.

show abstract

Propagation and leader election in a multihop broadcast environment

Cited by 61 publications

References 10 publications

An energy-aware distributed algorithm for virtual backbone in wireless sensor network with different transmission range

An energy-aware distributed algorithm for virtual backbone in wireless sensor network with different transmission range

Algorithmic aspects for total connected dominating sets in Mobile Ad Hoc Wireless Networks

Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

Contact Info

Product

Resources

About