An economic incentive based routing protocol incorporating quality of service for mobile peer-to-peer networks

Economic incentive models are becoming increasingly popular in Mobile Peer to Peer Networks (M-P2P). These models entice node participation to combat free riding and to effectively manage constraint resources in the network. Due to the dynamic topology of the M-P2P network, the connections between the peers become unpredictable and therefore, reliable routing becomes important. Many routing protocols proposed earlier (such as DSR, AODV) are based on best effort data traffic policy, such as the shortest route selection (hop minimization). Using economic models to find a cost effective optimal route from the source to the destination, while considering Quality of Service (QoS) aspects such as bandwidth and Service Capacity constraints for data delivery, remains a challenging task due to the presence of multiple paths and service providers. In this paper, we propose a Game theory based economic approach for routing with QoS support in M-P2P networks to forward data. Modeling the network as a directed weighted graph and using the cost acquired from the price function as an incentive to pay the intermediate nodes, we develop a Game theoretic approach based on stochastic games to find an optimal route. We formulate a capacity function, which provides the available bandwidth to support the QoS aspect. The performance of our routing protocol is also evaluated and compared with some existing routing protocols and the result shows that our protocol proves to be efficient compared to shortest-path DSR and multiple paths SMR in terms of average response time, energy utilization and bandwidth availability in the network --Abstract, page iv

Incentive based Routing Protocol for Mobile Peer to Peer Networks

Incentive models are becoming increasingly popular in Mobile Peer to Peer Networks (M-P2P) as these models entice node participation in return for a virtual currency to combat free riding and to effectively manage constraint resources in the network. Many routing protocols proposed are based on best effort data traffic policy, such as the shortest route selection (hop minimization). Using virtual currency to find a cost effective optimal route from the source to the destination, while considering Quality of Service (QoS) aspects such as bandwidth and service capacity constraints for data delivery, remains a challenging task due to the presence of multiple paths and service providers. Modeling the network as a directed weighted graph and using the cost acquired from the price function as an incentive to pay the intermediate nodes in M-P2P networks to forward data, we develop a Game theoretic approach based on stochastic games to find an optimal route considering QoS aspect. The performance of our routing protocol is evaluated and compared with some existing routing protocols and the result shows that our protocol proves to be efficient compared to shortest-path DSR and multiple paths SMR in terms of average response time, energy and bandwidth utilization in the network

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

Enabling Censorship Tolerant Networking

Billions of people in the world live under heavy information censorship. We propose a new class of delay tolerant network (DTN), known as a censorship tolerant network (CTN), to counter the growing practice of Internet-based censorship. CTNs should provide strict guarantees on the privacy of both information shared within the network and the identities of network participants. CTN software needs to be publicly available as open source software and run on personal mobile devices with real-world computational, storage, and energy constraints. We show that these simple assumptions and system constraints have a non-obvious impact on the design and implementation of CTNs, and serve to differentiate our system design from previous work. We design data routing within a CTN using a new paradigm: one where nodes operate selfishly to maximize their own utility, make decisions based only on their own observations, and only communicate with nodes they trust. We introduce the Laissez-faire framework, an incentivized approach to CTN routing. Laissez-faire does not mandate any specific routing protocol, but requires that each node implement tit-for-tat by keeping track of the data exchanged with other trusted nodes. We propose several strategies for valuing and retrieving content within a CTN. We build a prototype BlackBerry implementation and conduct both controlled lab and field trials, and show how each strategy adapts to different network conditions. We further demonstrate that, unlike existing approaches to routing, Laissez-faire prevents free-riding. We build an efficient and reliable data transport protocol on top of the Short Message Service (SMS) to serve a control channel for the CTN. We conduct a series of experiments to characterise SMS behaviour under bursty, unconventional workloads. This study examines how variables such as the transmission order, delay between transmissions, the network interface used, and the time-of-day affect the service. We present the design and implementation of our transport protocol. We show that by adapting to the unique channel conditions of SMS we can reduce message overheads by as much as 50\% and increase data throughput by as much as 545% over the approach used by existing applications. A CTN's dependency on opportunistic communication imposes a significant burden on smartphone energy resources. We conduct a large-scale user study to measure the energy consumption characteristics of 20100 smartphone users. Our dataset is two orders of magnitude larger than any previous work. We use this dataset to build the Energy Emulation Toolkit (EET) that allows developers to evaluate the energy consumption requirements of their applications against real users' energy traces. The EET computes the successful execution rate of energy-intensive applications across all users, specific devices, and specific smartphone user-types. We also consider active adaptation to energy constraints. By classifying smartphone users based on their charging characteristics we demonstrate that energy level can be predicted within 72% accuracy a full day in advance, and through an Energy Management Oracle energy intensive applications, such as CTNs, can adapt their execution to maintain the operation of the host device

Integration and Continuity of Primary Care: Polyclinics and Alternatives, a Patient-Centred Analysis of How Organisation Constrains Care Coordination

Background An ageing population, increasingly specialised of clinical services and diverse healthcare provider ownership make the coordination and continuity of complex care increasingly problematic. The way in which the provision of complex healthcare is coordinated produces – or fails to – six forms of continuity of care (cross-sectional, longitudinal, flexible, access, informational, relational). Care coordination is accomplished by a combination of activities by: patients themselves; provider organisations; care networks coordinating the separate provider organisations; and overall health system governance. This research examines how far organisational integration might promote care coordination at the clinical level. Objectives To examine: 1. What differences the organisational integration of primary care makes, compared with network governance, to horizontal and vertical coordination of care. 2. What difference provider ownership (corporate, partnership, public) makes. 3. How much scope either structure allows for managerial discretion and ‘performance’. 4. Differences between networked and hierarchical governance regarding the continuity and integration of primary care. 5. The implications of the above for managerial practice in primary care. Methods Multiple-methods design combining: 1. Assembly of an analytic framework by non-systematic review. 2. Framework analysis of patients’ experiences of the continuities of care. 3. Systematic comparison of organisational case studies made in the same study sites. 4. A cross-country comparison of care coordination mechanisms found in our NHS study sites with those in publicly owned and managed Swedish polyclinics. 5. Analysis and synthesis of data using an ‘inside-out’ analytic strategy. Study sites included professional partnership, corporate and publicly owned and managed primary care providers, and different configurations of organisational integration or separation of community health services, mental health services, social services and acute in-patient care. Results Starting from data about patients' experiences of the coordination or under-coordination of care we identified: 1. Five care coordination mechanisms present in both the integrated organisations and the care networks. 2. Four main obstacles to care coordination within the integrated organisations, of which two were also present in the care networks. 3. Seven main obstacles to care coordination that were specific to the care networks. 4. Nine care coordination mechanisms present in the integrated organisations. Taking everything into consideration, integrated organisations appeared more favourable to producing continuities of care than were care networks. Network structures demonstrated more flexibility in adding services for small care groups temporarily, but the expansion of integrated organisations had advantages when adding new services on a longer term and larger scale. Ownership differences affected the range of services to which patients had direct access; primary care doctors’ managerial responsibilities (relevant to care coordination because of its impact on GP workload); and the scope for doctors to develop special interests. We found little difference between integrated organisations and care networks in terms of managerial discretion and performance. Conclusions On balance, an integrated organisation seems more likely to favour the development of care coordination, and therefore continuities of care, than a system of care networks. At least four different variants of ownership and management of organisationally integrated primary care providers are practicable in NHS-like settings

Integration and continuity of primary care: polyclinics and alternatives - a patient-centred analysis of how organisation constrains care co-ordination

Background An ageing population, the increasing specialisation of clinical services and diverse health-care provider ownership make the co-ordination and continuity of complex care increasingly problematic. The way in which the provision of complex health care is co-ordinated produces – or fails to produce – six forms of continuity of care (cross-sectional, longitudinal, flexible, access, informational and relational). Care co-ordination is accomplished by a combination of activities by patients themselves; provider organisations; care networks co-ordinating the separate provider organisations; and overall health-system governance. This research examines how far organisational integration might promote care co-ordination at the clinical level. Objectives To examine (1) what differences the organisational integration of primary care makes, compared with network governance, to horizontal and vertical co-ordination of care; (2) what difference provider ownership (corporate, partnership, public) makes; (3) how much scope either structure allows for managerial discretion and ‘performance’; (4) differences between networked and hierarchical governance regarding the continuity and integration of primary care; and (5) the implications of the above for managerial practice in primary care. Methods Multiple-methods design combining (1) the assembly of an analytic framework by non-systematic review; (2) a framework analysis of patients’ experiences of the continuities of care; (3) a systematic comparison of organisational case studies made in the same study sites; (4) a cross-country comparison of care co-ordination mechanisms found in our NHS study sites with those in publicly owned and managed Swedish polyclinics; and (5) the analysis and synthesis of data using an ‘inside-out’ analytic strategy. Study sites included professional partnership, corporate and publicly owned and managed primary care providers, and different configurations of organisational integration or separation of community health services, mental health services, social services and acute inpatient care. Results Starting from data about patients’ experiences of the co-ordination or under-co-ordination of care, we identified five care co-ordination mechanisms present in both the integrated organisations and the care networks; four main obstacles to care co-ordination within the integrated organisations, of which two were also present in the care networks; seven main obstacles to care co-ordination that were specific to the care networks; and nine care co-ordination mechanisms present in the integrated organisations. Taking everything into consideration, integrated organisations appeared more favourable to producing continuities of care than did care networks. Network structures demonstrated more flexibility in adding services for small care groups temporarily, but the expansion of integrated organisations had advantages when adding new services on a longer term and a larger scale. Ownership differences affected the range of services to which patients had direct access; primary care doctors’ managerial responsibilities (relevant to care co-ordination because of their impact on general practitioner workload); and the scope for doctors to develop special interests. We found little difference between integrated organisations and care networks in terms of managerial discretion and performance. Conclusions On balance, an integrated organisation seems more likely to favour the development of care co-ordination and, therefore, continuities of care than a system of care networks. At least four different variants of ownership and management of organisationally integrated primary care providers are practicable in NHS-like settings. Future research is therefore required, above all to evaluate comparatively the different techniques for coordinating patient discharge across the triple interface between hospitals, general practices and community health services; and to discover what effects increasing the scale and scope of general practice activities will have on continuity of care

Joint source-channel-network coding in wireless mesh networks with temporal reuse

Technological innovation that empowers tiny low-cost transceivers to operate with a high degree of utilisation efficiency in multihop wireless mesh networks is contributed in this dissertation. Transmission scheduling and joint source-channel-network coding are two of the main aspects that are addressed. This work focuses on integrating recent enhancements such as wireless network coding and temporal reuse into a cross-layer optimisation framework, and to design a joint coding scheme that allows for space-optimal transceiver implementations. Link-assigned transmission schedules with timeslot reuse by multiple links in both the space and time domains are investigated for quasi-stationary multihop wireless mesh networks with both rate and power adaptivity. Specifically, predefined cross-layer optimised schedules with proportionally fair end-to-end flow rates and network coding capability are constructed for networks operating under the physical interference model with single-path minimum hop routing. Extending transmission rights in a link-assigned schedule allows for network coding and temporal reuse, which increases timeslot usage efficiency when a scheduled link experiences packet depletion. The schedules that suffer from packet depletion are characterised and a generic temporal reuse-aware achievable rate region is derived. Extensive computational experiments show improved schedule capacity, quality of service, power efficiency and benefit from opportunistic bidirectional network coding accrued with schedules optimised in the proposed temporal reuse-aware convex capacity region. The application of joint source-channel coding, based on fountain codes, in the broadcast timeslot of wireless two-way network coding is also investigated. A computationally efficient subroutine is contributed to the implementation of the fountain compressor, and an error analysis is done. Motivated to develop a true joint source-channel-network code that compresses, adds robustness against channel noise and network codes two packets on a single bipartite graph and iteratively decodes the intended packet on the same Tanner graph, an adaptation of the fountain compressor is presented. The proposed code is shown to outperform a separated joint source-channel and network code in high source entropy and high channel noise regions, in anticipated support of dense networks that employ intelligent signalling. AFRIKAANS : Tegnologiese innovasie wat klein lae-koste kommunikasie toestelle bemagtig om met ’n hoë mate van benuttings doeltreffendheid te werk word bygedra in hierdie proefskrif. Transmissie-skedulering en gesamentlike bron-kanaal-netwerk kodering is twee van die belangrike aspekte wat aangespreek word. Hierdie werk fokus op die integrasie van onlangse verbeteringe soos draadlose netwerk kodering en temporêre herwinning in ’n tussen-laag optimaliserings raamwerk, en om ’n gesamentlike kodering skema te ontwerp wat voorsiening maak vir spasie-optimale toestel implementerings. Skakel-toegekende transmissie skedules met tydgleuf herwinning deur veelvuldige skakels in beide die ruimte en tyd domeine word ondersoek vir kwasi-stilstaande, veelvuldige-sprong draadlose rooster netwerke met beide transmissie-spoed en krag aanpassings. Om spesifiek te wees, word vooraf bepaalde tussen-laag geoptimiseerde skedules met verhoudings-regverdige punt-tot-punt vloei tempo’s en netwerk kodering vermoë saamgestel vir netwerke wat bedryf word onder die fisiese inmengings-model met enkel-pad minimale sprong roetering. Die uitbreiding van transmissie-regte in ’n skakel-toegekende skedule maak voorsiening vir netwerk kodering en temporêre herwinning, wat tydgleuf gebruiks-doeltreffendheid verhoog wanneer ’n geskeduleerde skakel pakkie-uitputting ervaar. Die skedules wat ly aan pakkie-uitputting word gekenmerk en ’n generiese temporêre herwinnings-bewuste haalbare transmissie-spoed gebied word afgelei. Omvattende berekenings-eksperimente toon verbeterde skedulerings kapasiteit, diensgehalte, krag doeltreffendheid asook verbeterde voordeel wat getrek word uit opportunistiese tweerigting netwerk kodering met die skedules wat geoptimiseer word in die temporêre herwinnings-bewuste konvekse transmissie-spoed gebied. Die toepassing van gesamentlike bron-kanaal kodering, gebaseer op fontein kodes, in die uitsaai-tydgleuf van draadlose tweerigting netwerk kodering word ook ondersoek. ’n Berekenings-effektiewe subroetine word bygedra in die implementering van die fontein kompressor, en ’n foutanalise word gedoen. Gemotiveer om ’n ware gesamentlike bron-kanaal-netwerk kode te ontwikkel, wat robuustheid byvoeg teen kanaal geraas en twee pakkies netwerk kodeer op ’n enkele bipartiete grafiek en die beoogde pakkie iteratief dekodeer op dieselfde Tanner grafiek, word ’n aanpassing van die fontein kompressor aangebied. Dit word getoon dat die voorgestelde kode ’n geskeide gesamentlike bron-kanaal en netwerk kode in hoë bron-entropie en ho¨e kanaal-geraas gebiede oortref in verwagte ondersteuning van digte netwerke wat van intelligente sein-metodes gebruik maak.Dissertation (MEng)--University of Pretoria, 2011.Electrical, Electronic and Computer Engineeringunrestricte

A system dynamics & emergency logistics model for post-disaster relief operations

Emergency teams’ efficiency in responding to disasters is critical in saving lives, reducing suffering, and for damage control. Quality standards for emergency response systems are based on government policies, resources, training, and team readiness and flexibility. This research investigates these matters in regards to Saudi emergency responses to floods in Jeddah in 2009 and again in 2011. The study is relevant to countries who are building emergency response capacity for their populations: analysing the effects of the disaster, communications and data flows for stakeholders, achieving and securing access, finding and rescuing victims, setting up field triage sites, evacuation, and refuges. The research problem in this case was to develop a dynamic systems model capable of managing real time data to allow a team or a decision-maker to optimise their particular response within a rapidly changing situation. The Emergency Logistics Centre capability model responds to this problem by providing a set of nodes relevant to each responsibility centre (Civil Defence, regional/local authority including rescue teams, police and clean-up teams, Red Crescent). These nodes facilitate information on resource use and replenishment, and barriers such as access and weather can be controlled for in the model. The dynamic systems approach builds model capacity and transparency, allowing emergency response decision-makers access to updated instructions and decisions that may affect their capacities. After the event, coordinators and researchers can review data and actions for policy change, resource control, training and communications. In this way, knowledge from the experiences of members of the network is not lost for future position occupants in the emergency response network. The conclusion for this research is that the Saudi emergency response framework is now sufficiently robust to respond to a large scale crisis, such as may occur during the hajj with its three million pilgrims. Researchers are recommended to test their emergency response systems using the Emergency Logistics Centre model, if only to encourage rethinking and flexibility of perhaps stale or formulaic responses from staff. This may lead to benefits in identification of policy change, training, or more appropriate pathways for response teams

Combinatorial exchange models for a user-driven air traffic flow management in Europe

2008/2009Air Traffic Flow Management (ATFM) is the service responsible to guarantee that the available capacity of the air transportation system is efficiently used and never exceeded. It guarantees safety of air transportation by adopting a series of measures which range from strategic long-term ones to the imposition of ground delays to flights at a tactical level. These ATFM delays are imposed to individual flights at the departure airport prior to their take-off, since it is safer and less costly to anticipate on the ground any delay predicted somewhere in the system. They are assigned by a central authority according to a First-Planned-First-Served principle, without taking into account individual Airlines' preferences. This criteria of assignment can cause an aggregated cost of delay experienced by users, higher than the minimal one, due to the fact that the cost of delay is a non-linear function of the duration and it depends on many variables such as the type of aircraft, the specific origin-destination pair, ecc. This thesis tackles the issue of formalizing and analyzing alternative models for the assignment of ATFM resources which take into account individual airlines preferences. In particular mathematical programming models are analyzed, that extend the concept of ATFM slot currently adopted to the one of Target Window, as proposed in the CATS European project. Such a concept is in line with the SESAR program, recently adopted in Europe to develop the new generation system of Air Traffic Management, which imposes a direct involvement of Airspace users whenever external constraints need to be enforced that modify their original requests. The first Chapter provides a general introduction to the context of Air Traffic Management and Air Traffic Control. In the second Chapter the principles, methods and performances of the ATFM system are described according to the current situation as well as to the SESAR target concept. The problem of optimally assign ATFM resources is then described mathematically and then analyzed to uncover two fundamental structures that determine its tractability: one corresponds to the case in which there is a unique capacity constrained resource while in the second there is an unrestricted number of constrained resources. In Chapter three a number of properties are proved that give insight into the applicability of different mechanisms for a central calculation of the optimal solution by the ATFM authority. Since such mechanisms involve cost minimization for several agents they are formulated as exchanges, i.e. particular types of auctions in which each participant may buy and/or sell several indivisible goods. The last part of the thesis included in Chapter four deals with the design of iterative exchange mechanisms, whose application in real world presents several advantages with respect to centralized models, from the distribution of computational complexity among participants to the preservation of disclosure of private information by Aircraft Operators. In this case an optimal model based on the Lagrangian relaxation of the separable central problem is first formulated and analyzed. To overcome practical issues possibly deriving from its application in real operations, an heuristic iterative Market-based mechanism is finally formalized. This algorithm exploits some of the underlying characteristics specific to the problem to derive near-optimal solutions in an acceptable time. Computational results are obtained by simulating its implementation on real traffic data and they show that considerable cost savings are possible with respect to a First-Planned-First-Served central allocation. The contribute of this thesis is twofold. The first is to provide a mathematical description, modeling and analysis of the ATFM resource exchange problem faced by Airspace users when network capacity needs to be rationed among them. The second consists in the methodological innovation represented by the formulation of the Market Mechanism which is compliant with several requirements represented by legislative and practical constraints and whose simulation provided encouraging results.XXII Cicl