VTechWorks Repository :: Browsing by Author "DaSilva, Luiz A."

Browsing by Author "DaSilva, Luiz A."

Now showing 1 - 20 of 124

Abnormal Behavior Detection Based on Traffic Pattern Categorization in Mobile Cellular Networks
De Almeida, J. M.; Pontes, C. F. T.; DaSilva, Luiz A.; Both, C. B.; Gondim, J. J. C.; Ralha, Celia G.; Marotta, M. A. (IEEE, 2021-01-01)
Abnormal behavior in mobile cellular networks can cause network faults and consequent cell outages, a major reason for operational cost increase and revenue loss for operators. Nonetheless, network faults and cell outages can be avoided by monitoring abnormal situations in the network and acting accordingly. Thus, anomaly detection is an important component of self-healing control and network management. Network operators may use the detected abnormal behavior to quantify numerically their intensity. The quantification of abnormal behavior assists the characterization of potential regions for infrastructure updates and to support the creation of public policies for local connectivity enhancements. We propose an unsupervised learning solution for anomaly detection in mobile networks using Call Detail Records (CDR) data. We evaluate our solution using a real CDR data set provided by an Italian operator and compare it against other state-of-the-art solutions, showing a performance improvement of around 35%. We also demonstrate the relevance of considering the distinct traffic patterns of diverging geographic areas for anomaly detection in mobile networks, an aspect often ignored in the literature.
Adaptation in Reputation Management Systems for Ad hoc Networks
Refaei, Mohamed Tamer (Virginia Tech, 2007-02-02)
An ad hoc network adopts a decentralized unstructured networking model that depends on node cooperation for key network functionalities such as routing and medium access. The significance of node cooperation in ad hoc networks makes network survival particularly sensitive to insider node behavior. The presence of selfish or malicious nodes in an ad hoc network could greatly degrade the network performance and might even result in a total communication breakdown. Consequently, it is important for both security and performance reasons to discourage, expose, and react to such damaging misbehavior. Reputation management systems have been proposed to mitigate against such misbehavior in ad hoc networks. The functions of a reputation management system are to evaluate nodes' quality of behavior based on their cooperation (evaluation), distinguish between well-behaved and misbehaving nodes (detection), and appropriately react to misbehaving nodes (reaction). A significant number of reputation management systems have been proposed for ad hoc networks to date. However, there has been no attempt to consolidate all current research into a formal framework for reputation management systems. The lack of a formal framework is a potential weakness of the research field. For example, a formal comparison of proposed reputation management systems has remained difficult, mainly due to the lack of a formal framework upon which the comparison could be based. There is also a lack of formal metrics that could be used for quantitative evaluation and comparison of reputation management systems. Another major shortcoming in this research field is the assumption that the functions of reputation management (evaluation, detection, and reaction) are carried out homogeneously across time and space at different nodes. The dynamic nature of ad hoc networks causes node behavior to vary spatially and temporally due to changes in the local and network-wide conditions. Reputation management functions do not adapt to such changes, which may impact the system accuracy and promptness. We herein recognize an adaptive reputation management system as one where nodes carry out the reputation management functions heterogeneously across time and space according to the instantaneous perception of each of its surrounding network conditions. In this work, we address the above concerns. We develop a formal framework for reputation management systems upon which design, evaluation, and comparison of reputation management systems can be based. We define and discuss the different components of the framework and the interactions among them. We also define formal metrics for evaluation of reputation management systems. The metrics assess both, the effectiveness (security issues) of a reputation management system in detecting misbehavior and limiting its negative impact on the network, and its efficiency (performance issues) in terms of false positives and overhead exerted by the reputation management system on the network. We also develop ARMS, an autonomous reputation management system, based on the formal framework. The theoretical foundation of ARMS is based on the theory of Sequential Probability Ratio Test introduced by Wald. In ARMS, nodes independently and without cooperation manage their reputation management system functions. We then use ARMS to investigate adaptation in reputation management systems. We discuss some of the characteristics of an adaptive reputation management system such as sensitivity, adaptability, accuracy, and promptness. We consider how the choice of evaluation metric, typically employed by the evaluation function for assessment of node behavior, may impact the sensitivity and accuracy of node behavior evaluation. We evaluate the sensitivity and accuracy of node behavior evaluation using a number of metrics from the network and medium access layer. We then introduce a time-slotted approach to enhance the sensitivity of the evaluation function and show how the duration of an evaluation slot can adapt according to the network activity to enhance the system accuracy and promptness. We also show how the detection function can adapt to the network conditions by using the node's own behavior as a benchmark to set its detection parameters. To the best of our knowledge, this is the first work to explore the adaptation of the reputation management functions in ad hoc networks.
Adaptive Asymmetric Slot Allocation for Heterogeneous Traffic in WCDMA/TDD Systems
Park, JinSoo (Virginia Tech, 2004-07-28)
Even if 3rd and 4th generation wireless systems aim to achieve multimedia services at high speed, it is rather difficult to have full-fledged multimedia services due to insufficient capacity of the systems. There are many technical challenges placed on us in order to realize the real multimedia services. One of those challenges is how efficiently to allocate resources to traffic as the wireless systems evolve. The review of the literature shows that strategic manipulation of traffic can lead to an efficient use of resources in both wire-line and wireless networks. This aspect brings our attention to the role of link layer protocols, which is to orchestrate the transmission of packets in an efficient way using given resources. Therefore, the Media Access Control (MAC) layer plays a very important role in this context. In this research, we investigate technical challenges involving resource control and management in the design of MAC protocols based on the characteristics of traffic, and provide some strategies to solve those challenges. The first and foremost matter in wireless MAC protocol research is to choose the type of multiple access schemes. Each scheme has advantages and disadvantages. We choose Wireless Code Division Multiple Access/Time Division Duplexing (WCDMA/TDD) systems since they are known to be efficient for bursty traffic. Most existing MAC protocols developed for WCDMA/TDD systems are interested in the performance of a unidirectional link, in particular in the uplink, assuming that the number of slots for each link is fixed a priori. That ignores the dynamic aspect of TDD systems. We believe that adaptive dynamic slot allocation can bring further benefits in terms of efficient resource management. Meanwhile, this adaptive slot allocation issue has been dealt with from a completely different angle. Related research works are focused on the adaptive slot allocation to minimize inter-cell interference under multi-cell environments. We believe that these two issues need to be handled together in order to enhance the performance of MAC protocols, and thus embark upon a study on the adaptive dynamic slot allocation for the MAC protocol. This research starts from the examination of key factors that affect the adaptive allocation strategy. Through the review of the literature, we conclude that traffic characterization can be an essential component for this research to achieve efficient resource control and management. So we identify appropriate traffic characteristics and metrics. The volume and burstiness of traffic are chosen as the characteristics for our adaptive dynamic slot allocation. Based on this examination, we propose four major adaptive dynamic slot allocation strategies: (i) a strategy based on the estimation of burstiness of traffic, (ii) a strategy based on the estimation of volume and burstiness of traffic, (iii) a strategy based on the parameter estimation of a distribution of traffic, and (iv) a strategy based on the exploitation of physical layer information. The first method estimates the burstiness in both links and assigns the number of slots for each link according to a ratio of these two estimates. The second method estimates the burstiness and volume of traffic in both links and assigns the number of slots for each link according to a ratio of weighted volumes in each link, where the weights are driven by the estimated burstiness in each link. For the estimation of burstiness, we propose a new burstiness measure that is based on a ratio between peak and median volume of traffic. This burstiness measure requires the determination of an observation window, with which the median and the peak are measured. We propose a dynamic method for the selection of the observation window, making use of statistical characteristics of traffic: Autocorrelation Function (ACF) and Partial ACF (PACF). For the third method, we develop several estimators to estimate the parameters of a traffic distribution and suggest two new slot allocation methods based on the estimated parameters. The last method exploits physical layer information as another way of allocating slot to enhance the performance of the system. The performance of our proposed strategies is evaluated in various scenarios. Major simulations are categorized as: simulation on data traffic, simulation on combined voice and data traffic, simulation on real trace data. The performance of each strategy is evaluated in terms of throughput and packet drop ratio. In addition, we consider the frequency of slot changes to assess the performance in terms of control overhead. We expect that this research work will add to the state of the knowledge in the field of link-layer protocol research for WCDMA/TDD systems.
Adaptive Height Optimization for Cellular-Connected UAVs: A Deep Reinforcement Learning Approach
Fonseca, Erika; Galkin, Boris; Amer, Ramy; DaSilva, Luiz A.; Dusparic, Ivana (IEEE, 2023-01-19)
Providing reliable connectivity to cellular-connected Unmanned Aerial Vehicles (UAVs) can be very challenging; their performance highly depends on the nature of the surrounding environment, such as density and heights of the ground Base Stations (BSs). On the other hand, tall buildings might block undesired interference signals from ground BSs, thereby improving the connectivity between the UAVs and their serving BSs. To address the connectivity of UAVs in such environments, this paper proposes a Reinforcement Learning (RL) algorithm to dynamically optimise the height of a UAV as it moves through the environment, with the goal of increasing the throughput or spectrum ef ciency that it experiences. The proposed solution is evaluated in two settings: using a series of generated environments where we vary the number of BS and building densities, and in a scenario using real-world data obtained from an experiment in Dublin, Ireland. Results show that our proposed RL-based solution improves UAV Quality of Service (QoS) by 6% to 41%, depending on the scenario. We also conclude that, when ying at heights higher than the buildings, building density variation has no impact on UAV QoS. On the other hand, BS density can negatively impact UAV QoS, with higher numbers of BSs generating more interference and deteriorating UAV performance.
Adaptive Protocols to Improve TCP/IP Performance in an LMDS Network using a Broadband Channel Sounder
Eshler, Todd Jacob (Virginia Tech, 2002-04-22)
Virginia Tech researchers have developed a broadband channel sounder that can measure channel quality while a wireless network is in operation. Channel measurements from the broadband sounder hold the promise of improving TCP/IP performance by trigging configuration changes in an adaptive data link layer protocol. We present an adaptive data link layer protocol that can use different levels of forward error correction (FEC) codes and link layer automatic retransmission request (ARQ) to improve network and transport layer performance. Using a simulation model developed in OPNET, we determine the effects of different data link layer protocol configurations on TCP/IP throughput and end-to-end delay using a Rayleigh fading channel model. Switching to higher levels of FEC encoding improves TCP/IP throughput for high bit error rates, but increases end-to-end delay of TCP/IP segments. Overall TCP/IP connections with link layer ARQ showed approximately 150 Kbps greater throughput than without ARQ, but lead to the highest end-to-end delay for high bit error rate channels. Based on the simulation results, we propose algorithms to maximize TCP/IP throughput and minimize end-to-end delay using the current bit error rate of the channel. We propose a metric, carrier-to-interference ratio (CIR) that is calculated from data retrieved from the broadband channel sounder. We propose algorithms using the carrier-to-interference ratio to control TCP/IP throughput and end-to-end delay. The thesis also describes a monitor program to use in the broadband wireless system. The monitor program displays data collected from the broadband sounder and controls the settings for the data link layer protocol and broadband sounder while the network is in operation.
AI-driven F-RANs: Integrating Decision Making Considering Different Time Granularities
DeAlmeida, Jonathan M.; DaSilva, Luiz A.; Both, Cristiano Bonato; Ralha, Celia G.; Marotta, Marcelo A. (IEEE, 2021-06-07)
Cloud and fog-based networks are promising paradigms for vehicular and mobile networks. Fog Radio Access Networks (F-RANs), in particular, can offload computation tasks to the network edge and reduce the latency. Artificial Intelligence (AI) techniques can be used in F-RANs to achieve, for example, enhanced energy efficiency and increased throughput. Nonetheless, the appropriate technique selection must consider the different time granularities at which decision-making occurs in F-RANs. We discuss the benefits and challenges of implementing an AI-driven F-RAN considering different timescales, highlighting key Machine Learning (ML) techniques for each granularity. Finally, we discuss the challenges and opportunities to integrate different ML solutions in F-RANs.
AI-Powered Real-Time Channel Awareness and 5G NR Radio Access Network Scheduling Optimization
Wang, Ying; Gorski, Adam; DaSilva, Luiz A. (IEEE, 2021-04-19)
As with any other wireless technology, 5G is not immune to jamming. To achieve consistent performance, network resource scheduling must be optimized in a way that reacts to jamming in the NR channel environment. This paper presents a cognitive system for real-time Channel Awareness and Radio Access Network (RAN) Scheduling (CARS) optimization based on multi-dimensional temporal machine learning models. Our system automatically detects and classifies jamming in the channel environment and optimizes scheduling based on classification results and collected link parameters. Based on over-the-air (OTA) experiments, detection and classification time is less than 0.8 seconds, which enables real-time optimization. The system is evaluated and verified for OTA experimentation through integration to our end-to-end NR system. An Automated Jamming Module (AJM) is designed and implemented. Connecting the AJM to our NR system enables a comprehensive evaluation environment for our Jamming Detection and Classification Model (JDCM) and Modulation and Coding Scheme optimization model. The improvement in connection resiliency against Control Resource Set jamming is proof of the CARS concept for real-time channel awareness and scheduling optimization. Depending on channel conditions, CARS achieves a 30% or higher improvement in NR system throughput.
AIRTIME: End-to-end Virtualization Layer for RAN-as-a-Service in Future Multi-Service Mobile Networks
Kist, Maicon; Santos, Joao F.; Collins, Diarmuid; Rochol, Juergen; DaSilva, Luiz A.; Both, Cristiano (IEEE, 2020)
Future mobile networks are envisioned to become multi-service systems, enabling the dynamic deployment of services with vastly different performance requirements, accommodating the needs of diverse service providers. Virtualizing the mobile network infrastructure is of fundamental importance for realizing this vision in a cost-effective manner. While there have been extensive research efforts in virtualization for the mobile core network, virtualization in the radio access network (RAN) is still at an early stage. In this paper, we present AIRTIME, a new RAN slicing system that enables the dynamic on-the-fly virtualization of RANs, with the programmability required by service providers to customize any aspect of their virtual RAN to meet their service needs. We present a prototype implementation of AIRTIME and evaluate the: (i) capacity to create virtual RANs on-the-fly, (ii) performance experienced by slice owners, (iii) isolation among multiple virtual RANs sharing the same physical infrastructure, and (iv) scalability to accommodate a large number of virtual RANs.
Analysis and Design of Cognitive Radio Networks and Distributed Radio Resource Management Algorithms
Neel, James O'Daniell (Virginia Tech, 2006-09-06)
Cognitive radio is frequently touted as a platform for implementing dynamic distributed radio resource management algorithms. In the envisioned scenarios, radios react to measurements of the network state and change their operation according to some goal driven algorithm. Ideally this flexibility and reactivity yields tremendous gains in performance. However, when the adaptations of the radios also change the network state, an interactive decision process is spawned and once desirable algorithms can lead to catastrophic failures when deployed in a network. This document presents techniques for modeling and analyzing the interactions of cognitive radio for the purpose of improving the design of cognitive radio and distributed radio resource management algorithms with particular interest towards characterizing the algorithms' steady-state, convergence, and stability properties. This is accomplished by combining traditional engineering and nonlinear programming analysis techniques with techniques from game to create a powerful model based approach that permits rapid characterization of a cognitive radio algorithm's properties. Insights gleaned from these models are used to establish novel design guidelines for cognitive radio design and powerful low-complexity cognitive radio algorithms. This research led to the creation of a new model of cognitive radio network behavior, an extensive number of new results related to the convergence, stability, and identification of potential and supermodular games, numerous design guidelines, and several novel algorithms related to power control, dynamic frequency selection, interference avoidance, and network formation. It is believed that by applying the analysis techniques and the design guidelines presented in this document, any wireless engineer will be able to quickly develop cognitive radio and distributed radio resource management algorithms that will significantly improve spectral efficiency and network and device performance while removing the need for significant post-deployment site management.
Analysis of the Radiation Mechanisms in and Design of Tightly-Coupled Antenna Arrays
Vogler, Terry Richard (Virginia Tech, 2010-09-10)
The objective of this research is to design well-tuned, wideband elements for thin planar or cylindrically conformal arrays of balanced elements fed over ground. These arrays have closely spaced elements to achieve wide bandwidths through mutual coupling. This dissertation develops two wideband designs in infinite, semi-infinite, and finite array configurations. The infinite array is best for element tuning. This research advances a concept of a distributed, parallel capacitance between elements and across feeds that must be mutually altered for tuning. Semi-infinite techniques limit the problem space and determine the proper resistive loads to control the low-frequency array-guided surface wave (AGSW). The tight physical placement also forms a periodic structure that, along with the array boundary, launches a wave across the array surface. Options to suppress this surface wave are resistive loading and cylindrical conformations. AGSW control is necessary to achieve a maximum bandwidth, but lower radiation or aperture efficiency results. Conformation is shown to be an ineffective method for AGSW control alone. The Wrapped Bowtie design emerges as a novel design offering nearly a 10:1 bandwidth as a finite array over ground. Some bandwidth comes from the losses in radiation efficiency, which is necessary to control the AGSW; however, its simulated VSWR < 3 bandwidth in an infinite array is 7.24:1 with full efficiency. Less than perfect efficiency is required to mitigate surface wave effects, unless bandwidth is to be compromised. That loss may be as radiation or aperture efficiency, but it is unavoidable if the infinite array bandwidth is to be maintained in finite array designs. Lastly, this research articulates a development path for tightly-coupled arrays that extends in stages from infinite to semi-infinite, and thence finite layouts. Distinctions are explained and defended for the design focus at each stage. Element design, tuning, and initial feed design occur at the infinite array stage; AGSW suppression occurs at the semi-infinite stage; and design confirmation occurs only with the finite array.
Analysis of the Relationships between Changes in Distributed System Behavior and Group Dynamics
Lazem, Shaimaa (Virginia Tech, 2012-04-06)
The rapid evolution of portable devices and social media has enabled pervasive forms of distributed cooperation. A group could perform a task using a heterogeneous set of the devices (desktop, mobile), connections (wireless, wired, 3G) and software clients. We call this form of systems Distributed Dynamic Cooperative Environments (DDCEs). Content in DDCEs is created and shared by the users. The content could be static (e.g., video or audio), dynamic (e.g.,wikis), and/or Objects with behavior. Objects with behavior are programmed objects that take advantage of the available computational services (e.g., cloud-based services). Providing a desired Quality of Experience (QoE) in DDCEs is a challenge for cooperative systems designers. DDCEs are expected to provide groups with the utmost flexibility in conducting their cooperative activities. More flexibility at the user side means less control and predictability of the groups' behavior at the system side. Due to the lack of Quality of Service (QoS) guarantees in DDCEs, groups may experience changes in the system behavior that are usually manifested as delays and inconsistencies in the shared state. We question the extent to which cooperation among group members is sensitive to system changes in DDCEs. We argue that a QoE definition for groups should account for cooperation emergence and sustainability. An experiment was conducted, where fifteen groups performed a loosely-coupled task that simulates social traps in a 3D virtual world. The groups were exposed to two forms of system delays. Exo-content delays are exogenous to the provided content (e.g., network delay). Endo-content delays are endogenous to the provided content (e.g., delay in processing time for Objects with behavior). Groups' performance in the experiment and their verbal communication have been recorded and analyzed. The results demonstrate the nonlinearity of groups' behavior when dealing with endo-content delays. System interventions are needed to maintain QoE even though that may increase the cost or the required resources. Systems are designed to be used rather than understood by users. When the system behavior changes, designers have two choices. The first is to expect the users to understand the system behavior and adjust their interaction accordingly. That did not happen in our experiment. Understanding the system behavior informed groups' behavior. It partially influenced how the groups succeeded or failed in accomplishing its goal. The second choice is to understand the semantics of the application and provide guarantees based on these semantics. Based on our results, we introduce the following design guidelines for QoE provision in DDCEs. • If possible the system should keep track of information about group goals and add guarding constraints to protect these goals. • QoE guarantees should be provided based on the semantics of the user-generated content that constitutes the group activity. • Users should be given the option to define the content that is sensitive to system changes (e.g., Objects with behavior that are sensitive to delays or require intensive computations) to avoid the negative impacts of endo-content delays. • Users should define the Objects with behavior that contribute to the shared state in order for the system to maintain the consistency of the shared state. • Endo-content delays were proven to have significantly negative impacts on the groups in our experiment compared to exo-content delays. We argue that system designers, if they have the choice, should trade processing time needed for Objects with behavior for exo-content delay.
Analyzing Wireless LAN Security Overhead
McCarter, Harold Lars (Virginia Tech, 2006-04-17)
Wireless local area networks (WLAN) are beginning to play a much larger role in corporate network environments and are already very popular for home networking applications. This increase in accessibility has created large security holes for hackers and thieves to abuse, which is finally being addressed by stronger security methods such as advanced encryption algorithms and efficient authentication processes. However, these security methods often hamper network performance unbeknownst to engineers and users. This research examines the effects of Wired Equivalent Privacy (WEP), Temporal Key Integrity Protocol (TKIP), and Counter Mode/CBC-MAC Protocol (CCMP) encryption algorithms on throughput rates for IEEE 802.11 networks as well as the authentication times for Lightweight Extensible Authentication Protocol (LEAP) and Protected Extensible Authentication Protocol (PEAP). The research shows that today's wireless hardware is capable of reducing overhead of even the most advanced encryption schemes to less than five percent of the total bandwidth.
Application Layer Multipoint Extension for the Session Initiation Protocol
Thorp, Brian J. (Virginia Tech, 2005-04-25)
The Session Initiation Protocol (SIP) was first published in 1999, by the Internet Engineering Task Force (IETF), to be the standard for multimedia transfers. SIP is a peer-to-peer signaling protocol that is capable of initiating, modifying, and terminating media sessions. SIP utilizes existing Internet Protocols (IP) such as Domain Name Service (DNS) and the Session Description Protocol (SDP), allowing it to seamlessly integrate into existing IP networks. As SIP has matured and gained acceptance, its deficiencies when functioning as a multipoint communications protocol have become apparent. SIP currently supports two modes of operation referred to as conferencing and multicasting. Conferencing is the unicast transmission of session information between conference members. Multicasting uses IP multicast to distribute session information. This thesis proposes an extension for the Session Initiation Protocol that improves functionality for multipoint communications. When using conferencing, a SIP user-agent has limited information about the conference it is taking part in. This extension increases the awareness of a SIP node by providing it with complete conference membership information, the ability to detect neighboring node failures, and the ability to automatically repair conference partitions. Signaling for conferencing was defined and integrated into a standard SIP implementation where it was used to demonstrate the above capabilities. Using a prototype implementation, the additional functionality was shown to come at the cost of a modest increase in transaction message size and processing complexity. IP multicast has limited deployment in today's networks reducing the usability of this useful feature. Since IP multicast support is not guaranteed, the use of application layer multicast protocols is proposed to replace the use of IP multicast. An efficient means of negotiating an application layer protocol is proposed as well as the ability to provide the protocol with session information to begin operation. A ring protocol was defined and implemented using the proposed extension. Performance testing revealed that the application layer protocol had slightly higher processing complexity than conferencing, but on average had a smaller transaction message size.
An Approach to Using Cognition in Wireless Networks
Morales-Tirado, Lizdabel (Virginia Tech, 2009-12-18)
Third Generation (3G) wireless networks have been well studied and optimized with traditional radio resource management techniques, but still there is room for improvement. Cognitive radio technology can bring significantcant network improvements by providing awareness to the surrounding radio environment, exploiting previous network knowledge and optimizing the use of resources using machine learning and artificial intelligence techniques. Cognitive radio can also co-exist with legacy equipment thus acting as a bridge among heterogeneous communication systems. In this work, an approach for applying cognition in wireless networks is presented. Also, two machine learning techniques are used to create a hybrid cognitive engine. Furthermore, the concept of cognitive radio resource management along with some of the network applications are discussed. To evaluate the proposed approach cognition is applied to three typical wireless network problems: improving coverage, handover management and determining recurring policy events. A cognitive engine, that uses case-based reasoning and a decision tree algorithm is developed. The engine learns the coverage of a cell solely from observations, predicts when a handover is necessary and determines policy patterns, solely from environment observations.
Assessment of Voice Over IP as a solution for Voice over ADSL
Ram, Abhishek (Virginia Tech, 2004-05-22)
Voice over DSL (VoDSL) is a technology that enables the transport of data and multiple voice calls over a single copper-pair. VoDSL employs packet voice technology instead of the traditional circuit switched voice. Voice over ATM (VoATM) and Voice over IP (VoIP) are the two main alternatives for carrying voice packets over DSL. ATM is currently the preferred technology, since it offers the advantage of ATM's built-in Quality of Service (QoS) mechanisms. IP, on the other hand, cannot provide QoS guarantees in its traditional form. IP QoS mechanisms have been evolved only in the recent years. VoIP has gained popularity in the core networks. If it could replace VoATM in the access networks, it would open the door for end-to-end IP telephony that would result in major cost savings. In this thesis, we propose a VoIP-based VoDSL architecture that provides QoS guarantees comparable to those offered by ATM in the DSL access network. Our QoS architecture supports Premium and Regular service categories for voice traffic and the Best-Effort service category for data traffic. Voice and data packets are placed in separate output queues at the bottleneck link. The Weighted Fair Queuing algorithm in used to schedule voice and data packets for transmission over the bottleneck link. Fragmentation of large data packets reduces the waiting time for voice packets in the link. We also propose a new admission control mechanism called Admission Control by Implicit Signaling. This mechanism takes advantage of application layer signaling by mapping it to the IP header. The router can infer the resource requirements for the connection by looking at certain field in the IP header of the application layer signaling packets. This eliminates the need for an explicit signaling protocol. We evaluate the performance of our QoS architecture by means of a simulation study. Our primary metrics are the end-to-end delay of voice packets across the access network and the bandwidth consumed by a voice call. Our results show that the end-to-end delays of voice packets in our VoIP architecture are comparable to that in the VoATM architecture. ACIS limits the number of voice calls admitted into the premium service class and provides guaranteed service to those calls under all loads. It also provides acceptable service to regular calls under light loads. We also show that PPP is a better choice than ATM as a Layer 2 protocol for our VoIP architecture. PPP offers the advantages of low bandwidth requirement and interleaving of voice packets in between fragments of large data packets during transmission over the bottleneck link. We conclude that our VoIP architecture would be suitable for future VoDSL deployments.
Backpressure Policies for Wireless ad hoc Networks
Shukla, Umesh Kumar (Virginia Tech, 2010-03-16)
Interference in ad hoc wireless networks causes the performance of traditional networking protocols to suffer. However, some user applications in ad hoc networks demand high throughput and low end-user delay. In the literature, the backpressure policy, i.e. queue backlog differential-based joint routing and scheduling, is known to be throughput-optimal with robust support for traffic load fluctuations \cite{Tssailus92}. Unfortunately, many backpressure-based algorithms cannot be implemented due to high end-user delay, inaccurate assumptions for interference, and high control overhead in distributed scenarios. We develop new backpressure based approaches to address these issues. We first propose a heuristic packet forwarding scheme that solves the issue of high end-user delay and still provides near-optimal throughput. Next we develop a novel interference model that provides simple yet accurate interference relationships among users. Such a model is helpful in designing a simple backpressure scheduling algorithm that does not violate realistic interference constraints. Finally we develop distributed backpressure algorithms based on our proposed ideas. Our distributed algorithms provide throughput performance close to the optimal and have low control overhead and simple implementation.
Behavior-based Incentives for Node Cooperation in Wireless Ad Hoc Networks
Srivastava, Vivek (Virginia Tech, 2008-09-17)
A Mobile Ad Hoc Network (MANET) adopts a decentralized communication architecture which relies on cooperation among nodes at each layer of the protocol stack. Its reliance on cooperation for success and survival makes the ad hoc network particularly sensitive to variations in node behavior. Specifically, for functions such as routing, nodes which are limited in their resources may be unwilling to cooperate in forwarding for other nodes. Such selfish behavior leads to degradation in the performance of the network and possibly, in the extreme case, a complete cessation of operations. Consequently it is important to devise solutions to encourage resource-constrained nodes to cooperate. Incentive schemes have been proposed to induce selfish nodes to cooperate. Though many of the proposed schemes in the literature are payment-based, nodes can be incentivized to cooperate by adopting policies which are non-monetary in nature, but rather are based on the threat of retaliation for non-cooperating nodes. These policies, for which there is little formal analysis in the existing literature on node cooperation, are based on observed node behavior. We refer to them as behavior-based incentives. In this work, we analyze the effectiveness of behavior-based incentives in inducing nodes to cooperate. To determine whether an incentive scheme is effective in fostering cooperation we develop a game-theoretic model. Adopting a repeated game model, we show that nodes may agree to cooperate in sharing their resources and forward packets, even if they perceive a cost in doing so. This happens as the nodes recognize that refusing to cooperate will result in similar behavior by others, which ultimately would compromise the viability of the network as a whole. A major shortcoming in the analysis done in past works is the lack of consideration of practical constraints imposed by an ad hoc environment. One such example is the assumption that a node, when making decisions about whether to cooperate, has perfect knowledge of every other node's actions. In a distributed setting this is impractical. In our work, we analyze behavior-based incentives by incorporating such practical considerations as imperfect monitoring into our game-theoretic models. In modeling the problem as a game of imperfect public monitoring (nodes observe a common public signal that reflects the actions of other nodes in the network) we show that, under the assumption of first order stochastic dominance of the public signal, the grim trigger strategy leads to an equilibrium for nodes to cooperate. Even though a trigger-based strategy like grim-trigger is effective in deterring selfish behavior it is too harsh in its implementation. In addition, the availability of a common public signal in a distributed setting is rather limited. We, therefore, consider nodes that individually monitor the behavior of other nodes in the network and keep this information private. Note that this independent monitoring of behavior is error prone as a result of slow switching between transmit and promiscuous modes of operation, collisions and congestion due to the wireless medium, or incorrect feedback from peers. We propose a probability-based strategy that induces nodes to cooperate under such a setting. We analyze the strategy using repeated games with imperfect private monitoring and show it to be robust to errors in monitoring others" actions. Nodes achieve a near-optimal payoff at equilibrium when adopting this strategy. This work also characterizes the effects of a behavior-based incentive, applied to induce cooperation, on topology control in ad hoc networks. Our work is among the first to consider selfish behavior in the context of topology control. We create topologies based on a holistic view of energy consumption " energy consumed in forwarding packets as well as in maintaining links. Our main results from this work are to show that: (a) a simple forwarding policy induces nodes to cooperate and leads to reliable paths in the generated topology, (b) the resulting topologies are well-connected, energy-efficient and exhibit characteristics similar to those in small-world networks.
BioSENSE: Biologically-inspired Secure Elastic Networked Sensor Environment
Hassan Eltarras, Rami M. (Virginia Tech, 2011-01-25)
The essence of smart pervasive Cyber-Physical Environments (CPEs) is to enhance the dependability, security and efficiency of their encompassing systems and infrastructures and their services. In CPEs, interactive information resources are integrated and coordinated with physical resources to better serve human users. To bridge the interaction gap between users and the physical environment, a CPE is instrumented with a large number of small devices, called sensors, that are capable of sensing, computing and communicating. Sensors with heterogeneous capabilities should autonomously organize on-demand and interact to furnish real-time, high fidelity information serving a wide variety of user applications with dynamic and evolving requirements. CPEs with their associated networked sensors promise aware services for smart systems and infrastructures with the potential to improve the quality of numerous application domains, in particular mission-critical infrastructure domains. Examples include healthcare, environment protection, transportation, energy, homeland security, and national defense. To build smart CPEs, Networked Sensor Environments (NSEs) are needed to manage demand-driven sharing of large-scale federated heterogeneous resources among multiple applications and users. We informally define NSE as a tailorable, application agnostic, distributed platform with the purpose of managing a massive number of federated resources with heterogeneous computing, communication, and monitoring capabilities. We perceive the need to develop scalable, trustworthy, cost-effective NSEs. A NSE should be endowed with dynamic and adaptable computing and communication services capable of efficiently running diverse applications with evolving QoS requirements on top of federated distributed resources. NSEs should also enable the development of applications independent of the underlying system and device concerns. To our knowledge, a NSE with the aforementioned capabilities does not currently exist. The large scale of NSEs, the heterogeneous node capabilities, the highly dynamic topology, and the likelihood of being deployed in inhospitable environments pose formidable challenges for the construction of resilient shared NSE platforms. Additionally, nodes in NSE are often resource challenged and therefore trustworthy node cooperation is required to provide useful services. Furthermore, the failure of NSE nodes due to malicious or non-malicious conditions represents a major threat to the trustworthiness of NSEs. Applications should be able to survive failure of nodes and change their runtime structure while preserving their operational integrity. It is also worth noting that the decoupling of application programming concerns from system and device concerns has not received the appropriate attention in most existing wireless sensor network platforms. In this dissertation, we present a Biologically-inspired Secure Elastic Networked Sensor Environment (BioSENSE) that synergistically integrates: (1) a novel bio-inspired construction of adaptable system building components, (2) associative routing framework with extensible adaptable criteria-based addressing of resources, and (3) management of multi-dimensional software diversity and trust-based variant hot shuffling. The outcome is that an application using BioSENSE is able to allocate, at runtime, a dynamic taskforce, running over a federated resource pool that would satisfy its evolving mission requirements. BioSENSE perceives both applications and the NSE itself to be elastic, and allows them to grow or shrink based upon needs and conditions. BioSENSE adopts Cell-Oriented-Architecture (COA), a novel architecture that supports the development, deployment, execution, maintenance, and evolution of NSE software. COA employs mission-oriented application design and inline code distribution to enable adaptability, dynamic re-tasking, and re-programmability. The cell, the basic building block in COA, is the abstraction of a mission-oriented autonomously active resource. Generic cells are spontaneously created by the middleware, then participate in emerging tasks through a process called specialization. Once specialized, cells exhibit application specific behavior. Specialized cells have mission objectives that are being continuously sought, and sensors that are used to monitor performance parameters, mission objectives, and other phenomena of interest. Due to the inherent anonymous nature of sensor nodes, associative routing enables dynamic semantically-rich descriptive identification of NSE resources. As such, associative routing presents a clear departure from most current network addressing schemes. Associative routing combines resource discovery and path discovery into a single coherent role, leading to significant reduction in traffic load and communication latency without any loss of generality. We also propose Adaptive Multi-Criteria Routing (AMCR) protocol as a realization of associative routing for NSEs. AMCR exploits application-specific message semantics, represented as generic criteria, and adapts its operation according to observed traffic patterns. BioSENSE intrinsically exploits software diversity, runtime implementation shuffling, and fault recovery to achieve security and resilience required for mission-critical NSEs. BioSENSE makes NSE software a resilient moving target that : 1) confuses the attacker by non-determinism through shuffling of software component implementations; 2) improves the availability of NSE by providing means to gracefully recover from implementation flaws at runtime; and 3) enhances the software system by survival of the fittest through trust-based component selection in an online software component marketplace. In summary, BioSENSE touts the following advantages: (1) on-demand, online distribution and adaptive allocation of services and physical resources shared among multiple long-lived applications with dynamic missions and quality of service requirements, (2) structural, functional, and performance adaptation to dynamic network scales, contexts and topologies, (3) moving target defense of system software, and (4) autonomic failure recovery.
Breaking Down Network Slicing: Hierarchical Orchestration of End-to-End Networks
Santos, Joao F.; Liu, Wei; Jiao, Xianjun; Neto, Natal V.; Pollin, Sofie; Marquez-Barja, Johann M.; Moerman, Ingrid; DaSilva, Luiz A. (IEEE, 2020-10-01)
Network slicing is one of the key enabling techniques for 5G, allowing Network Providers (NPs) to support services with diverging requirements on top of their physical infrastructure. In this paper, we address the limited support and oversimplified resource allocation on different network segments of existing End-to-End (E2E) orchestration solutions. We propose a hierarchical orchestration scheme for E2E networks, breaking down the E2E resource management and network slicing problems per network segment. We introduce a higherlevel orchestrator, the hyperstrator, to coordinate the distributed orchestrators and deploy Network Slices (NSs) across multiple network segments. We developed a prototype implementation of the hyperstrator and validated our hierarchical orchestration concept with two proof-of-concept experiments, showing the NS deployment and the impact of the resource allocation per network segment on the performance of NSs. The results show that the distributed nature of our orchestration architecture introduces negligible overhead for provisioning NSs in our particular setting, and confirm the need of a hyperstrator for coordinating network segments and ensuring consistent QoS for NSs.
Building a Dynamic Spectrum Access Smart Radio With Application to Public Safety Disaster Communications
Silvius, Mark D. (Virginia Tech, 2009-08-13)
Recent disasters, including the 9/11 terrorist attacks, Hurricane Katrina, the London subway bombings, and the California wildfires, have all highlighted the limitations of current mobile communication systems for public safety first responders. First, in a point-to-point configuration, legacy radio systems used by first responders from differing agencies are often made by competing manufacturers and may use incompatible waveforms or channels. In addition, first responder radio systems, which may be licensed and programmed to operate in frequency bands allocated within their home jurisdiction, may be neither licensed nor available in forward-deployed disaster response locations, resulting in an operational scarcity of usable frequencies. To address these problems, first responders need smart radio solutions which can bridge these disparate legacy radio systems together, can incorporate new smart radio solutions, or can replace these existing aging radios. These smart radios need to quickly find each other and adhere to spectrum usage and access policies. Second, in an infrastructure configuration, legacy radio systems may not operate at all if the existing communications backbone has been destroyed by the disaster event. A communication system which can provide a new, temporary infrastructure or can extend an existing infrastructure into a shaded region is needed. Smart radio nodes that make up the public safety infrastructure again must be able to find each other, adhere to spectrum usage policies, and provide access to other smart radios and legacy public safety radios within their coverage area. This work addresses these communications problems in the following ways. First, it applies cognitive radio technology to develop a smart radio system capable of rapidly adapting itself so it can communicate with existing legacy radio systems or other smart radios using a variety of standard and customized waveforms. These smart radios can also assemble themselves into an ad-hoc network capable of providing a temporary communications backbone within the disaster area, or a network extension to a shaded communications area. Second, this work analyzes and characterizes a series of rendezvous protocols which enable the smart radios to rapidly find each other within a particular coverage area. Third, this work develops a spectrum sharing protocol that enables the smart radios to adhere to spectral policies by sharing spectrum with other primary users of the band. Fourth, the performance of the smart radio architecture, as well as the performance of the rendezvous and spectrum sharing protocols, is evaluated on a smart radio network testbed, which has been assembled in a laboratory setting. Results are compared, when applicable, to existing radio systems and protocols. Finally, this work concludes by briefly discussing how the smart radio technologies developed in this dissertation could be combined to form a public safety communications architecture, applicable to the FCC's stated intent for the 700 MHz Band. In the future, this work will be extended to applications outside of the public safety community, specifically, to communications problems faced by warfighters in the military.

Browsing by Author "DaSilva, Luiz A."

Results Per Page

Sort Options