GDL

Energy Efficient Routing Algorithm for Maximizing the Minimum Lifetime of Wireless Sensor Network: A Review

ISSN : 0976 - 1764
Undergraduate Theses from gdlhub / 2017-08-14 11:52:33
Oleh : Praveen Kaushik and Jyoti Singhai, International Journal of Ad hoc, Sensor & Ubiquitous Computing
Dibuat : 2012-06-25, dengan 1 file

Keyword : Battery power, Lifetime of wireless sensor network, Minimum energy cost routing, Optimal flow, Linear programming problem.
Subjek : Energy Efficient Routing Algorithm for Maximizing the Minimum Lifetime of Wireless Sensor Network: A Review
Url : http://airccse.org/journal/ijasuc/papers/2211ijasuc03.pdf
Sumber pengambilan dokumen : Internet

In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have


limited amount of initial energy that are consumed at different rates, depending on the power level. The


lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper


different type of energy efficient routing algorithms are discussed and approach of these algorithms is to


maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for


algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow


path for data transmission and gives the optimum results. Advantages, limitations as well as comparative


study of these algorithms are also discussed in this paper.

Deskripsi Alternatif :

In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have


limited amount of initial energy that are consumed at different rates, depending on the power level. The


lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper


different type of energy efficient routing algorithms are discussed and approach of these algorithms is to


maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for


algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow


path for data transmission and gives the optimum results. Advantages, limitations as well as comparative


study of these algorithms are also discussed in this paper.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of Ad hoc, Sensor & Ubiquitous Computing
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com