Now showing items 1-6 of 6
A cluster-based dynamic load balancing middleware protocol for grids
We describe a hierarchical dynamic load balancing protocol for Grids. The Grid consists of clusters and each cluster is represented by a coordinator. Each coordinator first attempts to balance the load in its cluster and ...
Merging clustering algorithms in mobile Ad Hoc networks
Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We first look at minimum spanning tree(MST) based algorithms and ...
A distributed wakening based target tracking protocol for wireless sensor networks
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA)  partitions the network into clusters with controllable diameter and ...
Performance evaluation of cluster-based target tracking protocols for wireless sensor networks
Target tracking is an important application type for wireless sensor networks (WSN). Recently, various approaches [1-11] are proposed to maintain the accurate tracking of the targets as well as low energy consumption. ...
Modeling leakage of ephemeral secrets in tripartite/group key exchange
Recent advances in the design and analysis of secure two-party key exchange (2KE) such as the leakage of ephemeral secrets used during the attacked sessions remained unnoticed by the current models for group key exchange ...
Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard
(ACM Press, 2008)
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 800-56A standard. The UM protocol is believed to ...