Algorithmic Aspects of Wireless Sensor Networks
From MaRDI portal
Publication:5312965
DOI10.1007/B98740zbMATH Open1104.68321OpenAlexW2489302366MaRDI QIDQ5312965FDOQ5312965
Authors: Ted Herman, Sébastien Tixeuil 
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98740
Recommendations
- Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
- scientific article; zbMATH DE number 2061536
- scientific article; zbMATH DE number 7028616
- Contention-free MAC protocols for asynchronous wireless sensor networks
- Contention-Free MAC Protocols for Wireless Sensor Networks
Cited In (16)
- Title not available (Why is that?)
- Contention-Free MAC Protocols for Wireless Sensor Networks
- A state-based model of sensor protocols
- Timer-based composition of fault-containing self-stabilizing protocols
- Topology-transparent reservation time division multiple access in multihop ad hoc networks
- Title not available (Why is that?)
- Contention-free MAC protocols for asynchronous wireless sensor networks
- Resource efficient stabilization for local tasks despite unknown capacity links
- Research of optimizing frame size and group division in Aloha-based algorithms
- Time-slot assignment for TDMA-systems
- Self-organizing Desynchronization and TDMA on Wireless Sensor Networks
- Ascending runs in dependent uniformly distributed random variables: application to wireless networks
- Evaluating Complex MAC Protocols for Sensor Networks with APMC
- Sleeping on the job: energy-efficient and robust broadcast for radio networks
- Title not available (Why is that?)
- Distributed Computing – IWDC 2005
This page was built for publication: Algorithmic Aspects of Wireless Sensor Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312965)
