Routing algorithm using GPSR and fuzzy membership for wireless sensor networks

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the wireless sensor networks, sensor nodes are generally clustered under the necessity. GPSR which Brad Karp et al. proposed, is routing algorithm that has follow advantages: GPSR is localized algorithm to find routes and sensor nodes have few data for routing. These features make GPSR be adapted to sensor networks. But, forwarding a packet is able to be failed because of geographic data error or mobility of sensor nodes. In order to improve such a problem, this paper proposes clustered GPSR by fuzzy membership. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Chang, K. B., Kim, D. W., & Park, G. T. (2006). Routing algorithm using GPSR and fuzzy membership for wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4113 LNCS-I, pp. 1314–1319). Springer Verlag. https://doi.org/10.1007/11816157_165

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free