Path: Top -> Journal -> Jurnal Internasional -> Journal -> Computer

Energy- efficient Routing Protocol for Homogeneous Wireless Sensor Networks

Energy- efficient Routing Protocol for Homogeneous Wireless Sensor Networks

ISSN : 2231 - 5853
Undergraduate Theses from gdlhub / 2017-08-14 11:52:33
Oleh : Gaurav Bathla and Gulista Khan, International Journal on Cloud Computing: Services and Architecture
Dibuat : 2012-06-26, dengan 1 file

Keyword : WSN, energy efficient, data aggregation, routing algorithm, Base station, minimum spanning tree
Subjek : Energy- efficient Routing Protocol for Homogeneous Wireless Sensor Networks
Url : http://airccse.org/journal/ijccsa/papers/0511ccsa02.pdf
Sumber pengambilan dokumen : Internet

A Wireless Sensor Network (WSN) is composed of sensor nodes spread over the field to sense the data.


The sensed data must be gathered & transmitted to Base Station (BS) for end user queries. The used


sensor nodes being in- expensive having low computation power & limited energy so are not as much


reliable as their expensive macro sensor counter parts but their size and cost enable hundred to thousand


of micro sensors to achieve high quality fault tolerant system. In an environment where in each round all


sensor nodes have to send data to base station, it is required to effectively utilize energy of sensor nodes


so as to increase the life- time of the system. The use of data aggregation & fusion as proposed in LEACH


increases system lifetime by a factor of 8 as compared to conventional routing protocols. In this paper


along with data aggregation & fusion, we are trying to minimize reduction in system energy by first


generating MST between all sensor nodes so as to minimize their transmission energy with in network


and after that a node of highest energy among the top tier will transmit the aggregated data of whole


network to base station. Keeping network topology same till any node of network dies another highest


energy node from top most rank tier is chosen to communicate with BS. This technique achieves 10x to


20x improvement in system life time as compare to MTP.

Deskripsi Alternatif :

A Wireless Sensor Network (WSN) is composed of sensor nodes spread over the field to sense the data.


The sensed data must be gathered & transmitted to Base Station (BS) for end user queries. The used


sensor nodes being in- expensive having low computation power & limited energy so are not as much


reliable as their expensive macro sensor counter parts but their size and cost enable hundred to thousand


of micro sensors to achieve high quality fault tolerant system. In an environment where in each round all


sensor nodes have to send data to base station, it is required to effectively utilize energy of sensor nodes


so as to increase the life- time of the system. The use of data aggregation & fusion as proposed in LEACH


increases system lifetime by a factor of 8 as compared to conventional routing protocols. In this paper


along with data aggregation & fusion, we are trying to minimize reduction in system energy by first


generating MST between all sensor nodes so as to minimize their transmission energy with in network


and after that a node of highest energy among the top tier will transmit the aggregated data of whole


network to base station. Keeping network topology same till any node of network dies another highest


energy node from top most rank tier is chosen to communicate with BS. This technique achieves 10x to


20x improvement in system life time as compare to MTP.

Beri Komentar ?#(0) | Bookmark

PropertiNilai Properti
ID Publishergdlhub
OrganisasiInternational Journal on Cloud Computing: Services and Architecture
Nama KontakHerti Yani, S.Kom
AlamatJln. Jenderal Sudirman
KotaJambi
DaerahJambi
NegaraIndonesia
Telepon0741-35095
Fax0741-35093
E-mail Administratorelibrarystikom@gmail.com
E-mail CKOelibrarystikom@gmail.com

Print ...

Kontributor...

  • , Editor: fachruddin

Download...

  • Download hanya untuk member.

    Jurnal 97
    Download Image
    File : Jurnal 97.PDF

    (263256 bytes)