Decentralized Object Location and Routing: A New Networking Paradigm

The advent of grassroots content distribution systems (e.g., Gnutella, FreeNet, Napster, Oceanstore) indicates the need for a distributed data location algorithm [HBMKK00, Cla00, Fan00, K+00a]. In this paper we investigate three methods of data location: distance-vector routing and link-state vector routing using Bloom filters, and a naive cache sharing algorithm. These data location methods ar...

With the availability of location based services, applications that use locations for optimal performance will require efficient location management algorithms, where user locations are kept track with minimal system overhead. Geography based routing in mobile ad hoc networks is one such application that uses location information of nodes in a network to route data packets. Previous work in thi...

Location-routing problem (LRP) thoroughly considers location allocation (LAP) and vehicle routing (VRP) which has been an integral part applied in modern logistics. A number of researchers at home aboard have put forward their views by establishing fine models. On the basis studying previous research results classification, summary, comparative analysis, this study hence proposes a new solution...

Typical communication patterns within a sensor network are data delivery from sensor nodes to one of selected information sinks, and information sinks requesting a certain physical phenomenon or requesting sensor nodes lying within a sensed area. In general, addressing is achieved by utilizing sensor locations. Geographic routing algorithms allow routers to be nearly stateless since packet forw...

Recently, in mobile ad hoc networks, routing schemes using location information have been proposed. Most of these schemes assume that the source node already knows the location information of the destination node. However, since all nodes are always moving, it is difficult to apply this assumption to the real mobile ad hoc environment. In order to cope this difficulty, this paper presents a new...

We propose using the predictability of human motion to eliminate the overhead of distributed location services in human-carried MANETs, dubbing the technique location profile routing. This method outperforms the Geographic Hashing Location Service when nodes change locations 2×more frequently than they initiate connections (e.g., start new TCP streams), as in applications like textand instant-m...

Geographical routing protocols have been received serious attention due to their advantages as compared to conventional routing protocols. They require information about the physical position of nodes to be available. Commonly, each node determines its own position through the use of Global Positioning System (GPS) or some other type of positioning service. Greedy Perimeter Stateless Routing (G...

In this paper, we propose an efficient greedy location-aided routing (GLAR) scheme to improve the efficiency of location-aided routing (LAR) scheme for mobile ad hoc networks (MANETs). In this scheme, we first decide a baseline, which is the line between the source node and the destination node, for route discovery. The request packet is broadcasted in a request zone based on the baseline to de...