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.
- CC1000 Low Power FSK transceiver, Chipcon Corporation.Google Scholar
- WiMedia Alliance,MBOA Wireless MAC Specification for High Rate Wireless Personal Area Networks (WPANs),Specification Draft.Google Scholar
- ZigBee Alliance, IEEE 802.15.4, ZigBee standard.Google Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- S. Gandham, M. Dawande, and R. Prakash. Link scheduling in sensor networks:Distributed edge coloring revisited. In IEEE INFOCOM 2005.Google ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- M.Luby.Removing randomness in parallel computation without processor penality. Journal of Computer and System Sciences 47(2):250--286,Oct. 1993. Google ScholarDigital Library
- 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 ScholarDigital Library
- S. Parthasarathy and R. Gandhi. Distributed algorithms for coloring and domination in wireless ad hoc networks. In FSTTCS pages 447--459, 2004. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
Index Terms
- DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Recommendations
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(\delta ) time and message complexity where \delta is the maximum size of a two-hop neighborhood in a wireless network ...
Translating full duplexity into capacity gains for the high-priority traffic classes of IEEE 802.11
SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied ComputingIn this paper we present PbP-EDCA, a Full Duplex (FD) MAC protocol that operates according to the high-priority access rules of the standard IEEE 802.11 EDCA. With PbP-EDCA, nodes that win a contention perform a sequence of narrow-band orthogonal ...
Adaptive GTS allocation in IEEE 802.15.4 for real-time wireless sensor networks
The IEEE 802.15.4 standard is able to achieve low-power transmissions in low-rate and short-distance Wireless Personal Area Networks (WPANs). It supports a Guaranteed Time Slots (GTSs) allocation mechanism for time-critical and delay-sensitive data ...
Comments