Hugo Miranda

Hugo Miranda

Auto-generated profile, based on publicly available information

Hugo Miranda

LaSIGE, Faculdade de Ciências, Universidade de Lisboa, Portugal

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2002
Verified
Conference Paper
Closed access
HMH. Miranda
H. Miranda
APA. Pinto
A. Pinto
LRL. Rodrigues
L. Rodrigues
Distributed applications are becoming increasingly complex, often requiring the simultaneous use of several communication channels with different qualities-of-service. This paper presents the Appia system, a protocol kernel that supports applications requiring multiple coordinated channels. Appia offers a clean and elegant way for the application to express inter-channel constraints, such as, for instance, that all channels should provide consistent information about the failures of remote nodes. These constraints can be implemented as protocol layers that can be dynamically combined with other protocol layers.

1 September 2006
Verified
Conference Paper
Closed access
HMHugo Miranda
Hugo Miranda
SLSimone Leggio
Simone Leggio
LRLuis Rodrigues
Luis Rodrigues
KRKimmo Raatikainen
Kimmo Raatikainen
Flooding is an expensive operation that is often required in the operation of mobile ad hoc networks (MANETs). In this paper, we present a novel algorithm to reduce the overhead imposed by flooding operations. The algorithm improves previous results by using a distributed function to elect the nodes that will provide the highest additional coverage to previous retransmissions. The algorithm does not require any signalling or impose special requirements on the participating devices

22 June 2004
Verified
Conference Paper
Closed access
HMH. Miranda
H. Miranda
LRL. Rodrigues
L. Rodrigues
Technological advances are leveraging the widespread deployment of mobile ad hoc networks. An interesting characteristic of ad hoc networks is their self-organization and their dependence of the behavior of individual nodes. Until recently, most research on ad hoc networks has assumed that all nodes were cooperative. This assumption is no longer valid in spontaneous networks formed by individuals with diverse goals and interests. In such environment, the presence of selfish nodes may degrade significantly the performance of the ad hoc network. This paper proposes a novel algorithm that aims to discourage selfish behavior in mobile ad hoc networks.

1 April 2008
Verified
Conference Paper
Open access
PDF file
PCPaolo Costa
Paolo Costa
DGDaniela Gavidia
Daniela Gavidia
BKBoris Koldehofe
Boris Koldehofe
HMHugo Miranda
Hugo Miranda
MMMirco Musolesi
Mirco Musolesi
OROriana Riva
Oriana Riva
Vehicular ad hoc networks present challenging characteristics, such as very dynamic behavior and sparse connectivity, that need to be taken into account in designing adequate communication support. Gossip-based protocols have recently emerged as an effective approach to providing reliable and efficient communication in this domain. Nonetheless, despite the preliminary encouraging results, to the best of our knowledge, no previous work has systematically analyzed how gossip protocols are affected by the intrinsic characteristics of vehicular networks such as the very specific mobility patterns of vehicles, the relative abundance of memory and computational resources that vehicles offer, and the availability of geographical information through GPS receivers. In this paper, we aim at filling this gap by examining core requirements of vehicular network applications and analyzing the research challenges that gossip-based communication protocols need to address.

1 July 2006
Verified
Conference Paper
Closed access
HMHugo Miranda
Hugo Miranda
LRLuis Rodrigues
Luis Rodrigues
In ubiquitous networks, the multiple devices carried by an user may unintentionally expose information about her habits or preferences. This information leakage can compromise the users' right to privacy. A common approach to increase privacy is to hide the user real identity under a pseudonym. Unfortunately, pseudonyms may interfere with the reputation systems that are often used to assert the reliability of the information provided by the participants in the network. This paper presents a framework for combining anonymity with reputation and shows that it can be configured to provide a desired degree of balance between these two conflicting goals. The proposed solution leverages on well-known cryptographic techniques, such as public key infrastructure and blind signatures

18 March 2013
Verified
Conference Paper
Open access
PDF file
RLRui Lima
Rui Lima
CBCarlos Baquero
Carlos Baquero
HMHugo Miranda
Hugo Miranda
Searching for resources over unstructured networks is usually supported by broadcast communication primitives. Ideally, the broadcast process should be cancelled as soon as possible after a successful discovery, to avoid ooding the entire network. However, cancelling an ongoing broadcast is challenging and may increase the number of exchanged messages. In this paper, we compare the cancellation mechanisms used by BERS and BERS? With new proposed cancellation approaches BCIR and BCIR? The formulation of a simplified analytical model and the simulation results show that:i)it is possible to reduce the number of retransmitted messages, without increasing the latency observed in BERS?; and ii) BCIR is more energy eficient, which can contribute to extend the availability of mobile battery powered devices.Fundação para a Ciência e Tecnologia, Portugal (PEst- OE/EME/UI4005/2011) and carried out within the research Centro Lusíada de Investigação e Desenvolvimento em Engenharia e Gestão Industrial (CLEGI