Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1132905.1132927acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
Article

DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks

Published:22 May 2006Publication History

ABSTRACT

This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(δ) time and message complexity where δ is the maximum size of a two-hop neighborhood in a wire-less network while message complexity remains O(δ), assuming that message delays can be bounded by an unknown constant.DRAND is the first fully distributed version of RAND. The algorithm is suitable for a wireless network where most nodes do not move,such as wireless mesh networks and wireless sensor networks.We implement the algorithm in TinyOS and demonstrate its performance in a real testbed of Mica2 nodes. The algorithm does not require any time synchronization and is shown to be effective in adapting to local topology changes without incurring global overhead in the scheduling.Because of these features, it can also be used even for other scheduling problems such as frequency or code scheduling (for FDMA or CDMA) or local identifier assignment for wireless networks where time synchronization is not enforced.

References

  1. CC1000 Low Power FSK transceiver, Chipcon Corporation.Google ScholarGoogle Scholar
  2. WiMedia Alliance,MBOA Wireless MAC Specification for High Rate Wireless Personal Area Networks (WPANs),Specification Draft.Google ScholarGoogle Scholar
  3. ZigBee Alliance, IEEE 802.15.4, ZigBee standard.Google ScholarGoogle Scholar
  4. L. Bao and J. J. Garcia-Luna-Aceves. A new approach to channel access scheduling for ad hoc networks. In ACM MobiCom '01: Proceedings of the 7th annual international conference on Mobile computing and networking pages 210--221, New York, NY, USA, 2001. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. Breslau, D. Estrin, K. Fall, S. Floyd, J. Heidemann, A. Helmy,P. Huang, S. McCanne,K. Varadhan, Y. Xu, and H. Yu. Advances in network simulation. IEEE Computer 33(5):59--67, May 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. I. Chlamtac and A. Farag. Making transmission schedules immune to topology changes in multi-hop packet radio networks.IEEE/ACM Transactions on Networking 2(1):23--29,1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. B.Crow,I.Widjaja,J.G.Kim,and P.Sakai.IEEE 802.11 wireless local area networks.IEEE Communications Magazine 35(9):116--126, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Gandham, M. Dawande, and R. Prakash. Link scheduling in sensor networks:Distributed edge coloring revisited. In IEEE INFOCOM 2005.Google ScholarGoogle ScholarCross RefCross Ref
  9. J. Grnkvist. Assignment methods for spatial reuse TDMA. In ACM MobiHoc '00: Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing pages 119--124, Piscataway, NJ, USA, 2000. IEEE Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Gruteser and D. Grunwald. Enhancing location privacy in wireless lan through disposable interface identifiers: a quantitative analysis.In WMASH '03: Proceedings of the 1st ACM international workshop on Wireless mobile applications and services on WLAN hotspots pages 46--55, New York, NY, USA, 2003. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. Herman and S. Tixeuil. A distributed TDMA slot assignment algorithm for wireless sensor networks. In Proceedings of the First Workshop on Algorithmic Aspects of Wireless Sensor Networks (AlgoSensors'2004)number 3121 in Lecture Notes in Computer Science, pages 45--58, Turku, Finland, July 2004. Springer-Verlag.Google ScholarGoogle ScholarCross RefCross Ref
  12. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister. System architecture directions for network sensors. In Proc. Int. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS)Cambridge,MA,November 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. B. Hull, K. Jamieson, and H. Balakrishnan. Mitigating congestion in wireless sensor networks. In SenSys '04: Proceedings of the 2nd international conference on Embedded networked sensor systems pages 134--147, New York,NY,USA,2004.ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. S. Kulkarni and M. U. Arumugam. TDMA service for sensor networks.In ICDCSW '04: Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04)pages 604--609,Washington,DC,USA, 2004.IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M.Luby.Removing randomness in parallel computation without processor penality. Journal of Computer and System Sciences 47(2):250--286,Oct. 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. T.Moscibroda and R.Wattenhofer. Coloring Unstructured Radio Networks.In 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Las Vegas, Nevada, USA July 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. Parthasarathy and R. Gandhi. Distributed algorithms for coloring and domination in wireless ad hoc networks. In FSTTCS pages 447--459, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. R. K. Patro and B. Mohan. Mobile agent based TDMA slot assignment algorithm for wireless sensor networks. In International Conference on Information Technology: Coding and Computing (ITCC'05) -Volume II pages pp.663--667,2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Polastre, J. Hill, and D. Culler. Versatile low power media access for wireless sensor networks. In ACM SenSys '04: Proceedings of the 2nd international conference on Embedded networked sensor systems pages 95--107, New York, NY, USA, 2004. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Ramanathan. A unified framework and algorithms for (T/F/C)DMA channel assignment in wireless networks. In IEEE INFOCOM pages 900--907, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. I. Rhee, A. Warrier, M. Aia, and J. Min. Z-MAC: a hybrid MAC for wireless sensor networks. In SenSys'05: Proceedings of the 3rd international conference on Embedded networked sensor systems pages 90--101, New York, NY, USA, 2005. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. R. Rozovsky and P. R. Kumar. SEEDEX: a MAC protocol for ad hoc networks.In ACM MobiHoc '01: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing pages 67--75, New York, NY, USA, 2001. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. T. Salonidis and L. Tassiulas. Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks. In ACM MobiHoc '05: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing pages 145--156, New York, NY, USA, 2005. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. W. Ye, J. Heidemann, and D. Estrin. An energy-efficient mac protocol for wireless sensor networks. In Proceedings of the IEEE Infocom pages 1567--1576, New York, NY, USA,June 2002. USC/Information Sciences Institute, IEEE.Google ScholarGoogle Scholar
  25. G. Zhou, T. He, S. Krishnamurthy, and J. A. Stankovic. Impact of radio irregularity on wireless sensor networks.In MobiSys '04: Proceedings of the 2nd international conference on Mobile systems, applications, and services pages 125--138, New York, NY, USA, 2004. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. C. Zhu and M. Corson. An evolutionary-TDMA scheduling protocol (E-TDMA) for mobile ad hoc networks. In Proc. of Advanced Tel ecommunications and Information Distribution Research Program (ATIRP)March, 2000.Google ScholarGoogle Scholar
  27. C.Zhu and M. S. Corson. A five-phase reservation protocol (fprp)for mobile ad hoc networks. Wireless Networks 7(4):371--384, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        MobiHoc '06: Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
        May 2006
        378 pages
        ISBN:1595933689
        DOI:10.1145/1132905

        Copyright © 2006 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 22 May 2006

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate296of1,843submissions,16%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader