Loading...
Search for: interference-modeling
0.01 seconds

    On the possibility of network scheduling with polynomial complexity and delay

    , Article IEEE/ACM Transactions on Networking ; 2017 ; 10636692 (ISSN) Sharifnassab, A ; Golestani, S. J ; Sharif University of Technology
    Abstract
    Considering the collection of all networks with independent set interference model, Shah, Tse, and Tsitsiklis showed that there exist scheduling algorithms with polynomial complexity and delay, only if the maximum independent set problem can be solved in polynomial time (equivalently, P=NP). In this paper, we extend this result to arbitrary collections of networks and present a clear-cut criterion for the existence of polynomial complexity and delay scheduling algorithms relative to a given collection of networks with arbitrary interference models, not confined to independent set interference or SINR models, and not necessarily encompassing all network topologies. This amounts to the... 

    Fast aggregation scheduling in wireless sensor networks

    , Article IEEE Transactions on Wireless Communications ; Volume 14, Issue 6 , 2015 , Pages 3402-3414 ; 15361276 (ISSN) Yousefi, H ; Malekimajd, M ; Ashouri, M ; Movaghar, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    Data aggregation is a key, yet time-consuming functionality introduced to conserve energy in wireless sensor networks (WSNs). In this paper, to minimize time latency, we focus on aggregation scheduling problem and propose an efficient distributed algorithm that generates a collision-free schedule with the least number of time slots. In contrast to others, our approach named FAST mainly contributes to both tree construction, where the former studies employ Connected 2-hop Dominating Sets, and aggregation scheduling that was previously addressed through the Competitor Sets computation. We prove that the latency of FAST under the protocol interference model is upper-bounded by 12R+Δ-2, where R... 

    Fair resource allocation in Ad hoc networks in the presence of delay

    , Article INDICON 2008 IEEE Conference and Exhibition on Control, Communications and Automation, Kanpur, 11 December 2008 through 13 December 2008 ; Volume 1 , 2008 , Pages 159-164 ; 9781424427475 (ISBN) Naseri, Z ; Haeri, M ; Sharif University of Technology
    IEEE Computer Society  2008
    Abstract
    In this paper, the problem of resource allocation at an Ad hoc network with nodes not using any infrastructure to cooperate with each other is considered. By using a simple interference model in wireless links, the convergence and stability of a fair resource allocation scheme in the absence of delay is investigated. Also, the local stability of the scheme in the presence of upper-bounded delay is verified. Simulations results illustrate the convergence and fairness of this scheme considering different initial states for different sources. The performance of the scheme in the presence of different disturbances for each flow in transient and steady state along with its local stability in the...