An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks
A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node’s remaining energy. Th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2015/842346 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849468014755315712 |
|---|---|
| author | Chakradhar Penumalli Yogesh Palanichamy |
| author_facet | Chakradhar Penumalli Yogesh Palanichamy |
| author_sort | Chakradhar Penumalli |
| collection | DOAJ |
| description | A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node’s remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node’s mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results. |
| format | Article |
| id | doaj-art-e0b3d143bf1e465da71ab0f9728bb58f |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-e0b3d143bf1e465da71ab0f9728bb58f2025-08-20T03:25:59ZengWileyThe Scientific World Journal2356-61401537-744X2015-01-01201510.1155/2015/842346842346An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc NetworksChakradhar Penumalli0Yogesh Palanichamy1Department of Information Science & Technology, Anna University, Chennai 600025, IndiaDepartment of Information Science & Technology, Anna University, Chennai 600025, IndiaA new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node’s remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node’s mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results.http://dx.doi.org/10.1155/2015/842346 |
| spellingShingle | Chakradhar Penumalli Yogesh Palanichamy An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks The Scientific World Journal |
| title | An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks |
| title_full | An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks |
| title_fullStr | An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks |
| title_full_unstemmed | An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks |
| title_short | An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks |
| title_sort | optimal cds construction algorithm with activity scheduling in ad hoc networks |
| url | http://dx.doi.org/10.1155/2015/842346 |
| work_keys_str_mv | AT chakradharpenumalli anoptimalcdsconstructionalgorithmwithactivityschedulinginadhocnetworks AT yogeshpalanichamy anoptimalcdsconstructionalgorithmwithactivityschedulinginadhocnetworks AT chakradharpenumalli optimalcdsconstructionalgorithmwithactivityschedulinginadhocnetworks AT yogeshpalanichamy optimalcdsconstructionalgorithmwithactivityschedulinginadhocnetworks |