A Low Degree Vertex Elimination With High Degree Vertex Selection Heuristic for Strongly Connected Dominating and Absorbent Sets in Wireless Ad-Hoc Networks. (C2011)

doi 10.26756/th.2011.59

Full Text

Abstract

Available in

Date

Unknown

Authors

Publisher

Lebanese American University

Related search

Power-Aware Broadcasting and Activity Scheduling in Ad Hoc Wireless Networks Using Connected Dominating Sets

Wireless Communications and Mobile Computing
Computer NetworksElectronic EngineeringInformation SystemsElectricalCommunications
2003English

Low Degree Connectivity of Ad-Hoc Networks via Percolation

Advances in Applied Probability
Applied MathematicsStatisticsProbability
2010English

A Transmission Range Reduction Scheme for Power-Aware Broadcasting in Ad Hoc Networks Using Connected Dominating Sets

2003English

Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks

Mobile Networks and Applications
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2006English

Vertex Degree Weighted Path Indices

Acta Chimica Slovenica
Chemistry
2016Italian

Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks

2009English

Clustering Wireless Sensor and Wireless Ad Hoc Networks Using Dominating Tree Concepts

International Journal of Computer Applications
2012English

Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Journal of Computing and Information Technology
Computer Science
2016English

A Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy