default search action
DIAL-M-POMC 2008: Toronto, Canada
- Michael Segal, Alexander Kesselman:
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Toronto, Canada, August 18-21, 2008. ACM 2008, ISBN 978-1-60558-244-3 - Andrzej Pelc:
Algorithmic aspects of radio communication. 1-2
Sensor networks
- Gruia Calinescu, Robert B. Ellis:
Monitoring schedules for randomly deployed sensor networks. 3-12 - Jamie Macbeth, Majid Sarrafzadeh:
Scalable medium access control for in-network data aggregation. 13-22 - Roger Wattenhofer:
Theory for sensor networks: what is it good for? 23-24 - Shlomi Dolev:
Self-stabilizing and self-orgenizing mobile networks. 25-26 - Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Gossiping (via mobile?) in social networks. 27-28 - Zeev Nutov:
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows. 29-34
Wireless networks I (scheduling)
- Olga Goussevskaia, Thomas Moscibroda, Roger Wattenhofer:
Local broadcasting in the physical interference model. 35-44 - Qiang-Sheng Hua, Francis C. M. Lau:
Exact and approximate link scheduling algorithms under the physical interference model. 45-54 - Prithwish Basu, Chi-Kin Chau:
Latency of opportunistic forwarding in finite regular wireless networks. 55-64
Wireless networks II (topology control)
- Eric Schmutz:
Symmetric range assignment with disjoint MST constraints. 65-70 - Chen Avin:
Distance graphs: from random geometric graphs to Bernoulli graphs and between. 71-78 - Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan:
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. 79-86 - Tim Nieberg:
Local, distributed weighted matching on general and wireless topologies. 87-92
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.