181 research outputs found

    A Novel Airborne Self-organising Architecture for 5G+ Networks

    Full text link
    Network Flying Platforms (NFPs) such as unmanned aerial vehicles, unmanned balloons or drones flying at low/medium/high altitude can be employed to enhance network coverage and capacity by deploying a swarm of flying platforms that implement novel radio resource management techniques. In this paper, we propose a novel layered architecture where NFPs, of various types and flying at low/medium/high layers in a swarm of flying platforms, are considered as an integrated part of the future cellular networks to inject additional capacity and expand the coverage for exceptional scenarios (sports events, concerts, etc.) and hard-to-reach areas (rural or sparsely populated areas). Successful roll-out of the proposed architecture depends on several factors including, but are not limited to: network optimisation for NFP placement and association, safety operations of NFP for network/equipment security, and reliability for NFP transport and control/signaling mechanisms. In this work, we formulate the optimum placement of NFP at a Lower Layer (LL) by exploiting the airborne Self-organising Network (SON) features. Our initial simulations show the NFP-LL can serve more User Equipment (UE)s using this placement technique.Comment: 5 pages, 2 figures, conference paper in IEEE VTC-Fall 2017, in Proceedings IEEE Vehicular Technology Conference (VTC-Fall 2017), Toronto, Canada, Sep. 201

    Hybridisation of genetic algorithm with simulated annealing for vertical-handover in heterogeneous wireless networks

    Get PDF
    To provide the seamless mobility in heterogeneous wireless networks two significant methods, simulated annealing (SA) and genetic algorithms (GAs) are hybrid. In this paradigm, vertical handovers (VHs) are necessary for seamless mobility. In this paper, the hybrid algorithm has the ability to find the optimal network to connect with a good quality of service (QoS) in accordance with the user's preferences. The intelligent algorithm was developed to provide solutions near to real time and to avoid slow and considerable computations according to the features of the mobile devices. Moreover, a cost function is used to sustain the chosen QoS during transition between networks, which is measured in terms of the bandwidth, BER, ABR, SNR and monetary cost. Simulation results presented that choosing the SA rules would minimise the cost function and the GA-SA algorithm could reduce the number of unnecessary handovers, and thereby avoid the 'Ping-Pong' effect

    Mobility prediction and multicasting in wireless networks : performance and analysis

    Get PDF
    Handoff is a call handling mechanism that is invoked when a mobile node moves from one cell to another. Such movement may lead to degradation in performance for wireless networks as a result of packet losses. A promising technique proposed in this thesis is to apply multicasting techniques aided by mobility prediction in order to improve handoff performance. In this thesis, we present a method that uses a Grey model for mobility prediction and a fuzzy logic controller that has been fine-tuned using evolutionary algorithms in order to improve prediction accuracy. We also compare the self-tuning algorithm with two evolutionary algorithms in terms of accuracy and their convergence times. Our proposed method takes into account signal strengths from the base stations and predicts the signal strength of the next candidate base station in order to provide improved handover performance. The primary decision for mobility prediction is the accurate prediction of signal strengths obtained from the base stations and remove any unwanted errors in the prediction using suitable optimisation techniques. Furthermore, the model includes the procedures of fine-tuning the predicted data using fuzzy parameters. We also propose suitable multicasting algorithms to minimise the reservation of overall network resource requirements during handoff with the mobility prediction information. To be able to efficiently solve the problem, the situation is modelled using a multicast tree that is defined to maintain connectivity with the mobile node, whilst ensuring bandwidth guarantees and a minimum hop-count. In this approach, we have tried to solve the problem by balancing two objectives through putting a weight on each of two costs. We provide a detailed description of an algorithm to implement join and prune mechanisms, which will help to build an optimal multicast tree with QoS requirements during handoff as well as incorporating dynamic changes in the positions of mobile nodes. An analysis of how mobility prediction helps in the selection of potential Access Routers (AR) with QoS requirements - which affects the multicast group size and bandwidth cost of the multicast tree -- is presented. The proposed technique tries to minimise the number of multicast tree join and prune operations. Our results show that the expected size of the multicast group increases linearly with an increase in the number of selected destination AR's for multicast during handoff. We observe that the expected number of joins and prunes from the multicast tree increases with group size. A special simulation model was developed to demonstrate both homogeneous and heterogeneous handoff which is an emerging requirement for fourth generation mobile networks. The model incorporates our mobility prediction model for heterogeneous handoff between the Wireless LAN and a cellular network. The results presented in this thesis for mobility prediction, multicasting techniques and heterogeneous handoff include proposed algorithms and models which aid in the understanding, analysing and reducing of overheads during handoff

    On a reliable handoff procedure for supporting mobility in wireless sensor networks

    Get PDF
    Wireless sensor network (WSN) applications such as patients’ health monitoring in hospitals, location-aware ambient intelligence, industrial monitoring /maintenance or homeland security require the support of mobile nodes or node groups. In many of these applications, the lack of network connectivity is not admissible or should at least be time bounded, i.e. mobile nodes cannot be disconnected from the rest of the WSN for an undefined period of time. In this context, we aim at reliable and real-time mobility support in WSNs, for which appropriate handoff and rerouting decisions are mandatory. This paper1 drafts a mechanism and correspondent heuristics for taking reliable handoff decisions in WSNs. Fuzzy logic is used to incorporate the inherent imprecision and uncertainty of the physical quantities at stake

    Application of genetic algorithm to wireless communications

    Get PDF
    Wireless communication is one of the most active areas of technology development of our time. Like all engineering endeavours, the subject of the wireless communication also brings with it a whole host of complex design issues, concerning network design, signal detection, interference cancellation, and resource allocation, to name a few. Many of these problems have little knowledge of the solution space or have very large search space, which are known as non-deterministic polynomial (NP) -hard or - complete and therefore intractable to solution using analytical approaches. Consequently, varied heuristic methods attempts have been made to solve them ranging from simple deterministic algorithms to complicated random-search methods. Genetic alcyorithm (GA) is an adaptive heuristic search algorithm premised on the evolutionary ideas of evolution and natural selection, which has been successfully applied to a variety of complicated problems arising from physics, engineering, biology, economy or sociology. Due to its outstanding search strength and high designable components, GA has attracted great interests even in the wireless domain. This dissertation is devoted to the application of GA to solve various difficult problems spotlighted from the wireless systems. These problems have been mathematically formulated in the constrained optimisation context, and the main work has been focused on developing the problem-specific GA approaches, which incorporate many modifications to the traditional GA in order to obtain enhanced performance. Comparative results lead to the conclusion that the proposed GA approaches are generally able to obtain the optimal or near-optimal solutions to the considered optimisation problems provided that the appropriate representation, suitable fitness function, and problem-specific operators are utilised. As a whole, the present work is largely original and should be of great interest to the design of practical GA approaches to solve realistic problems in the wireless communications systems.EThOS - Electronic Theses Online ServiceBritish Council (ORS) : Newcastle UniversityGBUnited Kingdo

    Access point deployment optimisation in communication-based train control systems

    Get PDF
    Through the use of new communication-based train control (CBTC) systems, modern metro railways have been able to provide a more efficient, more reliable and more eco-friendly transport services. The main advantages of the CBTC systems are achieved by utilising modern communication technologies. The performance of the communications network is dependent on a well-designed access point (AP) deployment, as this determines the overall communication capability and impacts the cost. In this thesis, a systematic methodology is proposed for formulating and solving AP deployment planning (ADP) problems in two scenarios: (i) a tunnel section area; and (ii) a real-world metro system. Different mathematical models are presented for modelling the ADP problem in these two scenarios. In addition to mathematical models, an exhaustive search and a customized search algorithm, which uses a multi-objective evolutionary algorithm based on decomposition (MOEA/D), are proposed for solving the ADP optimisation problems. The methodologies are applied to the scenarios mentioned above. To evaluate the optimisation results, the optimised AP deployments are tested on a simulation platform integrating a railway network simulator and a communication network simulator. The test result shows that with the optimised AP deployments the DCS can achieve a better performance while using fewer APs

    Enhancing cooperation in wireless networks using different concepts of game theory

    Get PDF
    PhDOptimizing radio resource within a network and across cooperating heterogeneous networks is the focus of this thesis. Cooperation in a multi-network environment is tackled by investigating network selection mechanisms. These play an important role in ensuring quality of service for users in a multi-network environment. Churning of mobile users from one service provider to another is already common when people change contracts and in a heterogeneous communication environment, where mobile users have freedom to choose the best wireless service-real time selection is expected to become common feature. This real time selection impacts both the technical and the economic aspects of wireless network operations. Next generation wireless networks will enable a dynamic environment whereby the nodes of the same or even different network operator can interact and cooperate to improve their performance. Cooperation has emerged as a novel communication paradigm that can yield tremendous performance gains from the physical layer all the way up to the application layer. Game theory and in particular coalitional game theory is a highly suited mathematical tool for modelling cooperation between wireless networks and is investigated in this thesis. In this thesis, the churning behaviour of wireless service users is modelled by using evolutionary game theory in the context of WLAN access points and WiMAX networks. This approach illustrates how to improve the user perceived QoS in heterogeneous networks using a two-layered optimization. The top layer views the problem of prediction of the network that would be chosen by a user where the criteria are offered bit rate, price, mobility support and reputation. At the second level, conditional on the strategies chosen by the users, the network provider hypothetically, reconfigures the network, subject to the network constraints of bandwidth and acceptable SNR and optimizes the network coverage to support users who would otherwise not be serviced adequately. This forms an iterative cycle until a solution that optimizes the user satisfaction subject to the adjustments that the network provider can make to mitigate the binding constraints, is found and applied to the real network. The evolutionary equilibrium, which is used to 3 compute the average number of users choosing each wireless service, is taken as the solution. This thesis also proposes a fair and practical cooperation framework in which the base stations belonging to the same network provider cooperate, to serve each other‘s customers. How this cooperation can potentially increase their aggregate payoffs through efficient utilization of resources is shown for the case of dynamic frequency allocation. This cooperation framework needs to intelligently determine the cooperating partner and provide a rational basis for sharing aggregate payoff between the cooperative partners for the stability of the coalition. The optimum cooperation strategy, which involves the allocations of the channels to mobile customers, can be obtained as solutions of linear programming optimizations

    Efficient spectrum-handoff schemes for cognitive radio networks

    Get PDF
    Radio spectrum access is important for terrestrial wireless networks, commercial earth observations and terrestrial radio astronomy observations. The services offered by terrestrial wireless networks, commercial earth observations and terrestrial radio astronomy observations have evolved due to technological advances. They are expected to meet increasing users' demands which will require more spectrum. The increasing demand for high throughput by users necessitates allocating additional spectrum to terrestrial wireless networks. Terrestrial radio astronomy observations s require additional bandwidth to observe more spectral windows. Commercial earth observation requires more spectrum for enhanced transmission of earth observation data. The evolution of terrestrial wireless networks, commercial earth observations and terrestrial radio astronomy observations leads to the emergence of new interference scenarios. For instance, terrestrial wireless networks pose interference risks to mobile ground stations; while inter-satellite links can interfere with terrestrial radio astronomy observations. Terrestrial wireless networks, commercial earth observations and terrestrial radio astronomy observations also require mechanisms that will enhance the performance of their users. This thesis proposes a framework that prevents interference between terrestrial wireless networks, commercial earth observations and terrestrial radio astronomy observations when they co-exist; and enhance the performance of their users. The framework uses the cognitive radio; because it is capable of multi-context operation. In the thesis, two interference avoidance mechanisms are presented. The first mechanism prevents interference between terrestrial radio astronomy observations and inter-satellite links. The second mechanism prevent interference between terrestrial wireless networks and the commercial earth observation ground segment. The first interference reductionmechanism determines the inter-satellite link transmission duration. Analysis shows that interference-free inter-satellite links transmission is achievable during terrestrial radio astronomy observation switching for up to 50.7 seconds. The second mechanism enables the mobile ground station, with a trained neural network, to predict the terrestrial wireless network channel idle state. The prediction of the TWN channel idle state prevents interference between the terrestrial wireless network and the mobile ground station. Simulation shows that incorporating prediction in the mobile ground station enhances uplink throughput by 40.6% and reduces latency by 18.6%. In addition, the thesis also presents mechanisms to enhance the performance of the users in terrestrial wireless network, commercial earth observations and terrestrial radio astronomy observations. The thesis presents mechanisms that enhance user performance in homogeneous and heterogeneous terrestrial wireless networks. Mechanisms that enhance the performance of LTE-Advanced users with learning diversity are also presented. Furthermore, a future commercial earth observation network model that increases the accessible earth climatic data is presented. The performance of terrestrial radio astronomy observation users is enhanced by presenting mechanisms that improve angular resolution, power efficiency and reduce infrastructure costs

    MOBILITY SUPPORT ARCHITECTURES FOR NEXT-GENERATION WIRELESS NETWORKS

    Get PDF
    With the convergence of the wireless networks and the Internet and the booming demand for multimedia applications, the next-generation (beyond the third generation, or B3G) wireless systems are expected to be all IP-based and provide real-time and non-real-time mobile services anywhere and anytime. Powerful and efficient mobility support is thus the key enabler to fulfil such an attractive vision by supporting various mobility scenarios. This thesis contributes to this interesting while challenging topic. After a literature review on mobility support architectures and protocols, the thesis starts presenting our contributions with a generic multi-layer mobility support framework, which provides a general approach to meet the challenges of handling comprehensive mobility issues. The cross-layer design methodology is introduced to coordinate the protocol layers for optimised system design. Particularly, a flexible and efficient cross-layer signalling scheme is proposed for interlayer interactions. The proposed generic framework is then narrowed down with several fundamental building blocks identified to be focused on as follows. As widely adopted, we assume that the IP-based access networks are organised into administrative domains, which are inter-connected through a global IP-based wired core network. For a mobile user who roams from one domain to another, macro (inter-domain) mobility management should be in place for global location tracking and effective handoff support for both real-time and non-real-lime applications. Mobile IP (MIP) and the Session Initiation Protocol (SIP) are being adopted as the two dominant standard-based macro-mobility architectures, each of which has mobility entities and messages in its own right. The work explores the joint optimisations and interactions of MIP and SIP when utilising the complementary power of both protocols. Two distinctive integrated MIP-SIP architectures are designed and evaluated, compared with their hybrid alternatives and other approaches. The overall analytical and simulation results shown significant performance improvements in terms of cost-efficiency, among other metrics. Subsequently, for the micro (intra-domain) mobility scenario where a mobile user moves across IP subnets within a domain, a micro mobility management architecture is needed to support fast handoffs and constrain signalling messaging loads incurred by intra-domain movements within the domain. The Hierarchical MIPv6 (HMIPv6) and the Fast Handovers for MIPv6 (FMIPv6) protocols are selected to fulfil the design requirements. The work proposes enhancements to these protocols and combines them in an optimised way. resulting in notably improved performances in contrast to a number of alternative approaches
    corecore