Connected Dominating Set Construction and Application in Wireless Sensor Networks
Wireless sensor networks (WSNs) are now widely used in many applications. Connected Dominating Set (CDS) based routing which is one kind of hierarchical methods has received more attention to reduce routing overhead. The concept of k-connected m-dominating sets (kmCDS) is used to provide fault toler...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Archive @ GSU
2009
|
| Subjects: | |
| Online Access: | http://digitalarchive.gsu.edu/cs_diss/45 http://digitalarchive.gsu.edu/cgi/viewcontent.cgi?article=1044&context=cs_diss |
| Summary: | Wireless sensor networks (WSNs) are now widely used in many applications. Connected Dominating Set (CDS) based routing which is one kind of hierarchical methods has received more attention to reduce routing overhead. The concept of k-connected m-dominating sets (kmCDS) is used to provide fault tolerance and routing flexibility. In this thesis, we first consider how to construct a CDS in WSNs. After that, centralized and distributed algorithms are proposed to construct a kmCDS. Moreover, we introduce some basic ideas of how to use CDS in other potential applications such as partial coverage and data dissemination in WSNs. |
|---|