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...
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...
Manohar Shamaiah, Siddhartha Banerjee, Haris Vikal...
We propose and evaluate wireless sensor routing algorithms designed to extend the lifetime of a heterogeneous wireless sensor network. The network is heterogeneous in the sensorsâ...
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
Mobile underwater sensor networks are usually featured with three-dimensional topology, high node mobility and long propagation delays. For such networks, geographic routing has be...