A Study on Algorithms for Establishing Almost Connected Dominating Sets of Smaller Size in Wireless Ad Hoc Networks
碩士 === 雲林科技大學 === 通訊工程研究所碩士班 === 96 === Given a graph G = (V, E) and a subset M of V . If each element in set V either belongs to M or is connected to at least one element of M , then M is called a dominating set of V. A dominating set is connected if there exists a path between any two nodes in...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/10769576517857864948 |