I. Stojmenovic. Home agent based location update and destination search schemes in ad hoc wireless networks. In A. Zemliak and N.E. Mastorakis, editors, Advances in Information Science and Soft Computing, pages 6--11. WSEAS Press, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....which is the case with other known methods. In other words, the proposed method is applicable when all nodes move in more or less same direction (e.g. rescue team or soldiers) This feature is lacking in another scalable, home agent based scheme, recently proposed independently in five articles [BBCGHL, MJKLD, PG, S3, WS]. This paper is organized as follows. Section 2 gives a review of localized routing algorithms and location update techniques in ad hoc networks. Section 3 proposes a routing strategy that mimics the route discovery process [BMJHJ] which separates the location update, destination search, path ....

.... on flooding anyway) and does not require communication overhead for its own backbone structure, which is dominating set as defined in [SSZ, WL] Location update technique that is most relevant to this paper is the home agent based scheme, which has been independently proposed in five papers [BBCGHL, MJKLD, PG, S3, WS]. In this scheme, each node selects a home region, known to other nodes, and sends location updates to nodes currently located in its home region. In order to locate destination, nodes send destination search message (or full message in some variants) toward home agent region of destination, and ....

[Article contains additional citation context not shown here]

I. Stojmenovic, Home agent based location update and destination search schemes in ad hoc wireless networks, Computer science, SITE, University of Ottawa, TR-99-10, September 1999.

....information reaches the correct node, where it is then stored. Since GLS requires that all nodes store the information on some other nodes, it can be classi ed as an all for some approach. D. Homezone Two almost identical location services have been proposed independently in [GH99] and [Sto99a] Both use the concept of a virtual Homezone where position information for a node is stored. The position C of the Homezone for a node can be derived by applying a well known hash function to the node identi er. All nodes within a disk with radius R centered at C have to maintain position ....

I. Stojmenovic. Home agent based location update and destination search schemes in ad hoc wireless networks. Technical Report TR-99-10, Computer science, SITE, University of Ottawa, September 1999.

No context found.

I. Stojmenovic, Home agent based location update and destination search schemes in ad hoc wireless networks, Computer science, SITE, University of Ottawa, TR-99-10, September 1999.

....applied outside the region. We extend our unified framework toward unified definition of forwarding region and derive routing and geocasting algorithms for each of three basic methods reviewed in the next section. Versions that require and do not require to memorize past traffic are discussed. In [S1, S2, S3, SRV], it is suggested to solve the mobility problem by separating location update and destination search steps from the actual routing. Based on their mobility, nodes periodically update their location to their smaller or larger neighborhood. When a source wishes to send a message ( long message) to ....

I. Stojmenovic, Home agent based location update and destination search schemes in ad hoc wireless networks, SITE, University of Ottawa, TR-99-10, September 1999.

....[APL] is based on doubling size of circles of location updates. This idea has been rediscovered one year later in [LJCKM] GEDIR is often used as basic ingredient in other routines. For instance, it is used in several location update schemes, such as quorum based [S1] and home agent based schemes [BBCGHL, MJKLD, S3, WS] (note that the later scheme was independently proposed in four papers) In 2 hop greedy method [SL2] node A selects the best candidate node C among its 1 hop and 2 hop neighbors according to the corresponding criterion. Then A forwards m to its best 1 hop neighbor in the set of neighbors of A ....

I. Stojmenovic, Home agent based location update and destination search schemes in ad hoc wireless networks, Computer science, SITE, University of Ottawa, TR-99-10, September 1999.

No context found.

I. Stojmenovic. Home agent based location update and destination search schemes in ad hoc wireless networks. In A. Zemliak and N.E. Mastorakis, editors, Advances in Information Science and Soft Computing, pages 6--11. WSEAS Press, 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC