I. Stojmenovic, A. P. Ruhil, and D. K. Lobiyal, "Voronoi Diagram and Convex Hull-Based Geocasting and Routing in Wireless Networks," Proc. 8th IEEE Symp. Comp. and Commun. ISCC, Antalya, Tukey, July 2001, pp. 51--56.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... in given in [GSB] A detailed literature review on location update schemes for efficient routing in ad hoc networks is given in recent survey [S2] The survey includes the DREAM algorithm [BCSW] LAR schemes [KV] ant based location updates [CL] Voronoi diagram and convex hull based approaches [S1], and doubling circles scheme [APL] 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. When one of servers require information from the other, it ....

....and destination search schemes. Component 2: Routing to a destination whose position is known (includes path creation from destination to the source, and data traffic from source to destination) Satisfactory localized solutions for path creation and data traffic phases are already proposed in [BFNO, BMSU, SL, SSW, SL2, S1]. Because of drawbacks of existing solutions for the location updates and destination search schemes, we shall concentrate on these two components in this paper. We shall propose new solutions for them in the next two sections. The main difference between our proposed location update and ....

[Article contains additional citation context not shown here]

I. Stojmenovic, Voronoi diagram and convex hull based geocasting and routing in ad hoc wireless networks, Computer Science, SITE, University of Ottawa, TR-99-11, December 1999, www.site.uottawa.ca/~ivan .

....investigated the problem of geocasting in mobile ad hoc networks [7] and proposed to use a forwarding zone to decrease delivery overhead of geocasting packets. The motivation rests with the fact that route information is costly to maintain in mobile ad hoc networks. Various other mechanisms [8, 9, 10] have been proposed to improve geocast e#ciency and delivery accuracy in mobile ad hoc networks. Zhou and Singh proposed a content based multicast [11] in which sensor event information is delivered to nodes in some geographic area that is determined by the velocity and type of the detected ....

Stojmenovic, I.: Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa (1999)

....to be delivered, and the geocast protocol tries to deliver the message only to the nodes in that area. Ko and Vaidya investigated the problem of geocast in mobile ad hoc networks [13] and proposed to use a forwarding zone to decrease delivery overhead of geocast packets. Various other mechanisms [14 16] have been proposed to improve geocast e#ciency and delivery accuracy in mobile ad hoc networks. Zhou and Singh proposed a content based multicast [17] in which sensor event information is delivered to nodes in some geographic area that is determined by the velocity and type of the detected ....

Stojmenovic, I.: Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa (1999)

....to be delivered, and the geocast protocol tries to deliver the message only to the nodes in that area. Ko and Vaidya investigated the problem of geocast in mobile ad hoc networks [15] and proposed to use a forwarding zone to decrease delivery overhead of geocast packets. Other mechanisms A([26, 17, 2]) have been proposed to improve geocast e#ciency and delivery accuracy in mobile ad hoc networks. Zhou and Singh proposed a content based multicast [28] in which sensor event information is delivered to nodes in some geographic area that is determined by the velocity and type of the detected ....

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa, December 1999.

....results are given in [9] for these optimizations, the ideas offer plans for future work. 2.1. 2 Voronoi diagram based geocasting GOAL of Protocol: The goal of the Voronoi diagram based geocasting protocol is to increase the success rate and decrease the hop count and flooding rate of LBM [15]. The authors of [15] observed that the forwarding zone defined in [9] may be a partitioned network between the source node and the geocast region, although there exists a path between the source and the destination. An example of this problem is illustrated in Figure 3, which is similar to a ....

....given in [9] for these optimizations, the ideas offer plans for future work. 2.1. 2 Voronoi diagram based geocasting GOAL of Protocol: The goal of the Voronoi diagram based geocasting protocol is to increase the success rate and decrease the hop count and flooding rate of LBM [15] The authors of [15] observed that the forwarding zone defined in [9] may be a partitioned network between the source node and the geocast region, although there exists a path between the source and the destination. An example of this problem is illustrated in Figure 3, which is similar to a figure that appeared in ....

[Article contains additional citation context not shown here]

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. Technical Report, University of Ottawa, TR-99-11, December 1999.

....message to be delivered, and the geocast protocol tries to deliver the message only to the nodes in that area. Ko and Vaidya investigated the problem of geocast in mobile ad hoc networks [13] and proposed to use a forwarding zone to decrease delivery overhead of geocast packets. Other mechanisms [22, 15, 2] have been proposed to improve geocast e#ciency and delivery accuracy in mobile ad hoc networks. Zhou and Singh proposed a content based multicast [24] in which sensor event information is delivered to nodes in some geographic area that is determined by the velocity and type of the detected ....

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa, December 1999.

....delivered, and the geocast protocol tries to deliver the message only to the nodes in that area. Ko and Vaidya investigated the problem of geocasting in mobile ad hoc networks [7] and proposed to use a forwarding zone to decrease delivery overhead of geocasting packets. Various other mechanisms [8, 9, 10] have been proposed to improve geocast e#ciency and delivery accuracy in mobile ad hoc networks. Zhou and Singh proposed a contentbased multicast [11] in which sensor event information is delivered to nodes in some geographic area that is determined by the velocity and type of the detected events. ....

Stojmenovic, I.: Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa (1999)

....simulation results are given in [8] for these optimizations, the ideas o er plans for future work. 2.1. 2 Voronoi diagram based geocasting GOAL of Protocol: The goal of the Voronoi diagram based geocasting protocol is to increase the success rate and decrease the hop count and ooding rate of LBM [14]. The authors of [14] observed that the forwarding zone de ned in [8] may be a partitioned network between the source node and the Geocast region, although there exists a path between the source and the destination. An example of this problem is illustrated in Figure 4, which is similar to a ....

....given in [8] for these optimizations, the ideas o er plans for future work. 2.1. 2 Voronoi diagram based geocasting GOAL of Protocol: The goal of the Voronoi diagram based geocasting protocol is to increase the success rate and decrease the hop count and ooding rate of LBM [14] The authors of [14] observed that the forwarding zone de ned in [8] may be a partitioned network between the source node and the Geocast region, although there exists a path between the source and the destination. An example of this problem is illustrated in Figure 4, which is similar to a gure that appeared in ....

[Article contains additional citation context not shown here]

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. Technical Report, University of Ottawa, TR-99-11, December 1999.

No context found.

I. Stojmenovic, Voronoi diagram and convex hull based geocasting and routing in ad hoc wireless networks, Computer Science, SITE, University of Ottawa, TR-99-11, December 1999.

....rate is the ratio of numbers of messages received by destination and sent by senders. For a shortest path algorithm, and for algorithms that guarantee delivery in a connected graph, this ratio is 1. Some of existing algorithms do not produce a unique path between a source and a destination (e.g. [BCSW, KV, S1]) Flooding rate is more appropriate measure for such algorithms. It is defined as the ratio of number of transmissions required by a method (in case of algorithms that produce a path, e.g. SL1, BMSU] and this paper, it is equivalent to the hop count) and hop count of a shortest path algorithm. ....

....location of all other nodes in network, including the time when the location for each node is established. The sender uses the latest available location about the position of the destination and attaches it to the message. Location updates and destination search problems are discussed in [BCSW, KV, S2, S1]. The proposed DFS algorithm guarantees delivery even if position of destination is not known accurately, and not consistent at various nodes. Several localized routing algorithms are proposed recently in literature. One such method, GEDIR (geographic distance routing) based on the location ....

I. Stojmenovic, Voronoi diagram and convex hull based geocasting and routing in ad hoc wireless networks, Computer Science, SITE, University of Ottawa, TR-99-11, December 1999; www.site.uottawa.ca/~ivan.

....Voronoi diagrams or bisectors with the circle or rectangle of possible positions of destination. The corresponding CH MFR is also described, based on the convex hull on neighboring nodes, while the analogous R DIR is modified from [BCSW, KV] The methods proposed here are originally described in [S5, S2]. The next section presents the survey of relevant routing algorithms and location update schemes. More detailed surveys are given in [GS, S2, S4] 2. Position based routing Several GPS based methods were proposed in 1984 86 by using the notion of progress. Define progress as the distance ....

I. Stojmenovic, Voronoi diagram and convex hull based geocasting and routing in ad hoc networks, SITE, Univ. of Ottawa, TR-99-11, Dec. 1999.

....pressure, and noise level. Geocasting is a form of broadcasting, where nodes that shall receive messages are restricted to be inside a region. A simple solution to this problem is to route from the source to a node inside geocasting region, and then apply broadcasting inside the region [S1]. Solutions proposed in literature do not appear to be more efficient that this one, and we will not survey them here. A survey is given in [JC] The traditional solution to the broadcasting problem is blind flooding, where each node receiving the message will retransmit it to all its neighbors. ....

I. Stojmenovic, Voronoi diagram and convex hull based geocasting and routing in ad hoc wireless networks, SITE, University of Ottawa, TR-99-11, December 1999.

....a message m to several neighbors whose direction (looking from A) is closest to the direction of destination D. In order to control flooding effect, flooding based method require nodes to memorize past traffic, to avoid forwarding the same message more than once. DREAM [BCSW] LAR KV] V GEDIR [S2], CH MFR [S2] belong to this class. Flooding can be partial because it is directed towards nodes in a limited sector of the network (e.g. in DREAM or in LAR) or because it is stopped after a certain number of hops (e.g. in flooding GEDIR family of schemes) Moreover, partial flooding can be used ....

....to several neighbors whose direction (looking from A) is closest to the direction of destination D. In order to control flooding effect, flooding based method require nodes to memorize past traffic, to avoid forwarding the same message more than once. DREAM [BCSW] LAR KV] V GEDIR [S2] CH MFR [S2] belong to this class. Flooding can be partial because it is directed towards nodes in a limited sector of the network (e.g. in DREAM or in LAR) or because it is stopped after a certain number of hops (e.g. in flooding GEDIR family of schemes) Moreover, partial flooding can be used only for path ....

[Article contains additional citation context not shown here]

I. Stojmenovic, Voronoi diagram and convex hull based geocasting and routing in wireless networks, SITE, University of Ottawa, TR-99-11, Dec. 1999. www.site.uottawa.ca/~ivan

....on mobility patterns. If an accurate location of destination is needed, destination search message is initiated from the source. In this scheme, the actual (long) message is sent after the destination reports back to the sender. Location updates and destination search problems are discussed in [BCSW, KV, SV, S1]. The proposed DFS algorithm guarantees delivery even if position of destination is not known accurately, and not consistent at various nodes. Several localized routing algorithms are proposed recently in literature. One such method, GEDIR (geographic distance routing) based on the location ....

I. Stojmenovic, Voronoi diagram and convex hull based geocasting and routing in wireless networks, SITE, University of Ottawa, TR-99-11, Dec. 1999.

No context found.

I. Stojmenovic, A. P. Ruhil, and D. K. Lobiyal, "Voronoi Diagram and Convex Hull-Based Geocasting and Routing in Wireless Networks," Proc. 8th IEEE Symp. Comp. and Commun. ISCC, Antalya, Tukey, July 2001, pp. 51--56.

No context found.

I Stojmenovic, "Voronoi diagram and convex hull based geocasting and routing in wireless networks," TR TR-99-11, University of Ottawa, December 1999.

No context found.

I Stojmenovic, "Voronoi diagram and convex hull based geocasting and routing in wireless networks," TR TR-99-11, University of Ottawa, December 1999.

No context found.

I Stojmenovic, "Voronoi diagram and convex hull based geocasting and routing in wireless networks," TR TR-99-11, University of Ottawa, December 1999.

No context found.

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa, December 1999.

No context found.

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. Technical Report, University of Ottawa, TR-99-11, December 1999.

No context found.

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa, December 1999.

No context found.

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa, December 1999.

No context found.

I Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. TR TR-99-11, University of Ottawa, December 1999.

No context found.

I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. 2000.

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