189 research outputs found

    Hybrid routing and bridging strategies for large scale mobile ad hoc networks

    Get PDF
    Multi-hop packet radio networks (or mobile ad-hoc networks) are an ideal technology to establish instant communication infrastructure for military and civilian applications in which both hosts and routers are mobile. In this dissertation, a position-based/link-state hybrid, proactive routing protocol (Position-guided Sliding-window Routing - PSR) that provides for a flat, mobile ad-hoc routing architecture is described, analyzed and evaluated. PSR is based on the superposition of link-state and position-based routing, and it employs a simplified way of localizing routing overhead, without having to resort to complex, multiple-tier routing organization schemes. A set of geographic routing zones is defined for each node, where the purpose of the ith routing zone is to restrict propagation of position updates, advertising position differentials equal to the radius of the (i-i )th routing zone. Thus, the proposed protocol controls position-update overhead generation and propagation by making the overhead generation rate and propagation distance directly proportional to the amount of change in a node\u27s geographic position. An analytical model and framework is provided, in order to study the various design issues and trade-offs of PSR routing mechanism, discuss their impact on the protocol\u27s operation and effectiveness, and identify optimal values for critical design parameters, under different mobility scenarios. In addition an in-depth performance evaluation, via modeling and simulation, was performed in order to demonstrate PSR\u27s operational effectiveness in terms of scalability, mobility support, and efficiency. Furthermore, power and energy metrics, such as path fading and battery capacity considerations, are integrated into the routing decision (cost function) in order to improve PSR\u27s power efficiency and network lifetime. It is demonstrated that the proposed routing protocol is ideal for deployment and implementation especially in large scale mobile ad hoc networks. Wireless local area networks (WLAN) are being deployed widely to support networking needs of both consumer and enterprise applications, and IEEE 802.11 specification is becoming the de facto standard for deploying WLAN. However IEEE 802.11 specifications allow only one hop communication between nodes. A layer-2 bridging solution is proposed in this dissertation, to increase the range of 802.11 base stations using ad hoc networking, and therefore solve the hotspot communication problem, where a large number of mobile users require Internet access through an access point. In the proposed framework nodes are divided into levels based on their distance (hops) from the access point. A layer-2 bridging tree is built based on the level concept, and a node in certain level only forwards packets to nodes in its neighboring level. The specific mechanisms for the forwarding tree establishment as well as for the data propagation are also introduced and discussed. An analytical model is also presented in order to analyze the saturation throughput of the proposed mechanism, while its applicability and effectiveness is evaluated via modeling and simulation. The corresponding numerical results demonstrate and confirm the significant area coverage extension that can be achieved by the solution, when compared with the conventional 802.1 lb scheme. Finally, for implementation purposes, a hierarchical network structure paradigm based on the combination of these two protocols and models is introduced

    Resource-efficient strategies for mobile ad-hoc networking

    Get PDF
    The ubiquity and widespread availability of wireless mobile devices with ever increasing inter-connectivity (e. g. by means of Bluetooth, WiFi or UWB) have led to new and emerging next generation mobile communication paradigms, such as the Mobile Ad-hoc NETworks (MANETs). MANETs are differentiated from traditional mobile systems by their unique properties, e. g. unpredictable nodal location, unstable topology and multi-hop packet relay. The success of on-going research in communications involving MANETs has encouraged their applications in areas with stringent performance requirements such as the e-healthcare, e. g. to connect them with existing systems to deliver e-healthcare services anytime anywhere. However, given that the capacity of mobile devices is restricted by their resource constraints (e. g. computing power, energy supply and bandwidth), a fundamental challenge in MANETs is how to realize the crucial performance/Quality of Service (QoS) expectations of communications in a network of high dynamism without overusing the limited resources. A variety of networking technologies (e. g. routing, mobility estimation and connectivity prediction) have been developed to overcome the topological instability and unpredictability and to enable communications in MANETs with satisfactory performance or QoS. However, these technologies often feature a high consumption of power and/or bandwidth, which makes them unsuitable for resource constrained handheld or embedded mobile devices. In particular, existing strategies of routing and mobility characterization are shown to achieve fairly good performance but at the expense of excessive traffic overhead or energy consumption. For instance, existing hybrid routing protocols in dense MANETs are based in two-dimensional organizations that produce heavy proactive traffic. In sparse MANETs, existing packet delivery strategy often replicates too many copies of a packet for a QoS target. In addition, existing tools for measuring nodal mobility are based on either the GPS or GPS-free positioning systems, which incur intensive communications/computations that are costly for battery-powered terminals. There is a need to develop economical networking strategies (in terms of resource utilization) in delivering the desired performance/soft QoS targets. The main goal of this project is to develop new networking strategies (in particular, for routing and mobility characterization) that are efficient in terms of resource consumptions while being effective in realizing performance expectations for communication services (e. g. in the scenario of e-healthcare emergency) with critical QoS requirements in resource-constrained MANETs. The main contributions of the thesis are threefold: (1) In order to tackle the inefficient bandwidth utilization of hybrid service/routing discovery in dense MANETs, a novel "track-based" scheme is developed. The scheme deploys a one-dimensional track-like structure for hybrid routing and service discovery. In comparison with existing hybrid routing/service discovery protocols that are based on two-dimensional structures, the track-based scheme is more efficient in terms of traffic overhead (e. g. about 60% less in low mobility scenarios as shown in Fig. 3.4). Due to the way "provocative tracks" are established, the scheme has also the capability to adapt to the network traffic and mobility for a better performance. (2) To minimize the resource utilization of packet delivery in sparse MANETs where wireless links are intermittently connected, a store-and-forward based scheme, "adaptive multicopy routing", was developed for packet delivery in sparse mobile ad-hoc networks. Instead of relying on the source to control the delivery overhead as in the conventional multi-copy protocols, the scheme allows each intermediate node to independently decide whether to forward a packet according to the soft QoS target and local network conditions. Therefore, the scheme can adapt to varying networking situations that cannot be anticipated in conventional source-defined strategies and deliver packets for a specific QoS targets using minimum traffic overhead. ii (3) The important issue of mobility measurement that imposes heavy communication/computation burdens on a mobile is addressed with a set of resource-efficient "GPS-free" soluti ons, which provide mobility characterization with minimal resource utilization for ranging and signalling by making use of the information of the time-varying ranges between neighbouring mobile nodes (or groups of mobile nodes). The range-based solutions for mobility characterization consist of a new mobility metric for network-wide performance measurement, two velocity estimators for approximating the inter-node relative speeds, and a new scheme for characterizing the nodal mobility. The new metric and its variants are capable of capturing the mobility of a network as well as predicting the performance. The velocity estimators are used to measure the speed and orientation of a mobile relative to its neighbours, given the presence of a departing node. Based on the velocity estimators, the new scheme for mobility characterization is capable of characterizing the mobility of a node that are associated with topological stability, i. e. the node's speeds, orientations relative to its neighbouring nodes and its past epoch time. iiiBIOPATTERN EU Network of Excellence (EU Contract 508803

    Assortativity Effects on Diffusion-like Processes in Scale-free Networks

    Get PDF
    We study the variation in epidemic thresholds in complex networks with different assortativity properties. We determine the thresholds by applying spectral analysis to the matrices associated to the graphs. In order to produce graphs with a specific assortativity we introduce a procedure to sample the space of all the possible networks with a given degree sequence. Our analysis shows that while disassortative networks have an higher epidemiological threshold, assortative networks have a slower diffusion time for diseases. We also used these networks for evaluating the effects of assortativity in a specific dynamic model of sandpile. We show that immunization procedures give different results according to the assortativity of the network considered

    Framework to facilitate smooth handovers between mobile IPv6 networks

    Get PDF
    Fourth generation (4G) mobile communication networks are characterised by heterogeneous access networks and IP based transport technologies. Different access technologies give users choices to select services such as levels of Quality of Service (QoS) support, business models and service providers. Flexibility of heterogeneous access is compounded by the overhead of scanning to discover accessible services, which added to the handoff latency. This thesis has developed mechanisms for service discovery and service selection, along with a novel proposal for mobility management architectures that reduced handoff latency. The service discovery framework included a service advertisement data repository and a single frequency band access mechanism, which enabled users to explore services offered by various operators with a reduced scanning overhead. The novel hierarchical layout of the repository enabled it to categorise information into various layers and facilitate location based information retrieval. The information made available by the repository included cost, bandwidth, Packet Loss (PL), latency, jitter, Bit Error Rate (BER), location and service connectivity information. The single frequency band access mechanism further enabled users to explore service advertisements in the absence of their main service providers. The single frequency access mechanism broadcasted service advertisements information piggybacked onto a router advertisement packet on a reserved frequency band for advertisements. Results indicated that scanning 13 channels on 802.11 b interface takes 189ms whereas executing a query with maximum permissible search parameters on the service advertisement data repository takes 67ms. A service selection algorithm was developed to make handoff decisions utilising the service advertisements acquired from the service discovery framework; based on a user's preference. The selection algorithm reduced the calculation overhead by eliminating unsuitable networks; based on interface compatibility, service provider location, unacceptable QoS (Quality of service) and unacceptable cost; from the selection process. The selection algorithm utilised cost, bandwidth, PL, latency, jitter, BER and terminal power for computing the most suitable network. Results indicated that the elimination based approach has improved the performance of the algorithm by 35% over non- elimination oriented selection procedures, even after utilising more selection parameters. The service discovery framework and the service selection algorithm are flexible enough to be employed in most mobility management architectures. The thesis recommends Seamless Mobile Internet Protocol (SMIP) as a mobility management scheme based on the simulation results. The SMIP protocol, a combination of Hierarchical Mobile Internet Protocol (HMIP) and Fast Mobile Internet Protocol (FMIP), suffered hand off latency increases when undergoing a global handoff due to HMIP. The proposed modification to the HMIP included the introduction of a coverage area overlap, to reduce the global handoff latency. The introduction of a Home Address (HA) in Wireless Local Area Networks (WLAN) binding table enabled seamless handoffs from WLANs by having a redirection mechanism for the user's packets after handoff. The thesis delivered a new mobility management architecture with mechanisms for service discovery and service selection. The proposed framework enabled user oriented, application centric and terminal based approach for selecting IPv6 networks

    Multicast outing protocols and architectures in mobile ad-hoc wireless networks

    Get PDF
    The basic philosophy of personal communication services is to provide user-to-user, location independent communication services. The emerging group communication wireless applications, such as multipoint data dissemination and multiparty conferencing tools have made the design and development of efficient multicast techniques in mobile ad-hoc networking environments a necessity and not just a desire. Multicast protocols in mobile adhoc networks have been an area of active research for the past few years. In this dissertation, protocols and architectures for supporting multicast services are proposed, analyzed and evaluated in mobile ad-hoc wireless networks. In the first chapter, the activities and recent advances are summarized in this work-in-progress area by identifying the main issues and challenges that multicast protocols are facing in mobile ad-hoc networking environments and by surveying several existing multicasting protocols. a classification of the current multicast protocols is presented, the functionality of the individual existing protocols is discussed, and a qualitative comparison of their characteristics is provided according to several distinct features and performance parameters. In the second chapter, a novel mobility-based clustering strategy that facilitates the support of multicast routing and mobility management is presented in mobile ad-hoc networks. In the proposed structure, mobile nodes are organized into nonoverlapping clusters which have adaptive variable-sizes according to their respective mobility. The mobility-based clustering (MBC) approach which is proposed uses combination of both physical and logical partitions of the network (i.e. geographic proximity and functional relation between nodes, such as mobility pattern etc.). In the third chapter, an entropy-based modeling framework for supporting and evaluating the stability is proposed in mobile ad-hoc wireless networks. The basic motivations of the proposed modeling approach stem from the commonality observed in the location uncertainty in mobile ad-hoc wireless networks and the concept of entropy. In the fourth chapter, a Mobility-based Hybrid Multicast Routing (MHMR) protocol suitable for mobile ad-hoc networks is proposed. The MHMR uses the MBC algorithm as the underlying structure. The main features that the proposed protocol introduces are the following: a) mobility based clustering and group based hierarchical structure, in order to effectively support the stability and scalability, b) group based (limited) mesh structure and forwarding tree concepts, in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide the low route acquisition delay of proactive techniques and the low overhead of reactive methods. In the fifth chapter, an architecture for supporting geomulticast services with high message delivery accuracy is presented in mobile ad-hoc wireless networks. Geomulticast is a specialized location-dependent multicasting technique, where messages are multicast to some specific user groups within a specific zone. An analytical framework which is used to evaluate the various geomulticast architectures and protocols is also developed and presented. The last chapter concludes the dissertation

    An approach to display layout of dynamic windows

    Get PDF
    The development of windows based user interface has introduced a new dimension to the field of human computer interaction. Now a user is able to perform multiple tasks at a time, often switching from one task to another. However windows environment also imposes the burden of manual windows management on the user. Several studies have suggested that manual window management is an unproductive chore often resulting in clutter and confusion on the display screen. Therefore we need a automatic windows layout generator to free the user to perform other useful tasks. This thesis introduces SPORDAC {Shadow Propagation for Overlap Removal and Display Area Compaction) algorithm. This algorithm aims to remove overlap from the display layout and encapsulate the layout in the finite display area. The SPORDAC prototype integrates the SPORDAC algorithm with simulated annealing to optimise the display area usage. The usefulness and applicability of the SPORDAC approach are illustrated with the implementation of a prototype, samples of generated layouts and analysis of the collected dat

    Software architecture for modeling and distributing virtual environments

    Get PDF

    Efficient Time of Arrival Calculation for Acoustic Source Localization Using Wireless Sensor Networks

    Get PDF
    Acoustic source localization is a very useful tool in surveillance and tracking applications. Potential exists for ubiquitous presence of acoustic source localization systems. However, due to several significant challenges they are currently limited in their applications. Wireless Sensor Networks (WSN) offer a feasible solution that can allow for large, ever present acoustic localization systems. Some fundamental challenges remain. This thesis presents some ideas for helping solve the challenging problems faced by networked acoustic localization systems. We make use of a low-power WSN designed specifically for distributed acoustic source localization. Our ideas are based on three important observations. First, sounds emanating from a source will be free of reflections at the beginning of the sound. We make use of this observation by selectively processing only the initial parts of a sound to be localized. Second, the significant features of a sound are more robust to various interference sources. We perform key feature recognition such as the locations of significant zero crossings and local peaks. Third, these features which are compressed descriptors, can also be used for distributed pattern matching. For this we perform basic pattern analysis by comparing sampled signals from various nodes in order to determine better Time Of Arrivals (TOA). Our implementation tests these ideas in a predictable test environment. A complete system for general sounds is left for future wor
    • …
    corecore