Results 1  10
of
18
Wireless capacity and admission control in cognitive radio
 IEEE INFOCOM
"... ar ..."
(Show Context)
The Power of NonUniform Wireless Power
, 2012
"... We study a fundamental measure for wireless interference in the SINR model when power control is available. This measure characterizes the effectiveness of using oblivious power — when the power used by a transmitter only depends on the distance to the receiver — as a mechanism for improving wireles ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We study a fundamental measure for wireless interference in the SINR model when power control is available. This measure characterizes the effectiveness of using oblivious power — when the power used by a transmitter only depends on the distance to the receiver — as a mechanism for improving wireless capacity. We prove optimal bounds for this measure, implying a number of algorithmic applications. An algorithm is provided that achieves — due to existing lower bounds — capacity that is asymptotically best possible using oblivious power assignments. Improved approximation algorithms are provided for a number of problems for oblivious power and for power control, including distributed scheduling, secondary spectrum auctions, wireless connectivity, and dynamic packet scheduling.
An O (logn) distributed approximation algorithm for local broadcasting in unstructured wireless networks
"... Abstract—The unstructured multihop radio network model, with asynchronous wakeup, no collision detection and little knowledge on the network topology, is proposed for capturing the particularly harsh characteristics of initially deployed wireless ad hoc and sensor networks. In this paper, assuming ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract—The unstructured multihop radio network model, with asynchronous wakeup, no collision detection and little knowledge on the network topology, is proposed for capturing the particularly harsh characteristics of initially deployed wireless ad hoc and sensor networks. In this paper, assuming such a practical model, we study a fundamental problem of both theoretical and practical interests—the local broadcasting problem. Given a set of nodes V where each node wants to broadcast a message to all its neighbors that are within a certain local broadcasting range R, the problem is to schedule all these requests in the fewest timeslots. By adopting the physical interference model and without any knowledge on neighborhood, we give a new randomized distributed approximation algorithm for the local broadcasting problem with approximation ratio O(log n) where n is the number of nodes. This distributed approximation algorithm improves the stateoftheart result in [22] by a logarithmic factor. I.
Towards tight bounds for local broadcasting
, 2012
"... Abstract. We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among n wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a log2 n additive term) ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among n wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a log2 n additive term). This improves upon the previous best O(logn)approximate algorithm. Without power measurement, our algorithm achieves O(logn)approximation, matching the previous best result, but with a simpler approach that works under harsher conditions, such as arbitrary node failures. We give complementary lower bounds under reasonable assumptions. 1.
Measurement Based Interference Models for Wireless Scheduling Algorithms
"... ar ..."
(Show Context)
MultiHop Routing and Scheduling in Wireless Networks in the SINR model
 In Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS
, 2011
"... ar ..."
NearOptimal Distributed Scheduling Algorithms for Regular Wireless Sensor Networks
"... Wireless sensor networks are normally characterized by resource challenged nodes. Since communication costs the most in terms of energy in these networks, minimizing this overhead is important. We consider minimum length node scheduling in regular multihop wireless sensor networks. We present colli ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Wireless sensor networks are normally characterized by resource challenged nodes. Since communication costs the most in terms of energy in these networks, minimizing this overhead is important. We consider minimum length node scheduling in regular multihop wireless sensor networks. We present collisionfree decentralized scheduling algorithms based on TDMA with spatial reuse that do not use message passing, this saving communication overhead. We develop the algorithms using graphbased khop interference model and show that the schedule complexity in regular networks is independent of the number of nodes and varies quadratically with k which is typically a very small number. We follow it by characterizing feasibility regions in the SINR parameter space where the constant complexity continues to hold while simultaneously satisfying the SINR criteria. Using simulation, we evaluate the efficiency of our solution on random network deployments. 1