A wide range of applications in wireless sensor networks rely on the location information of the sensing nodes. However, traditional localization techniques are dependent on hardware that is sometimes unavailable (e.g. GPS), or on sophisticated virtual localization calculus which have a costly overhead. Instead of actually localizing nodes in the physical two-dimensional Euclidean space, we use...

Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). To reduce the control overhead due to these messages, beacon-less routing algorithms have recently been proposed. However, existing beacon-less algorithms have not considered realistic physical layers. Therefore, those algorithms cannot work pr...

Three-dimensional accurate positioning algorithm, using RSSI-based (Received Signal Strength Indication) positioning method, which constructs an attenuation model of wireless signal between beacon node and unknown node in three-dimensional space, and compensates for the loss of wireless signal on the basis of their material, thickness and other factors when there are obstacles or walls being in...

Geographic routing is a routing paradigm, which uses geographic coordinates of network nodes to determine routes. Greedy routing, the simplest form of geographic routing forwards a packet to the closest neighbor towards the destination. A greedy embedding is a embedding of a graph on a geometric space such that greedy routing always guarantees delivery. A Schnyder drawing is a classical way to ...

We consider the security of geographic routing (GR) that is widely used in ad hoc and wireless sensor networks due to its scalability. In GR, a node greedily forwards a packet to the neighbor that is closest to the destination. Thus, GR only requires a node to maintain the location information of its one hop neighbors. However, very little work has been done to secure GR. In a potential attack,...

Traditional topology-based MANET routing protocols use stateful routing which increases the processing, communication and memory overheads. The high mobility of nodes in MANETs makes it difficult to maintain a deterministic route. To overcome this, stateless geographic routing protocols which ensure reliable data delivery have been proposed. It is found that link instability can be a major fact...

The energy consumption is a great challenge in Wireless sensor networks that may affect the performance of the entire network. Even though many techniques are being still addressed to this issue, it is ongoing problem. One of the most energy efficient routing protocols is Geographic Adaptive Fidelity (GAF), which is the location based protocol. This reduces the use of energy by switching off so...

We present Obstacle-aware Virtual Circuit geographic Routing (OVCR), a novel routing mechanism for obstacle-aware wireless sensor networks that uses the obstacle-free path computed by the sink to make the greedy forwarding of geographic routing dependable. OVCR discovers obstacle-free paths by the powerful sink as obstacles are detected. To bypass obstacles, the information of obstacle-free pat...

We propose Adaptive Geo-Source Multicast Routing (AGSMR) for WSNs. It addresses the scalability issue of previous location based stateless multicast protocols in WSNs. AGSMR is a novel stateless multicast protocol that optimizes the location-based and source-based multicast approaches in various ways. First, it saves the cost of a tree building by using receiver’s geographic location informatio...

In this paper we present a novel combinatorial approach for geographic routing with delivery guarantees. Proposed algorithm can be seen as a variant of GFG (Greedy Face Greedy of Bose et.al) algorithm, but based on the defined combinatorial properties of the graph. We utilize a distributed planarization algorithm of a geometric graph, which is based on the Schnyder's characterization of planar ...