Ivan Stojmenovic, Mark Russell, and Bosko Vukojevic, "Depth first search and location based localized routing and QoS routing in wireless networks," Computers and Informatics, vol. 21, no. 2, pp. 149--165, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... two nodes becomes R) Similarly, the same action may be taken when a new neighbor is detected (that is, in response to a message arriving from a new neighbor) The availability of geographic position information enables nodes to estimate the connection time with other nodes, as proposed in [SRV, SLG]. The connection time is defined as the estimated duration of a connection between two neighboring nodes. Neighboring nodes frequently update their location to each other, and this information may be used to estimate the direction and speed of their movements. In turn, this suffices to estimate ....

....t, they move to new positions A = A at and B = B bt. They will loose their connection when the 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 6 A B = B A (b a)t =R [SRV,SLG]. Note that this adopted criterion allows nodes to move with same speed and in the same direction (e.g. a road) without generating any location update message. In response to detected broken link, each node A will broadcast a message containing its new location information to all neighbors that ....

I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE International Conference on Parallel Processing, August 21-24, 2000, Toronto, 173-180.

....to the last vehicle and vice versa. The identity of the receiver is a priori unknown to the initiator of the message. Hence, the geographic location of vehicles in a given tra#c situation a#ects the destination of a message rather than the identity of hosts. Novel studies [BH00, IN99, KK00, SR00] in geographic and location based routing reflect the need for an alternative addressing scheme in mobile ad hoc networks. 2.1 Related Work An overview on the topic of routing in mobile ad hoc networks is given in [BMJ 98, RT99] The authors compare the performance of several routing ....

....In contrast to FACE, each node or the packet has to store the history information about the routing process. An extension of the memoryless FACE algorithm towards broadcasting and geocasting i.e. multicasting inside a destination region is also discussed. Stojmenovic et al. SL00, SR00] present further research on location based routing. The authors adopt the term localized algorithms from [EGHK99] as distributed algorithms where simple node behavior based on decisions 30 source destination Figure 2.2: Routing using FACE 2 from [BMSU99] made by local knowledge achieves ....

[Article contains additional citation context not shown here]

Ivan Stojmenovic and Mark Russell. Depth first search and location based localized routing and QoS routing in wireless 216 networks. In IEEE International Conference on Parallel Processing, pages 173--180, August 2000. 24, 30, 31, 42

No context found.

I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE International Conference on Parallel Processing, August 21-24, 2000, Toronto, 173-180.

No context found.

I. Stojmenovic, M. Russell and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, in: IEEE International Conference on Parallel Processing, Toronto, 21--24 August 2000, pp. 173--180.

....also happen to be the same, use y coordinate for final decision. Such comparison rule will result in fewer remaining nodes in the graph. The information about the degree of neighboring nodes may be gathered together with their location. The preliminary version of this paper was published as [SRV]. After the publication of [SRV] we have learned about a relevant and independent article [JPS] Jain, Puri and Sengupta [JPS] proposed a single path strategy that guarantees delivery called geographic routing algorithm (GRA) It requires nodes to partially store routes toward certain ....

....use y coordinate for final decision. Such comparison rule will result in fewer remaining nodes in the graph. The information about the degree of neighboring nodes may be gathered together with their location. The preliminary version of this paper was published as [SRV] After the publication of [SRV], we have learned about a relevant and independent article [JPS] Jain, Puri and Sengupta [JPS] proposed a single path strategy that guarantees delivery called geographic routing algorithm (GRA) It requires nodes to partially store routes toward certain destinations in routing tables. GRA applies ....

[Article contains additional citation context not shown here]

I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE International Conference on Parallel Processing, August 21-24,

....are simultaneously running. Q and F component finishes after two messages to each other, while the other component finds the path BWGHIJD . Although multi paths can be created in the networks, experiments show that the overall flooding rate remains small, comparable or lower than in DFS algorithm [8] that maintains single path at all times (a variant of algorithm [8] where DFS is used for maintaining routing tables was independently described in [5] It can also be observed, using simple geometric facts, that there are at most four connected components of neighbors of any concave node ....

....to each other, while the other component finds the path BWGHIJD . Although multi paths can be created in the networks, experiments show that the overall flooding rate remains small, comparable or lower than in DFS algorithm [8] that maintains single path at all times (a variant of algorithm [8] where DFS is used for maintaining routing tables was independently described in [5] It can also be observed, using simple geometric facts, that there are at most four connected components of neighbors of any concave node in unit graph model. Therefore the number of newly created components ....

[Article contains additional citation context not shown here]

I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE Int. Conf. on Parallel Processing, Aug. 21-24, 2000, Toronto, 173-180. 290

....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, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, Computers and Informatics, 21, 2, 2002, 149-165.

....of past traffic is needed for short period of time, while ongoing routing task is in progress, and therefore after a timeout outdated traffic can be safely removed from memory. Finally, the creation of Quality of Service (QoS) path, that is, path with bandwidth, delay, and connection time [SRV] requirements, requires that the path is memorized in order to optimize the traffic flow and satisfy QoS criteria. This certainly includes the use of the best path found in the search process. Once destination is reached, the optimal path can be reported back to source. f) Guaranteed message ....

....C 11 4. Depth First Search Based Routing with Guaranteed Delivery Single path strategies that guarantee delivery of the message to the destination are very relevant for supporting loss sensitive traffic. Geographic Routing Algorithm [JPS] and the Depth First Search Based Algorithm proposed in [SRV] schemes are based on this concept. Jain, Puri and Sengupta [JPS] proposed one such strategy called geographic routing algorithm (GRA) and it requires nodes to partially store routes toward certain destinations in routing tables. GRA applies greedy strategy in forwarding messages. However, ....

[Article contains additional citation context not shown here]

I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE Int. Conf. On Parallel Processing, Aug. 21-24, Toronto, 173-180.

No context found.

I. Stojmenovic, M. Russell, and B. Vukojevic, "Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks," IEEE Int'l Conf. Parallel Processing, pp. 173180, Aug. 2000.

....destination is used to measure the progress. When no node is closer to the destination than current node C, the algorithm fails. Power aware routing algorithms in unit graphs are studied in [SL2] Routing algorithms that are based on depth first search algorithm, merged with GEDIR, are proposed in [SRV]. These algorithms require nodes to memorize past traffic, which is not the case with algorithms discussed here. The performance of DFS based routing algorithms can also be improved by applying internal node concept [SRV] Bose, Morin, Stojmenovic and Urrutia [BMSU] described a GPS based ....

....are based on depth first search algorithm, merged with GEDIR, are proposed in [SRV] These algorithms require nodes to memorize past traffic, which is not the case with algorithms discussed here. The performance of DFS based routing algorithms can also be improved by applying internal node concept [SRV]. Bose, Morin, Stojmenovic and Urrutia [BMSU] described a GPS based localized routing algorithm which guarantees the delivery for wireless networks modeled by unit graphs, assuming only that the graph is connected. The only additional constraint is, of course, that the position of destination (as ....

I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE International Conference on Parallel Processing, August 21-24, 2000, Toronto, 173-180.

....2 gives an example showing that greedy or GEDIR algorithm may produce longer paths than SP (shortest path) routing algorithm. Power aware routing algorithms in unit graphs are studied in [SL2] Routing algorithms that are based on depth first search algorithm, merged with GEDIR, are proposed in [SRV]. These algorithms require nodes to memorize past traffic, which is not the case with algorithms discussed here. The performance of DFS based routing algorithms can also be improved by applying internal node concept [SRV] 5 2.2. Dominating sets and internal nodes A set is dominating if all the ....

....are based on depth first search algorithm, merged with GEDIR, are proposed in [SRV] These algorithms require nodes to memorize past traffic, which is not the case with algorithms discussed here. The performance of DFS based routing algorithms can also be improved by applying internal node concept [SRV]. 5 2.2. Dominating sets and internal nodes A set is dominating if all the nodes in G are either in the set or neighbors of nodes in the set. Nodes that belong to a dominating set will be called, in this paper, internal nodes for G (of course, a different definition for dominating set leads to ....

I. Stojmenovic, M. Russell, and B. Vukojevic, Depth first search and location based localized routing and QoS routing in wireless networks, IEEE International Conference on Parallel Processing, August 21-24, 2000, Toronto, 173-180.

No context found.

Ivan Stojmenovic, Mark Russell, and Bosko Vukojevic, "Depth first search and location based localized routing and QoS routing in wireless networks," Computers and Informatics, vol. 21, no. 2, pp. 149--165, 2002.

No context found.

I. Stojmenovic, M. Russell, and B. Vukojevic. Depth first search and location based localized routing and QoS routing in wireless networks. In Proceedings of the IEEE International Conference on Parallel Processing, pages 173--180, 2000.

No context found.

I. Stojmenovic, M. Russell, and B. Vukojevic. Depth first search and location based localized routing and qos routing in wireless networks. In Proceedings of the IEEE International Conference on Parallel Processing, pages 173--180, 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