List of Publications

  1. W. Goddard,  S. T. Hedetniemi, D. P. Jacobs,  V. Trevisan, Distance-$k$ knowledge in self-stabilizing algorithms,
    Theoretical Computer Science, (to appear).
  2. W. Goddard, S. Hedetniemi, D. Jacobs and V. Trevisan. Distance-k information in self-stabilizing algorithms. Thirteenth Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), 3-5 July 2006, Chester, UK.
  3. W. Goddard, S.T. Hedetniemi and Z. Shi, An anonymous self-stabilizing algorithm for 1-maximal matching in trees. The 2006 Internat. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA'06), Las Vegas, USA.
  4. Z. Shi and P. K. Srimani, An online distributed gossiping protocol for mobile networks, Journal of Combinatorial Optimization, Volume 11, No. 1, pp. 87 - 97, 2006
  5. W. Goddard, S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Self-stabilizing algorithms for orderings and colorings, International Journal of Foundations of Computer Science, Vol. 16, No. 1 (2005) 19-36. (Abstract) (Paper)
  6. W. Goddard, S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Self-Stabilizing Global Optimization Algorithms for
    Large Network Graphs, International Journal of Distributed Sensor Networks, Volume 1, No. 3&4, pp. 329 - 344, 2005. (Abstract) (Paper)
  7. Z. Xu and P.K. Srimani,  Self-Stabilizing Publish/Subscribe Protocol for P2P Networks, Proceedings of Lecture Notes in Computer Science, Springer-Verlag, LNCS 3741; IWDC Workshop - 2005: 7th International Workshop - Kharagpore, India, pp. 129 - 140. (Abstract) (Paper)
  8. Z. Shi and P. K. Srimani, An Efficient Distributed Protocol for Online Gossiping Problem, Proceedings of 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Compiegne, France. (Abstract) (Paper)
  9. Z. Shi and P. K. Srimani, Self-Stabilizing Distributed Systems & Sensor Networks, Chapter 23 in Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad-Hoc Wireless, and Peer-to-Peer Networks, Auerbach Publications, 2005, pp-393-402.  (Abstract) (Paper)
  10. Z. Zxu and P. K. Srimani, Protocols for Sensor Networks using COSMOS Model, Proceedings of Lecture Notes in Computer Science, Springer-Verlag, LNCS 3741; IWDC Workshop - 2005: 7th International Workshop - Kharagpore, India, pp. 75 - 86. (Abstract) (Paper)
  11. W. Shi, A. Bouabdallah, and P. K. Srimani, Leader Election in Oriented Star-Graphs, Networks, vol 45, pp 169 - 179, 2005. (Abstract) (Paper)
  12. L.Wng, S. Subramanian, S. Latifi, and P. K. Srimani, Distance Distribution of Nodes in Star Graphs, Applied Mathematics Letters, 2005. (Abstract) (Paper)
  13. V. Jolly, N. Kimura, S. Latifi, P. K. Srimani, Loop detectionin MPLS for wireless sensor networks, Elsevier ???. (Abstract) (Paper)
  14. P. K. Srimani and B. P Sinha, Mobility Tolerant Broadcast in Mobile Ad Hoc Networks, in the Lecture Notes in Computer Science, Springer-Verlag Volume 3326; Distributed Computing -  IWDC 2004: 6th International Workshop, Kolkata, India, December 27-30, 2004 page 435-446 .(Abstract) (Paper)
  15. J. Zheng, E. Regentova, and P. K. Srimani, Personalized Location Area for Future PCS Networks, in the Lecture Notes in Computer Science, Springer-Verlag Volume 3326; Distributed Computing -  IWDC 2004: 6th International Workshop, Kolkata, India, December 27-30, 2004 page 495-501.(Abstract) (Paper)
  16. W. Shi and P. K. Srimani, Leader Election in Hyper-Butterfly Graphs, in the Lecture Notes in Computer Science, Springer-Verlag Volume 3222; IPIF International Federation for Information Processing, NPC 2004, Beijing, China, October, 2004 pages 292-299. (Abstract) (Paper)
  17. M. Gairing, W. Goddard, S. T. Hedetniemi, P. Kristiansen and A. A. McRae, Distance-Two Information in Self-stabilizing Algorithms, Parallel Processing Letters, to appear 2004.(Abstract) (Paper)
  18. Z. Shi and P. K. Srimani, A New Adaptive Distributed Routing Protocol using d-hop Dominating Sets for Mobile Ad Hoc Networks, in the Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'04), Las Vegas, Nevada, USA, June, 2004.(Abstract) (Paper)
  19. W. Goddard, S. T. Hedetniemi, D. P. Jacobs, P. K. Srimani, Fault Tolerant Algorithms for Orderings and Colorings, in the Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04 ,Santa Fe, New Mexico, USA, April, 2004.(Abstract) (Paper)
  20. Z. Shi, W. Goddard and S. T. Hedetniemi, An Anonymous Self-Stabilizing Algorithm for 1-Maximal Independent Set in Trees, Information Processing Letters, Vol 91/2 pp 77-83, 2004. (Abstract) (Paper)
  21. W. Goddard, S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph, International Conference on High Performance Computing (HiPC 2003), Hyderabad, India, December 17-20, 2003. (Abstract) (Paper)
  22. Z. Xu, S. T. Hedetniemi, W. Goddard, and P. K. Srimani, A Synchronous Self-Stabilizing Minimal Domination Protocol in an Arbitrary Network Graph, In the Proceedings of the 5th International Workshop on Distributed Computing(IWDC), Calcutto, India, 27-30 December 2003. (Abstract) (Paper)
  23. W. Goddard, S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks, in the Proceedings of the Fifth IPDPS Workshop on Advances in Parallel and Distributed Computational Model, Nice, France, April 22-26, 2003. (Abstract) (Paper)
  24. S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Self-stabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Set, Computer Mathematics and Applications, 2003. (Abstract) (Paper)
  25. S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Linear time self-stabilizing colorings, Information Processing Letters 87 (2003) 251-255. (Abstract) (Paper)
  26. W. Goddard, S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Graph, in the Proceedings of the 8th IPDPS Workshop Formal Methods for Parallel Programming: Theory and Applications, Nice, France, April 22-26, 2003. (Abstract) (Paper)
  27. W. Goddard, S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time, in the Proceedings of the ICDCS International Workshop on Mobile Distributed Computing (MDC03), Rhode Island, May 19-22, 2003. (Abstract) (Paper)
  28. Martin Gairing, S. T. Hedetniemi, Petter Kristiansen, and Alice A. McRae, Self-stabilizing Algorithms for {k}-domination. Proceedings of the 6th Symposium on Self-Stabilization (SSS 2003), Springer LNCS 2704, pages 49-60, 2003. (Abstract) (Paper)
  29. S. K. S. Gupta and P. K. Srimani, Self-stabilizing Multicast Protocols for Ad Hoc Networks, Journal of Parallel and Distributed Computing 63(2003) 87-96. (Abstract) (Paper)
  30. S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Fault Tolerant Distributed Coloring Algorithms That Stabilize in Linear Time, in the Proceedings of the IEEE IPDPS-2002 Workshop on Advances in Parallel and Distributed Computational Models, Orlando, Florida, April 2002.  (Abstract) (Paper)
  31. S. K. S. Gupta and P. K. Srimani,  Cored-Based Tree with Forwarding Regions (CBT-FR); A Protocol for Reliable Multicasting in Mobile Ad Hoc Networks, Journal of Parallel and Distributed Computing 61(2001) 1249-1277. (Abstract) (Paper)
  32. S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Maximal matching stabilizes in time O(m), Information Processing Letters 80 (2001) 221-223. (Abstract) (Paper)
Back