Sciweavers

376 search results - page 19 / 76
» Self-Stabilizing Graph Protocols
Sort
View
SIROCCO
2004
13 years 9 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
CSMR
2007
IEEE
14 years 2 months ago
Online Construction of Dynamic Object Process Graphs
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
Jochen Quante
ADHOCNETS
2009
Springer
14 years 2 months ago
DHT-Based Detection of Node Clone in Wireless Sensor Networks
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...
Zhijun Li, Guang Gong
IAT
2006
IEEE
14 years 1 months ago
A Multi-agent Mechanism for Topology Balancing in Unstructured P2P Networks
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
Prithviraj Dasgupta
CN
2008
118views more  CN 2008»
13 years 7 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso