AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

AI Insight

AI extracts a summary of this paper


Weibo:
We have shown that even if the merge procedure sometimes results in an inferior matching, under certain conditions the throughput will still be nearly 100%

Maximizing throughput in wireless networks via gossiping

Measurement and Modeling of Computer Systems, no. 1 (2006): 27-38

Cited by: 339|Views131
EI

Abstract

A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed al- gorithms for networks in which a node can converse with at most a single neighbor at a time have been presented. These algorithms guarantee 50% of the maxim...More

Code:

Data:

0
Introduction
  • One of the major challenges in the design and operation of wireless networks is to schedule transmissions to efficiently share the common spectrum among links in the same geographic area.
  • In the context of switch scheduling and node-exclusive spectrum sharing networks, this algorithm has to schedule the edges of the Maximum Weight Matching at each time slot, where the edge weights are the queue sizes.
  • For the simplicity of presentation, in sections 4 and 5 the authors assumed that (i) the running time of the New-Sch and the Mix algorithms is shorter than the slot used for data transmission and (ii) all nodes make the decision in Step 1.iii of the Merge algorithm simultaneously.
Highlights
  • One of the major challenges in the design and operation of wireless networks is to schedule transmissions to efficiently share the common spectrum among links in the same geographic area
  • We show that if the difference between the preferable matching and the selected matching is bounded with high probability, the system is stable for any set of rates (1 − α − β)Λ∗, where Λ∗ is the stability region under a perfect scheduler. α and β are small constants that depend on the allowed difference between the preferable and selected matchings and on the probability that a maximum weight matching will be selected
  • This paper presents the first distributed scheduling algorithms for wireless networks that obtain 100% throughput
  • We have shown that even if the merge procedure sometimes results in an inferior matching, under certain conditions the throughput will still be nearly 100%
  • Based on this framework and on the observation that the required information can be collected within local components, we have developed a few distributed algorithms including a very efficient gossip algorithm
  • The presented framework can be extended to general interference constraints
Results
  • (2) Use Rand-Match for constant number of iterations to obtain a matching on the graph Gm. The authors state the following straightforward result about the Arr-Match algorithm.
  • It is desirable to develop a distributed approximation algorithm for the maximum weight matching problem that satisfies property P1 with relatively large δ.
  • In the summation algorithm presented in Section 5.1, if a connected component of G1 is a path, the two nodes at both ends of the path will indicate it in the messages they send.
  • The gossip algorithms presented in Sections 5.2 and 5.3 can operate well without special messages initiated by nodes at the ends of a path.
  • The combination of the Rand-Match and the summation algorithms will result in a network which is stable for all rates within the stability region Λ∗.
  • In [6, 17] it has been shown that for the node-exclusive spectrum sharing model, using a maximal matching algorithm to schedule the transmissions allows to obtain at least 0.5 of the stability region.
  • Notice that for all the algorithms discussed above, the time complexities were obtained assuming that at each time slot, every node can send a single control message to all of its neighbors.
  • This is a standard definition used for comparing the performance of different distributed algorithms, it does not adhere to the specific characteristics of networks with primary interference constraints.
  • The first required component is a distributed New-Sch algorithm that selects an independent set in the interference graph, such that the probability of selecting the maximum weight independent set is positive.
Conclusion
  • This paper presents the first distributed scheduling algorithms for wireless networks that obtain 100% throughput.
  • Some of the key issues in that context are: (i) how should the control messages be transmitted in a node-exclusive spectrum sharing model, (ii) what are the tradeoffs between throughput, delay, and decentralization costs, and (iii) how can the algorithms deal with an asynchronous network.
  • The presented framework can be extended to general interference constraints
Tables
  • Table1: Time complexity, communication complexity, local computation complexity, message size, addressing requirement, and stability region of the various algorithms (α and β are small constants)
Download tables as Excel
Funding
  • This work was supported by NSF ITR grant CCR-0325401, by ONR grant number N000140610064, and by DARPA/ AFOSR through the University of Illinois grant no
  • The research of Gil Zussman was supported by a Marie Curie International Fellowship within the 6th European Community Framework Programme
Reference
  • M. Bayati, D. Shah, and M. Sharma. Maximum weight matching via maxproduct algorithm. In Proc. IEEE ISIT’05, Sep. 2005.
    Google ScholarLocate open access versionFindings
  • D. Bertsekas and J. Tsitsiklis. Parallel and distributed computation: numerical methods. MIT/LIDS Tech. Report, 2003.
    Google ScholarFindings
  • R. Bhatia, A. Segall, and G. Zussman. Analysis of bandwidth allocation algorithms for wireless personal area networks. To appear in ACM/Springer Wireless Networks (WINET), 12, 2006.
    Google ScholarFindings
  • S. Boyd, A. Ghosh, B. Prabbakar, and D. Shah. Gossip algorithms: design, analysis and applications. In Proc. IEEE INFOCOM’05, March 2005.
    Google ScholarLocate open access versionFindings
  • P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. In Proc. 43rd Allerton Conf. on Commun., Control, and Comp., September 2005.
    Google ScholarLocate open access versionFindings
  • L. Chen, S. H. Low, M. Chiang, and J. C. Doyle. Optimal cross-layer congestion control, routing and scheduling design in ad hoc wireless networks. In Proc. IEEE INFOCOM’06, April 2006.
    Google ScholarLocate open access versionFindings
  • S. Deb, D. Shah, and S. Shakkottai. Fast incremental algorithm for repetitive optimization: an application to switch scheduling. In Proc. CISS, March 2006.
    Google ScholarLocate open access versionFindings
  • A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. 2nd edition, Springer, 1998.
    Google ScholarFindings
  • P. Giaccone, B. Prabhakar, and D. Shah. Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE J. Sel. Areas Commun., 21(4):546- 559, May 2003.
    Google ScholarLocate open access versionFindings
  • B. Hajek and G. Sasaki. Link scheduling in polynomial time. IEEE Trans. Inf. Theory, 34(5):910-917, September 1988.
    Google ScholarLocate open access versionFindings
  • J.-H. Hoepman. Simple distributed weighted matchings. eprint cs.DC/0410047, October 2004.
    Google ScholarFindings
  • A. Israeli and A. Itai. A fast randomized parallel algorithm for maximal matching. Inform. Process. Lett., 22(2):77-80, January 1986.
    Google ScholarLocate open access versionFindings
  • K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu. Impact of interference on multi-hop wireless network performance. ACM/Springer Wireless Networks, 11(4):471-487, July 2005.
    Google ScholarLocate open access versionFindings
  • K. M. Jung and D. Shah. Fast gossip via non-reversible random walk. In Proc. IEEE ITW’06, March 2006.
    Google ScholarLocate open access versionFindings
  • R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. IEEE FOCS’00, November 2000.
    Google ScholarLocate open access versionFindings
  • E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.
    Google ScholarFindings
  • X. Lin and N.B. Shroff. The impact of imperfect scheduling on cross-layer rate control in wireless networks. In Proc. IEEE INFOCOM’05, March 2005.
    Google ScholarLocate open access versionFindings
  • N. McKeown, V. Anantharam, and J. Walrand. Achieving 100% throughput in an input-queued switch. In Proc. IEEE INFOCOM’96, March 1996.
    Google ScholarLocate open access versionFindings
  • D. Mosk-Aoyama and D. Shah. Computing separable functions via gossip. Available at www.arxiv.org:cs.NI/0504029, Feb. 2006.
    Findings
  • M. Neely, E. Modiano, and C. Rohrs. Dynamic power allocation and routing for time-varying wireless networks. IEEE J. Sel. Areas Commun., 23(1):89-103, January 2005.
    Google ScholarLocate open access versionFindings
  • D. Peleg, Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
    Google ScholarLocate open access versionFindings
  • L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proc. IEEE INFOCOM’98, April 1998.
    Google ScholarLocate open access versionFindings
  • L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control, 37(12):1936-1948, December 1992.
    Google ScholarLocate open access versionFindings
  • L. Tassiulas and S. Sarkar. Maxmin fair scheduling in wireless ad hoc networks. IEEE J. Sel. Areas Commun., 23(1):163-173, January 2005.
    Google ScholarLocate open access versionFindings
  • M. Wattenhofer and R. Wattenhofer. Distributed weighted matching. In Proc. DISC’04, LNCS 3221:335-348, Springer, October 2004.
    Google ScholarLocate open access versionFindings
  • X. Wu and R. Srikant. Regulated maximal matching: a distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing. In Proc. IEEE CDC-ECC’05, December 2005.
    Google ScholarLocate open access versionFindings
  • G. Zussman and A. Segall. Capacity assignment in bluetooth scatternets - optimal and heuristic algorithms. ACM/Kluwer Mobile Networks and Applications (MONET), 9(1):49-61, February 2004.
    Google ScholarLocate open access versionFindings
Your rating :
0

 

Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科