Results 1 - 10
of
39
Self-organization in ad hoc networks: Overview and classification
, 2006
"... su pe rse de d b y jou rna l v ers ion ..."
(Show Context)
RAPID: Reliable Probabilistic Dissemination in wireless ad-hoc networks
- In Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (SRDS
, 2007
"... Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. In this paper we propose a novel ReliAble ProbabIlistic Dissemination protocol, called RAPID, for mobile wireless ad-hoc networks that tolerates ..."
Abstract
-
Cited by 26 (6 self)
- Add to MetaCart
(Show Context)
Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. In this paper we propose a novel ReliAble ProbabIlistic Dissemination protocol, called RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and selfish behavior. The protocol employs a combination of probabilistic forwarding with deterministic corrective measures. The forwarding probability is set based on the observed number of nodes in each one-hop neighborhood, while the deterministic corrective measures include deterministic gossiping as well as timer based corrections of the probabilistic process. These aspects of the protocol are motivated by a theoretical analysis that is also presented in the paper, which explains why this unique protocol design is inherent to ad-hoc networks environments. Since the protocol only relies on local computations and probability, it is highly resilient to mobility and failures. By adding authentication, it can even be made malicious tolerant. Additionally, the paper includes a detailed performance evaluation by simulation. We compare the performance and the overhead of RAPID with the performance of other probabilistic approaches. Our results show that RAPID achieves a significantly higher node coverage with a smaller overhead.
DICTATE: Distributed certification authority with probabilistic freshness for ad hoc networks
- TRANS. DEPENDABLE SECURE COMPUT
, 2005
"... Securing ad hoc networks is notoriously challenging, notably due to the lack of an online infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case where an ad hoc network is under the respons ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
Securing ad hoc networks is notoriously challenging, notably due to the lack of an online infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case where an ad hoc network is under the responsibility of a mother certification authority (mCA). Since the nodes can frequently be collectively isolated from the mCA (e.g., for a remote mission) but still need the access to a certification authority, the mCA preassigns a special role to several nodes (called servers) that constitute a distributed certification authority (dCA) during the isolated period. We propose a solution, called DICTATE (DIstributed CerTification Authority with probabilisTic frEshness), to manage the dCA. This solution ensures that the dCA always processes a certificate update (or query) request in a finite amount of time and that an adversary cannot forge a certificate. Moreover, it guarantees that the dCA responds to a query request with the most recent version of the queried certificate in a certain probability; this probability can be made arbitrarily close to 1, but at the expense of higher overhead. Our contribution is twofold: 1) a set of certificate management protocols that allow trading protocol overhead for certificate freshness or the other way around, and 2) a combination of threshold and identity-based cryptosystems to guarantee the security, availability, and scalability of the certification function. We describe DICTATE in detail and, by security analysis and simulations, we show that it is robust against various attacks.
Group Management for Mobile Ad Hoc Networks: Design, Implementation and Experiment
- MOBILE DATA MANAGEMENT (2005) 192-199
, 2005
"... Mobile ad hoc networks (MANET) offer a convenient basis toward realization of pervasive computing, due to its ease of deployment and inherent support for anytime, anywhere network access for mobile users. However, the development of applications over such networks is faced by the challenge of networ ..."
Abstract
-
Cited by 18 (1 self)
- Add to MetaCart
Mobile ad hoc networks (MANET) offer a convenient basis toward realization of pervasive computing, due to its ease of deployment and inherent support for anytime, anywhere network access for mobile users. However, the development of applications over such networks is faced by the challenge of network dynamics attributed to node mobility and the scalability issue. Group management poses as a promising paradigm to ease the development of distributed applications for dynamic, mobile networks. Specifically, group management makes transparent the failures due to node mobility and assembles mobile nodes to meet target functional and non-functional properties. Various network-level grouping schemes over MANET have been investigated over the last couple of years. In this paper, we introduce the design and implementation of a generic group service for MANET, defined with respect to the various attributes of relevance. Generic group management is further demonstrated with its support of scalable service discovery in MANET.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks
- Journal of Pragmatics
, 2001
"... A network of sensors can be used to obtain statebased data from the area in which they are deployed. To reduce costs, the data, sent via intermediate sensors to a sink, is often aggregated (or compressed). This compression is done by a subset of the sensors called aggregators. Since sensors are usua ..."
Abstract
-
Cited by 17 (0 self)
- Add to MetaCart
(Show Context)
A network of sensors can be used to obtain statebased data from the area in which they are deployed. To reduce costs, the data, sent via intermediate sensors to a sink, is often aggregated (or compressed). This compression is done by a subset of the sensors called aggregators. Since sensors are usually equipped with small and unreplenishable energy reserves, a critical issue is to strategically deploy an appropriate number of aggregators so as to minimize the amount of energy consumed by transporting and aggregating the data.
Adaptive Content-based Routing for Delay-tolerant Mobile Ad Hoc Networks
"... Content-based routing fosters a sharp decoupling between data producers and consumers. Therefore, it is key in highly dynamic scenarios like mobile ad hoc networks (MANETs), where it can provide the building block for higher-level programming abstractions, e.g., publish-subscribe and queryadvertise. ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
(Show Context)
Content-based routing fosters a sharp decoupling between data producers and consumers. Therefore, it is key in highly dynamic scenarios like mobile ad hoc networks (MANETs), where it can provide the building block for higher-level programming abstractions, e.g., publish-subscribe and queryadvertise. A few proposals exist for content-based routing on MANETs, addressing the issues concerned with the dynamic network topology. However, these approaches do not take into account that the network is often partitioned in smaller portions with rather stable topology, enjoying only intermittent connectivity thanks to carrier hosts traveling across partitions. This mobility pattern is frequent among human beings, and can be regarded as a form of delay-tolerant network. In this paper we propose an adaptive content-based routing approach addressing this problem. The protocol takes into account information about host mobility and connectivity changes to produce estimates enabling a more accurate message forwarding. These include the identification of potential carrier hosts, therefore maximizing message delivery despite network partitions and intermittent connectivity. We compare the performance of our protocol against others, using a mobility model validated with real-world traces. 1.
A Study of Self-Organization Mechanisms in Ad Hoc and Sensor Networks
- Elsevier Computer Communications
, 2008
"... Self-organization is a great concept for building scalable systems consisting of a huge number of subsystems. The primary objectives are improved scalability and dynamic adaptation to changing environmental conditions. Until now, many selforganization methods have been developed for communication ne ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
(Show Context)
Self-organization is a great concept for building scalable systems consisting of a huge number of subsystems. The primary objectives are improved scalability and dynamic adaptation to changing environmental conditions. Until now, many selforganization methods have been developed for communication networks in general and ad hoc networks in particular. Nevertheless, the term self-organization is still often misunderstood or misused. This paper contributes to the networking community by providing a better understanding of self-organization mechanisms focusing especially on the applicability in ad hoc and sensor networks. The main contributions of this paper are a clarification of the term self-organization and a categorization of self-organization methods. Additionally, well-known protocols in ad hoc and sensor networks are classified and selected case studies are provided. Primarily, solutions for the medium access control and the network layer are analyzed and discussed. Finally, open research issues with practical relevance are discussed. Key words: self-organization, ad hoc networks, sensor networks, ad hoc routing, wireless communication, adaptive mechanisms 1
Probabilistic quorum systems in wireless ad hoc networks
- In Proceedings of the 38th IEEE International Conference on Dependable Systems and Networks (DSN-DCCS
, 2008
"... Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This paper explores several access strategies for implementing probabilistic q ..."
Abstract
-
Cited by 10 (5 self)
- Add to MetaCart
(Show Context)
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic. This paper explores several access strategies for implementing probabilistic quorums in ad hoc networks. In particular, we present the first detailed study of asymmetric probabilistic bi-quorum systems, that allow to mix different access strategies and different quorums sizes, while guaranteeing the desired intersection probability. We show the advantages of asymmetric probabilistic bi-quorum systems in ad hoc networks. Such an asymmetric construction is also useful for other types of networks with non uniform access costs (e.g, peer-to-peer networks). The paper includes both a formal analysis of these approaches backed up by an extensive simulation based study. In particular, we show that one of the strategies that uses Random Walks, exhibits the smallest communication overhead, thus being very attractive for ad hoc networks. Categories and Subject Descriptors: C.2.1 [Comp.-Communication Networks]: Network Architecture and Design—Wireless communication;
Building reliable mobile applications with space-elastic adaptation
- In Mobile Distributed Computing workshop (MDC 2006
, 2006
"... Mobile applications, for example mobile robots, are playing an increasingly important role in our everyday lives. Since components of these applications share their environment with each other and with humans, they need to coordinate their behaviour to respect strong safety constraints. Unfortunatel ..."
Abstract
-
Cited by 8 (6 self)
- Add to MetaCart
(Show Context)
Mobile applications, for example mobile robots, are playing an increasingly important role in our everyday lives. Since components of these applications share their environment with each other and with humans, they need to coordinate their behaviour to respect strong safety constraints. Unfortunately, they typically make use of wireless networks in which real-time communication is highly unreliable, making coordination particularly challenging. We present a real-time communication model for wireless networks that takes into account that communication might not be reliable. It provides feedback to mobile components about the state of communication, so that they can adapt their behaviour accordingly. We show how this model can be used to build reliable mobile applications in wireless networks: this involves specifying the safety constraints that need to be respected, and translating them into constraints on the behaviour of individual components. To illustrate our approach, we describe an example from the Intelligent Transportation Systems domain. 1.
Using group management to tame mobile ad hoc networks
- in MOBIS, 2004
"... Mobile ad hoc networks (MANET) pave the way for pervasive computing due to inherent support for anytime, anywhere network access for mobile users. Nonetheless, the highly dynamic nature of mobile ad hoc networks poses tremendous challenges for the development of applications since the application’s ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
(Show Context)
Mobile ad hoc networks (MANET) pave the way for pervasive computing due to inherent support for anytime, anywhere network access for mobile users. Nonetheless, the highly dynamic nature of mobile ad hoc networks poses tremendous challenges for the development of applications since the application’s context keeps changing over time. One approach to master this complexity lies in the management of groups over MANET, i.e., applications execute on top of groups that manage the dynamic execution context, including mobility-related failures. There has been extensive research on group maninria-00415906,
