7 search results - page 1 / 2 » Secured Greedy Perimeter Stateless Routing for Wireless Sens... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
MOBICOM
2000
ACM
13 years 8 months ago
2000
ACM
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...
ITCC
2005
IEEE
13 years 10 months ago
2005
IEEE
— Several problems are required to be fixed in order to apply geographical routing protocol Greedy Perimeter Stateless Routing (GPSR) in wireless sensor networks. First, GPSR is...
MOBIHOC
2001
ACM
14 years 3 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
TWC
2008
13 years 4 months ago
2008
In order to adapt to time-varying wireless channels, various channel-adaptive schemes have been proposed to exploit inherent spatial diversity in mobile/wireless ad hoc networks w...