Sciweavers

289 search results - page 46 / 58
» Simple COMA Node Implementations
Sort
View
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 9 months ago
A Novel Scheme for Secured Data Transfer Over Computer Networks
: This paper presents a novel encryption-less algorithm to enhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a `jigsaw puzzle&#...
Rangarajan Vasudevan, Ajith Abraham, Sugata Sanyal
DPD
2006
123views more  DPD 2006»
13 years 8 months ago
Reducing network traffic in unstructured P2P systems using Top-k queries
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solu...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
ITA
2006
163views Communications» more  ITA 2006»
13 years 8 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
JCP
2006
100views more  JCP 2006»
13 years 8 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
JNW
2008
116views more  JNW 2008»
13 years 7 months ago
Scalable Revocation in Hybrid Ad Hoc Networks: The SHARL Scheme
The article proposes a simple, scalable and robust scheme for the distribution of revocation information in mobile ad hoc networks (MANETs). The scheme is intended for ad hoc netwo...
Mona Holsve Ofigsbø, Anne Marie Hegland, P&...