Author:
Cichoń Jacek,Kapelko Rafał,Lemiesz Jakub,Zawada Marcin
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Alfandari, L., Paschos, V.: Approximating minimum spanning tree of depth 2. International Transactions in Operational Research 6, 607–622 (1999)
2. Clementi, A.E.F., Ianni, M.D., Monti, A., Rossi, G., SilvestriL, R.: Divide and conquer is almost optimal for the bounded-hop accumulation in ad hoc wireless networks. In: The Proceedings of SIROCCO (2005)
3. Clementi, A.E.F., Penna, M.D., Silvestri, R.: On the power assignment problem in radio networks. In: Mobile Networks and Applications, MONET (2004)
4. Clementi, A.E.F., Ianni, M.D., Lauria, M., Monti, A., Rossi, G., Silvestri, R.: A distributed protocol for the bounded-hops converge-cast in ad-hoc networks. In: The Proceedings of the 5th International Conference on AD-HOC Networks & Wireless (2006)
5. Zawada, M.: Analysis of the bounded-hops converge-cast distributed protocol in ad-hoc networks. In: The Proceedings of the 3nd International Workshop on Algorithmic Aspect of Wireless Sensor Networks (2007)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On ?-Alert Problem;2012 IEEE 26th International Parallel and Distributed Processing Symposium;2012-05
2. On Cardinality Estimation Protocols for Wireless Sensor Networks;Ad-hoc, Mobile, and Wireless Networks;2011