Cartesian routing

Hughes, Larry; Banyasad, Omid; Hughes, Evan

doi:10.1016/s1389-1286(00)00130-4

Cited by 17 publications

(13 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Starting with the first proposals on geographical routing (e.g., Greedy Perimeter Stateless Routing (GPSR) [7]), they have assumed that the sources know the geographical coordinates of the destinations, or at least regions where the destinations may be located. Cartesian Routing [8] uses latitude and longitude address to determine the position of route relative to that of the destination. GeoGRID is an extension of GRID [9] in which a forwarding zone is composed of multiple two-dimensional logical grids.…”

Section: Related Workmentioning

confidence: 99%

Using geographical coordinates to attain efficient route signaling in ad hoc networks

Wang

Westphal

Garcia-Luna-Aceves

2013

2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

Abstract-Flooding of route requests or link states is a necessity in many routing protocols for mobile ad hoc networks (MANET), and several mechanisms have been devised to make flooding more efficient; however, all flooding approaches to date are such that the number of neighbors each node must use to relay a flooded packet grows as the node density increases. A new method, called ORCA (On-demand Routing with Coordinates Awareness) is introduced for the dissemination of route requests in MANETs. The selection of relaying nodes at each node in ORCA is done by computing the shortest Euclidean Distance from all neighbors of the node to four polar points located in the transmission range of the node. We prove that ORCA guarantees the coverage of all nodes in a connected MANET, and that the number of relays for each node is at most six. ORCA is compared with representative routing protocols, namely AODV, OLSR, LAR, and THP. The simulation results in networks of 200 and 250 nodes show that ORCA incurs the smallest routing load while attaining average delays and packet delivery ratios that are comparable to or better than those obtained with the other four routing protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

Using geographical coordinates to attain efficient route signaling in ad hoc networks

Wang

Westphal

Garcia-Luna-Aceves

2013

2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

show abstract

“…Starting with the first proposals on geographical routing (e.g., Greedy Perimeter Stateless Routing (GPSR) [15]), they have assumed that the sources know the geographical coordinates of the destinations, or at least regions where the destinations may be located. Cartesian Routing [16] uses latitude and longitude address to determine the position of route relative to that of the destination. GeoGRID is an extension of GRID [17] in which a forwarding zone is composed of multiple two-dimensional logical grids.…”

Section: Related Workmentioning

confidence: 99%

Minimizing routing overhead with Two-Hop Coordinate Awareness in ad hoc networks

Wang

Garcia-Luna-Aceves

2013

2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC)

View full text Add to dashboard Cite

Abstract-We introduce ORTHCA (On-demand Routing with Two Hop Coordinates Awareness) a method for minimizing the dissemination of route requests in mobile ad hoc networks (MANET). The selection of relaying nodes is implemented by first computing the best two-hop relay nodes R 2 (u) whose Euclidean Distance to four polar points are the shortest among all two-hop neighbors N 2 (u), and then determining one-hop relay nodes R 1 (u) connecting with R 2 (u). This process is iterated by each member of R 2 (u). We prove that all nodes in a connected MANET are covered in the dissemination of route requests using this procedure, and that |R 1 (u) + R 2 (u)| ≤ 16, which constitutes complexity O(1), regardless of the density of the network. ORTHCA is compared with representative routing protocols, namely AODV, OLSR, LAR, and THP. The simulation results show that ORTHCA reduces the routing load and improves packet delivery ratios, outperforming the other four routing protocols.

show abstract

“…One of the major reasons for the limited throughput capabilities of the electronic router is that the existing hierarchical routing schemes employ distance vector and link state routing algorithms, which require the exchange of routing information for the construction and maintenance of routing tables [4]. As networks increase in size, the memory requirements for the routing tables and the time taken to search the tables increase proportionally [4].…”

Section: Introductionmentioning

confidence: 99%

“…As networks increase in size, the memory requirements for the routing tables and the time taken to search the tables increase proportionally [4]. Optical implementation of a router based on these routing schemes would require querying an optical lookup table which, at present, is not feasible given the current underdeveloped state of optical buffering.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Router Design for Optical Cartesian Networks

Sheth

Hughes

3rd Annual Communication Networks and Services Research Conference (CNSR'05)

View full text Add to dashboard Cite

The paper describes the progress in the research, design, and development of an all-optical router for the optical switching of packets in Cartesian Networks (a novel network akin to mesh networks). The importance of all-optical packet switching/routing for convergent, next generation transport network is described. The selection of Cartesian routing as the basic routing methodology for all-optical packets is justified. The photonic packet switch/router architecture is studied in detail. Various design issues related to an all-optical node, such as header synchronization, header processing and optical buffering have been addressed. The functionality modelling of optical components and optical switch/router simulation algorithms are presented as well.

show abstract

Cartesian routing

Cited by 17 publications

References 2 publications

Using geographical coordinates to attain efficient route signaling in ad hoc networks

Using geographical coordinates to attain efficient route signaling in ad hoc networks

Minimizing routing overhead with Two-Hop Coordinate Awareness in ad hoc networks

Router Design for Optical Cartesian Networks

Contact Info

Product

Resources

About