NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • Tagged with
  • 5
  • 5
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 5 of 5 (0.053 seconds)

Spelling suggestions: "subject:"geometric couting"" "subject:"geometric douting""

1

Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram

Muhammad, Rashid Bin 30 November 2009 (has links)
No description available.
Computer Science
Steiner tree
Voronoi diagram
range assignment
geometric routing
2

Efficient Location Verification, Neighbor Discovery and Routing in Ad Hoc Wireless Networks

Vora, Adnan Zoeb 07 October 2009 (has links)
No description available.
Computer Science
Ad Hoc Wireless Networks
Location Verification
Neighbor Discovery
Sybil Attack
Geometric Routing
3

Local geometric routing algorithms for edge-augmented planar graphs

Wahid, Mohammad Abdul 20 September 2013 (has links)
Given a geometric graph G = (V,E), where V is the set of vertices and E is the set of edges and a source-target pair {s,t} is a subset of V, a local geometric routing algorithm seeks a route from s to t using only local neighborhood relationships. This thesis proposes a local geometric routing algorithm that uses only a single state bit as message overhead and guarantees delivery of messages in three different classes of edge-augmented planar graphs: convex subdivisions, quasi planar convex subdivisions (allow some augmented edges on a spanning convex subdivision) and 2-augmented triangulations (allow some augmented edges on a spanning triangulation). The proposed algorithm is origin oblivious (does not require the knowledge of the origin vertex s) and predecessor oblivious (does not require the knowledge of the predecessor vertex).
online routing algorithm
local routing algorithm
geometric routing algorithm
distributed routing algorithm
oblivious routing algorithm
1-bit memory local routing algorithm
predecessor-oblivious routing
origin-oblivious routing
4

Local geometric routing algorithms for edge-augmented planar graphs

Wahid, Mohammad Abdul 20 September 2013 (has links)
Given a geometric graph G = (V,E), where V is the set of vertices and E is the set of edges and a source-target pair {s,t} is a subset of V, a local geometric routing algorithm seeks a route from s to t using only local neighborhood relationships. This thesis proposes a local geometric routing algorithm that uses only a single state bit as message overhead and guarantees delivery of messages in three different classes of edge-augmented planar graphs: convex subdivisions, quasi planar convex subdivisions (allow some augmented edges on a spanning convex subdivision) and 2-augmented triangulations (allow some augmented edges on a spanning triangulation). The proposed algorithm is origin oblivious (does not require the knowledge of the origin vertex s) and predecessor oblivious (does not require the knowledge of the predecessor vertex).
online routing algorithm
local routing algorithm
geometric routing algorithm
distributed routing algorithm
oblivious routing algorithm
1-bit memory local routing algorithm
predecessor-oblivious routing
origin-oblivious routing
5

Concurrent Geometric Routing

Adamek, Jordan Matthew 28 July 2017 (has links)
No description available.
Computer Science

Page generated in 0.0561 seconds