Centdian computation for sensor networks

Authors:
Boaz Ben-Moshe;Amit Dvir;Michael Segal;Arie Tamir
Affiliations:
Department of Computer Science, Ariel University Center of Samaria, Israel;Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Israel;Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Israel;School of Mathematical Sciences, Tel Aviv University, Israel
Venue:
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Year:
2010

Citing 15
Cited 0

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A note on locating a central vertex of a 3-cactus graph

Computers and Operations Research
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Computing
A linear-time algorithm for solving the center problem on weighted cactus graphs

Information Processing Letters
Algorithms for energy-efficient multicasting in static ad hoc wireless networks

Mobile Networks and Applications
On the node-scheduling approach to topology control in ad hoc networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Estimating the Traffic on Weighted Cactus Networks in Linear Time

IV '05 Proceedings of the Ninth International Conference on Information Visualisation
A Robust and Energy Efficient Routing Scheme for Wireless Sensor Networks

ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
TTDD: two-tier data dissemination in large-scale wireless sensor networks

Wireless Networks
Efficient algorithms for center problems in cactus networks

Theoretical Computer Science
Median problems on wheels and cactus graphs

Computing
Wireless Dynamic Token Protocol for MANET

ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
Wireless sensor network survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Placing and maintaining a core node in wirelessad hoc networks

Wireless Communications & Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

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.