Comparison between graph-based and interference-based STDMA scheduling

Grönkvist, Jimmi; Hansson, Anders

doi:10.1145/501449.501453

Cited by 115 publications

(89 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [1,10,11], it is argued that the performance of graphbased algorithms is inferior to algorithms in more realistic SIN R models. More recently, Moscibroda et al [26] show experimentally that the theoretical limits of any protocol, which obeys the laws of graph-based models, can be broken by a protocol explicitly defined for the SIN R G model.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Complexity in geometric SINR

Goussevskaia

Oswald

Wattenhofer

2007

Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing

345

363

View full text Add to dashboard Cite

In this paper we study the problem of scheduling wireless links in the geometric SIN R model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We present the first NP-completeness proofs in such a model. In particular, we prove two problems to be NP-complete: Scheduling and One-Shot Scheduling. The first problem consists in finding a minimum-length schedule for a given set of links. The second problem receives a weighted set of links as input and consists in finding a maximum-weight subset of links to be scheduled simultaneously in one shot. In addition to the complexity proofs, we devise an approximation algorithm for each problem.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Using (9), (11), and plugging in the value of μ, defined in (8), the SIN R at receiver ri can be lower bounded by…”

Section: Algorithm 1 Approximation Algorithm For the Scheduling Problemmentioning

confidence: 99%

Complexity in geometric SINR

Goussevskaia

Oswald

Wattenhofer

2007

Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing

345

363

View full text Add to dashboard Cite

show abstract

“…This model implicitly assumed that each node v k will adopt the power control mechanism when it transmits signals. Simulation analysis [16] as well as the analytical results [17] indicate that the PrIM does not necessarily provide a comprehensive view of reality due to the aggregate effect of interference in wireless networks. However, it does provide some good estimations of interference and most importantly it enables a theoretical performance analysis of a number of protocols designed in the literature.…”

Section: A Network and Interference Modelsmentioning

confidence: 99%

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks

Wang

et al. 2008

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduce the interference effect of close-by transmissions. Unlike the previous studies that often assume a unit disk graph model, we assume that different terminals could have different transmission ranges and different interference ranges. In our model, it is also possible that a communication link may not exist due to barriers or is not used by a predetermined routing protocol, while the transmission of a node always result interference to all non-intended receivers within its interference range.Using a mathematical formulation, we develop interference aware joint routing and synchronized TDMA link schedulings that optimize the networking throughput subject to various constraints. Our linear programming formulation will find a flow routing whose achieved throughput is at least a constant fraction of the optimum, and the achieved fairness is also a constant fraction of the requirement. Then, by assuming known link capacities and link traffic loads, we study link scheduling under the RTS/CTS interference model and the protocol interference model with fixed transmission power. For both models, we present both efficient centralized and distributed algorithms that use time slots within a constant factor of the optimum. We also present efficient distributed algorithms whose performances are still comparable with optimum, but with much less communications. We prove that the time-slots needed by our faster distributed algorithms are only at most O(min(log n, log ψ)) for RTS/CTS interference model and protocol interference model. Our theoretical results are corroborated by extensive simulation studies.

show abstract

“…In [10], the authors proposed the use of graph-based approaches to solve channel assignment problem. An advantage of semi-dynamic approaches over the fixed channel assignment is that nodes can switch to different channels to communicate with different neighbours such that partitions can be eliminated.…”

Section: Channel Assignment In Wireless Ad Hoc Networkmentioning

confidence: 99%

Centralized Control for Dynamic Channel Allocation in IEEE 802.15.4 Based Wireless Sensor Networks

Nirapai

Chantaraskul

2014

View full text Add to dashboard Cite

Abstract. Coexistence problem is one of the most important issues in the IEEE 802.15.4 based Wireless Sensor Networks (WSNs), since the system operates on the highly populated 2.4 GHz ISM band. As a result, system performance of WSNs can be greatly impaired by the interference from over powering signal from other systems such as WLAN and Bluetooth. This paper proposes an approach based on centralized control for dynamic channel allocation. The proposed method offers multi-channel utilization with intelligent controlling mechanism in order to provide system performance enhancement in order to cope with variation of interfered environment. Based on centralized control, decision making process is performed by the network coordinator allowing such system flexibility. Simulation model has been developed and it is embedded with this proposed mechanism in order to test the system performance. To observe the system performance under the proposed method, variety of simulation scenarios are performed with the variation of two major factors affecting system performance including the size of the network topology and the scale of interference. Proposed method is evaluated and the simulation results are compared against tradition system as well as system with multichannel utilization method with channel scheduling. The flexibility of the method proposed here allows the system to have better system performance under different test scenarios both in terms of average packet end-to-end delay and system throughput.

show abstract

Comparison between graph-based and interference-based STDMA scheduling

Cited by 115 publications

References 6 publications

Complexity in geometric SINR

Complexity in geometric SINR

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks

Centralized Control for Dynamic Channel Allocation in IEEE 802.15.4 Based Wireless Sensor Networks

Contact Info

Product

Resources

About