Sciweavers

PERCOM
2008
ACM
13 years 11 months ago
P2P multicast for pervasive ad hoc networks
Integrating p2p services in multi-hop ad hoc networks is today a hot topic. General multi-hop , and pervasive systems in particular, can greatly benefit from high-level middleware...
Franca Delmastro, Andrea Passarella, Marco Conti
PERCOM
2008
ACM
13 years 11 months ago
An application framework for mobile, context-aware trails
In this paper 1 we describe the design, implementation and evaluation of a software framework that supports the development of mobile, context-aware trails-based applications. A t...
Cormac Driver, Siobhán Clarke
PERCOM
2008
ACM
13 years 11 months ago
Providing Security and Privacy in RFID Systems Using Triggered Hash Chains
RFID technology shall increase security, e.g. by helping to prevent counterfeiting. But the technology also causes privacy issues. In this paper, after highlighting goals and prob...
Dirk Henrici, Paul Müller
PERCOM
2008
ACM
13 years 11 months ago
Randomized Bit Encoding for Stronger Backward Channel Protection in RFID Systems
In this paper, we introduce a randomized bit encoding scheme that can strengthen the privacy protection on RFID tags. This scheme is used together with the backward channel protec...
Tong-Lee Lim, Tieyan Li, Sze-Ling Yeo
PERCOM
2008
ACM
13 years 11 months ago
An Infrastructure for Developing Pervasive Learning Environments
This paper presents an infrastructure for developing problem-based pervasive learning environments. Building such environments necessitates having many autonomous components deali...
Sabine Graf, Kathryn MacCallum, Tzu-Chien Liu, Mai...
PERCOM
2008
ACM
13 years 11 months ago
Peer-to-Peer Context Reasoning in Pervasive Computing Environments
In this paper, we propose a peer-to-peer approach to derive and obtain additional context data from lowlevel context data that may be spread over multiple domains in pervasive com...
Tao Gu, Hung Keng Pung, Daqing Zhang
NETWORKS
2008
13 years 11 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
NETWORKS
2008
13 years 11 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona