Citation Context

...nt location service, so that routes between source and destination can be found.A scalable quorum-based location service in ad hoc and sensor networks 73 Traditional protocols (Basagni et al., 1998; =-=Ko and Vaidya, 1998-=-; Stojmenovic et al., 2006) deal with this service using flooding-based methods, which involves all nodes, located inside a region, in data accessing. The location of destination can be retrieved loca...

Citation Context

...f edge (u, v) and with diameter ||uv||. It has some desirable properties when used for routing in wireless networks, such as localised message free computation, planarity and preserving connectivity (=-=Bose et al., 2001-=-). Gabriel graph divides the network into faces. The one that contains the line SD, where S is failure node and D is destination, is traversed by right-hand or left-hand rule (placing a virtual hand o...

Citation Context

... a node with maximal number of unassigned r hop neighbours as backbone nodes, and assigning all its r hop neighbours to that node. We observe that this is, in fact, a well-known clustering algorithm (=-=Lin and Gerla, 1997-=-) generalised to r hops. The maintenance of cluster structure is known to require significant communication overhead (for instance, local changes may cause global updates by chain effect) (Gerla et al...

Citation Context

...eloping energy efficient location service, so that routes between source and destination can be found.A scalable quorum-based location service in ad hoc and sensor networks 73 Traditional protocols (=-=Basagni et al., 1998-=-; Ko and Vaidya, 1998; Stojmenovic et al., 2006) deal with this service using flooding-based methods, which involves all nodes, located inside a region, in data accessing. The location of destination ...

Citation Context

...ised to r hops. The maintenance of cluster structure is known to require significant communication overhead (for instance, local changes may cause global updates by chain effect) (Gerla et al., 2000; =-=Wu and Li 2001-=-). A significantly better backbone structure, one that does not require any communication overhead and provides connectivity between nodes, is described in Wu and Li (2001), and can be also generalise...

Citation Context

... to recover from failure. Face routing requires the network topology to be a planar graph (i.e. no edges intersect each other); the one used in Bose et al. (2001) is the Gabriel graph. Gabriel graph (=-=Gabriel and Sokal, 1969-=-) contains edges between nodes u and v if and only if no other nodes are located within the circle centred in the middle of edge (u, v) and with diameter ||uv||. It has some desirable properties when ...

Citation Context

...(2006a,b).A scalable quorum-based location service in ad hoc and sensor networks 75 2 Literature review We briefly describe position-based routing schemes that are used in this paper. Greedy method (=-=Finn, 1987-=-; Stojmenovic and Lin, 2001) selects neighbour A that is closest to the destination D. A routing algorithm that guarantees delivery in unit graphs is described in Bose et al. (2001). It applies greedy...

Citation Context

...t subsets of S whose union is S. When one of the servers requires information from the other, it suffices to query one server from each quorum. It is possible to form quorums of size approximately n (=-=Maekawa, 1985-=-). For example, 25 servers can be organised into 5 rows and 5 columns. Each column serves as a quorum. Thus each node (i, j) (located in ith row and jth column) replicates its data to all servers (i′,...

Citation Context

... scalable quorum-based location service in ad hoc and sensor networks 75 2 Literature review We briefly describe position-based routing schemes that are used in this paper. Greedy method (Finn, 1987; =-=Stojmenovic and Lin, 2001-=-) selects neighbour A that is closest to the destination D. A routing algorithm that guarantees delivery in unit graphs is described in Bose et al. (2001). It applies greedy routing until either messa...

Citation Context

... or less same direction (e.g. rescue team or soldiers). This feature is lacking in another scalable, home-agent and hashing-based scheme, proposed independently in five papers (Blazevic et al., 2001; =-=Morris et al., 2000-=-; Pei and Gerla, 2001; Stojmenovic, 1999b; Woo and Singh, 2001). They have low fault tolerance in the presence of nodes failures or dynamic environment. In this paper, we propose a scalable quorum-bas...

Citation Context

...r actuator) that can be mobile. The task of finding and maintaining routes in the network is non-trivial since node mobility causes frequent unpredictable topological changes. Location-based routing (=-=Giordano and Stojmenovic, 2004-=-) is therefore introduced to reduce the communication overhead imposed by flooding-based solutions. Each node operates autonomously with no central control. It determines its own location through the ...

Citation Context

... outer face in the same face_time is about to be repeated. The two ends of the edge are denoted as farthest_nb and farthest_nb_next. The FACE algorithm can be improved by applying a short-cut scheme (=-=Datta et al., 2002-=-). The final result will be that all nodes at the outer face of the network will receive location update. This method guarantees that ‘horizontal’ destination search and ‘vertical’ location update wil...

Citation Context

...so that routes between source and destination can be found.A scalable quorum-based location service in ad hoc and sensor networks 73 Traditional protocols (Basagni et al., 1998; Ko and Vaidya, 1998; =-=Stojmenovic et al., 2006-=-) deal with this service using flooding-based methods, which involves all nodes, located inside a region, in data accessing. The location of destination can be retrieved locally, but the communication...

Citation Context

... distance between them becomes >R, where R is the radius of corresponding unit graph. The time t when the connection will be lost can be estimated by solving quadratic equation |A′B′|=|B−A+(b−a)t|=R (=-=Stojmenovic et al., 2000-=-; Su et al., 2000). Note that this adopted criterion allows nodes to move with the same speed and in the same direction (e.g. a road) without generating any location update message. In response to the...

Citation Context

...cation updates. They concluded experimentally that the best strategy is to update when a certain prespecified number of links incident on a node have been established or broken since the last update (=-=Karumanchi et al., 1999-=-). We decided to apply this strategy in our paper. However, the quorum organisation in our paper differs from one in Karumanchi et al. (1999). The quorums applied in this paper refer to nodes currentl...

Citation Context

...ral ‘columns’. Haas and Liang (1999a,b) and Liang and Haas (2000) proposed another variant of quorum-based distributed mobility management scheme. First, virtual backbone is initiated and maintained (=-=Liang and Haas, 2000-=-). Two ‘neighbouring’ backbone nodes may be up to 2r + 1 hops away. A distributed scheme for initiating is based on selecting, repeatedly, a node with maximal number of unassigned r hop neighbours as ...

Citation Context

...Gerla, 1997) generalised to r hops. The maintenance of cluster structure is known to require significant communication overhead (for instance, local changes may cause global updates by chain effect) (=-=Gerla et al., 2000-=-; Wu and Li 2001). A significantly better backbone structure, one that does not require any communication overhead and provides connectivity between nodes, is described in Wu and Li (2001), and can be...

Citation Context

...omes >R, where R is the radius of corresponding unit graph. The time t when the connection will be lost can be estimated by solving quadratic equation |A′B′|=|B−A+(b−a)t|=R (Stojmenovic et al., 2000; =-=Su et al., 2000-=-). Note that this adopted criterion allows nodes to move with the same speed and in the same direction (e.g. a road) without generating any location update message. In response to the detected broken ...

Citation Context

...or soldiers). This feature is lacking in another scalable, home-agent and hashing-based scheme, proposed independently in five papers (Blazevic et al., 2001; Morris et al., 2000; Pei and Gerla, 2001; =-=Stojmenovic, 1999-=-b; Woo and Singh, 2001). They have low fault tolerance in the presence of nodes failures or dynamic environment. In this paper, we propose a scalable quorum-based location service based on a localised...

Citation Context

...ibuted systems, computer networks, WDM optical and wireless networks, internet technologies and mobile computing. 1 Introduction We consider two basic scenarios in this paper. Mobile ad hoc networks (=-=Giordano, 2002-=-) consist of wireless nodes that communicate with each other in the absence of a fixed infrastructure. In wireless sensor networks, sensor nodes are static and route reports on event discovery to a sp...

Citation Context

...or soldiers). This feature is lacking in another scalable, home-agent and hashing-based scheme, proposed independently in five papers (Blazevic et al., 2001; Morris et al., 2000; Pei and Gerla, 2001; =-=Stojmenovic, 1999-=-b; Woo and Singh, 2001). They have low fault tolerance in the presence of nodes failures or dynamic environment. In this paper, we propose a scalable quorum-based location service based on a localised...

Citation Context

...on (e.g. rescue team or soldiers). This feature is lacking in another scalable, home-agent and hashing-based scheme, proposed independently in five papers (Blazevic et al., 2001; Morris et al., 2000; =-=Pei and Gerla, 2001-=-; Stojmenovic, 1999b; Woo and Singh, 2001). They have low fault tolerance in the presence of nodes failures or dynamic environment. In this paper, we propose a scalable quorum-based location service b...

Citation Context

...survey includes the DREAM algorithm (Basagni et al., 1998), LAR schemes (Ko and Vaidya, 1998), Voronoi diagram and convex hull based approaches (Stojmenovic et al., 2006) and doubling circles scheme (=-=Amouris et al., 1999-=-), among others. We will restrict the review only to results directly related to this paper. Given a set S of n servers, a quorum system is a set of mutually disjoint subsets of S whose union is S. Wh...

Citation Context

...nce, each query returns the latest value of the queried data. Such a query and update strategies has been previously employed for location management in cellular networks (Krishnamurthy et al., 1998; =-=Prakash and Singhal, 1996-=-; Prakash et al., 1997). The authors in Karumanchi et al. (1999) discussed information dissemination in partitionable mobile ad hoc networks. They use a well known approach for information disseminati...

Citation Context

...e, we only mention two independent rediscoveries of basic horizontal-vertical greedy quorum-based method (without face routing part for guaranteed service) in 2002 (Aydin and Shen, 2002) and in 2004 (=-=Tchakarov and Vaidya, 2004-=-) (this paper also describes an enhancement) in the context of efficient content location in location-aware ad hoc networks. Short conference version of this paper appeared in Liu et al. (2006a,b).A ...

Citation Context

...owever, it is not clear how this selection can be made with local knowledge only. In the second scheme, a node initiates a random walk of length k, for either query or update. In quorum-based scheme (=-=Lee et al., 2003-=-), node also selects k connected other nodes at random to dynamically form a quorum of size k. The efficiency of the method is not clear since selected nodes may move, and an efficient method (other t...

Citation Context

...eature is lacking in another scalable, home-agent and hashing-based scheme, proposed independently in five papers (Blazevic et al., 2001; Morris et al., 2000; Pei and Gerla, 2001; Stojmenovic, 1999b; =-=Woo and Singh, 2001-=-). They have low fault tolerance in the presence of nodes failures or dynamic environment. In this paper, we propose a scalable quorum-based location service based on a localised approach. It relies o...

Citation Context

... latest value of the queried data. Such a query and update strategies has been previously employed for location management in cellular networks (Krishnamurthy et al., 1998; Prakash and Singhal, 1996; =-=Prakash et al., 1997-=-). The authors in Karumanchi et al. (1999) discussed information dissemination in partitionable mobile ad hoc networks. They use a well known approach for information dissemination by replicating info...

Citation Context

...ceived the latest update. Hence, each query returns the latest value of the queried data. Such a query and update strategies has been previously employed for location management in cellular networks (=-=Krishnamurthy et al., 1998-=-; Prakash and Singhal, 1996; Prakash et al., 1997). The authors in Karumanchi et al. (1999) discussed information dissemination in partitionable mobile ad hoc networks. They use a well known approach ...

Citation Context

...propriate places in this paper. Here, we only mention two independent rediscoveries of basic horizontal-vertical greedy quorum-based method (without face routing part for guaranteed service) in 2002 (=-=Aydin and Shen, 2002-=-) and in 2004 (Tchakarov and Vaidya, 2004) (this paper also describes an enhancement) in the context of efficient content location in location-aware ad hoc networks. Short conference version of this p...

Citation Context

...apers on location service were published in literature, and we mention few of them. Basic row-column quorum-based location service presented in this paper was named in several subsequent papers (e.g. =-=Chen et al., 2006-=-; Jiang and Ling, 2007) as XYLS protocol. In Ziviani et al. (2002), it is proposed to send the initial packets of a flow to learn the position of their destination instead of adopting a dedicated quer...

Citation Context

...ervice were published in literature, and we mention few of them. Basic row-column quorum-based location service presented in this paper was named in several subsequent papers (e.g. Chen et al., 2006; =-=Jiang and Ling, 2007-=-) as XYLS protocol. In Ziviani et al. (2002), it is proposed to send the initial packets of a flow to learn the position of their destination instead of adopting a dedicated query packet. Nikaein and ...