1. Prim-Dijkstra tradeoffs for improved performance-driven routing tree design;Alpert;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,1995
2. G.V. Andreev, Y.N. Sotskov, A branch and bound method for mixed graph coloring and scheduling, in: Proceedings of the 16th International Conference on CAD/CAM Robotics & Factories of the Future (CARS & FOF 2000), vol. 1, Port of Spain/Trinidad and Tobago, pp. 1–8.
3. Cost-sensitive analysis of communication protocols;Awerbuch,1990
4. M. Bagaa, A. Derhab, N. Lasla, A. Ouadjaout, N. Badache, Semi-structured and unstructured data aggregation scheduling in wireless sensor networks, in: INFOCOM, 2012 Proceedings IEEE, pp. 2671–2675.
5. Algorithm design and synthesis for wireless sensor networks;Bakshi;International Conference on Parallel Processing,2004