The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we consider the problem of increasing the throughput of cognitive radio in a cognitive radio network by forming coalitions among cognitive radio users. Recently there have been numerous studies exploring the benefits of the cooperation in a cognitive radio network. The cooperation tends to increase the spectrum sensing performance which in turn results in increased transmission opportunities...
Global efforts aim at utilizing the available information technology in order to enhance the power grid with resilience properties, precise accounting and new services. Towards this end, we provide methods to support an adaptive power grid and study the relative changes in supply and/or demand while in a quasi-steady state. Acknowledging that the absolute amount of the power demand/supply is not always...
An extensible, decentralized Internet of Things (IoT), with self-governing objects connected to a shared, variable power supply, is a realistic problem domain for certain demand-management problems arising in the context of future “smart homes” connected to smart power grids. A theoretical framework of such an IoT is presented and discussed in this paper. Each object of the IoT has a power demand...
The problem of resource allocation for OFDMA downlink is investigated in this paper. The problem is formulated as a rate adaptive problem, which is to maximize the system throughput while subject to total transmission power constraints. A distributed resource allocation scheme to solve this combinatorial optimization problem is presented. The problem is decomposed into a principal problem with regard...
In recent work, it was shown that the class of distributed random access MAC schemes leveraging Carrier-Sense Multiple Access (CSMA) is throughput-optimal. To fully assess the potential of such schemes, it is challenging to study their performance in terms of mean delays and compare it against that of centralized scheduling. In this paper, we present upper and lower bounds on the performance of CSMA-based...
This tutorial discusses the optimization models and methods in wireless network resource allocation, especially power control and scheduling. Emphasis will be on deriving distributed algorithms, bridging the theory-practice gap, and evaluating fairness of allocation. Both classical results and recent advances will be covered, and implications to industry standards and practical implementation discussed.
We consider the problem of fair resource allocation in interference channels, for the case of one-dimensional cells. We propose simple interference channel models based upon the deterministic channel model, assuming zero queuing delay. This enables study of how the interference induces coupling among the rates available in the channels and evaluation of resource allocation. A sequence of models of...
Since IEEE has standardized 802.11 protocol for WLANs, significant work has been done in developing rate adaptation algorithms. Most of the rate adaptation algorithms proposed till now are heuristic, suboptimal and are competitive in nature. Even though these algorithms have advantage of implementing in distributed fashion, their throughput performance will be low as these schemes may converge to...
An e-Infrastructure allows end-user's applications to easily and securely access heterogeneous grid resources (e.g., computing and storage elements). Since e-Science applications are often characterized by huge data transfers and high computational loads, the selection and allocation of grid resources dramatically affect their performance. This paper proposes a distributed resource allocation algorithm,...
The following topics are dealt with: broadband, wireless computing, communication and applications; ad hoc networks; sensor networks; parallel and multi-core systems; mesh networks; practical security and privacy application; optical networks; networks algorithms and protocols; distributed schemes and protocols; wireless networks; disaster information systems; network security, privacy and trust;...
A critical aspect of applications with WSNs is increase the sensor nodes lifetime. Power constrained WSNs are useable such as they can communicate sensed data to a processing node. Communication and sensing consume energy therefore energy saving and improving lifetime of WSNs can be achieved by scheduling of sensor nodes. In scheduling allow sensor nodes can interchange its state into idle, sleep...
Connected dominating set (CDS) algorithm based on a virtual backbone technology has an important role for wireless ad hoc network, route optimization, energy conservation and allocation of resources. In this paper, on the base of several classic distributed CDS approximation algorithm and connected dominating set, a new distributed CDS algorithm based on weight is presented, the correctness and efficiency...
Self-organisation is frequently advocated as the solution for managing large, dynamic systems. Distributed algorithms are implicitly designed for infinitely large problems, while small systems are regarded as being controllable using traditional, centralised approaches. Many real-world systems, however, do not fit conveniently into these “small” or “large” categories, resulting in a range of cases...
We consider generalized coloring of a weighted graph in a distributed setting, where each node in the graph is represented by an independent agent. The target is to minimize the weight of edges connecting same-color nodes. To avoid getting stuck in a not-too-good local optimum, we approach this problem by finding the colorable sub graph with the maximum weight subset of edges. The agents run a basic...
The increasing growth of the global Internet making the shortcomings of its unstructured topology and distributed routing algorithm are exposed more rapidly. To design a controllable, scalable and manageable backbone network with a simple, efficient architecture is very imperative. Among many topologies, Tree topology which has a natural hierarchical structure and explicit end-to-end transmission...
A natural requirement of a resource allocation system is to guarantee fairness to its participants. Fair allocation can be achieved either by distributed protocols known as cake-cutting algorithms or by centralized approaches, which first collect the agents' preferences and then decide on the allocation. Compared with cake-cutting algorithms, centralized approaches ageless restricted and can therefore...
NUM (Network Utility Maximization) problems have worked as an important approach to solve network deployment problem especially for network resource management. In existing literature, NUM model has been used to provision optimal network resource allocation. However, in practice, routing and transmission delay would not be ignored. Without routing, we would not achieve the “real” maximum utility....
The anticipated uptake of Cloud computing, built on well-established research in Web Services, networks, utility computing, distributed computing and virtualisation, will bring many advantages in cost, flexibility and availability for service users. These benefits are expected to further drive the demand for Cloud services, increasing both the Cloud's customer base and the scale of Cloud installations...
A fundamental issue in a large-scale distributed system consisting of heterogeneous machines which vary in both I/O and computing capabilities is to distribute workloads with respect to the capabilities of each node to achieve the optimal performance. However, node capabilities are often not stable due to various factors. Simply using a static workload distribution scheme may not well match the capability...
In the traditional distributed spanning tree (DST), randomly selecting representatives makes some nodes become critical nodes, which increase the load of critical nodes and also reduce the fault tolerance of systems. To resolve this problem, an improved DST structure and a searching algorithm were proposed. In this paper, we describe a representative selection rule first, which provides a good load...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.