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.
We consider the problem of scheduling wireless networks with stochastic packet arrivals on the links and constant transmission rates. We propose a scheduling policy based on solving a Maximum Weighted Independent Set (MWIS) problem at each time slot on a conflict graph that incorporates all the interference constraints. Due to the computational difficulty of solving the MWIS on general graphs, we...
We consider in-network distributed implementations of some stochastic approximation type estimation algorithms, subject to transmission constraints in wireless networks. Based on the analysis of asynchronous stochastic approximation schemes, we formulate the problem of optimizing the transmission schedule subject to constraints imposed by wireless transmission, so as to maximize the speed of convergence...
In this paper, we study the problem of jointly maximizing network lifetime and data rate in wireless networks. For this problem, we introduce a cross-layer formulation with general NUM (network utility maximization) that accommodates routing, scheduling and stream control from different layers of network with relevant constraints. In particular, based on a lagrangian approach, we extend our programming...
The paper is devoted to Time Division Multiple Access Link Scheduling Protocols in wireless sensor networks for full duplex (two-way) communication, where each sensor is scheduled on an incident link as a transmitter and as a receiver in two different time slots. We formulate the full duplex link scheduling problem (FDLSP) as distance-2 edge coloring in bi-directed graphs. We proves that there exists...
In this paper, we present a distributed algorithm combining power control and scheduling for densely deployed femtocells networks. The strong interference in the downlink from the femtocells should be well mitigated to satisfy the quality of service (QoS) requirement of femtocell users. The considered optimization problem is formulated as minimizing the total power consumption, while the QoS requirements...
Recently directional sensor networks have received a lot of attention. A directional sensor network is composed of many directional sensor nodes. Unlike conventional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical constraints, energy constraint or cost considerations. Area coverage problem is still...
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.
Integration of system components is a crucial challenge in the design of embedded real-time systems, as complex non-functional interdependencies may exist. [20] presented a framework, enabling autonomous verification of timing properties in the system itself. The work presented in this paper, takes that approach one step further, enabling autonomuous assignment of execution priorities under timing...
We consider the network with two kinds of traffic: inelastic and elastic traffic. The inelastic traffic requires fixed throughput, high priority while the elastic traffic has controllable rate and low priority. Giving the fixed rate of inelastic traffic, how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The Lagrangian Duality...
Opportunistic scheduling has been recognized as an effective method that significantly outperforms fixed TDMA scheduling in both channel capacity and communication reliability. Nevertheless the superior system performance comes at a price of high computational complexity, large signaling overhead, and unfairness among users. In this paper, we find that in relay-assisted next-generation wireless networks,...
For multi-hop radio networks, traditional flat TDMA access method has the drawback of low wireless resource utility efficiency. To improve the slot reusability, spatial TDMA method can be adopted. In this paper, a new STDMA channel assignment algorithm is proposed which takes the service priority, node position and data status into concerned. In addition to limiting the information stored in and transferred...
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,...
FAA's NextGen program aims at increasing the capacity of the national airspace, while ensuring the safety of aircraft. This paper provides a distributed merging and spacing algorithm that maximizes the throughput at the terminal phase of flight using the information provided through the ADS-B framework. Using dual decomposition, aircraft negotiate with each other and reach an agreement on optimal...
In this paper, we consider the problem of scheduling in multihop wireless networks subject to interference constraints. We consider a graph based representation of wireless networks, where scheduled links adhere to the K-hop link interference model. We develop a distributed greedy heuristic for this scheduling problem. Further, we show that this distributed greedy heuristic computes the exact same...
We consider the problem of backbone formation in ad hoc wireless networks composed of heterogeneous nodes. A virtual backbone in an ad hoc wireless network provides a hierarchical infrastructure that can be used to address important challenges such as efficient routing, multicasting/broadcasting, activity-scheduling, and energy efficiency. We model a wireless network in which nodes have different...
The link scheduling in wireless multi-hop networks is addressed. Different from most of work that adopt the protocol interference model which merely take consideration of packet collisions, our proposed algorithms use the physical interference model to reflect the aggregated signal to interference and noise ratio (SINR), which is a more accurate abstraction of the real scenario. We first propose a...
The promise of a buffered crossbar switch - a crossbar switch with a packet buffer at each crosspoint - is that it can provide good delay performance with much less complex, practical scheduling algorithms. With today's technology, it is now possible to implement it in a single chip. Thus it has attracted great attention recently. Though simple distributed algorithms can achieve 100% throughput under...
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this paper, we consider the problem of constructing self-stabilizingly a locally maximizable task (such as constructing a maximal independent set, a maximal matching,...
Data aggregation is an essential yet time-consuming task in wireless sensor networks (WSNs). This paper studies the well-known Minimum-Latency Aggregation Schedule (MLAS) problem and proposes an energy-efficient distributed scheduling algorithm named Clu-DDAS based on a novel cluster-based aggregation tree. Our approach differs from all the previous schemes where Connected Dominating Sets or Maximal...
Cognitive radio is a new communication paradigm that is able to observe, learn, optimize, and intelligently adapt to achieve optimal frequency band usage. Cognitive radio (CR)-based wireless mesh networks (WMNS) provide infrastructures for secondary users' transmission, and it is necessary to develop techniques with low interference to primary users in such networks. In this paper, we propose an interference-minimization...
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.