Search or add a thesis

Advanced Search (Beta)
Home > An Efficient Clustering of Wireless Sensor Network by Spectral Graph Partitioning

An Efficient Clustering of Wireless Sensor Network by Spectral Graph Partitioning

Thesis Info

Access Option

External Link

Author

Sonia Sohail

Institute

Virtual University of Pakistan

Institute Type

Public

City

Lahore

Province

Punjab

Country

Pakistan

Thesis Completing Year

2018

Thesis Completion Status

Completed

Subject

Software Engineering

Language

English

Link

http://vspace.vu.edu.pk/detail.aspx?id=196

Added

2021-02-17 19:49:13

Modified

2024-03-24 20:25:49

ARI ID

1676720991440

Similar


The past decade has observed the development of wireless sensor networks (WSNs) being used in a great number of applications. For the better routing and energy efficiency, WSNs are partitioned into clusters. Partitioning was done to minimize the distances between the source node and the sink. In order to achieve better partitioning, graph partitioning methods can be used. Such techniques are mostly used in distributed environment and applications, but they are not much efficient in wireless sensor networks due to the dynamic topology and multi-hop transmission. In this paper, few existing graph partitioning methods have been discussed and studied which may be implemented for WSN partitioning. A novel partitioning method is tested in this paper, which is better in terms of efficiency in WSN partitioning.
Loading...
Loading...

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...