Trust Models for Ubiquitous Mobile Systems

Author(s):  
Mike Burmester

This chapter introduces the notion of trust as a means to establish security in ubiquitous mobile network systems. It argues that trust is an essential requirement to enable security in any open network environments, and in particular, in wireless ad hoc environments where there is no network topology. In such environments, communication can only be achieved via routes that have to be trusted. In general it may be hard, or even impossible, to establish, recall, and maintain trust relationships. It is therefore important to understand the limitations of such environments and to find mechanisms that may support trust either explicitly or implicitly. We consider several models that can be used to enable trust in such environments, based on economic, insurance, information flow, and evolutionary paradigms.

2009 ◽  
pp. 2827-2832
Author(s):  
Mike Burmester

This chapter introduces the notion of trust as a means to establish security in ubiquitous mobile network systems. It argues that trust is an essential requirement to enable security in any open network environments, and in particular, in wireless ad hoc environments where there is no network topology. In such environments, communication can only be achieved via routes that have to be trusted. In general it may be hard, or even impossible, to establish, recall, and maintain trust relationships. It is therefore important to understand the limitations of such environments and to find mechanisms that may support trust either explicitly or implicitly. We consider several models that can be used to enable trust in such environments, based on economic, insurance, information flow, and evolutionary paradigms.


Author(s):  
Mike Burmester

This chapter introduces the notion of trust as a means to establish security in ubiquitous mobile network systems. It argues that trust is an essential requirement to enable security in any open network environments, and in particular, in wireless ad hoc environments where there is no network topology. In such environments, communication can only be achieved via routes that have to be trusted. In general it may be hard, or even impossible, to establish, recall, and maintain trust relationships. It is therefore important to understand the limitations of such environments and to find mechanisms that may support trust either explicitly or implicitly. We consider several models that can be used to enable trust in such environments, based on economic, insurance, information flow, and evolutionary paradigms.


2008 ◽  
pp. 1450-1455
Author(s):  
Mike Burmester

This chapter introduces the notion of trust as a means to establish security in mobile ubiquitous applications. It argues that trust is an essential requirement to enable security in open network environments. In particular in wireless ad hoc environments where there is no network topology. In such environments communication can only be achieved via routes that have to be trusted. In general it may be hard, or even impossible, to establish, recall and maintain trust relationships. It is therefore important to understand the limitations of such environments and to find mechanisms that may support trust either explicitly or implicitly. We consider several models that can be used to enable trust in such environments, based on economic, insurance, information flow and evolutionary paradigms.


Author(s):  
Mike Burmester

This chapter introduces the notion of trust as a means to establish security in mobile ubiquitous applications. It argues that trust is an essential requirement to enable security in open network environments. In particular in wireless ad hoc environments where there is no network topology. In such environments communication can only be achieved via routes that have to be trusted. In general it may be hard, or even impossible, to establish, recall and maintain trust relationships. It is therefore important to understand the limitations of such environments and to find mechanisms that may support trust either explicitly or implicitly. We consider several models that can be used to enable trust in such environments, based on economic, insurance, information flow and evolutionary paradigms.


Author(s):  
Mike Burmester

This chapter introduces the notion of trust as a means to establish security in mobile ubiquitous applications. It argues that trust is an essential requirement to enable security in open network environments. In particular in wireless ad hoc environments where there is no network topology. In such environments communication can only be achieved via routes that have to be trusted. In general it may be hard, or even impossible, to establish, recall and maintain trust relationships. It is therefore important to understand the limitations of such environments and to find mechanisms that may support trust either explicitly or implicitly. We consider several models that can be used to enable trust in such environments, based on economic, insurance, information flow and evolutionary paradigms.


Author(s):  
Indrajit Ray ◽  
Indrakshi Ray ◽  
Sudip Chakraborty

Ad hoc collaborations often necessitate impromptu sharing of sensitive information or resources between member organizations. Each member of resulting collaboration needs to carefully assess and tradeoff the requirements of protecting its own sensitive information against the requirements of sharing some or all of them. The challenge is that no policies have been previously arrived at for such secure sharing (since the collaboration has been formed in an ad hoc manner). Thus, it needs to be done based on an evaluation of the trustworthiness of the recipient of the information or resources. In this chapter, the authors discuss some previously proposed trust models to determine if they can be effectively used to compute trustworthiness for such sharing purposes in ad hoc collaborations. Unfortunately, none of these models appear to be completely satisfactory. Almost all of them fail to satisfy one or more of the following requirements: (i) well defined techniques and procedures to evaluate and/or measure trust relationships, (ii) techniques to compare and compose trust values which are needed in the formation of collaborations, and (iii) techniques to evaluate trust in the face of incomplete information. This prompts the authors to propose a new vector (we use the term “vector” loosely; vector in this work means a tuple) model of trust that is suitable for reasoning about the trustworthiness of systems built from the integration of multiple subsystems, such as ad hoc collaborations. They identify three parameters on which trust depends and formulate how to evaluate trust relationships. The trust relationship between a truster and a trustee is associated with a context and depends on the experience, knowledge, and recommendation that the truster has with respect to the trustee in the given context. The authors show how their model can measure trust in a given context. Sometimes enough information is not available about a given context to calculate the trust value. Towards this end the authors show how the relationships between different contexts can be captured using a context graph. Formalizing the relationships between contexts allows us to extrapolate values from related contexts to approximate a trust value of an entity even when all the information needed to calculate the trust value is not available. Finally, the authors develop formalisms to compare two trust relationships and to compose two or more of the same – features that are invaluable in ad hoc collaborations.


Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3788 ◽  
Author(s):  
Lionel Nkenyereye ◽  
Lewis Nkenyereye ◽  
S. M. Riazul Islam ◽  
Yoon-Ho Choi ◽  
Muhammad Bilal ◽  
...  

There is a strong devotion in the automotive industry to be part of a wider progression towards the Fifth Generation (5G) era. In-vehicle integration costs between cellular and vehicle-to-vehicle networks using Dedicated Short Range Communication could be avoided by adopting Cellular Vehicle-to-Everything (C-V2X) technology with the possibility to re-use the existing mobile network infrastructure. More and more, with the emergence of Software Defined Networks, the flexibility and the programmability of the network have not only impacted the design of new vehicular network architectures but also the implementation of V2X services in future intelligent transportation systems. In this paper, we define the concepts that help evaluate software-defined-based vehicular network systems in the literature based on their modeling and implementation schemes. We first overview the current studies available in the literature on C-V2X technology in support of V2X applications. We then present the different architectures and their underlying system models for LTE-V2X communications. We later describe the key ideas of software-defined networks and their concepts for V2X services. Lastly, we provide a comparative analysis of existing SDN-based vehicular network system grouped according to their modeling and simulation concepts. We provide a discussion and highlight vehicular ad-hoc networks’ challenges handled by SDN-based vehicular networks.


2019 ◽  
Vol 8 (4) ◽  
pp. 53
Author(s):  
Mohammed Souidi ◽  
Ahmed Habbani ◽  
Halim Berradi

With the increase of mobile terminals, routing protocols in wireless communications must provide better quality of service to meet bandwidth and reliability requirements. In networks without infrastructure, such as ad hoc and sensor networks, where a device performs as both a terminal and a router to forward data of other nodes, maintaining the network topology consumes considerable resources in terms of energy and bandwidth. These parameters need to be considered when designing routing protocols for wireless networks. To reduce the cost of the protocol overhead, some algorithms act on the forwarders, while others act on the transmission of messages. Finally, the hybrid ones are a combination of both. In this paper, we propose a new algorithm with two zoning strategies to enhance the performance of mobile network. The first strategy helps to select dispersive forwarders in order to reduce the collision in radio channel. The second strategy aims to reduce the transmission of redundant messages. Both strategies are based on the location information of nodes. We implemented our algorithm in the optimized link state routing protocol, the most used protocol in mobile ad hoc networks. We showed by simulations that our solution reduces drastically the cost of the overhead with no hindrance to the network topology.


Author(s):  
G. Manohar ◽  
D. Kavitha ◽  
S. Sreedhar

Intermittently connected mobile Network systems represent a challenging environment for networking research, due to the problems of ensuring messages delivery in spite of frequent disconnections and random meeting patterns. These networks fall into general category of Delay Tolerant Networks. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, traditional routing schemes fail, because they try to establish complete end-to-end paths, before any packet is sent. To deal with such networks, researches introduced flooding based routing schemes which leads to high probability of delivery. But the flooding based routing schemes suffered with contention and large delays. Here the proposed protocol “Spraying with performed by a node upon reception of an Acknowledgment message”, sprays a few message copies into the network, neighbors receives a copy and by that relay nodes we are choosing the shortest route and then route that copy towards the destination, if packets reach its destination which that node diffuse Acknowledment with Autonomic behaviour and discard messages. Previous works assumption is that there is no contention and unreachable nodes. But we argue that contention and unreachable nodes must be considered for finding efficiency in routing. So we are including a network which has contention and unreachable nodes and we applied the proposed protocol. So, we introduce new routing mechanism for Diffusion Based Efficient Spray Routing in Intemittently Connected Mobile Networks with Multiple Copies.


Author(s):  
Bodhy Krishna .S

A wireless ad hoc network is a decentralized type of wireless network. It is a type of temporary computer-to-computer connection. It is a spontaneous network which includes mobile ad-hoc networks (MANET), vehicular ad-hoc networks (VANET) and Flying ad-hoc networks (FANET). A MANET is a network that has many free or autonomous nodes often composed of mobile devices that can operate without strict top-down network administration [1]. A VANET is a sub form of MANET. It is a technology that uses vehicles as nodes in a network to create a mobile network. FANET is an ad-hoc network of flying nodes. They can fly independently or can be operated distantly. This paper discusses the characteristics of these three ad-hoc networks.


Sign in / Sign up

Export Citation Format

Share Document