In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. In this paper, we study greedy geometric routing in R, using the standard Euclidean metric. Greedy geometric routing is not always possible in fixed-dimensional Euclidean spaces, of course, as is the ...

Location information is essential in many applications of WSNs,it is natural to use this information for routing as well. Location-based protocols or geographical routing protocols to exploit the location information of each node to provide efficient and scalable routing. Various routing algorithms that feat geographic information (e.g., GPSR) have been aimed to attain this goal. These algorith...

The challenges in designing a scalable and robust multicast routing protocol in a mobile ad hoc network (MANET) due to the difficulty in group membership management, multicast packet forwarding, and the maintenance of multicast structure over the dynamic network topology for a large group size or network size. To use a novel Robust and Scalable Geographic Multicast Protocol (RSGM) which exhibit...

Routing for ad-hoc wireless network is challenging, many routing strategies have been proposed in literature. With the availability of affordable Global Position System equipped devices, location-aware routing provides a promising foundation for developing an efficient and practical solution for routing in ad-hoc wireless network. Current geographic forwarding strategies and geographic routing ...

In this paper, we extend previous work on geographic random forwarding (GeRaF) by considering a more efficient paradigm whereby on/off cycles are exploited and every node can participate to packet relaying, as long as it wakes up during any handshake procedure. The protocol is fully distributed, as routing decisions are made hop by hop based on geographic metrics and using a joint channel acces...

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...

Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by in...

In this paper we study the problem of searching for a node or a piece of data in an ad hoc network using random packet forwarding. In particular, we examine three different methods. The first is a random direction forwarding scheme where the query packet is forwarded along a randomly chosen direction (following an approximate straight line) till it either hits the destination node (the target) ...