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.
Cognitive Radios (CRs) address spectrum scarcity and under-utilization of the spectrum. Allocating spectrum to CR nodes in a network is neither easy nor straight-forward since spectrum availability is space and time-varying. The Link layer always sets up communication between nodes in a CR ad hoc network by allocating the available spectrum suitably. In a time-slotted model, allocation of channels...
Grid resource management is a core component of the grid. This paper analyzes the characteristics of the grid, and designed a Hierarchical Resource Management Framework for data resource in grid(HRMF-G). For the characteristics of the grid and the existing shortage of hierarchical resource management, we improved, respectively, the resource management domain model by Wang Hong et al, the multi-level...
Cognitive Radios (CRs) address spectrum scarcity and under-utilization of the spectrum. However, realizing a CR network is neither easy nor straight-forward. In particular the link layer should facilitate setting up of communication between nodes enabling sharing of channels, while maximizing the spectrum utilization. We address the problem of allocation of channels to CR nodes. For time-slotted model,...
Grid systems tend to grow in size, but currently deployed state-of-the-art schedulers have inherent scalability limits due to centralization and high messaging cost. In this paper, we explore the feasibility of scalable grid scheduling using a peer-to-peer overlay. We propose DGSASAP, a decentralized scheduling algorithm that schedules compute-intensive jobs such that their execution starts as soon...
When designing distributed wireless networks utilizing shared bandwidth, a critical issue is allocating spatial and temporal resources to streaming information flows. We focus on large networks of half-duplex terminals sharing common bandwidth, and study methods for allocating resources on a fine-grained temporal basis, with specific emphasis on managing the interactions between streams of packets...
Recent advances in the physical layer have enabled the simultaneous reception of multiple packets by a node in wireless networks. In this paper, we present a generalized model for the throughput optimization problem in multi-hop wireless networks that support multi-packet reception (MPR) capability. The model incorporates the multi-access channel, which accurately accounts for the achievable capacity...
Emerging applications in Wireless Sensor Networks (WSNs) demand notable in-network processing capacities rather than simple data gathering and dissemination. Therefore, the performances of the network like latency and energy consumption are greatly affected by how the various application requirements are mapped to the processing nodes in the network. This paper investigates intelligent task mapping...
This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for resource allocation in DTNs are typically solved using dynamic programming which requires knowledge of future events such as meeting schedules and durations. This paper defines a new notion of optimality for DTNs, called snapshot...
Cognitive radios (CRs) address the problems of spectrum scarcity and under-utilization of the spectrum. However, realizing a CR network is neither easy nor straight-forward. The link layer in CR ad hoc networks is responsible for choosing suitable channels, out of the available channels, for setting up communication between nodes. However, the selection of channels amongst the CR nodes in the network...
Overlay resource allocation mechanism of P2P application intensifies congestion at backbone. Current traffic engineering algorithm doesn't adapt to P2P traffic demand. It fails to achieve load balance in link utilization. To tackle this problem, we propose a united resource allocation architecture called Pharos by collaboration of both ISP and P2P. In the architecture, we establish overlay path metrics...
Wireless sensor networks require shared medium access management to prevent collisions, message corruption and other unhelpful effects. Cellular sensornets require minimal energy consumption to maximise network lifetime, and management of interaction with base stations and other cells. We present a protocol which dynamically generates a near-optimal duty schedule within a cell such that communication...
In an IEEE 802.16(d) (WiMAX) mesh network, network bandwidth can be managed by either the centralized scheduling (CS) mode or the distributed scheduling (DS) mode. Compared with the CS mode, the DS mode provides a larger bandwidth capacity and is more scalable. However, because the DS mode uses an on-demand three-way handshake procedure to establish data schedules, the network quality experienced...
Many authors recognize the limitations of hierarchical Grid scheduling in scalable environments, and proposed peer-to-peer solutions to this problem. However, most peer-to-peer grid resource management systems allow only to discover available resources at the time of the request. We claim that peer-to-peer techniques have the potential for actual Grid scheduling, where each resource maintains a schedule...
Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the nodes. Among the many reasons behind the importance of efficiently determining the membership of an arbitrary rate vector in the feasibility region, is its high relevance in optimal cross layer design. A key feature in a wireless...
We consider the problem of two wireless networks operating on the same (presumably unlicensed) frequency band. Pairs within a given network cooperate with one another, but between networks there is competition for spectrum. To make the problem tractable, we assume transmissions are scheduled according to a random access protocol where each network chooses an access probability for its users. In this...
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.