A Distributed Constraint Satisfaction Problem Approach to Virtual Device Composition

Karmouch, Eric; Nayak, Amiya

doi:10.1109/tpds.2012.39

Cited by 10 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the future we plan to explore other trust-based MAN-ET applications such as trust-based intrusion detection [2,11,20,23,38] and service composition [70,71] with which we could further demonstrate the design notion of application-level trust optimization proposed in this paper. We also plan to investigate if other trust formation methods (other than the linear function considered in this paper) would be more effective for such MANET applications, and perform a comparative performance analysis with existing methods (e.g., Bayesian [21] or fuzzy logic [14]).…”

Section: Resultsmentioning

confidence: 98%

Trust management in mobile ad hoc networks for bias minimization and application performance maximization

et al. 2014

View full text Add to dashboard Cite

Keywords:Trust management Mobile ad hoc networks Trust bias minimization Model-based analysis Application-level trust optimization Reliability assessment a b s t r a c t Trust management for mobile ad hoc networks (MANETs) has emerged as an active research area as evidenced by the proliferation of trust/reputation protocols to support mobile group based applications in recent years. In this paper we address the performance issue of trust management protocol design for MANETs in two important areas: trust bias minimization and application performance maximization. By means of a novel modelbased approach to model the ground truth status of mobile nodes in MANETs as the basis for design validation, we identify and validate the best trust protocol settings under which trust bias is minimized and application performance is maximized. We demonstrate the effectiveness of our approach with an integrated social and quality-of-service (QoS) trust protocol (called SQTrust) with which we identify the best trust aggregation setting under which trust bias is minimized despite the presence of malicious nodes performing slandering attacks. Furthermore, using a mission-oriented mobile group utilizing SQTrust, we identity the best trust formation protocol setting under which the application performance in terms of the system reliability of the mission-oriented mobile group is maximized.

show abstract

Section: Resultsmentioning

confidence: 98%

Trust management in mobile ad hoc networks for bias minimization and application performance maximization

et al. 2014

View full text Add to dashboard Cite

show abstract

“…On the other hand, the pull method [9], [10] enables a node to advertise its service availability only when a peer node (i.e., a SR) shows interest. That is, the push method is proactive and consumes more resources while the pull method reactively serves upon request, trading off delay for resource consumption.…”

Section: Service Advertisementmentioning

confidence: 99%

Trust-Based Service Composition and Binding for Tactical Networks with Multiple Objectives

Wang¹,

Chen²,

Cho

et al. 2013

MILCOM 2013 - 2013 IEEE Military Communications Conference

View full text Add to dashboard Cite

-Tactical networks must select service providers to meet service requirements of an operation while facing resource constraints and high security vulnerability. In such an environment nodes provide services to support various operations and/ may request services to support the operations as well. We formulate the problem of service composition and service binding as a multi-objective optimization (MOO) problem, minimizing the service cost, while maximizing the quality of service (QoS) and quality of information (QoI). The MOO problem is essentially a node-to-service assignment problem such that by dynamically formulating service composition, and selecting the right nodes to provide requested services, the network can support concurrent operations while achieving multiple system objectives. We develop a trust-based service composition and binding protocol. We demonstrate that the trust-based scheme outperforms the counterpart non-trustbased scheme. Furthermore, our trust-based scheme can effectively penalize malicious nodes performing self-promotion attacks, thus filtering out malicious nodes and can ultimately lead to high user satisfaction.

show abstract

“…There are several kinds of formats to simplify a differential equation such as the forward, backward and central difference approximations. For space approximation, this paper applies the seven-point stencil FDM described in Equation (1). For time approximation, the partial differential equation is handled by the backward Euler method which is a fully implicit method described in Equation (2).…”

Section: The Parallel Fdm Overlapping Domain Decompo-mentioning

confidence: 99%

“…In this context, smart things communicate with each other, collect and aggregate data in network for satisfying certain requirements of end-users [1]. In recent years, IoT technologies have been widely used in many applications such as environmental quality and protection, natural resource management, groundwater management, farmland and greenhouse [2,3], etc.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Parallel Computing Method for the Processing of Large Sensed Data

Wang

2013

Automatika

View full text Add to dashboard Cite

Original scientific paperIn recent years we witness the advent of the Internet of Things and the wide deployment of sensors in many applications for collecting and aggregating data. Efficient techniques are required to analyze these massive data for supporting intelligent decisions making. Partial differential problems which involve large data are the most common in the engineering and scientific research. For simulations of large-scale three-dimensional partial differential equations, the intensive computation ability and large amounts of memory requirements for modeling are the main research problems. To address the two challenges, this paper provided an effective parallel method for partial differential equations. The proposed approach combines the overlapping domain decomposition strategy and the multi-core cluster technology to achieve parallel simulations of partial differential equations, uses the finite difference method to discretize equations and adopts the hybrid MPI/OpenMP programming model to exploit two-level parallelism on a multi-core cluster. The three-dimensional groundwater flow model with the parallel finite difference overlapping domain decomposition strategy was successfully set up and carried out by the parallel MPI/OpenMP implementation on a multi-core cluster with two nodes. The experimental results show that the proposed parallel approach can efficiently simulate partial differential problems with large amounts of data.Key words: Data processing, Domain decomposition method, Hybrid programming model, Multi-core clusters, Finite difference method Učinkovita metoda paralelnog računanja za obradu velike količine podataka prikupljanih senzorom. Posljednjih godina svjedočimo dolasku tzv. interneta stvari i širokoj uporabi senzora u raznim primjenama prikupljanja i objedinjavanja podataka. Učinkovite metode su potrebne za analizu velike količine podataka u svrhu podrške inteligentnom odlučivanju. Parcijalno diferencijalni problemi koji uključuju veliku količinu podataka su gotovo uobičajeni u inženjerstvu i znanstvenom istraživanju. Za simulaciju masovnih trodimenzionalnih parcijalnih diferencijalnih jednadžbi potrebne su značajne računalne mogućnosti, a potreba za velikom količinom memorije za modeliranje je glavni istraživački problem. Za rješavanje oba problema ovaj rad pruža efektivnu paralelnu metodu za parcijalne diferencijalne jednadžbe. Predloženi pristup kombinira strategiju dekompozicije preklapajućih domena i tehnologiju višejezgrenih klastera za postizanje paralelnih simulacija parcijalnih diferencijalnih jednadžbi, koristi metodu konačnog diferenciranja za diskretizaciju jednadžbi te model MPI/OpenMP hibridnog programiranja za iskorištavanje dvorazinskog paralelizma na višejezgrenom klasteru. Formiran je trodimenzionalan model toka podzemnih voda sa strategijom dekompozicije preklapajućih domena konačnih diferencija. Za izvoîenje je korištena paralelna MPI/OpenMP implementacija na višejezgrenom klasteru s dvačvora. Eksperimentalni rezultati su pokazali kako predloženi paralelni p...

show abstract

A Distributed Constraint Satisfaction Problem Approach to Virtual Device Composition

Cited by 10 publications

References 26 publications

Trust management in mobile ad hoc networks for bias minimization and application performance maximization

Trust management in mobile ad hoc networks for bias minimization and application performance maximization

Trust-Based Service Composition and Binding for Tactical Networks with Multiple Objectives

An Efficient Parallel Computing Method for the Processing of Large Sensed Data

Contact Info

Product

Resources

About