Structural Separation and Access in Telecommunications Markets

This paper presents a basic framework to assess whether structural (vertical) separation is desirable. It is discussed within the setting of fixed telecommunications markets. From an economist’s perspective, the key question that underlies the case for structural separation is: is there a persistent bottleneck? The obvious candidate is the ‘local loop’, or local access network. If yes then it makes sense to compare the costs and benefits of structural separation. The framework provides a set of options that the regulator can use strategically, by using the threat of a break-up to influence an incumbent’s competitive stance in the wholesale market.

Social Shaping for Multi-Agent Systems

Multi-agent systems have gained attention due to advances in automation, technology, and AI. In these systems, intelligent agents collaborate through networks to achieve goals. Despite successes, multi-agent systems pose social challenges. Problems include agents finding resource prices unacceptable due to efficient allocation, interactions being cooperative/competitive, leading to varying outcomes, and sensitive data being at risk due to sharing. Problems are: 1. Price Acceptance; 2. Agent Cooperation and Competition; 3. Privacy Risks. For Price Acceptance, we address decentralized resource allocation systems as markets. We solve price acceptance in static systems with quadratic utility functions by defining allowed quadratic ranges. For dynamic systems, we present dynamic competitive equilibrium computation and propose a horizon strategy for smoothing dynamic pricing. Concerning Agent Cooperation and Competition, we study the well-known Regional Integrated Climate-Economy model (RICE). It's a dynamic game. We analyze cooperative and competitive solutions, showing impact on negotiations and consensus for regional climate action. Regarding Privacy Risks, we infer network structures from linear-quadratic game best-response dynamics to reveal agent vulnerabilities. We prove network identifiability tied to controllability conditions. A stable, sparse system identification algorithm learns network structures despite noise. Lastly, we contribute privacy-aware algorithms. We address network games where agents aggregate under differential privacy. Extending to network games, we propose a Laplace linear-quadratic functional perturbation algorithm. A tutorial example demonstrates meeting privacy needs through tuning. In summary, this thesis solves social challenges in multi-agent systems: Price Acceptance, Agent Cooperation and Competition, and Privacy Risks

Air pollution and livestock production

The air in a livestock farming environment contains high concentrations of dust particles and gaseous pollutants. The total inhalable dust can enter the nose and mouth during normal breathing and the thoracic dust can reach into the lungs. However, it is the respirable dust particles that can penetrate further into the gas-exchange region, making it the most hazardous dust component. Prolonged exposure to high concentrations of dust particles can lead to respiratory health issues for both livestock and farming staff. Ammonia, an example of a gaseous pollutant, is derived from the decomposition of nitrous compounds. Increased exposure to ammonia may also have an effect on the health of humans and livestock. There are a number of technologies available to ensure exposure to these pollutants is minimised. Through proactive means, (the optimal design and management of livestock buildings) air quality can be improved to reduce the likelihood of risks associated with sub-optimal air quality. Once air problems have taken hold, other reduction methods need to be applied utilising a more reactive approach. A key requirement for the control of concentration and exposure of airborne pollutants to an acceptable level is to be able to conduct real-time measurements of these pollutants. This paper provides a review of airborne pollution including methods to both measure and control the concentration of pollutants in livestock buildings

Fair relay selection in wireless rural networks using game theory

Access to Internet is the key to facilitate the economic growth and development of the rural communities and to bridge the digital-divide between the urban and rural population. The traditional broadband access technologies are not always suitable for the rural areas due to their difficult topography and sparsely populated communities. Specialized relay stations can be deployed to extend the coverage of a wireless rural network but they come with an inherited increase in the infrastructural cost. An alternative is to utilize the in-range users as relays to enhance the coverage range of the wireless rural network. In this thesis, the in-range ordinary users termed as primary users (PUs) are used to act as relays for the out-of-range users called the secondary users (SUs). Two relay selection solutions, the Fair Battery Power Consumption (FBPC) algorithm and the Credit based Fair Relay Selection (CF-RS) protocol have been proposed with the aim of providing fair chance to every PU to assist the SUs, thus resulting in fair utilization of battery power of all relays along with the coverage extension. The FBPC algorithm uses the concept of proportional fairness as the relay selection criterion. However, if only proportionally fair consumption of battery power is taken as the relay selection parameter, the FBPC algorithm may result in selecting relays with poor channel conditions. The rural network may also consist of selfish PUs which need to be incentivized to use their resources for the SUs. The CF-RS protocol is developed which takes into account both the achievable data rate and consumption of battery power for selection of a relay. The CF-RS protocol is formulated using Stackelberg game which employs a credit-based incentive mechanism to motivate the self-interested PUs to help the SUs by providing instantaneous as well as long term benefit to the PUs. A basic network model consisting of PUs and SUs has been simulated and the performance of the FBPC algorithm and the CF-RS protocol have been evaluated in terms of data rate and utility achievable at the SUs, dissipation of battery power of the PUs and Jain’s fairness index to determine fairness in utilization of battery power. The results obtained show that the FBPC algorithm achieves approximately 100% fairness for utilization of battery power of relays but compromises the data rate attainable by the SUs. Thus the FBPC algorithm shall be viewed as a trade-off between the fair battery power dissipation of relays and the data rate achievable by the SUs. Whereas, the CF-RS protocol provides 55% better utility and longer service time to the SUs without harming the attainable data rate and achieves 80% fairness. When the CF-RS protocol is used for relay selection, it is advantageous even for the self-interested users to participate in the relaying process to earn some benefit to utilize it when needed to buy assistance from other users

An Optimization Theoretical Framework for Resource Allocation over Wireless Networks

With the advancement of wireless technologies, wireless networking has become ubiquitous owing to the great demand of pervasive mobile applications. Some fundamental challenges exist for the next generation wireless network design such as time varying nature of wireless channels, co-channel interferences, provisioning of heterogeneous type of services, etc. So how to overcome these difficulties and improve the system performance have become an important research topic. Dynamic resource allocation is a general strategy to control the interferences and enhance the performance of wireless networks. The basic idea behind dynamic resource allocation is to utilize the channel more efficiently by sharing the spectrum and reducing interference through optimizing parameters such as the transmitting power, symbol transmission rate, modulation scheme, coding scheme, bandwidth, etc. Moreover, the network performance can be further improved by introducing diversity, such as multiuser, time, frequency, and space diversity. In addition, cross layer approach for resource allocation can provide advantages such as low overhead, more efficiency, and direct end-to-end QoS provision. The designers for next generation wireless networks face the common problem of how to optimize the system objective under the user Quality of Service (QoS) constraint. There is a need of unified but general optimization framework for resource allocation to allow taking into account a diverse set of objective functions with various QoS requirements, while considering all kinds of diversity and cross layer approach. We propose an optimization theoretical framework for resource allocation and apply these ideas to different network situations such as: 1.Centralized resource allocation with fairness constraint 2.Distributed resource allocation using game theory 3.OFDMA resource allocation 4.Cross layer approach On the whole, we develop a universal view of the whole wireless networks from multiple dimensions: time, frequency, space, user, and layers. We develop some schemes to fully utilize the resources. The success of the proposed research will significantly improve the way how to design and analyze resource allocation over wireless networks. In addition, the cross-layer optimization nature of the problem provides an innovative insight into vertical integration of wireless networks

Performance evaluation of cooperation strategies for m-health services and applications

Health telematics are becoming a major improvement for patients’ lives, especially for disabled, elderly, and chronically ill people. Information and communication technologies have rapidly grown along with the mobile Internet concept of anywhere and anytime connection. In this context, Mobile Health (m-Health) proposes healthcare services delivering, overcoming geographical, temporal and even organizational barriers. Pervasive and m-Health services aim to respond several emerging problems in health services, including the increasing number of chronic diseases related to lifestyle, high costs in existing national health services, the need to empower patients and families to self-care and manage their own healthcare, and the need to provide direct access to health services, regardless the time and place. Mobile Health (m- Health) systems include the use of mobile devices and applications that interact with patients and caretakers. However, mobile devices have several constraints (such as, processor, energy, and storage resource limitations), affecting the quality of service and user experience. Architectures based on mobile devices and wireless communications presents several challenged issues and constraints, such as, battery and storage capacity, broadcast constraints, interferences, disconnections, noises, limited bandwidths, and network delays. In this sense, cooperation-based approaches are presented as a solution to solve such limitations, focusing on increasing network connectivity, communication rates, and reliability. Cooperation is an important research topic that has been growing in recent years. With the advent of wireless networks, several recent studies present cooperation mechanisms and algorithms as a solution to improve wireless networks performance. In the absence of a stable network infrastructure, mobile nodes cooperate with each other performing all networking functionalities. For example, it can support intermediate nodes forwarding packets between two distant nodes. This Thesis proposes a novel cooperation strategy for m-Health services and applications. This reputation-based scheme uses a Web-service to handle all the nodes reputation and networking permissions. Its main goal is to provide Internet services to mobile devices without network connectivity through cooperation with neighbor devices. Therefore resolving the above mentioned network problems and resulting in a major improvement for m-Health network architectures performances. A performance evaluation of this proposal through a real network scenario demonstrating and validating this cooperative scheme using a real m-Health application is presented. A cryptography solution for m-Health applications under cooperative environments, called DE4MHA, is also proposed and evaluated using the same real network scenario and the same m-Health application. Finally, this work proposes, a generalized cooperative application framework, called MobiCoop, that extends the incentive-based cooperative scheme for m-Health applications for all mobile applications. Its performance evaluation is also presented through a real network scenario demonstrating and validating MobiCoop using different mobile applications