Skip to main content
Article thumbnail
Location of Repository

An Improved Trusted Greedy Perimeter Stateless Routing for Wireless Sensor Networks

By P. Raghu Vamsi and Krishna Kant


In this paper, an improvement over Trusted Greedy Perimeter Stateless Routing (T-GPSR) is presented. T-GPSR employs heuristic weight values to evaluate total trust value of neighboring nodes. However, heuristic assignment of weights provide flexibility but it is not suitable in presence of several security attacks such as Grey hole, selfish behavior, on-off attack etc., are launched in the network in different proportions. To overcome this limitation, an improvement is suggested with an emphasis on trust update, lightweight trust computation and storage to reduce communication and storage overhead. The simulation study indicates that the packet delivery ratio of the improved T-GPSR has improved by 10% over T-GPSR in the presence of 50% of malicious nodes in the network

Topics: Trust, security, geographic routing, reputation, security attacks, wireless sensor networks, Electronic computers. Computer science, QA75.5-76.95, Instruments and machines, QA71-90, Mathematics, QA1-939, Science, Q
Publisher: MECS Publisher
Year: 2014
DOI identifier: 10.5815/ijcnis.2014.11.02
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.