A better dynamic cluster-based structure of wireless sensor network for efficient routing
In recent years, wireless sensor networks have gained a tremendous amount of attention due to their potential ability in providing solutions in various areas such as health care, environment, defense, surveillance, industry and transport. Typically, the sensors are small, with limited processing and...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
ICIC International
2012
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/32735/ http://www.ijicic.org/ijicic-11-05030.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Summary: | In recent years, wireless sensor networks have gained a tremendous amount of attention due to their potential ability in providing solutions in various areas such as health care, environment, defense, surveillance, industry and transport. Typically, the sensors are small, with limited processing and computing resources and thus useful for network operations. In this paper, we present an improved Dynamic Cluster-based Wire- less Sensor Network (WSN) that facilitates an efficient routing protocol. The cluster- based structure presented here is self-constructible and reconfigurable and is supported by two atomic operations: node-move-in and node-move-out. Our routing protocol finds routes on graph G, unlike some previous routing protocols that find routes on the struc- ture in a similar cluster-based structure. For the two operations we also propose two algorithms: Node-Move-In and Node-Move-Out. We show that to establish a route on graph G using the structure, it requires O(p) rounds, where p is the number of clusters in the network. Note that, in a scenario where the number of sensor nodes n is enormous, p is much less than n. We also show that the proposed Node-Move-In and Node-Move-Out algorithms require expected O(q) and O(jTj) rounds, respectively. Here q is the number of neighbors in G of the node that wish to join to an existing cluster-based structure and T is the sub-tree of the structure whose root is the leaving node. Finally, our simulation results describe that the proposed routing protocol finds a better route with less length and using less computational time.
|
|---|