Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and propose two protocols, GREES-L and GREES-M, which combine geographic routing and energy efficient routing techniques and take into account the rea...

A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of network densities. Current approaches, geographic routing and table based routing, fail to provide very good scalability with good paths in sparse networks. We propose a method based on the discovery of connectivity between geograph...

∗ This research is supported in part by The New Jersey Center for Multimedia Research and in part by New Jersey Institute of Technology under Grant No 421050. Abstract In this paper we propose PSR (Position-guided Sliding-window Routing), a position-based/link-state hybrid, proactive routing protocol that provides for a flat, mobile ad-hoc routing architecture. Our protocol is based on the supe...

Existing geographic routing algorithms assume a two-dimensional topology. Dedicated wireless sensor network scenarios demand for algorithms that operate in three-dimensional environments. This paper discusses issues which arise when making the step from 2D to 3D. Simulation studies show that 3D routing is less efficient than its 2D counterpart when comparing topologies with the same average nod...

We present a new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes and generates less maintenance traffic than previous algorithms. While geographic routing potentially scales well, it faces the problem of what to do at local dead ends where greedy forwarding fails. Existing geographic routing algorithms handle dead ends by planarizing the...

We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proximity and link cost. Coupled with the local next hop decision in geographic routing, NADV enables an adaptive and efficient cost-aware routing strategy. Depending on the objective or message priority, applications can u...

Geographic routing protocols are well suited to wireless sensor networks because of their modest resource requirements. A major limiting factor in their implementation is the requirement of location information. The virtual localization algorithm provides the functionality of geographic routing without any knowledge of node locations by constructing a virtual coordinate system. It differs from ...

Most of the routing protocols proposed for ad-hoc networks and sensor networks are not designed with security as a goal. Hence, many routing protocols are vulnerable to an attack by an adversary who can disrupt the network or harness valuable information from the network. Routing Protocols for wireless sensor networks are classified into three types depending on their network structure as Flat ...

The purpose is to schedule redundant nodes into energy-saving mode, while maintaining the connectivity of a network for simple geographic routing protocols. Comparing to GAF, the number of cells as well as the overall energy consumption of a WSN also drops dramatically with the proposed protocol.