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...
| Publicado en: | Scientific World Journal Vol. 2015; pp. 842346 - 842347 |
|---|---|
| Autores principales: | , |
| Formato: | Journal Article |
| Publicado: |
Wiley-Blackwell
1/1/2015
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=109609046&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 109609046 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 1/1/2015 vid: 2015 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 109609046 NLM26221627 2013111477 10.1155/2015/842346 NLM26221627 PMC4477438 109609046 ppf: 842346 ppct: 1 formats: tig: atl: An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks. aug: au: Penumalli, Chakradhar Palanichamy, Yogesh affil: Department of Information Science & Technology, Anna University, Chennai 600025, India. sug: ab: 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. pubtype: Academic Journal doctype: Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|