Context-Aware P2P Over Opportunistic Networks

Author(s):  
Marco Conti ◽  
Franca Delmastro ◽  
Andrea Passarella

Recently, the popularity of p2p computing paradigm has been increasing, especially in the mobile environments, due to the large use of mobile devices as tools to generate and share content among users. Several works have been proposed in ad hoc networks literature to optimize legacy p2p systems over a mobile environment, mainly relying on the necessity of a stable path between pairs of nodes wishing to communicate. However, in the last few years, resources limitations and high mobility of users have introduced a new networking paradigm characterized by intermittent connectivity and frequent partitioning: the opportunistic networks. In such a dynamic environment, where systems must exploit all communication opportunities to enable the users to get in touch and exchange data, the authors propose a novel definition of mobile p2p, which exploits context information to enhance distributed services. In addition, they present a Context-aware opportunistic File Sharing application as a practical example of an optimized p2p service over opportunistic networks.

2018 ◽  
Vol 15 (2) ◽  
pp. 47-66
Author(s):  
Prashant Kumar ◽  
Naveen Chauhan ◽  
Narottam Chand ◽  
Lalit K. Awasthi

Opportunistic networks are the special class of ad hoc networks where permanent link among the nodes are almost absent and communication occurs when an “opportunity” is found. The opportunistic networks have more diverse features than traditional ad hoc networks, like self-organized nature, intermittent connectivity, store-carry-forward routing mechanism, etc. All these features make opportunistic networks more prone to security threats. This article discusses security challenges and threats to opportunistic networks. Focusing on the specific security requirements of opportunistic networks, proposed is a secure framework for authentication and privacy preservation (SF-APP) for opportunistic networks. The proposed algorithm takes care of authentication, privacy preservation, and trust management. Within this article is a performed security analysis of SF-APP and simulation results show that the proposed framework is capable of fulfilling the security requirements of opportunistic networks.


2010 ◽  
Vol 143-144 ◽  
pp. 201-206
Author(s):  
Liang Xiao ◽  
Fan Wang

Distribution tasks have typical feature of context dependence. Attaining the mission-related dynamic context information service timely and accurately has a significant effect to the execution efficiency of the distribution task. On the basis of the definition of four distribution contexts systematically: network context , product context, customer context, resource context, this paper proposes the model of context management of distribution task, and the collaborative service and process mechanism of distribution tasks base on task context, it is of great value and significance to support the effective implementation of collaborative management of the distribution task in dynamic environment.


2017 ◽  
Vol 14 (4) ◽  
pp. 33-49 ◽  
Author(s):  
Jun Zeng ◽  
Feng Li ◽  
Yinghua Li ◽  
Junhao Wen ◽  
Yingbo Wu

With the rapid development of mobile internet, it is difficult to obtain high-quality recommendation in such a complicated mobile environment, just depending on traditional user-item binary information. How to use multiple contexts to generate satisfying recommendation has been a hot topic in some fields like e-commerce, tourism and news. Context aware recommender system (CARS) imports contexts into recommender to generate ubiquitous and personalized recommendation. In this paper, the basic information of CARS, such as the definition of context, the process of CARS and evaluation are introduced carefully. In order to explore whether contexts have a great influence on recommendation or not, the authors conduct experiments on real datasets. Experimental results show recommender that incorporates contexts significantly improves performance over the traditional recommender. Finally, State of the art about CARS is detailed.


2021 ◽  
Author(s):  
Hoda R.K. Nejad

With the emergence of wireless devices, service delivery for ad-hoc networks has started to attract a lot of attention recently. Ad-hoc networks provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad-hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. On the other hand, data access applications in Ad-hoc networks suffer from restricted resources. In this thesis, we explore how to use Cooperative Caching to improve data access efficiency in Ad-hoc network. We propose a Resource-Aware Cooperative Caching P2P system (RACC) for data access applications in Ad-hoc networks. The objective is to improve data availability by considering energy of each node, demand and supply of network. We evaluated and compared the performance of RACC with Simple Cache, CachePath and CacheData schemes. Our simulation results show that RACC improves the lay of query as well as energy usage of the network as compared to Simple Cache, CachePath and CacheData.


Author(s):  
Ashish Agarwal ◽  
Thomas D.C. Little

Vehicular Area Networking (VANET) is an emerging technology to support a class of applications involving communications between vehicles, and vehicles and the environment. Activity in this area includes development of the Dedicated Short Range Communication (DSRC) protocol aimed at enabling vehicles to exchange safety information to enhance awareness of the vehicle beyond the line of sight, and to enhance safety features such as active braking and collision warning. While safety is the primary driver for development, additional applications emerge as potential users of this technology that are more general in nature. Real-time traffic and route updates, traffic monitoring, remote diagnostics, general purpose Internet access and in-car entertainment are examples that require data collection and dissemination analogous to the wired Internet. However, DSRC and related short-range communications technology would appear to be insufficient for these scenarios. In this chapter, we describe, how and under what conditions it is feasible, and in fact desirable, to use short range communications. We describe a network formed over moving vehicles implemented by short-range communication and thereby analyze factors that affect the design and performance. Observations reveal intermittent connectivity between vehicles traveling on the roadway in opposite directions that hinders applications. Techniques adapted from related research in computer networks provide solutions for enabling networking in a fragmented network of moving vehicles. We elaborate and demonstrate analytically the application of techniques that enable networking through short-range communication.


Author(s):  
Anind K. Dey ◽  
Jonna Häkkilä

Context-awareness is a maturing area within the field of ubiquitous computing. It is particularly relevant to the growing sub-field of mobile computing as a user’s context changes more rapidly when a user is mobile, and interacts with more devices and people in a greater number of locations. In this chapter, we present a definition of context and context-awareness and describe its importance to human-computer interaction and mobile computing. We describe some of the difficulties in building context-aware applications and the solutions that have arisen to address these. Despite these solutions, users have difficulties in using and adopting mobile context-aware applications. We discuss these difficulties and present a set of eight design guidelines that can aid application designers in producing more usable and useful mobile context-aware applications.


Author(s):  
Ryma Abassi

In a collaborative environment such as MANET, nodes reliability evaluation is vital. Trust Management can be used to ensure such healthy collaboration it offers a formal and unified framework for trust specification and interpretation. Establishing trustworthy relationships is generally done by maintaining a reputation for each node computed based on direct observations or neighbors' observations exchanged using recommendations. Unfortunately, for malicious reason, such method may be faked by cheaters: several nodes collude in order to rate each other with the maximum value and decrease other nodes' reputations by giving negative recommendations. The main contribution of this chapter is then, the proposition of a trust based environment for MANET and securing it against collusion attack in order to enhance the network QoS. This is achieved using three steps: (1) the definition of a formal trust based environment (2) the addition of a process handling collusion attack and (3) the extension of the whole proposition by a delegation process allowing nodes functionalities sharing.


2017 ◽  
Vol 8 (1) ◽  
pp. 70-97 ◽  
Author(s):  
Shobha Tyagi ◽  
Subhranil Som ◽  
Qamar Parvez Rana

The mobile environment in MANETs (Mobile Ad hoc Networks) itself is a major constraint to deal with, and assuring reliability on the top of that strengthens the problem more. This paper which is entirely an extension of the authors' previous work based on trust based group formation using Fuzzy Logic. They herein propose a model which is highly inspired by natural and social behavior of human beings that man is a social animal and is always associated with different types of dynamic groups. Before ensuring the reliable route take into account the trust (T) and the speed (S) of the intermediate nodes which may take part in routing. Trust is actually a matter of feeling with which one feels connected with some person/s in the form of multicast groups. Thus, the proposed Multicast Route Reliability (MRR) is a purely a probabilistic function of Cartesian product of past relationships and present moving patterns.


Sign in / Sign up

Export Citation Format

Share Document