In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose ...

This paper presents a novel reactive location routing algorithm based on cluster-based flooding for use in Vehicular Ad-hoc Networks (VANET). We compare position-based and non-positionbased routing strategies in two typical traffic scenarios: urban and motorway. The mobility of vehicles using a microscopic traffic model developed in OPNET is used to evaluate the performance of the reactive Loca...

In this paper, we present a generic extension of location-based ad hoc routing protocols named Skewed Map Forwarding (SMF). SMF incorporates multipath routing into any location-based routing protocol, while preserving the stateless property of location-based protocols. It alters/distorts the view of the network topology from the routing protocol by mapping the physical coordinates of nodes to l...

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

In this talk, we consider a location-routing problem in designing the optical Internet with WDM systems. This problem arises from the design of broadband local access networks that deliver high-speed access service to residential subscribers. In this problem, we consider fiber routing and gateway location. For routing problem, we determine the optimal dimensioning of link capacity, and seek to ...

As the applications of wireless sensor networks proliferate, the efficiency in supporting large sensor networks and offering security guarantees becomes an important requirement in the design of the relevant networking protocols. Geographical routing has been proven to efficiently cope with large network dimensions while trust management schemes have been shown to assist in defending against ro...

In this paper we investigate a practical routing solution for a new class of wireless sensor networks where any node can be mobile anytime. Assuming GPS-enabled sensor nodes we propose a new geometric routing protocol called M-Geocast that is designed to efficiently support node mobility as well as location service for such mobile sensor networks. Unlike existing geometric routing schemes, M-Ge...

In networks where nodes are aware of their locations via the use of a GPS receiver or other localization techniques, geographic routing has been suggested to be the candidate of choice for robust and resource efficient routing. However, efficient location management algorithms are required for the source node to obtain the destination node’s location before it can start data transfer using geog...

A geography-based grid location service (GLS), proposed elsewhere, has resulted in a scalable location management service for mobile ad hoc networks (MANETs) where packet forwarding decisions are based on geographic position. A similarly scalable location management strategy has been devised for MANETs that employ hierarchical link state routing. Both approaches employ hierarchical principles ...

Position-based routing is a promising technology for VANET. And location service is the fundamental component for the success of position-based routing. A map-based location service algorithm is proposed in this paper. It uses a predesigned hash function to map a node to a certain location, where location servers are recruited. Hence any node in the network can find location servers of others, ...