• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 27
  • 6
  • 4
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 56
  • 56
  • 54
  • 36
  • 24
  • 16
  • 14
  • 12
  • 11
  • 10
  • 10
  • 9
  • 9
  • 9
  • 8
  • 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.
31

Cooperation in Wireless Networks

Sharma, Sushant 05 January 2011 (has links)
Spatial diversity, in the form of employing multiple antennas (i.e., MIMO), has proved to be very effective in increasing network capacity and reliability. However, equipping a wireless node with multiple antennas may not be practical, as the footprint of multiple antennas may not fit on a wireless node (particularly on handheld wireless devices). In order to achieve spatial diversity without requiring multiple antennas on the same node, the so-called cooperative communications (CC) has been introduced. Under CC, each node is equipped with only a single antenna and spatial diversity is achieved by exploiting the antennas on other nodes in the network through cooperative relaying. The goal of this dissertation is to maximize throughput at network level through CC at the physical layer. A number of problems are explored in this investigation. The main contributions of this dissertation can be summarized as follows. <b>1. Optimal Relay Assignment.</b> We first consider a simple CC model where each source-destination pair may employ only a single relay. For this three-node model, the choice of a relay node (among a set of available relay nodes) for a given session is critical in the overall network performance. We study the relay node assignment problem in a cooperative ad hoc network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network. Our objective is to assign the available relay nodes to different source-destination pairs so as to maximize the minimum data rate among all pairs. We present an optimal polynomial time algorithm, called ORA, that solves this problem. A novel idea in this algorithm is a "linear marking" mechanism, which maintains linear complexity at each iteration. We offer a formal proof of optimality for ORA and use numerical results to demonstrate its capability. <b>2. Incorporating Network Coding.</b> It has been shown that network coding (NC) can reduce the time-slot overhead when multiple session share the same relay node in CC. Such an approach is called network-coded CC (or NC-CC). Most of the existing works have mainly focused on the benefits of this approach. The potential adverse effect under NC-CC remains unknown. We explore this important problem by introducing the concept of network coding noise (NC noise). We show that due to NC noise, NC may not be always beneficial to CC. We substantiate this important finding in two important scenarios: analog network coding (ANC) in amplify-and-forward (AF) CC, and digital network coding (DNC) in decode-and-forward (DF) CC. We analyze the origin of NC noise via a careful study of signal aggregation at a relay node and signal extraction at a destination node. We derive a closed-form expression for NC noise at each destination node and show that the existence of NC noise could diminish the advantage of NC in CC. Our results shed new light on how to use NC in CC effectively. <b>3. Session Grouping and Relay Node Selection.</b> When there are multiple sessions in the network, it may be necessary to combine sessions into different groups, and then have each group select the most beneficial relay node for NC-CC. We study this joint grouping and relay node selection problem for NC-CC. By studying matching problems in hypergraphs, we show that this problem is NP-hard. We then propose a distributed and online algorithm to solve this problem. The key idea in our algorithm is to have each neighboring relay node of a newly joined session determine and offer the best group for this session from the groups that it is currently serving; and then to have the source node of this newly joined session select the best group among all received offers. We show that our distributed algorithm has polynomial complexity. Using extensive numerical results, we show that our distributed algorithm is near-optimal and adapts well to online network dynamics. <b>4. Grouping and Matching for Multi-Relay Cooperation.</b> Existing models of NC-CC consider only single relay node for each session group. We investigate how NC-CC behaves when multiple relay nodes are employed. For a given session, we develop closed form formulas for the mutual information and achievable rate under multi-relay NC-CC. In multi-relay NC-CC, the achievable rate of a session depends on the other sessions in its group as well as the set of relay nodes used for NC-CC. Therefore, we study NC-CC via joint optimization of grouping and matching of session and relay groups in an ad hoc network. Although we show that the joint problem is NP-hard, we develop an efficient polynomial time algorithm for grouping and matching (called G²M). G²M first builds beneficial relay groups for individual sessions. This is followed by multiple iterations during which sessions are combined with other sessions to form larger and better session groups (while corresponding relay groups are merged and updated accordingly). Using extensive numerical results, we show the efficiency and near optimality of our G²M algorithm. / Ph. D.
32

A Hardware/Software Stack for Heterogeneous Systems

Lehner, Wolfgang, Castrillon, Jeronimo, Lieber, Matthias, Klüppelholz, Sascha, Völp, Marcus, Asmussen, Nils, Aßmann, Uwe, Baader, Franz, Baier, Christel, Fettweis, Gerhard, Fröhlich, Jochen, Goens, Andrés, Haas, Sebastian, Habich, Dirk, Härtig, Hermann, Hasler, Mattis, Huismann, Immo, Karnagel, Tomas, Karol, Sven, Kumar, Akash, Leuschner, Linda, Ling, Siqi, Märcker, Steffen, Menard, Christian, Mey, Johannes, Nagel, Wolfgang, Nöthen, Benedikt, Peñaloza, Rafael, Raitza, Michael, Stiller, Jörg, Ungethüm, Annett, Voigt, Axel, Wunderlich, Sascha 17 July 2023 (has links)
Plenty of novel emerging technologies are being proposed and evaluated today, mostly at the device and circuit levels. It is unclear what the impact of different new technologies at the system level will be. What is clear, however, is that new technologies will make their way into systems and will increase the already high complexity of heterogeneous parallel computing platforms, making it ever so difficult to program them. This paper discusses a programming stack for heterogeneous systems that combines and adapts well-understood principles from different areas, including capability-based operating systems, adaptive application runtimes, dataflow programming models, and model checking. We argue why we think that these principles built into the stack and the interfaces among the layers will also be applicable to future systems that integrate heterogeneous technologies. The programming stack is evaluated on a tiled heterogeneous multicore.
33

Coded Wireless Video Broadcast/Multicast

She, James 29 July 2009 (has links)
Advancements in video coding, compact media display, and communication devices, particularly in emerging broadband wireless access networks, have created many foreseeable and exciting applications of video broadcast/multicast over the wireless meidum. For efficient and robust wireless video broadcast/multicast under fading, this thesis presents and examines a novel cross-layer framework that exploits the interplay between applying protections on a successively refinable video source and transmitting through a layered broadcast/multicast channel. The framework is realistically achieved and evaluated by using multiple description coding (MDC) on a scalable video source and using superposition coding (SPC) for layered broadcast/multicast transmissions. An analytical model using the total received/recovered video bitstreams from each coded wireless broadcast/multicast signal is developed, which serves as a metric of video quality for the system analysis and optimization. An efficient methodology has demonstrated that optimal power allocations and modulation selections can be practically determined to improve the broadcast/multicast video quality. From the information-theoretical perspective, a general closed-form formula is derived for the end-to-end distortion analysis of the proposed framework, which is applicable to any (n, k) protection code applied on a successive refinable source with a Gaussian distribution over layered Gaussian broadcast channels. The results reveal the scenarios for the proposed framework to lead to a lower distortion than a legacy system without any protection. By analyzing the characteristics of the closed-form formula, an efficient O(n log n) algorithm is developed to determine optimal k values in the (n, k) protection codes that minimize the distortion under the framework. Finally, a cross-layer design of logical SPC modulation is introduced to achieve layered broadcast/multicast for scalable video. It serves as an alternative for practically implementing the proposed framework of coded wireless video broadcast/multicast, if the hardware-based SPC component is not available in a wireless system. In summary, the thesis presents comprehensive analyses, simulations, and experiments to understand, investigate, and justify the effectiveness of the proposed cross-layer framework of coded wireless video broadcast/multicast. More importantly, this thesis contributes to the advancement in the related fields of communication engineering and information theory by introducing a new design dimension in terms of protection. This is unique when compared to previously-reported layered approaches that are often manipulating conventional parameters alone such as power and modulation scheme. The impact of this dimension was unapparent in the past, but is now proven as an effective means to enable high-quality, efficient, and robust wireless video broadcast/multicast for promising media applications.
34

Coded Wireless Video Broadcast/Multicast

She, James 29 July 2009 (has links)
Advancements in video coding, compact media display, and communication devices, particularly in emerging broadband wireless access networks, have created many foreseeable and exciting applications of video broadcast/multicast over the wireless meidum. For efficient and robust wireless video broadcast/multicast under fading, this thesis presents and examines a novel cross-layer framework that exploits the interplay between applying protections on a successively refinable video source and transmitting through a layered broadcast/multicast channel. The framework is realistically achieved and evaluated by using multiple description coding (MDC) on a scalable video source and using superposition coding (SPC) for layered broadcast/multicast transmissions. An analytical model using the total received/recovered video bitstreams from each coded wireless broadcast/multicast signal is developed, which serves as a metric of video quality for the system analysis and optimization. An efficient methodology has demonstrated that optimal power allocations and modulation selections can be practically determined to improve the broadcast/multicast video quality. From the information-theoretical perspective, a general closed-form formula is derived for the end-to-end distortion analysis of the proposed framework, which is applicable to any (n, k) protection code applied on a successive refinable source with a Gaussian distribution over layered Gaussian broadcast channels. The results reveal the scenarios for the proposed framework to lead to a lower distortion than a legacy system without any protection. By analyzing the characteristics of the closed-form formula, an efficient O(n log n) algorithm is developed to determine optimal k values in the (n, k) protection codes that minimize the distortion under the framework. Finally, a cross-layer design of logical SPC modulation is introduced to achieve layered broadcast/multicast for scalable video. It serves as an alternative for practically implementing the proposed framework of coded wireless video broadcast/multicast, if the hardware-based SPC component is not available in a wireless system. In summary, the thesis presents comprehensive analyses, simulations, and experiments to understand, investigate, and justify the effectiveness of the proposed cross-layer framework of coded wireless video broadcast/multicast. More importantly, this thesis contributes to the advancement in the related fields of communication engineering and information theory by introducing a new design dimension in terms of protection. This is unique when compared to previously-reported layered approaches that are often manipulating conventional parameters alone such as power and modulation scheme. The impact of this dimension was unapparent in the past, but is now proven as an effective means to enable high-quality, efficient, and robust wireless video broadcast/multicast for promising media applications.
35

Communication and Coordination in Wireless Multimedia Sensor and Actor Networks

Melodia, Tommaso 03 July 2007 (has links)
Wireless Sensor and Actor Networks (WSANs) are distributed systems of heterogeneous devices, referred to as sensors and actors, which sense, control, and interact with the physical environment. Sensors are low-cost, low-power, multi-functional devices that communicate untethered in short distances. Actors are resource-rich devices that collect and process sensor data and consequently perform actions on the environment. This thesis is concerned with coordination and communication problems in WSANs, in datacentric and multimedia application scenarios. First, communication and coordination problems are jointly addressed in a unifying framework for the case of static actors. A sensor-actor coordination model is proposed, based on an event-driven partitioning paradigm. Sensors are partitioned into different sets and each set is associated with a different actor. Data delivery trees are created to optimally react to the event and timely deliver event data with minimum energy expenditure. The optimal partitioning strategy is determined bymathematical programming, and a distributed solution is also proposed. Furthermore, the actor-actor coordination problem is formulated as an optimal task assignment problem, and a distributed solution of the problem based on an analogy with a one-shot auction is presented. Application scenarios for WSANs with mobile actors are then studied. A location management scheme is introduced to handle the mobility of actors with minimal energy consumption for resource-constrained sensors. The proposed scheme, which is the first localization scheme specifically designed for WSANs, is shown to consistently reduce the energy consumption with respect to existing localization services for ad hoc and sensor networks. An optimal energy-aware forwarding rule is then derived for sensor-actor communication in fast varying Rayleigh channels. The proposed scheme allows controlling the delay of the data-delivery process based on power control, and reacts to network congestion by diverting traffic from congested to lightly-loaded actors. The mobility of actors is coordinated to optimally accomplish application-specific tasks, based on a nonlinear optimization model that accounts for location and capabilities of heterogeneous actors. The research challenges for delivery of multimedia traffic in wireless sensor and actor networks are then outlined. Finally, a cross-layer communication architecture based on Ultra Wide Band communications is described, whose design objective is to reliably and flexibly deliver QoS to multimedia applications in WSANs, by carefully leveraging and controlling interactions among layers according to application requirements. Performance evaluation shows how the proposed solution achieves the performance objectives of wireless sensor and actor networks.
36

Improving the Capacity in Wireless Ad Hoc Networks through Multiple Channel Operation: Design Principles and Protocols

Gong, Michelle Xiaohong 07 July 2005 (has links)
Despite recent advances in wireless local area network (WLAN) technologies, today's WLANs still cannot offer the same data rates as their wired counterparts. The throughput problem is further aggravated in multi-hop wireless environments due to collisions and interference caused by multi-hop routing. Because all current IEEE 802.11 physical (PHY) standards divide the available frequency into several orthogonal channels, which can be used simultaneously within a neighborhood, increasing capacity by exploiting multiple channels becomes particularly appealing. To improve the capacity of wireless ad hoc networks by exploiting multiple available channels, I propose three principles that facilitate the design of efficient distributed channel assignment protocols. Distributed channel assignment problems have been proven to be <i>NP</i>-complete and, thus, computationally intractable. Though being a subject of many years of research, distributed channel assignment remains a challenging problem. There exist only a few heuristic solutions, none of which is efficient, especially for the mobile ad hoc environment. However, protocols that implement the proposed design principles are shown to require fewer channels and exhibit significantly lower communication, computation, and storage complexity, compared with existing approaches. As examples, I present two such protocols that build on standard reactive and proactive routing protocols. In addition, I prove the correctness of the algorithms and derive an upper bound on the number of channels required to both resolve collisions and mitigate interference. A new multi-channel medium access control (MC-MAC) protocol is also proposed for multi-hop wireless ad hoc networks. MC-MAC is compatible with the IEEE 802.11 medium access control (MAC) standard and imposes the minimum system requirements among all existing multi-channel MAC protocols. In addition, simulation results show that even with only a single half-duplex transceiver, MC-MAC, by exploiting multiple channels, can offer up to a factor of four improvement in throughput over the IEEE 802.11 MAC protocol. The reduction in delay is even more significant. Therefore, the MC-MAC protocol and the accompanying distributed channel assignment protocols constitute an effective solution to the aforementioned performance problem in a multi-hop wireless network. Finally, I generalize the cross-layer design principle to more general networking functions and present a network architecture to motivate and facilitate cross-layer designs in wireless networks. A literature survey is provided to validate the proposed cross-layer design architecture. Current cross-layer design research can be categorized into two classes: joint-layer design using optimization techniques, and adaptive techniques based on system-profile and/or QoS requirements. Joint-layer design based on optimization techniques can achieve optimal performance, but at the expense of complexity. Adaptive schemes may achieve relatively good performance with less complexity. Nevertheless, without careful design and a holistic view of the network architecture, adaptive schemes may actually cause more damage than benefit. / Ph. D.
37

Multiple Description Video Communications in Wireless Ad Hoc Networks

Cheng, Xiaolin 29 June 2005 (has links)
As developments in wireless ad hoc networks continue, there is an increasing expectation with regard to supporting content-rich multimedia communications (e.g., video) in such networks, in addition to simple data communications. The recent advances in multiple description (MD) video coding have made it highly suitable for multimedia applications in such networks. In this thesis, we study three important problems regarding multiple description video communications in wireless ad hoc networks. They are multipath routing for MD video, MD video multicast, and joint routing and server selection for MD video in wireless ad hoc networks. In multipath routing for MD video problem, we follow an applicationcentric cross-layer approach and formulate an optimal routing problem that minimizes the application layer video distortion. We show that the optimization problem has a highly complex objective function and an exact analytic solution is not obtainable. However, we find that a metaheuristic approach such as Genetic Algorithms (GAs) is eminently effective in addressing this type of complex cross-layer optimization problems. We provide a detailed solution procedure for the GA-based approach, as well as a tight lower bound for video distortion. We use numerical results to compare this approach to several other approaches and demonstrate its superior performance. In MD video multicast problem, we take the similar application-centric, cross-layer approach as in the multipath routing problem. We propose an MD video multicast scheme where multiple source trees are used. Furthermore, each video description is coded into multiple layers in order to cope with diversity in wireless link bandwidths. Based on this multicast model, we formulate the multicast routing as a combinatorial optimization problem and apply Genetic Algorithm (GA)-based metaheuristic procedure to solove this problem. Performance comparisons with existing approaches show significant gains for a wide range of network operating conditions. In the last problem, we study the important problem of joint routing and server selection for MD video in ad hoc networks. We formulate the task as a combinatorial optimization problem and present tight lower and upper bounds for the achievable distortion. The upper bound also provides a feasible solution to the formulated problem. Our extensive numerical results show that the bounds are very close to each other for all the cases studied, indicating the near-global optimality of the derived upper bounding solution. Moreover, we observe significant gains in video quality achieved by the proposed approach over existing server selection schemes. This justifies the importance of jointly considering routing and server selection for optimal MD video streaming in wireless ad hoc networks. / Master of Science
38

A Sleep-Scheduling-Based Cross-Layer Design Approach for Application-Specific Wireless Sensor Networks

Ha, Rick Wan Kei January 2006 (has links)
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost over a wide area. To extend the functional lifetime of battery-operated sensor nodes, stringent sleep scheduling strategies with communication duty cycles running at sub-1% range are expected to be adopted. Although ultra-low communication duty cycles can cast a detrimental impact on sensing coverage and network connectivity, its effects can be mitigated with adaptive sleep scheduling, node deployment redundancy and multipath routing within the mesh WSN topology. This work proposes a cross-layer organizational approach based on sleep scheduling, called Sense-Sleep Trees (SS-Trees), that aims to harmonize the various engineering issues and provides a method to extend monitoring capabilities and operational lifetime of mesh-based WSNs engaged in wide-area surveillance applications. Various practical considerations such as sensing coverage requirements, duty cycling, transmission range assignment, data messaging, and protocol signalling are incorporated to demonstrate and evaluate the feasibility of the proposed design approach.
39

Performance Modeling, Design and Analysis of Transport Mechanisms in Integrated Heterogeneous Wireless Networks

Rutagemwa, Humphrey January 2007 (has links)
Recently, wireless access to Internet applications and services has attracted a lot of attention. However, there is no single wireless network that can meet all mobile users’ requirements. Con-sequently, integrated heterogeneous wireless networks are introduced to meet diverse wireless Internet applications and services requirements. On the other hand, integrated heterogeneous wireless networks pose new challenges to the design and development of reliable transport mechanisms. Wireless Application Protocol version 2 (WAP 2.0) is one of the promising trans-port mechanisms. It uses wireless profiled TCP (WP-TCP), which is fully compatible with TCP, as one of the reliable transport protocols to cope with the wireless link impairments. For WAP 2.0 to continue providing reliable and efficient transport services in the future, one of the key is-sues is to thoroughly study, understand, and improve its performance in integrated heterogeneous wireless networks. In this thesis, we develop analytical frameworks and propose a solution to respectively study and improve the performance of WP-TCP in integrated heterogeneous wireless networks. Spe-cifically, we consider WP-TCP short- and long-lived flows over integrated wireless local area network (WLAN) and wireless wide area network (WWAN), where WLAN can be static or mo-bile. In order to facilitate the analysis of WP-TCP performance in integrated WLAN and WWAN, we first construct a novel WLAN link model, which captures the impact of both uncor-related and correlated transmission errors, and derive mathematical expressions that describe packet loss probability and packet loss burst length over WWAN-WLAN link. Then, we develop analytical frameworks for studying the performance of WP-TCP short- and long-lived flows. Differently from those reported in the literature, our analytical framework for WP-TCP short-lived flows takes into account both correlated and uncorrelated packet losses. Furthermore, our analytical framework for long-lived flow can be used to study the short-term (during vertical handover) and long-term performances of WP-TCP and it captures the effects of vertical handover, such as excessive packet losses and sudden change in network characteristics, which are commonly experienced in integrated static WLAN and WWAN. By using the devel-oped analytical frameworks, we extensively analyze the performance of WP-TCP flows and in-vestigate the optimal protocol design parameters over a wide range of network conditions. Finally, based on our analytical studies, we propose a receiver-centric loosely coupled cross-layer design along with two proactive schemes, which significantly improve the vertical hand-over performance. The proposed solution is easy to implement and deploy, compatible with tra-ditional TCP, and robust in the absence of cross-layer information. Extensive simulations have been conducted to confirm the effectiveness and practicability of our schemes.
40

A Sleep-Scheduling-Based Cross-Layer Design Approach for Application-Specific Wireless Sensor Networks

Ha, Rick Wan Kei January 2006 (has links)
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost over a wide area. To extend the functional lifetime of battery-operated sensor nodes, stringent sleep scheduling strategies with communication duty cycles running at sub-1% range are expected to be adopted. Although ultra-low communication duty cycles can cast a detrimental impact on sensing coverage and network connectivity, its effects can be mitigated with adaptive sleep scheduling, node deployment redundancy and multipath routing within the mesh WSN topology. This work proposes a cross-layer organizational approach based on sleep scheduling, called Sense-Sleep Trees (SS-Trees), that aims to harmonize the various engineering issues and provides a method to extend monitoring capabilities and operational lifetime of mesh-based WSNs engaged in wide-area surveillance applications. Various practical considerations such as sensing coverage requirements, duty cycling, transmission range assignment, data messaging, and protocol signalling are incorporated to demonstrate and evaluate the feasibility of the proposed design approach.

Page generated in 0.1054 seconds