Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 45 for “"Routing (Computer network management)"”.
-
Multi-level low energy adaptive clustering hierarchy (ML-LEACH): a routing solution for periodic data sensing in large-area wireless sensor network
Wireless sensor networks (WSN) can provide valuable services in scientific data collection and other military applications. Recent technological advances have led to the development of small, low-cost, and low-power microsensors. Almost all of these microsensors are battery-powered. They maybe …
-
Survivable routing in WDM networks with guaranteed minimum network bandwidth
In IP over WDM networks, IP links are realized by subscribing to lightpath services from a WDM network. Survivability is a key issue in designing such networks. There are two kinds of Lightpath services available: protected and unprotected. The research in [3] mainly considers the cases in which …
-
Efficient Publish/Subscribe System over Mobile Ad-Hoc Network
… dynamic and fragile nature of the mobile ad-hoc networks, in which participants have limited computing resources and battery, intermittent network connections, and mobile tasks. To address the aforementioned issue, this thesis proposes an efficient semantics-based publish/subscribe strategy. In …
-
Design and Use of Managed Overlay Networks
… quality of service (QoS), search, and resilient networks. The use of overlays, in turn, has led to more interest in improving their performance. The performance of an overlay network depends significantly on how the network is structured, i.e., the placement of the nodes in the underlying network …
-
Off-network control processing for scalable routing in very large sensor networks
Thesis (Ph. D.)--Michigan State University. Electrical Engineering, 2008
-
Design Space Analysis and a Novel Routing Agorithm for Unstructured Networks-on-Chip
Traditionally, on-chip network communication was achieved with shared medium networks where devices shared the transmission medium with only one device driving the network at a time. To avoid performance losses, it required a fast bus arbitration logic. However, a single shared bus has serious …
-
Performance improvements to the AODV routing protocol and multiple hop wireless routes : a thesis presented in partial fulfilment of the requirements for the degree of Masters of Engineering in Computer Systems Engineering at Massey University, Palmerston North, New Zealand
… of the Ad-hoc On-demand Distance Vector (AODV) routing protocol over multiple hop routes. The two specific areas that this research addressed were the dramatic decrease in throughput over multiple hop IEEE 802.11 wireless routes and the problems caused by the use of hello messages by AODV …
-
Path Planning under Failures in Wireless Sensor Networks
… path can be obtained in a wireless sensor network when sensors fail. Sensors are randomly deployed in a predefined geographical area, simulating the deployment of sensors from an airplane, and finding shortest path between all the sensors deployed based on distance. A major problem to …
-
Adaptive Routing Using SDN and NFV
… multimedia applications. Due to ever-increasing network traffic, it is challenging for ISPs to accomplish optimal network conditions. To achieve high-quality services implementation of network monitoring and QoS routing algorithm is inevitable. Also, several modifications occur while network …
-
End-to-end performance measurements for overlay flow engineering in the Internet
The heterogeneous and scalable best-effort IP routing forces packets to be forwarded in a manner that is insensitive to delay, loss and available bandwidth in specific sections of the Internet. This thesis presents short and long-term analysis of a targeted high-performance overlay flow-engineering …
-
Shortest Path in a Wireless Sensor Network with Multiple Sensor Failures
… path can be obtained in a wireless sensor network, between a source sensor and a destination sensor, in a hop-by-hop fashion, considering multiple sensor failures along the path of data transmission. A wireless sensor network consists of a number of sensors spread across a geographical …
-
Resource allocation and routing in multi-hop wireless networks
Thesis (Ph. D.)--Michigan State University. Computer Science, 2010
-
Efficient Communication Protocols for Underwater Acoustic Sensor Networks
Underwater sensor networks find applications in oceanographic data collection, pollution monitoring, offshore exploration, disaster prevention, assisted navigation, tactical surveillance, and mine reconnaissance. The enabling technology for these applications is acoustic wireless networking. …
-
Rate allocation and QoS support in wireless mesh networks
… D.)--Michigan State University. Department of Computer Science, 2009
-
Lexicographic path searches for FPGA routing
… searches to solve problems in FPGA detailed routing. Our contributions include the derivation of iteration limits for scalar implementations of negotiation congestion for standard floating point types and the identification of pathological cases for path choice. In the study of the …
-
Low-Overhead Opportunistic Routing for Wireless Ad Hoc and Sensor Networks in a Fading Environment
… of wireless sensors capable of forming multi-hop networks. Emerging applications of this technology such as surveillance and disaster monitoring have throughput and efficiency requirements not met by current routing algorithms. These requirements are also shared by ad-hoc networks. Early routing …
-
Non-Uniform Grid-Based Coordinated Routing in Wireless Sensor Networks
Wireless sensor networks are ad hoc networks of tiny battery powered sensor nodes that can organize themselves to form self-organized networks and collect information regarding temperature, light, and pressure in an area. Though the applications of sensor networks are very promising, sensor nodes …
Page 1 of 3