• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 41
  • 2
  • 2
  • 2
  • 2
  • Tagged with
  • 52
  • 52
  • 52
  • 20
  • 13
  • 12
  • 12
  • 12
  • 10
  • 8
  • 7
  • 7
  • 7
  • 6
  • 6
  • 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

Web-based Real-Time Communication for Rescue Robots

Gallastegi, Akaitz January 2014 (has links)
In this thesis an audio and video streaming system is implemented for its use in rescue robots. WebRTC technology is used in order to stream in real time. Implemented in an architecture based on a Web server, two pages running WebRTC and a TURN1-STUN2 server, the system has been tested in terms of CPU and bandwidth utilization. Measurements show that when WebRTC is run in an Intel Core i3, less than 10% of CPU is used, whereas on smaller tablets the performance is not enough for running the application with the desired quality of service.
2

A Real-Time Communication Framework for Wireless Sensor Networks

AAL SALEM, MOHAMMED January 2009 (has links)
Doctor of Philosophy(PhD) / Recent advances in miniaturization and low power design have led to a flurry of activity in wireless sensor networks. Sensor networks have different constraints than traditional wired networks. A wireless sensor network is a special network with large numbers of nodes equipped with embedded processors, sensors, and radios. These nodes collaborate to accomplish a common task such as environment monitoring or asset tracking. In many applications, sensor nodes will be deployed in an ad-hoc fashion without careful planning. They must organize themselves to form a multihop, wireless communication network. In sensor network environments, much research has been conducted in areas such as power consumption, self-organisation techniques, routing between the sensors, and the communication between the sensor and the sink. On the other hand, real-time communication with the Quality of Service (QoS) concept in wireless sensor networks is still an open research field. Most protocols either ignore real time or simply attempt to process as fast as possible and hope that this speed is sufficient to meet the deadline. However, the introduction of real-time communication has created additional challenges in this area. The sensor node spends most of its life routing packets from one node to another until the packet reaches the sink; therefore, the node functions as a small router most of the time. Since sensor networks deal with time-critical applications, it is often necessary for communication to meet real time constraints. However, research that deals with providing QoS guarantees for real-time traffic in sensor networks is still in its infancy.This thesis presents a real-time communication framework to provide quality of service in sensor networks environments. The proposed framework consists of four components: First, present an analytical model for implementing Priority Queuing (PQ) in a sensor node to calculate the queuing delay. The exact packet delay for corresponding classes is calculated. Further, the analytical results are validated through an extensive simulation study. Second, report on a novel analytical model based on a limited service polling discipline. The model is based on an M/D/1 queuing system (a special class of M/G/1 queuing systems), which takes into account two different classes of traffic in a sensor node. The proposed model implements two queues in a sensor node that are served in a round robin fashion. The exact queuing delay in a sensor node for corresponding classes is calculated. Then, the analytical results are validated through an extensive simulation study. Third, exhibit a novel packet delivery mechanism, namely the Multiple Level Stateless Protocol (MLSP), as a real-time protocol for sensor networks to guarantee the traffic in wireless sensor networks. MLSP improves the packet loss rate and the handling of holes in sensor network much better than its counterpart, MMSPEED. It also introduces the k-limited polling model for the first time. In addition, the whole sending packets dropped significantly compared to MMSPEED, which it leads to decrease the consumption power. Fourth, explain a new framework for moving data from the sink to the user, at a low cost and low power, using the Universal Mobile Telecommunication System (UMTS), which is standard for the Third Generation Mobile System (3G). The integration of sensor networks with the 3G mobile network infrastructure will reduce the cost of building new infrastructures and enable the large-scale deployment of sensor networks
3

Software Design of A Soft Real-Time Communication Synthesis Method

Liao, Jian-Hong 08 September 2004 (has links)
In the era of system-on-chip, many hardware modules are embedded on a single chip. More messages communicated among on-chip modules. On-chip communication bandwidth is thus scaled up dramatically. It causes significant increase of routing area as well as relative reduction of system performance. It affects overall feasibility of a system chip. In order to solve the problem and meet the communication performance requirement of application systems. We need to consider factors that affect overall system performance and cost, communication resource allocation, message routing, and transmission control design. Thus, we proposed a soft real-time communication synthesis method. It applied the simulated annealing optimization method.. In the process, it carries out several tasks: calibration of dynamic communication cases, communication resource allocation, message routing path generation, and estimation of overall communication performance and system cost. In this research, we designed the experimental software of the communication synthesis method. We will perform experiments for its system evaluation to verify its effectiveness on system-on-chip designs.
4

A Real-Time Communication Framework for Wireless Sensor Networks

AAL SALEM, MOHAMMED January 2009 (has links)
Doctor of Philosophy(PhD) / Recent advances in miniaturization and low power design have led to a flurry of activity in wireless sensor networks. Sensor networks have different constraints than traditional wired networks. A wireless sensor network is a special network with large numbers of nodes equipped with embedded processors, sensors, and radios. These nodes collaborate to accomplish a common task such as environment monitoring or asset tracking. In many applications, sensor nodes will be deployed in an ad-hoc fashion without careful planning. They must organize themselves to form a multihop, wireless communication network. In sensor network environments, much research has been conducted in areas such as power consumption, self-organisation techniques, routing between the sensors, and the communication between the sensor and the sink. On the other hand, real-time communication with the Quality of Service (QoS) concept in wireless sensor networks is still an open research field. Most protocols either ignore real time or simply attempt to process as fast as possible and hope that this speed is sufficient to meet the deadline. However, the introduction of real-time communication has created additional challenges in this area. The sensor node spends most of its life routing packets from one node to another until the packet reaches the sink; therefore, the node functions as a small router most of the time. Since sensor networks deal with time-critical applications, it is often necessary for communication to meet real time constraints. However, research that deals with providing QoS guarantees for real-time traffic in sensor networks is still in its infancy.This thesis presents a real-time communication framework to provide quality of service in sensor networks environments. The proposed framework consists of four components: First, present an analytical model for implementing Priority Queuing (PQ) in a sensor node to calculate the queuing delay. The exact packet delay for corresponding classes is calculated. Further, the analytical results are validated through an extensive simulation study. Second, report on a novel analytical model based on a limited service polling discipline. The model is based on an M/D/1 queuing system (a special class of M/G/1 queuing systems), which takes into account two different classes of traffic in a sensor node. The proposed model implements two queues in a sensor node that are served in a round robin fashion. The exact queuing delay in a sensor node for corresponding classes is calculated. Then, the analytical results are validated through an extensive simulation study. Third, exhibit a novel packet delivery mechanism, namely the Multiple Level Stateless Protocol (MLSP), as a real-time protocol for sensor networks to guarantee the traffic in wireless sensor networks. MLSP improves the packet loss rate and the handling of holes in sensor network much better than its counterpart, MMSPEED. It also introduces the k-limited polling model for the first time. In addition, the whole sending packets dropped significantly compared to MMSPEED, which it leads to decrease the consumption power. Fourth, explain a new framework for moving data from the sink to the user, at a low cost and low power, using the Universal Mobile Telecommunication System (UMTS), which is standard for the Third Generation Mobile System (3G). The integration of sensor networks with the 3G mobile network infrastructure will reduce the cost of building new infrastructures and enable the large-scale deployment of sensor networks
5

Real-Time Communication over Switched Ethernet with Resource Reservation

Ashjaei, Mohammad January 2016 (has links)
Due to the need for advanced computer-controlled functionality in distributed embedded systems the requirements on network communication are becoming overly intricate. This dissertation targets the requirements that are concerned with real-time guarantees, run-time adaptation, resource utilization and flexibility during the development. The Flexible Time-Triggered Switched Ethernet (FTT-SE) and Hard Real-Time Ethernet Switching (HaRTES) network architectures have emerged as two promising solutions that can cater for these requirements. However, these architectures do not support multi-hop communication as they are originally developed for single-switch networks. This dissertation presents a fundamental contribution in multi-hop real-time communication over the FTT-SE and HaRTES architectures targeting the above mentioned requirements. It proposes and evaluates various solutions for scheduling and forwarding the traffic through multiple switches in these architectures. These solutions preserve the ability of dynamic adaptation without jeopardizing real-time properties of the architectures. Moreover, the dissertation presents schedulability analyses for the timeliness verification and evaluation of the proposed solutions as well as several protocols to support run-time adaptation in the multi-hop communication. Finally, the work led to an end-to-end resource reservation framework, based on the proposed multi-hop architectures, to support flexibility during the development of the systems. The efficiency of the proposed solutions is evaluated on various case studies that are inspired from industrial systems.
6

High performance fiber-optic interconnection networks for real-time computing systems

Jonsson, Magnus January 1999 (has links)
Parallel and distributed computing systems become more and more powerful and hence place increasingly higher demands on the networks that interconnect their processors or processing nodes. Many of the applications running on such systems, especially embedded systems applications, have real-time requirements and, with increasing application demands, high-performance networks are the hearts of these systems. Fiber-optic networks are good candidates for use in such systems in the future. This thesis contributes to the relatively unexplored area of fiber-optic networks for parallel and distributed real-time computer systems and  suggests and evaluates several fiber-optic networks and protocols. Two different technologies are used in the networks, WDM (Wavelength Division Multiplexing) and fiber-ribbon point-to-point links. WDM offers multiple channels, each with a capacity of several Gbit/s. A WDM star network in which protocols and services are efficiently integrated to support different kinds of real-time demands, especially hard ones, has been developed. The star-of-stars topology can be chosen to offer better network scalability. The WDM star architecture is attractive but its future success depends on components becoming more commercially mature. Fiber-ribbon links, offering instead an aggregated bandwidth of several Gbit/s, have already reached the market with a promising price/performance ratio. This has motivated the development and investigation of two new ring networks based on fiber-ribbon links. The networks take advantage of spatial bandwidth reuse, which can greatly enhance performance in applications with a significant amount of nearest downstream neighbor communication. One of the ring networks is control channel based and not only has support for real-time services like the WDM star network but also low level support for, e.g., group communication. The approach has been to develop network protocols with support for dynamic real-time services, out of time-deterministic static TDMA systems. The focus has been on functionality more than pure performance figures, mostly on real-time features but also on other types of functionality for parallel and distributed systems. Worst-case analyses, some simulations, and case studies are reported for the networks. The focus has been on embedded supercomputer applications, where each node itself can be a parallel computer, and it is shown that the networks are well suited for use in the radar signal processing systems studied. Other application examples in which these kinds of networks are valuable are distributed multimedia systems, satellite imaging and other image processing applications. / Technical report / School of Electrical and Computer Engineering, Chalmers University of Technology, Göteborg, Sweden, 0282-5406 ; 379
7

Scheduling and management of real-time communication in point-to-point wide area networks

Pope, Cheryl Lynn January 2003 (has links)
Applications with timing requirements, such as multimedia and live multi-user interaction, are becoming more prevalent in wide area networks. The desire to provide more predictable performance for such applications in packet switched wide area networks is evident in the channel management provided by Asynchronous Transfer Mode (ATM) networks and in the extensions to the Internet protocols proposed by the Internet Engineering Task Force (IETF) working groups on integrated and differentiated service. The ability to provide guarantees on the performance of traffic flows, such as packet delay and loss characteristics, relies on an accurate model of the traffic arrival and service at each node in the network. This thesis surveys the work in bounding packet delay based on various proposed queuing disciplines and proposes a method for more accurately defining the traffic arrival and worst case backlog experienced by packets. The methods are applied to the first in first out (FIFO) queuing discipline to define equations for determining the worst case backlog and queuing delay in multihop networks. Simulation results show a significant improvement in the accuracy of the delay bounds over existing bounds published in the literature. An improvement of two orders of magnitude can be realised for a ten hop path and the improvement increases exponentially with the length of the path for variable rate network traffic. The equations derived in the thesis also take into consideration the effect of jitter on delay, thereby removing the requirement for rate controllers or traffic shaping within the network. In addition to providing more accurate delay bounds, the problem of providing fault tolerance to channels with guaranteed quality of service (QoS) is also explored. This thesis introduces a method for interleaving resource requirements of backup channels to reduce the overall resource reservations that are required to provide guaranteed fault recovery with the same QoS as the original failed channel. An algorithm for selecting recovery paths that can meet a channel's QoS requirements during recovery is also introduced. / Thesis (Ph.D.)--Computer Science, 2003.
8

ARQ PROTOCOLS SUPPORTING QOS IN EMBEDDED SYSTEMS

Aydin Beheshtizadeh Mofrad, January 2008 (has links)
<p>Many efforts have been carried out to provide transmission reliability in the history of communication systems. As the demand for real-time applications increased, providing a reliable communication in a timely manner for such applications is strongly desired. Considering timing constraints makes the issue of achieving reliability more difficult. This thesis concentrates on providing reliability for real-time communication in embedded networks by achieving a timing analysis and using the ARQ concept. What is carried out in this thesis is providing retransmission in a real-time manner for embedded networks according to application request. The thesis work focuses on one packet retransmission over a point to point link, but the concept is rich and can be extended to cover application request in real-time embedded networks. Two methods have been fulfilled, and a simulation has been done on the timing analysis focusing on the performance in accepting real-time traffic in the form of separate channels for each application request. The protocol combines ARQ and a scheduling algorithm as a base to support retransmission for hard real-time applications in embedded networks.</p>
9

Fiber-Optic Interconnections in High-Performance Real-Time Computer Systems

Jonsson, Magnus January 1997 (has links)
<p>Future parallel computer systems for embedded real-time applications,where each node in itself can be a parallel computer, are predicted to havevery high bandwidth demands on the interconnection network. Otherimportant properties are time-deterministic latency and guarantees to meetdeadlines. In this thesis, a fiber-optic passive optical star network with amedium access protocol for packet switched communication in distributedreal-time systems is proposed. By using WDM (Wavelength DivisionMultiplexing), multiple channels, each with a capacity of several Gb/s, areobtained.</p><p>A number of protocols for WDM star networks have recently been proposed.However, the area of real-time protocols for these networks is quiteunexplored. The protocol proposed in this thesis is based on TDMA (TimeDivision Multiple Access) and uses a new distributed slot-allocationalgorithm with real-time properties. Services for both guarantee-seekingmessages and best-effort messages are supported for single destination,multicast, and broadcast transmission. Slot reserving can be used toincrease the time-deterministic bandwidth, while still having an efficientbandwidth utilization due to a simple slot release method.</p><p>By connecting several clusters of the proposed WDM star network by abackbone star, thus forming a star-of-stars network, we get a modular andscalable high-bandwidth network. The deterministic properties of thenetwork are theoretically analyzed for both intra-cluster and inter-clustercommunication, and computer simulations of intra-cluster communicationare reported. Also, an overview of high-performance fiber-opticcommunication systems is presented.</p>
10

Fibre-Optic AWG Networks Supporting Real-Time Communication in High-Performance Embedded Systems

Kunert, Kristina January 2008 (has links)
<p>High-performance embedded systems communicating heterogeneous traffic with high bandwidth and strict timing requirements are in need of more efficient communication solutions. This thesis proposes two multi-wavelength passive optical networks able to meet these demands. The networks are based upon a single-hop star topology with an Arrayed Waveguide Grating (AWG) placed in the centre. The intended application areas for the two networks are short range embedded communication systems like System Area Networks (SANs) and router architectures with electronic queuing. The AWG’s attractive property of spatial wavelength reuse, as well as the combination of fixed-tuned and tuneable transceivers in the end nodes, enables simultaneous control and data traffic transmission. This, in turn, makes it possible to support heterogeneous traffic with both hard and soft real-time constraints.</p><p>Additionally, two Medium Access Control (MAC) protocols, one for each network solution, are developed. Traffic scheduling is centrally controlled by a node, the protocol processor, residing together with the AWG in a hub. All nodes use Earliest Deadline First (EDF) scheduling and communicate with the protocol processor through physical control channels. A case study, including simulations, in the field of Radar Signal Processing (RSP) and simulations using periodic real-time traffic are conducted for the two application areas respectively, showing very good results. Further, a deterministic real-time analysis is conducted to provide throughput and delay guarantees for hard real-time traffic and an increase in guaranteed traffic is achieved through an analysis of existing traffic dependencies in a multichannel network. Simulation results incorporating the traffic dependency analysis indicate a considerable increase in the possible guaranteed throughput of hard real-time traffic.</p>

Page generated in 0.1458 seconds