Routing algorithm using GPSR and fuzzy membership for wireless sensor networks

Authors:
Kyung-Bae Chang;Dong-Wha Kim;Gwi-Tae Park
Affiliations:
Department of Electrical Engineering, Korea University, Seoul, Korea;Department of Electrical Engineering, Korea University, Seoul, Korea;Department of Electrical Engineering, Korea University, Seoul, Korea
Venue:
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Year:
2006

Citing 6
Cited 0

Convergence theory for fuzzy c-means: counterexamples and repairs

IEEE Transactions on Systems, Man and Cybernetics
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geometric spanners for routing in mobile networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.