@inproceedings{6983568b41f744e58a39bcdf393939ce,
title = "Centdian computation for sensor networks",
abstract = "This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a convex combination of two QoS requirements: transport and delay. To the best of our knowledge, no efficient algorithm has yet been developed for constructing a centdian node in a cactus graph, either sequential or distributed. We first investigate the properties of the centdian node in a cycle graph, and then explore the behavior of the centdian node in a cactus graph. Finally, we present new efficient sequential and distributed algorithms for finding all centdian nodes in a cycle graph and a cactus graph.",
keywords = "Cactus Graph, Centdian Node, Distributed Algorithm, Sensor Network",
author = "Boaz Ben-Moshe and Amit Dvir and Michael Segal and Arie Tamir",
year = "2010",
month = jan,
day = "1",
doi = "10.1007/978-3-642-13562-0\_18",
language = "English",
isbn = "3642135617",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "187--198",
booktitle = "Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings",
address = "Germany",
note = "7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010 ; Conference date: 07-06-2010 Through 11-06-2010",
}