When should I use network emulation ?

The design and development of a complex system requires an adequate methodology and efficient instrumental support in order to early detect and correct anomalies in the functional and non-functional properties of the tested protocols. Among the various tools used to provide experimental support for such developments, network emulation relies on real-time production of impairments on real traffic according to a communication model, either realistically or not. This paper aims at simply presenting to newcomers in network emulation (students, engineers, ...) basic principles and practices illustrated with a few commonly used tools. The motivation behind is to fill a gap in terms of introductory and pragmatic papers in this domain. The study particularly considers centralized approaches, allowing cheap and easy implementation in the context of research labs or industrial developments. In addition, an architectural model for emulation systems is proposed, defining three complementary levels, namely hardware, impairment and model levels. With the help of this architectural framework, various existing tools are situated and described. Various approaches for modeling the emulation actions are studied, such as impairment-based scenarios and virtual architectures, real-time discrete simulation and trace-based systems. Those modeling approaches are described and compared in terms of services and we study their ability to respond to various designer needs to assess when emulation is needed

When Should I Use Network Emulation?

The design and development of a complex system requires an adequate methodology and efficient instrumental support in order to early detect and correct anomalies in the functional and non-functional properties of the tested protocols. Among the various tools used to provide experimental support for such developments, network emulation relies on real-time production of impairments on real traffic according to a communication model, either realistically or not. This paper aims at simply presenting to newcomers in network emulation (students, engineers, ...) basic principles and practices illustrated with a few commonly used tools. The motivation behind is to fill a gap in terms of introductory and pragmatic papers in this domain. The study particularly considers centralized approaches, allowing cheap and easy implementation in the context of research labs or industrial developments. In addition, an architectural model for emulation systems is proposed, defining three complementary levels, namely hardware, impairment and model levels. With the help of this architectural framework, various existing tools are situated and described. Various approaches for modeling the emulation actions are studied, such as impairment-based scenarios and virtual architectures, real-time discrete simulation and trace-based systems. Those modeling approaches are described and compared in terms of services and we study their ability to respond to various designer needs to assess when emulation is needed

Data trust framework using blockchain and smart contracts

Lack of trust is the main barrier preventing more widespread data sharing. The lack of transparent and reliable infrastructure for data sharing prevents many data owners from sharing their data. Data trust is a paradigm that facilitates data sharing by forcing data controllers to be transparent about the process of sharing and reusing data. Blockchain technology has the potential to present the essential properties for creating a practical and secure data trust framework by transforming current auditing practices and automatic enforcement of smart contracts logic without relying on intermediaries to establish trust. Blockchain holds an enormous potential to remove the barriers of traditional centralized applications and propose a distributed and transparent administration by employing the involved parties to maintain consensus on the ledger. Furthermore, smart contracts are a programmable component that provides blockchain with more flexible and powerful capabilities. Recent advances in blockchain platforms toward smart contracts' development have revealed the possibility of implementing blockchain-based applications in various domains, such as health care, supply chain and digital identity. This dissertation investigates the blockchain's potential to present a framework for data trust. It starts with a comprehensive study of smart contracts as the main component of blockchain for developing decentralized data trust. Interrelated, three decentralized applications that address data sharing and access control problems in various fields, including healthcare data sharing, business process, and physical access control system, have been developed and examined. In addition, a general-purpose application based on an attribute-based access control model is proposed that can provide trusted auditability required for data sharing and access control systems and, ultimately, a data trust framework. Besides auditing, the system presents a transparency level that both access requesters (data users) and resource owners (data controllers) can benefit from. The proposed solutions have been validated through a use case of independent digital libraries. It also provides a detailed performance analysis of the system implementation. The performance results have been compared based on different consensus mechanisms and databases, indicating the system's high throughput and low latency. Finally, this dissertation presents an end-to-end data trust framework based on blockchain technology. The proposed framework promotes data trustworthiness by assessing input datasets, effectively managing access control, and presenting data provenance and activity monitoring. A trust assessment model that examines the trustworthiness of input data sets and calculates the trust value is presented. The number of transaction validators is defined adaptively with the trust value. This research provides solutions for both data owners and data users’ by ensuring the trustworthiness and quality of the data at origin and transparent and secure usage of the data at the end. A comprehensive experimental study indicates the presented system effectively handles a large number of transactions with low latency

Evolution of Computer Virus Concealment and Anti-Virus Techniques: A Short Survey

This paper presents a general overview on evolution of concealment methods in computer viruses and defensive techniques employed by anti-virus products. In order to stay far from the anti-virus scanners, computer viruses gradually improve their codes to make them invisible. On the other hand, anti-virus technologies continually follow the virus tricks and methodologies to overcome their threats. In this process, anti-virus experts design and develop new methodologies to make them stronger, more and more, every day. The purpose of this paper is to review these methodologies and outline their strengths and weaknesses to encourage those are interested in more investigation on these areas

SECURITY CHALLENGES IN MOBILE AD HOC NETWORKS: A SURVEY

ABSTRACT MANET is a kind of A

Trust Worthy Content Based Routing in Mobile Ad-hoc Networks

This thesis proposes a trust based security model suitable for content-basedrouting in Ad-hoc networks. The trust model is developed by listening to incoming and outgoing messages in passive mode. Knowledge of how these messages are modified is used to update trust tables. This work looks at a number of attacks in such network, for example, predicate modification and proximity modification. For message forwarding these trust tables are used to decide which messages need to be ignored or forwarded depending on threshold trust levels in the tables, thus developing a trust mechanism. The main finding for the research shows that all nodes which are malicious are identified over time; however, there is a high number of false positives for predicate modifications. This is an area for future research.Computer Science Departmen

Game theory based Ad-hoc On Demand Distance Vector Routing Protocol to Extend the Wireless Sensor Networks Life Time

This paper proposes a solution to increase the energy life time of wireless sensor networks (WSNs) via a concept of game theory enabled ad-hoc on demand distance vector (AODV) routing algorithm. Game theory is an optimal promising candidate for decision making in a wireless networking scenario to find the optimal path for data packets transfer between source node and destination node, where combination with the AODV routing algorithm, a procedure of game theory enabled AODV (GTEAODV) is developed and proposed in this research paper. The developed and proposed methodology is validated through simulation in NS2 environment and the results show an improvement in energy life time of the order of 30-35% in comparison to the existing routing methodology which uses co-operative routing techniques among the nodes in WSN. Further, the throughput of game theory enabled adhoc on demand routing is also highly improved in comparison to existing traditional approaches though obtained results. Though, game theory approach is an existing approach concatenation of it with AODV can provide increased network performance which is significant as portrayed in research results shown in the paper. Hence, by virtue of providing enhanced energy life time and data security through the nature of the algorithm, the proposed GTEAODV algorithm can be employed in defence applications for secure data transmission and reception for forthcoming deployment of 5G systems which are blossoming in world wide scenario

Polynomial Based Dynamic Key Management for Secure Cluster Communication in Wireless Mobile Sensor Network

For inter and intra cluster communication, member nodes jointly build a mutual session key called cluster key to allow secure communication. Most existing schemes for cluster key management use messages exchange among the member nodes within a cluster for the new cluster key establishment when a node leaves or joins a cluster. This causes significant communication and computation costs. Furthermore, the secure distribution of cluster keys among member nodes in frequently changing environments is a difficult task without encryption and decryption operations. For secure cluster key management, we utilized polynomial (P) to accomplish effective intra-cluster key management and produced polynomial for making an inter-cluster key distribution. The main contribution is to generate polynomials and broadcast to nodes whenever a change occurs in a network or demanding nodes for secure key management. The presented scheme supports scalability for an increasing number of nodes using polynomials. The proposed scheme increases the lifetime of the network by decreasing the key pool size

Location Detection of Vehicular Accident Using Global Navigation Satellite Systems/Inertial Measurement Units Navigator

Vehicle tracking and accident recognizing are considered by many industries like insurance and vehicle rental companies. The main goal of this paper is to detect the location of a car accident by combining different methods. The methods, which are considered in this paper, are Global Navigation Satellite Systems/Inertial Measurement Units (GNSS/IMU)-based navigation and vehicle accident detection algorithms. They are expressed by a set of raw measurements, which are obtained from a designed integrator black box using GNSS and inertial sensors. Another concern of this paper is the definition of accident detection algorithm based on its jerk to identify the position of that accident. In fact, the results convinced us that, even in GNSS blockage areas, the position of the accident could be detected by GNSS/INS integration with 50% improvement compared to GNSS stand alone