Results 1  10
of
12
A clientdriven approach for channel management in wireless LANs
 In IEEE Infocom
, 2006
"... Abstract — We propose an efficient clientbased approach for channel management (channel assignment and load balancing) in 802.11based WLANs that lead to better usage of the wireless spectrum. This approach is based on a “conflict set coloring ” formulation that jointly performs load balancing alon ..."
Abstract

Cited by 84 (3 self)
 Add to MetaCart
(Show Context)
Abstract — We propose an efficient clientbased approach for channel management (channel assignment and load balancing) in 802.11based WLANs that lead to better usage of the wireless spectrum. This approach is based on a “conflict set coloring ” formulation that jointly performs load balancing along with channel assignment. Such a formulation has a number of advantages. First, it explicitly captures interference effects at clients. Next, it intrinsically exposes opportunities for better channel reuse. Finally, algorithms based on this formulation do not depend on specific physical RF models and hence can be applied efficiently to a widerange of inbuilding as well as outdoor scenarios. We have performed extensive packetlevel simulations and measurements on a deployed wireless testbed of 70 APs to validate the performance of our proposed algorithms. We show that in addition to single network scenarios, the conflict set coloring formulation is well suited for channel assignment where multiple wireless networks share and contend for spectrum in the same physical space. Our results over a wide range of both simulated topologies and inbuilding testbed experiments indicate that our approach improves application level performance at the clients by upto three times (and atleast 50%) in comparison to current bestknown techniques. I.
PEDAMACS: Power efficient and delay aware medium access protocol for sensor networks
 IEEE Transactions on Mobile Computing
, 2002
"... Abstract—PEDAMACS is a Time Division Multiple Access (TDMA) scheme that extends the common single hop TDMA to a multihop sensor network, using a highpowered access point to synchronize the nodes and to schedule their transmissions and receptions. The protocol first enables the access point to gathe ..."
Abstract

Cited by 53 (6 self)
 Add to MetaCart
(Show Context)
Abstract—PEDAMACS is a Time Division Multiple Access (TDMA) scheme that extends the common single hop TDMA to a multihop sensor network, using a highpowered access point to synchronize the nodes and to schedule their transmissions and receptions. The protocol first enables the access point to gather topology (connectivity) information. A scheduling algorithm then determines when each node should transmit and receive data, and the access point announces the transmission schedule to the other nodes. The performance of PEDAMACS is compared to existing protocols based on simulations in TOSSIM, a simulation environment for TinyOS, the operating system for the Berkeley sensor nodes. For the traffic application we consider, the PEDAMACS network provides a lifetime of several years compared to several months and days based on random access schemes with and without sleep cycles, respectively, making sensor network technology economically viable. Index Terms—Sensor networks, energy efficiency, delay guarantee. 1
TDMA Scheduling Algorithms for Wireless Sensor Networks
, 2009
"... Algorithms for scheduling TDMA transmissions in multihop networks usually determine the smallest length conflictfree assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent pointtopoint flows in the network. In se ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
(Show Context)
Algorithms for scheduling TDMA transmissions in multihop networks usually determine the smallest length conflictfree assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent pointtopoint flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflictfree assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NPcomplete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or nodebased scheduling, which is adapted from classical multihop scheduling algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or levelbased scheduling, which is a novel scheduling algorithm for manytoone communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10 − 70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network. 1
Selfstabilizing protocols for maximal matching and maximal independent sets for ad hoc networks
 in Workshop on Advances in Parallel and Distributed Computational Models
, 2003
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
A synchronous selfstabilizing minimal domination protocol in an arbitrary network graph
 In IWDC’03: Proceedings of the 5th International Workshop on Distributed Computing, Springer LNCS 2918
, 2003
"... Abstract. In this paper we propose a new selfstabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph. 1. ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we propose a new selfstabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph. 1.
SelfStabilizing Distributed Algorithm for Strong Matching in a System Graph
 In Proceedings of HiPC 2003, volume LNCS 2913
, 2003
"... We present a new selfstabilizing algorithm for finding a maximal strong matching in an arbitrary distributed network. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2]. The concepts behind the algorithm, using Ids in the newtork ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We present a new selfstabilizing algorithm for finding a maximal strong matching in an arbitrary distributed network. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2]. The concepts behind the algorithm, using Ids in the newtork, promise to have applications for other graph theoretic primitives.
Efficient Strategies for Channel Management in Wireless LANs
, 2005
"... We define efficient algorithms for channel management (channel assignment and load balancing among APs) in 802.11based WLANs that lead to better usage of the wireless spectrum. These algorithms (called CFAssign) are based on a “conflictfree set coloring ” formulation that jointly perform load bala ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
We define efficient algorithms for channel management (channel assignment and load balancing among APs) in 802.11based WLANs that lead to better usage of the wireless spectrum. These algorithms (called CFAssign) are based on a “conflictfree set coloring ” formulation that jointly perform load balancing along with channel assignment. Such a formulation has a number of advantages. First, it explicitly captures interference effects at clients. Next, it intrinsically exposes opportunities for better channel reuse. Finally, algorithms based on this formulation do not depend on specific physical RF models and hence can be applied efficiently to a widerange of inbuilding as well as outdoor scenarios. We have performed extensive packetlevel simulations and measurements on a deployed wireless testbed of 70 APs to validate the performance of our proposed algorithms. We show that in addition to single network scenarios, CFAssign algorithms are well suited for channel assignment in scenarios where multiple wireless networks share the same physical space and contend for the same frequency spectrum. Our results over a wide range of scenarios indicate that CFAssign reduces the interference at clients by about 5070 % in comparison to current bestknown techniques. 1.
LearningBased Constraint Satisfaction With Sensing Restrictions,” arXiv preprint arXiv:1210.7156
, 2012
"... ar ..."
(Show Context)
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time
, 2003
"... We present a selfstabilizing algorithm for finding a generalized maximal matching (#matching) in an arbitrary distributed network. We show that the algorithm converges in #### moves under an unfair central demon independent of the #values at different nodes. The algorithm is capable of working wi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We present a selfstabilizing algorithm for finding a generalized maximal matching (#matching) in an arbitrary distributed network. We show that the algorithm converges in #### moves under an unfair central demon independent of the #values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].
DOI 10.1007/s1127600901830 TDMA scheduling algorithms for wireless sensor networks
, 2009
"... Ó The Author(s) 2009. This article is published with open access at Springerlink.com Abstract Algorithms for scheduling TDMA transmissions in multihop networks usually determine the smallest length conflictfree assignment of slots in which each link or node is activated at least once. This is base ..."
Abstract
 Add to MetaCart
(Show Context)
Ó The Author(s) 2009. This article is published with open access at Springerlink.com Abstract Algorithms for scheduling TDMA transmissions in multihop networks usually determine the smallest length conflictfree assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent pointtopoint flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflictfree assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NPcomplete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or nodebased scheduling, which is adapted from classical multihop scheduling algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or levelbased scheduling, which is a novel scheduling algorithm for manytoone communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10–70 over centralized algorithms for 1000 nodes. We also obtain