153 research outputs found
QAP: A QoS supportive adaptive polling protocol for wireless LANs
A QoS supportive adaptive polling (QAP) protocol for wireless LANs is introduced. QAP operates under an infrastructure wireless LAN, where an access point (AP) polls the wireless nodes in order to grant them permission to transmit. The polled node sends data directly to the destination node. We consider bursty traffic conditions, under which the protocol operates efficiently. The polling scheme is based on an adaptive algorithm according to which it is most likely that an active node is polled. Also, QAP takes into account packet priorities, so it supports QoS by means of the Highest Priority First packet buffer discipline and the priority distinctive polling scheme. Lastly, the protocol combines efficiency and fairness, since it prohibits a single node to dominate the medium permanently. QAP is compared to the efficient learning automata-based polling (LEAP) protocol, and is shown to have superior performance. © 2005 Elsevier B.V. All rights reserved
Estimation and Coordination of Sequence Patterns for Frequency Hopping Dynamic Spectrum Access Networks
In 2010, the Shared Spectrum Company showed in a survey of Radio Frequency (RF) bands that underutilization of spectrum has resulted from current frequency management practices. Traditional frequency allocation allows large bands of licensed spectrum to remain vacant even under current high demands. Cognitive radio\u27s (CR) use of Dynamic Spectrum Access (DSA) enables better spectrum management by allowing usage in times of spectrum inactivity. This research presents the CR problem of rendezvous for fast Frequency Hopping Spread Spectrum (FHSS) networks, and examines protocols for disseminating RF environment information to coordinate spectrum usage. First, Gold\u27s algorithm is investigated as a rendezvous protocol for networks utilizing fast frequency hopping. A hardware implementation of Gold\u27s algorithm on a Virtex-5 Field Programmable Gate Array (FPGA) is constructed to determine the resource requirements and timing limitations for use in a CR. The resulting design proves functionality of the algorithm, and demonstrates a decrease in time-to-rendezvous over current methods. Once a CR network is formed, it must understand the changing environment in order to better utilize the available spectrum. This research addresses the costs a network incurs to coordinate such environment data. Three exchange protocols are introduced and evaluated via simulation to determine the best technique based on network size. The resulting comparison found that smaller networks function best with polled or timedivision based protocols where radios always share their environment information. Larger networks, on the other hand, function best when a dispute-based exchange protocol was utilized. These studies together conclude that the selection of a rendezvous algorithm or a protocol for the exchange of environment data in a CR network are determined by the characteristics of the network, and therefore their selection requires a cognitive decision
Recommended from our members
Radio network management in cognitive LTE-Femtocell Systems
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London.There is a strong uptake of femtocell deployment as small cell application
platforms in the upcoming LTE networks. In such two-tier networks of LTEfemtocell
base stations, a large portion of the assigned spectrum is used
sporadically leading to underutilisation of valuable frequency resources.
Novel spectrum access techniques are necessary to solve these current spectrum
inefficiency problems. Therefore, spectrum management solutions should have
the features to improve spectrum access in both temporal and spatial manner.
Cognitive Radio (CR) with the Dynamic Spectrum Access (DSA) is considered
to be the key technology in this research in order to increase the spectrum
efficiency. This is an effective solution to allow a group of Secondary Users
(SUs) to share the radio spectrum initially allocated to the Primary User (PUs) at
no interference.
The core aim of this thesis is to develop new cognitive LTE-femtocell systems
that offer a 4G vision, to facilitate the radio network management in order to
increase the network capacity and further improve spectrum access probabilities.
In this thesis, a new spectrum management model for cognitive radio networks is
considered to enable a seamless integration of multi-access technology with
existing networks. This involves the design of efficient resource allocation
algorithms that are able to respond to the rapid changes in the dynamic wireless
environment and primary users activities. Throughout this thesis a variety of
network upgraded functions are developed using application simulation
scenarios. Therefore, the proposed algorithms, mechanisms, methods, and system
models are not restricted in the considered networks, but rather have a wider
applicability to be used in other technologies.
This thesis mainly investigates three aspects of research issues relating to the
efficient management of cognitive networks: First, novel spectrum resource
management modules are proposed to maximise the spectrum access by rapidly
detecting the available transmission opportunities. Secondly, a developed pilot
power controlling algorithm is introduced to minimise the power consumption by
considering mobile position and application requirements. Also, there is
investigation on the impact of deploying different numbers of femtocell base
stations in LTE domain to identify the optimum cell size for future networks.
Finally, a novel call admission control mechanism for mobility management is
proposed to support seamless handover between LTE and femtocell domains.
This is performed by assigning high speed mobile users to the LTE system to
avoid unnecessary handovers.
The proposed solutions were examined by simulation and numerical analysis to
show the strength of cognitive femtocell deployment for the required
applications. The results show that the new system design based on cognitive
radio configuration enable an efficient resource management in terms of
spectrum allocation, adaptive pilot power control, and mobile handover. The
proposed framework and algorithms offer a novel spectrum management for self organised LTE-femtocell architecture.
Eventually, this research shows that certain architectures fulfilling spectrum
management requirements are implementable in practice and display good
performance in dynamic wireless environments which recommends the
consideration of CR systems in LTE and femtocell networks
Improving forwarding mechanisms for mobile personal area networks
This thesis presents novel methods for improving forwarding mechanisms for personal area networks.
Personal area networks are formed by interconnecting personal devices such as personal digital assistants,
portable multimedia devices, digital cameras and laptop computers, in an ad hoc fashion. These
devices are typically characterised by low complexity hardware, low memory and are usually batterypowered.
Protocols and mechanisms developed for general ad hoc networking cannot be directly applied
to personal area networks as they are not optimised to suit their specific constraints.
The work presented herein proposes solutions for improving error control and routing over personal
area networks, which are very important ingredients to the good functioning of the network. The proposed
Packet Error Correction (PEC) technique resends only a subset of the transmitted packets, thereby
reducing the overhead, while ensuring improved error rates. PEC adapts the number of re-transmissible
packets to the conditions of the channel so that unnecessary retransmissions are avoided. It is shown by
means of computer simulation that PEC behaves better, in terms of error reduction and overhead, than
traditional error control mechanisms, which means that it is adequate for low-power personal devices.
The proposed C2HR routing protocol, on the other hand, is designed such that the network lifetime
is maximised. This is achieved by forwarding packets through the most energy efficient paths. C2HR
is a hybrid routing protocol in the sense that it employs table-driven (proactive) as well as on-demand
(reactive) components. Proactive routes are the primary routes, i.e., packets are forwarded through those
paths when the network is stable; however, in case of failures, the protocol searches for alternative routes
on-demand, through which data is routed temporarily. The advantage of C2HR is that data can still be
forwarded even when routing is re-converging, thereby increasing the throughput. Simulation results
show that the proposed routing method is more energy efficient than traditional least hops routing, and
results in higher data throughput.
C2HR relies on a network leader for collecting and distributing topology information, which in turn
requires an estimate of the underlying topology. Thus, this thesis also proposes a new cooperative leader
election algorithm and techniques for estimating network characteristics in mobile environments. The
proposed solutions are simulated under various conditions and demonstrate appreciable behaviour
High Performance Signal Processing-Based Collision Resolution for Random Access Schemes
Els darrers anys han experimentat un augment de la demanda de serveis interactius per satèl·lit per al gran consum, cobrint serveis fixes i mòbils, tal i com accés de banda ampla, comunicacions mà quina-mà quina (M2M), supervisió, control i adquisició de dades (SCADA), transaccions i aplicacions de seguretat crÃtiques. Aquestes xarxes de comunicacions es caracteritzen per tenir una gran població d’usuaris compartint l’amplada de banda amb unes condicions de trà fic molt dinà miques. Concretament, en el canal de retorn (de l’usuari a la xarxa) de xarxes d’accés de banda ampla, els usuaris residencials generen grans rà fegues de trà fic amb perÃodes d’inactivitat freqüents. Una situació similar succeeix en xarxes de comunicacions mòbils per satèl·lit, on una gran població de terminals generen transmissions infreqüents de senyalització, serveis basats en la localització or altres aplicacions de missatgeria.
Aquests serveis requereixen el desenvolupament de protocols d’accés múltiple eficients que puguin operar en les condicions descrites anteriorment. Els protocols d´accés aleatori són bons candidats per servir trà fic poc predictiu, amb transmissions infreqüents aixà com sensibles amb el retard. A més, els protocols d´accés aleatori suporten un gran nombre de terminals compartint el canal de comunicacions i requereixen poca complexitat en el terminals. El protocols d´accés aleatori han estat à mpliament estudiats i desplegats en xarxes terrestres, però les seves prestacions són pobres en el entorn satèl·lital, que està caracteritzat per retards de propagació molt grans. Avui en dia, el seu ús en les xarxes de comunicacions per satèl·lit està principalment limitat a la senyalització d’inici de sessió, transmissió de paquets de control i en alguns casos a la transmissió de petits volums de dades amb unes eficiència d’utilització del canal molt baixa.
Aquesta tesi proposa tres noves tècniques d’accés aleatori, bens adaptades per proveir els serveis esmentats anteriorment en un entorn satèl·lital, amb altes prestacions i una complexitat en el terminal d’usuari reduïda. Les noves tècniques d’accés aleatori són Contention Resolution Diversity Slotted Aloha (CRDSA), Asynchronous Contention Resolution Diversity Aloha (ACRDA) i Enhanced Spread Spectrum Aloha (E-SSA), adaptades per un tipus d’accés ranurat, asÃncron i d’espectre eixamplat respectivament. Les tres tècniques utilitzen una codificació de canal (FEC) robusta, capaç d’operar en front de interferències elevades, que són tÃpiques en l’accés aleatori, i d’un mecanisme de cancel·lació successiva d’interferència que s’implementa en el receptor sobre els paquets descodificats satisfactòriament. Els nous protocols obtenen un throughput normalitzat superior a 1 bit/s/Hz amb una tassa de pèrdua de paquets inferior a 10-3, el qual representa un factor de millora de 1000 respecte a protocols d’accés aleatori tradicionals com l’ALOHA ranurat. Les prestacions de les noves tècniques d’accés aleatori has estat analitzades per mitjà de simulacions, aixà com amb nou models analÃtics desenvolupats en aquesta tesi capaços de caracteritzar el trà fic, la distribució estadÃstica de la potència dels paquets, les prestacions de la codificació de canal (FEC) i el procés de cancel·lació d’interferència successiva.Los últimos años han experimentado un crecimiento de la demanda de servicios interactivos por satélite para el gran consumo, cubriendo servicios fijos i móviles, como el acceso de banda ancha, comunicaciones máquina a máquina (M2M), supervisión, control y adquisición de datos (SCADA), transacciones i aplicaciones criticas de seguridad. Estas redes de comunicaciones se caracterizan por tener una gran población de usuarios compartiendo el ancho de banda en unas condiciones de tráfico muy dinámicas. Concretamente, en el canal de retorno (del usuario a la red) de redes de acceso de banda ancha, los usuarios residenciales generan grandes ráfagas de tráfico con periodos frecuentes de inactividad. Una situación similar ocurre en las redes de comunicaciones móviles por satélite, donde una gran población de terminales generan transmisiones infrecuentes de señalización, servicios basados en la localización u otras aplicaciones me mensajerÃa.
Estos servicios requieren el desarrollo de protocolos de acceso múltiple eficientes capaces de operar en las condiciones descritas anteriormente. Los protocolos de acceso aleatorio son buenos candidatos para servir el tráfico poco predictivo, con transmisiones infrecuentes asà como sensibles al retardo. Además, los protocolos de acceso soportan un gran número de terminales compartiendo el canal de comunicaciones y requieren poca complejidad en los terminales. Los protocolos de acceso aleatorio han estado ampliamente estudiados i desplegados en las redes terrestres, pero sus prestaciones son pobres en el entorno satelital, que se caracteriza por retardos de comunicaciones muy elevados. Hoy en dÃa, su uso en la redes de comunicaciones por satélite está principalmente limitado a la señalización de inicio de sesión, transmisión de pequeños volumenes de datos con eficiencia de utilización del canal muy baja.
Esta tesis propone tres nuevas técnicas de acceso aleatorio bien adaptadas para proveer los servicios mencionados anteriormente en un entorno de comunicaciones por satélite, con altas prestaciones y una complejidad en el terminal de usuario reducida. Las nuevas técnicas de acceso aleatorio son Contention Resolution Diversity Slotted Aloha (CRDSA), Asynchronous Contention Resolution Diversity Aloha (ACRDA) y Enhanced Spread Spectrum Aloha (E-SSA), adaptadas para un tipo de acceso ranurado, asÃncrono y de espectro ensanchado respectivamente. Las tres técnicas utilizan una codificación de canal (FEC) robusta, capaz de operar en condiciones de interferencia elevadas, que son tÃpicas en el acceso aleatorio, y de un mecanismo de cancelación sucesiva de interferencias que se implementa en el receptor sobre los paquetes que han sido decodificados satisfactoriamente. Los nuevos protocolos obtienen un throughput normalizado superior a 1 bit/s/Hz con una tasa de pérdida de paquetes inferior a 10-3, lo cual representa un factor de mejora de 1000 respecto a los protocolos de acceso aleatorio tradicionales como el ALOHA ranurado. Las prestaciones de las nuevas técnicas de acceso aleatorio han sido analizadas con simulaciones asà como con nuevos modelos analÃticos desarrollados en esta tesis, capaces de caracterizar el tráfico, la distribución estadÃstica de la potencia de los paquetes, las prestaciones de la codificación de canal (FEC) y el proceso de cancelación sucesiva de interferencias.Over the past years there has been a fast growing demand for low-cost interactive satellite terminals supporting both fixed and mobile services, such as consumer broadband access, machine-to-machine communications (M2M), supervisory control and data acquisition (SCADA), transaction and safety of life applications. These networks, are generally characterized by a large population of terminals sharing the available resources under very dynamic traffic conditions. In particular, in the return link (user to network) of commercial satellite broadband access networks, residential users are likely to generate a large amount of low duty cycle bursty traffic with extended inactivity periods. A similar situation occurs in satellite mobile networks whereby a large number of terminals typically generate infrequent packets for signaling transmission as well for position reporting or other messaging applications.
These services call for the development of efficient multiple access protocols able to cope with the above operating conditions. Random Access (RA) techniques are by nature, good candidates for the less predictive, low duty cycle as well as time sensitive return link traffic. Besides, RA techniques are capable of supporting large population of terminals sharing the same capacity and require low terminal complexity. RA schemes have been widely studied and deployed in terrestrial networks, but do not perform well in the satellite environment, which is characterized by very long propagation delays. Today, their use in satellite networks is mainly limited to initial network login, the transmission of control packets, and in some cases, for the transmission of very small volumes of data with very low channel utilization.
This thesis proposes three novel RA schemes well suited for the provision of the above-mentioned services over a satellite environment with high performance and low terminal complexity. The new RA schemes are Contention Resolution Diversity Slotted Aloha (CRDSA), Asynchronous Contention Resolution Diversity Aloha (ACRDA) and Enhanced Spread Spectrum Aloha (E-SSA), suited for slotted, unslotted and spread spectrum-based systems respectively. They all use strong Forward Error Correction (FEC) codes, able to cope with heavy co-channel interference typically present in RA, and successive interference cancellation implemented over the successfully decoded packets. The new schemes achieve a normalized throughput above 1 bit/s/Hz for a packet loss ratio below 10-3, which represents a 1000-fold increase compared to Slotted ALOHA. The performance of the proposed RA schemes has been analyzed by means of detailed simulations as well as novel analytical frameworks that characterize traffic and packets power statistical distributions, the performance of the FEC coding as well as the iterative interference cancellation processing at the receiver
Effective web crawlers
Web crawlers are the component of a search engine that must traverse the Web, gathering documents in a local repository for indexing by a search engine so that they can be ranked by their relevance to user queries. Whenever data is replicated in an autonomously updated environment, there are issues with maintaining up-to-date copies of documents. When documents are retrieved by a crawler and have subsequently been altered on the Web, the effect is an inconsistency in user search results. While the impact depends on the type and volume of change, many existing algorithms do not take the degree of change into consideration, instead using simple measures that consider any change as significant. Furthermore, many crawler evaluation metrics do not consider index freshness or the amount of impact that crawling algorithms have on user results. Most of the existing work makes assumptions about the change rate of documents on the Web, or relies on the availability of a long history of change. Our work investigates approaches to improving index consistency: detecting meaningful change, measuring the impact of a crawl on collection freshness from a user perspective, developing a framework for evaluating crawler performance, determining the effectiveness of stateless crawl ordering schemes, and proposing and evaluating the effectiveness of a dynamic crawl approach. Our work is concerned specifically with cases where there is little or no past change statistics with which predictions can be made. Our work analyses different measures of change and introduces a novel approach to measuring the impact of recrawl schemes on search engine users. Our schemes detect important changes that affect user results. Other well-known and widely used schemes have to retrieve around twice the data to achieve the same effectiveness as our schemes. Furthermore, while many studies have assumed that the Web changes according to a model, our experimental results are based on real web documents. We analyse various stateless crawl ordering schemes that have no past change statistics with which to predict which documents will change, none of which, to our knowledge, has been tested to determine effectiveness in crawling changed documents. We empirically show that the effectiveness of these schemes depends on the topology and dynamics of the domain crawled and that no one static crawl ordering scheme can effectively maintain freshness, motivating our work on dynamic approaches. We present our novel approach to maintaining freshness, which uses the anchor text linking documents to determine the likelihood of a document changing, based on statistics gathered during the current crawl. We show that this scheme is highly effective when combined with existing stateless schemes. When we combine our scheme with PageRank, our approach allows the crawler to improve both freshness and quality of a collection. Our scheme improves freshness regardless of which stateless scheme it is used in conjunction with, since it uses both positive and negative reinforcement to determine which document to retrieve. Finally, we present the design and implementation of Lara, our own distributed crawler, which we used to develop our testbed
Energy-efficient diversity combining for different access schemes in a multi-path dispersive channel
Dissertação para obtenção do Grau de Doutor em
Engenharia Electrotécnica e ComputadoresThe forthcoming generation of mobile communications, 5G, will settle a new standard for a larger bandwidth and better Quality of Service (QoS). With the exploding growth rate of user generated data, wireless
standards must cope with this growth and at the same time be energy efficient to avoid depleting the batteries of wireless devices. Besides these issues, in a broadband wireless setting QoS can be severely affected from a multipath dispersive channel and therefore be energy demanding.
Cross-layered architectures are a good choice to enhance the overall performance of a wireless system.
Examples of cross-layered Physical (PHY) - Medium Access Control (MAC) architectures are type-II Diversity Combining (DC) Hybrid-ARQ (H-ARQ) and Multi-user Detection (MUD) schemes. Cross-layered type-II DC H-ARQ schemes reuse failed packet transmissions to enhance data reception on posterior retransmissions; MUD schemes reuse data information from previously collided packets on posterior retransmissions to enhance data reception. For a multipath dispersive channel, a PHY layer analytical
model is proposed for Single-Carrier with Frequency Domain Equalization (SC-FDE) that supports DC H-ARQ and MUD. Based on this analytical model, three PHY-MAC protocols are proposed. A crosslayered Time Division Multiple Access (TDMA) scheme that uses DC H-ARQ is modeled and its performance is studied in this document; the performance analysis shows that the scheme performs better with DC and achieves a better energy efficiency at the cost of a higher delay. A novel cross-layered prefix-assisted Direct-Sequence Code Division Multiple Access (DS-CDMA) scheme is proposed and modeled in this document, it uses principles of DC and MUD. This protocol performs better by means
of additional retransmissions, achieving better energy efficiency, at the cost of higher redundancy from a code spreading gain. Finally, a novel cross-layered protocol H-ARQ Network Division Multiple Access (H-NDMA) is proposed and modeled, where the combination of DC H-ARQ and MUD is used with the intent of maximizing the system capacity with a lower delay; system results show that the proposed scheme achieves better energy efficiency and a better performance at the cost of a higher number of retransmissions.
A comparison of the three cross-layered protocols is made, using the PHY analytical model, under normalized conditions using the same amount of maximum redundancy. Results show that the H-NDMA protocol, in general, obtains the best results, achieving a good performance and a good energy efficiency
for a high channel load and low Signal-to-Noise Ratio (SNR). TDMA with DC H-ARQ achieves the best energy efficiency, although presenting the worst delay. Prefix-assisted DS-CDMA in the other hand shows good delay results but presents the worst throughput and energy efficiency
Enabling Technologies for Ultra-Reliable and Low Latency Communications: From PHY and MAC Layer Perspectives
© 1998-2012 IEEE. Future 5th generation networks are expected to enable three key services-enhanced mobile broadband, massive machine type communications and ultra-reliable and low latency communications (URLLC). As per the 3rd generation partnership project URLLC requirements, it is expected that the reliability of one transmission of a 32 byte packet will be at least 99.999% and the latency will be at most 1 ms. This unprecedented level of reliability and latency will yield various new applications, such as smart grids, industrial automation and intelligent transport systems. In this survey we present potential future URLLC applications, and summarize the corresponding reliability and latency requirements. We provide a comprehensive discussion on physical (PHY) and medium access control (MAC) layer techniques that enable URLLC, addressing both licensed and unlicensed bands. This paper evaluates the relevant PHY and MAC techniques for their ability to improve the reliability and reduce the latency. We identify that enabling long-term evolution to coexist in the unlicensed spectrum is also a potential enabler of URLLC in the unlicensed band, and provide numerical evaluations. Lastly, this paper discusses the potential future research directions and challenges in achieving the URLLC requirements
- …