A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Link Scheduling in Local Interference Models
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
Choosing an appropriate interference model is crucial for link scheduling problems in sensor networks. ...
In this work, we focus on interference models that are local in the sense that admissibility of transmissions only depends on local concurrent transmissions, and correct with respect to the geometric SINR ...
Scheduling of link transmissions has been addressed in many interference models and, in most cases, proven to be NP-hard. ...
doi:10.1007/978-3-540-92862-1_6
fatcat:dxptsk234fds3l673s3rcalb7i
Longest-queue-first scheduling under SINR interference model
2010
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
By employing the ρ-local pooling technique, we show that LQF scheduling achieves zero throughput in the worst case. ...
We then propose a novel technique to localize interference which enables us to decentralize the LQF scheduling while preventing it from having vanishing throughput in all network topologies. ...
INTERFERENCE LOCALIZATION In the SINR interference model, any activated link will create interference to all other activated links in the network. ...
doi:10.1145/1860093.1860100
dblp:conf/mobihoc/LeMJS10
fatcat:gjdknha3gvbtloso5d23j5j7re
Distributed link scheduling for throughput maximization under physical interference model
2012
2012 Proceedings IEEE INFOCOM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study distributed link scheduling for throughput maximization in wireless networks. The majority of results on link scheduling assume binary interference models for simplicity. ...
There have been just a few existing results on centralized link scheduling under the physical interference model, though distributed schedulings are more practical. ...
Thus, interference models matter significantly in link scheduling algorithm design and analysis. ...
doi:10.1109/infcom.2012.6195680
dblp:conf/infocom/ZhouLLLTMH12
fatcat:yjlmzrz37rgbrag3276vpeam3m
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
2009
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
of GMS in networks with up to 5 nodes under the 1-hop interference model. ...
In this paper, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. ...
Since the minimum distance between two scheduled links is 2 hops in the 2-hop interference model, a disabled node cannot be scheduled. ...
doi:10.1145/1530748.1530771
dblp:conf/mobihoc/LeconteNS09
fatcat:hyjfntjodzf5hflbelgkecqu5i
Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks
2011
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
of GMS in networks with up to 5 nodes under the 1-hop interference model. ...
In this paper, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. ...
Since the minimum distance between two scheduled links is 2 hops in the 2-hop interference model, a disabled node cannot be scheduled. ...
doi:10.1109/tnet.2010.2089534
fatcat:3cobum7ncreblntvppuy6y2k4m
Locally Optimized Scheduling and Power Control Algorithms for Multi-hop Wireless Networks under SINR Interference Models
2007
2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we develop locally optimized scheduling and power control algorithms for multi-hop wireless networks under SINR interference models. ...
Our scheme can be implemented in a fully distributed manner and requires only that each node solve a simple local optimization problem. ...
Section III develops a locally-optimized scheduling algorithm under the linear SINR interference model. Section IV extends our result in Section III to the logarithmic SINR interference model. ...
doi:10.1109/wiopt.2007.4480039
dblp:conf/wiopt/KimLS07
fatcat:egqkno3twnciheeck3hxa7shay
Local Greedy Approximation for Scheduling in Multihop Wireless Networks
2012
IEEE Transactions on Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The system model is described in Section 2. In Section 3, the local greedy scheduling schemes are described and their performance analyzed. ...
We successfully reduce the complexity based on the observation that links with the largest queue length within their interference range are crucial in characterizing the capacity region of GMS. ...
We model the interference constraints between the links by the K-hop interference model, under which any two links within a K-hop distance cannot be scheduled in the same time slot. ...
doi:10.1109/tmc.2011.33
fatcat:kbuxluvzyjalhevpwdlysa3vm4
A local greedy scheduling scheme with provable performance guarantee
2008
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Instead, it deterministically schedules only links that have the largest queue length among their local neighbors. ...
In recent years, there have been many efforts to develop lowcomplexity scheduling schemes that can approximate optimal performance in multi-hop wireless networks. ...
We model the interference constraints between the links as the K-hop interference model, under which any two links within a K-hop distance cannot be scheduled in the same time-slot. ...
doi:10.1145/1374618.1374634
dblp:conf/mobihoc/Joo08
fatcat:smmwybsxafat5jtwgkeaqcn7s4
Scheduling problems in interference-aware wireless sensor networks
2013
2013 International Conference on Computing, Networking and Communications (ICNC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study the Minimum Latency Aggregation Scheduling problem in two interference models, the collision-interference-free graph model and the physical interference model known as Signal-to-Interference-Noise-Ratio ...
with power control in the SINR model, and provide constant approximation algorithms. ...
As WSNs are commonly modeled as graphs in the literature, researchers have adopted two interference models: the graph model and the physical interference model. ...
doi:10.1109/iccnc.2013.6504188
dblp:conf/iccnc/LamAHN13
fatcat:7g2yybqt7vdwxhkkyciugjzo5a
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
2008
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then develop an iterative procedure to estimate the local-pooling factor under a large class of network topologies and interference models. ...
While a lower bound on the throughput performance of GMS is relatively well-known in the simple node-exclusive interference model, it has not been thoroughly explored in the more general K-hop interference ...
Specifically, two links in L that interfere with each other under the K 1 -hop model also interfere under the K 2 -hop model. ...
doi:10.1109/infocom.2008.165
dblp:conf/infocom/JooLS08
fatcat:elxw4waijjfrhmquq2jzolbiqq
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
2008
2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then develop an iterative procedure to estimate the local-pooling factor under a large class of network topologies and interference models. ...
While a lower bound on the throughput performance of GMS is relatively well-known in the simple node-exclusive interference model, it has not been thoroughly explored in the more general K-hop interference ...
Specifically, two links in L that interfere with each other under the K 1 -hop model also interfere under the K 2 -hop model. ...
doi:10.1109/infocom.2007.165
fatcat:ykr3rsnc2fcbplw2dujyjfjvhm
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks
2009
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then develop an iterative procedure to estimate the local-pooling factor under a large class of network topologies and interference models. ...
While a lower bound on the throughput performance of GMS is relatively well-known in the simple node-exclusive interference model, it has not been thoroughly explored in the more general K-hop interference ...
Specifically, two links in L that interfere with each other under the K 1 -hop model also interfere under the K 2 -hop model. ...
doi:10.1109/tnet.2009.2026276
fatcat:6erhnrwsgjcwtndtjhjpbedbse
Throughput Optimizing Localized Link Scheduling for Multihop Wireless Networks under Physical Interference Model
2014
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We study throughput-optimum localized link scheduling in wireless networks. ...
The majority of results on link scheduling assume binary interference models that simplify interference constraints in actual wireless communication. ...
Distributed or even localized scheduling un-der the physical interference model is more demanding out of practical relevance. ...
doi:10.1109/tpds.2013.210
fatcat:q656jymjkfawzkfba5tkq7jsuu
Distributed shortest link scheduling algorithms with constant time complexity in IoT under Rayleigh fading
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For the shortest link scheduling (SLS), i.e., scheduling a given set of links with minimum time slots, we consider the distributed algorithm design by using the locality of the protocol model with high ...
In addition, extensive simulations evaluate the performance of two proposed algorithms. INDEX TERMS Shortest link scheduling, Rayleigh fading, locality, distributed algorithms. I. ...
TRANSFORMATION FROM PROTOCOL MODEL TO SIR MODEL In this section, we first utilize the protocol model to localize interference and prove a successful link under protocol model is also SIR-feasible; then ...
doi:10.1109/access.2020.2991515
fatcat:wp6zfnv7hzeodkrgxinh5z6u2i
Adaptive Instantiation of the Protocol Interference Model in Mission-Critical Wireless Networks
2010
2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To exploit the strengths of both the physical and the protocol interference models and to understand the varying observations on the relative goodness of scheduling based on the two models in literature ...
Index Terms-Wireless interference model, protocol model, physical model, throughput, reliability, local adaptation 978-1-4244-7151-5/10/$26.00 ©2010 IEEE This full text paper was peer reviewed at the direction ...
Unlike the SINR model, the ratio-K model defines local, pair-wise/non-combinatorial interference relations where interference is regarded as existent only between nodes in a local neighborhood. ...
doi:10.1109/secon.2010.5508292
dblp:conf/secon/CheLJZ10
fatcat:w4p4ysnk6rb23gawugisl4fbsm
« Previous
Showing results 1 — 15 out of 106,363 results