A solution for network life time problem using content based energy efficient routing algorithm

Tribikram Pradhan, Ajit Kumar Sahoo, Dharitri Talukdar, Pramod Kumar

Research output: Contribution to journalArticle

Abstract

In This Project we consider an overarching problem that encompasses both performance metrics. In particular, we study the network capacity problem under a given network lifetime requirement. Specifically, for a wireless sensor network where each node is provisioned with an initial energy, if all nodes are required to live up to a certain lifetime criterion, what is themaximum amount of bit volume that can be generated by the entire network? In particular, thosenodes that consume the least amount of power on their data path toward the base station are allocated with much more bit rates than other nodes in the network. Consequently, the data collection behaviour for the entire network only favours certain nodes that have this property, while other nodes will be unfavourably penalized with much smaller bit rates. We apply the content based energy routing algorithm for each of the nodes. This is thoroughly a distributed algorithm (the algorithm which has no centralized controller, each node can be seen as autonomous units, functioning independently). Thus the flexibility of the network is wide open. Any numberof nodes can be added dynamically as per requirements.

Original languageEnglish
Pages (from-to)1731-1740
Number of pages10
JournalInternational Journal of Engineering and Technology
Volume5
Issue number2
Publication statusPublished - 2013

Fingerprint

Routing algorithms
Parallel algorithms
Base stations
Wireless sensor networks
Controllers

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Pradhan, Tribikram ; Sahoo, Ajit Kumar ; Talukdar, Dharitri ; Kumar, Pramod. / A solution for network life time problem using content based energy efficient routing algorithm. In: International Journal of Engineering and Technology. 2013 ; Vol. 5, No. 2. pp. 1731-1740.
@article{3a584282ba474916b85a5467f305cfd0,
title = "A solution for network life time problem using content based energy efficient routing algorithm",
abstract = "In This Project we consider an overarching problem that encompasses both performance metrics. In particular, we study the network capacity problem under a given network lifetime requirement. Specifically, for a wireless sensor network where each node is provisioned with an initial energy, if all nodes are required to live up to a certain lifetime criterion, what is themaximum amount of bit volume that can be generated by the entire network? In particular, thosenodes that consume the least amount of power on their data path toward the base station are allocated with much more bit rates than other nodes in the network. Consequently, the data collection behaviour for the entire network only favours certain nodes that have this property, while other nodes will be unfavourably penalized with much smaller bit rates. We apply the content based energy routing algorithm for each of the nodes. This is thoroughly a distributed algorithm (the algorithm which has no centralized controller, each node can be seen as autonomous units, functioning independently). Thus the flexibility of the network is wide open. Any numberof nodes can be added dynamically as per requirements.",
author = "Tribikram Pradhan and Sahoo, {Ajit Kumar} and Dharitri Talukdar and Pramod Kumar",
year = "2013",
language = "English",
volume = "5",
pages = "1731--1740",
journal = "International Journal of Engineering and Technology",
issn = "2319-8613",
publisher = "Engg Journals Publications",
number = "2",

}

A solution for network life time problem using content based energy efficient routing algorithm. / Pradhan, Tribikram; Sahoo, Ajit Kumar; Talukdar, Dharitri; Kumar, Pramod.

In: International Journal of Engineering and Technology, Vol. 5, No. 2, 2013, p. 1731-1740.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A solution for network life time problem using content based energy efficient routing algorithm

AU - Pradhan, Tribikram

AU - Sahoo, Ajit Kumar

AU - Talukdar, Dharitri

AU - Kumar, Pramod

PY - 2013

Y1 - 2013

N2 - In This Project we consider an overarching problem that encompasses both performance metrics. In particular, we study the network capacity problem under a given network lifetime requirement. Specifically, for a wireless sensor network where each node is provisioned with an initial energy, if all nodes are required to live up to a certain lifetime criterion, what is themaximum amount of bit volume that can be generated by the entire network? In particular, thosenodes that consume the least amount of power on their data path toward the base station are allocated with much more bit rates than other nodes in the network. Consequently, the data collection behaviour for the entire network only favours certain nodes that have this property, while other nodes will be unfavourably penalized with much smaller bit rates. We apply the content based energy routing algorithm for each of the nodes. This is thoroughly a distributed algorithm (the algorithm which has no centralized controller, each node can be seen as autonomous units, functioning independently). Thus the flexibility of the network is wide open. Any numberof nodes can be added dynamically as per requirements.

AB - In This Project we consider an overarching problem that encompasses both performance metrics. In particular, we study the network capacity problem under a given network lifetime requirement. Specifically, for a wireless sensor network where each node is provisioned with an initial energy, if all nodes are required to live up to a certain lifetime criterion, what is themaximum amount of bit volume that can be generated by the entire network? In particular, thosenodes that consume the least amount of power on their data path toward the base station are allocated with much more bit rates than other nodes in the network. Consequently, the data collection behaviour for the entire network only favours certain nodes that have this property, while other nodes will be unfavourably penalized with much smaller bit rates. We apply the content based energy routing algorithm for each of the nodes. This is thoroughly a distributed algorithm (the algorithm which has no centralized controller, each node can be seen as autonomous units, functioning independently). Thus the flexibility of the network is wide open. Any numberof nodes can be added dynamically as per requirements.

UR - http://www.scopus.com/inward/record.url?scp=84878399608&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878399608&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 1731

EP - 1740

JO - International Journal of Engineering and Technology

JF - International Journal of Engineering and Technology

SN - 2319-8613

IS - 2

ER -