Randomized permutation routing in multihop ad hoc networks with unknown destinations

A large variety of permutation routing protocols in a single-hop Network are known to day. Since they are single hop, there is always a wireless path connecting two nodes. One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster called clusterhead is responsible for the routing service. In this paper, we propose a clustering mechanism to perform permutation routing in multi-hop ad hoc Networks having p stations and in which n data items are saved. We first develop a clustering algorithm to partition stations into clusters. Secondly, we run a locally permutation routing to broadcast items to their local destinations in each group. Finally we use a multicast procedure to transmit outgoing items to their final cluster destination.1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI

Randomized permutation routing in multihop ad hoc networks with unknown destinations

A large variety of permutation routing protocols in a single-hop Network are known to day. Since they are single hop, there is always a wireless path connecting two nodes. One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster called clusterhead is responsible for the routing service. In this paper, we propose a clustering mechanism to perform permutation routing in multi-hop ad hoc Networks having p stations and in which n data items are saved. We first develop a clustering algorithm to partition stations into clusters. Secondly, we run a locally permutation routing to broadcast items to their local destinations in each group. Finally we use a multicast procedure to transmit outgoing items to their final cluster destination.1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI

An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks

International audienc

A Secured Resource Access Management in Educational Cloud Computing Environment

The paper discusses the problems of data security in the Cloud Computing and proposes an approach based on network technologies and algorithms. The main idea is to establish a criterion of trust between the service provider and the client to control data access and updates which are operated by the owner or a third party. The method allows limiting and filtering the access, to detect corrupted data and proposes corrective action in the case of an illegal access to the cloud computing services. Similarly, this approach examines the strategies to secure the resources through a distributed cloud computing

A Depopulation Embedded System Model in Urban Environments

The threat of terrorism is a constant reminder of the significance of developing effective strategies to safeguard the population. This is particularly important in large, densely populated areas, which can often be the primary targets of a terrorist attack. In such a situation, the implementation of a depopulation plan becomes very challenging to manage. This paper explores one possible method of addressing rapid evacuation of densely populated urban environments in response to a terrorist threat through an in-vehicle embedded system model. The objective of the model is to determine feasible technologies that enable mobile ad-hoc mesh communication to safely depopulate an urban area