• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 67
  • 6
  • 4
  • 2
  • 1
  • 1
  • Tagged with
  • 93
  • 93
  • 93
  • 93
  • 67
  • 33
  • 30
  • 23
  • 18
  • 18
  • 18
  • 15
  • 11
  • 9
  • 9
  • 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.
1

Multi-level low energy adaptive clustering hierarchy (ML-LEACH) : a routing solution for periodic data sensing in large-area wireless sensor network

Huang, Bo January 2007 (has links)
Thesis (M.S.)--University of Hawaii at Manoa, 2007. / Includes bibliographical references (leaves 66-67). / viii, 67 leaves, bound ill. (some col.) 29 cm
2

Routing in delay tolerant networks /

Jain, Sushant, January 2005 (has links)
Thesis (Ph. D.)--University of Washington, 2005. / Vita. Includes bibliographical references (leaves 141-147).
3

Selfish routing

Roughgarden, Tim. January 2002 (has links) (PDF)
Thesis (Ph.D.)--Cornell University, 2002. / Adviser: Eva Tardos. Includes bibliographical references.
4

A greedy algorithm for non-atomic data dissemination in publish/subscribe network /

Barua, Chowdhury Sucharit, January 2007 (has links)
Thesis (M.S.)--University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 62-63)
5

Practical and efficient internet routing with competing interests /

Mahajan, Ratul. January 2005 (has links)
Thesis (Ph. D.)--University of Washington, 2005. / Vita. Includes bibliographical references (p. 123-135).
6

An adaptive distributed algorithm for path aggregation.

January 2008 (has links)
Zhang, Zhenyi. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 55-[58]). / Abstracts in Chinese and English. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Problem Formulation --- p.4 / Chapter 3 --- Examples --- p.7 / Chapter 3.1 --- Examples of Undirected Graph --- p.7 / Chapter 3.1.1 --- Example 1: SPF Routing --- p.7 / Chapter 3.1.2 --- Example 2: rings --- p.7 / Chapter 3.1.3 --- Example 3: grid --- p.8 / Chapter 3.1.4 --- Example 4: cube --- p.9 / Chapter 3.1.5 --- Example 5: random graph X --- p.10 / Chapter 3.1.6 --- Example 6: random graph Y --- p.10 / Chapter 3.2 --- An Example for Directive Graph --- p.11 / Chapter 4 --- The Framework --- p.13 / Chapter 4.1 --- The distributed algorithm --- p.13 / Chapter 4.2 --- The modules --- p.14 / Chapter 4.3 --- Path control --- p.15 / Chapter 4.4 --- The forwarding module --- p.18 / Chapter 4.5 --- The routing module --- p.19 / Chapter 4.5.1 --- Non-weighted Routing (NWR) --- p.19 / Chapter 4.5.2 --- Weighted Routing (WR) --- p.20 / Chapter 4.6 --- Packet Aggregation (PKA) --- p.21 / Chapter 5 --- Experiments of Path Aggregation --- p.23 / Chapter 5.1 --- System Setup --- p.24 / Chapter 5.2 --- Experiment Results --- p.25 / Chapter 6 --- Convergence --- p.28 / Chapter 6.1 --- Simulation study --- p.34 / Chapter 6.2 --- Optimality --- p.34 / Chapter 6.3 --- Speed of Convergence --- p.37 / Chapter 7 --- The adaptive property --- p.41 / Chapter 7.1 --- Adapting to new links --- p.42 / Chapter 7.2 --- Adapting to topology changing --- p.43 / Chapter 7.3 --- Adapting to interference and congestion --- p.45 / Chapter 7.4 --- Adapting to traffic flows --- p.45 / Chapter 7.5 --- Adapting to capacity --- p.46 / Chapter 8 --- Related works --- p.48 / Chapter 8.1 --- Spanning Tree --- p.48 / Chapter 8.2 --- Minimum Equivalent Directed Graph Problem --- p.49 / Chapter 8.3 --- Topology Control --- p.50 / Chapter 8.4 --- The Relationship with our problem --- p.53 / Chapter 9 --- Conclusion --- p.54
7

Survivable routing in WDM networks with guaranteed minimum network bandwidth

Wang, Ye January 2007 (has links)
Thesis (M.S.)--University of Hawaii at Manoa, 2007. / Includes bibliographical references. / vi, 47 leaves, bound ill. 29 cm
8

Non-uniform grid-based coordinated routing in wireless sensor networks

Kadiyala, Priyanka. Akl, Robert G., January 2008 (has links)
Thesis (M.S.)--University of North Texas, August, 2008. / Title from title page display. Includes bibliographical references.
9

Design and analysis of dynamic packet scheduling protocols for unidirectional optical buses /

Chen, Jing. January 2008 (has links)
Thesis (Ph.D.)--University of Texas at Dallas, 2008. / Includes vita. Includes bibliographical references (leaves 124-129)
10

High performance cache architectures for IP routing : replacement, compaction and sampling schemes

Guo, Ruirui, January 2007 (has links) (PDF)
Thesis (Ph. D.)--Washington State University, August 2007. / Includes bibliographical references (p. 103-105).

Page generated in 0.5178 seconds