This article presents a way of organizing a stable coalition that consists of the Internet of things interacting objects, taking into account their trust and reputation. The concept of convergence and interpenetrating...
详细信息
ISBN:
(纸本)9781728199573
This article presents a way of organizing a stable coalition that consists of the Internet of things interacting objects, taking into account their trust and reputation. The concept of convergence and interpenetrating services, networks, computing, and communications, which forming the Internet of things environment, requires solving a whole range of problems. One of the main issues is increasing the efficiency of use-limited resources (time, energy, radio frequency spectrum) by the Internet of things devices. Besides, there is a lack of guaranteeing trustworthy, user/data security and resistance against adversaries there. In this regard, trustworthiness evaluation and a coherent recommendation of estimating friend nodes' reliability will allow achieving network security and isolating malicious nodes' environment. A proposed method for measuring trust and reputation in the Internet of things defines the rules for transforming subjective trust assessments into the overall evaluation of the object interaction reputation. Simulation modeling with a real dataset confirms the effectiveness of the developed method and the possibility of reducing trust estimation uncertainty.
In this article, we develop a comprehensive framework to characterize the performance of a drone assisted backscatter communication-based Internet of Things (IoT) sensor network. We consider a scenario where the drone...
详细信息
ISBN:
(纸本)9781728105703
In this article, we develop a comprehensive framework to characterize the performance of a drone assisted backscatter communication-based Internet of Things (IoT) sensor network. We consider a scenario where the drone transmits an RF carrier that is modulated by IoT sensor node (SN) to transmit its data. The SN implements load modulation which results in amplitude shift keying (ASK) type modulation for the impinging R F carrier. In order to quantify the performance of the considered network, we characterize the coverage probability for the ground based SN node. The statistical framework developed to quantify the coverage probability explicitly accommodates a dyadic backscatter channel which experiences deeper fades than that of the one-way Rayleigh channel. Our model also incorporates Line of Sight (LoS) and Non-LoS (NLoS) propagation states for accurately modelling large-scale path- loss between drone and SN. We consider spatially distributed SNs which can be modelled using a spatial Binomial Point Process (BPP). We practically implement the proposed system using Software Defined Radio (SDR) and a custom designed SN tag. The measurements of parameters such as noise figure, tag reflection coefficient etc., are used to parametrize the developed framework. Lastly, we demonstrate that there exists an optimal set of parameters which maximizes the coverage probability for the SN.
The article analyses efficient information detection by a network of sensors. It is assumed that every sensor collects local information, however, with the application of clustering in the network, it is possible to e...
详细信息
ISBN:
(纸本)9789532900996
The article analyses efficient information detection by a network of sensors. It is assumed that every sensor collects local information, however, with the application of clustering in the network, it is possible to efficiently exchange knowledge within the network. In particular, the local knowledge about a licensed signal is acquired by sensors, and it is then exchanged and transferred to global knowledge. To this end, two types of clustering are analysed: hard K-means clustering and soft K-means. In the latter case, the crucial knowledge about stiffness is important to perform an efficient exchange of information. The analysis of desired stiffness values has been carried out with simulation experiments where the energy usage and reporting efficiency were compared for various sizes and types of clusters. Moreover, the quality of global knowledge is also shown in the simulation results.
SQL Join is one of the most commonly used operators for workloads running upon SQL Engines built for Big Data like Apache Spark SQL, Apache Hive and Presto. As Joins on Big Data can be expensive, Join optimizations ca...
详细信息
ISBN:
(纸本)9781728162515
SQL Join is one of the most commonly used operators for workloads running upon SQL Engines built for Big Data like Apache Spark SQL, Apache Hive and Presto. As Joins on Big Data can be expensive, Join optimizations can significantly improve the efficiency and performance of it's workloads. In this work, we would address the problem of finding optimal order for SQL Joins, which is a well researched NP-Hard problem for traditional workloads. Traditional Cost Based Optimization in Query processing, including Join Reordering algorithms are not effective on Big Data due to lack of statistics. Statistics are mostly absent in Big Data as they are expensive to compute and needs frequent recompute due to velocity of data change. Hence, ensuring optimal order of Joins for Big Data is still largely a manual process done via trial and error. We are proposing a novel greedy algorithm for Join Reordering which can work in the absence of statistics. Proposed technique is of linear complexity in terms of number of joins. We have observed that on TPC-DS benchmarks it can reorder 39 queries and improve query performance upto 51%.
Large number of physical systems such as electric vehicles and energy storage elements are connected to the main grid. Monitoring and regulating of this interconnected cyberphysical power system state within a short p...
详细信息
Large number of physical systems such as electric vehicles and energy storage elements are connected to the main grid. Monitoring and regulating of this interconnected cyberphysical power system state within a short period of time is a challenging task, and it can perform by the process of grid state estimation. This paper proposes a multi-agent based optimal distributed dynamic state estimation algorithm for smart grid incorporating intermittent electric vehicles and turbines. After mathematically representation of large-scale grid systems into a compact state-space framework, the smart sensors are installed to get real-time measurements which are manipulated by environmental noise. A distributed smart grid state estimation process is developed and verified. Each agent learns and runs an innovation and consensus type distributed scheme based on local measurements, previous and neighbouring estimated grid states. In this way, each local agent estimated grid state converges to the global consensus estimation over time. The proposed algorithm can effectively reconstruct the original grid states.
Smart Cyber-Physical systems (SCPS) has enhanced use of smart devices with numerous applications including smart cities, smart traffic management, smart cars, smart health care and smart grids. Core logic behind these...
详细信息
ISBN:
(纸本)9781728146768
Smart Cyber-Physical systems (SCPS) has enhanced use of smart devices with numerous applications including smart cities, smart traffic management, smart cars, smart health care and smart grids. Core logic behind these applications usually require huge processing or massive data handling which are normally performed at cloud but the application will suffer from latency. Edge computing offers solution for latency aware computations at edge of the network but with limited resources available at edge nodes. This problem can be resolved by leveraging edge resources in a group and executing resource intensive task. Most previous studies deploy centralized methods for clustering but comes with overhead of cluster formation and management. In this article, key idea is to group heterogeneous edge nodes on task arrival in a decentralize way, and handle task allocation and execution in parallel on group devices to achieve its deadline. Our methodology will help to reduce traffic amount travelling towards cloud in case of resource intensive big tasks of SCPS applications. We have proposed an algorithm for decentralized group formation and presented task division and allocation methodology for parallel execution. Our results show that our technique is working while providing desired goals of reducing overall latency, and limiting network traffic as well as achieving higher ratio for number of tasks meeting their deadline.
This paper presents an evaluation of a process migration checkpoint issues, especially the potential collision of resources usage at user level (space) over a distributed computation infrastructure. In particular, wit...
详细信息
Battery lifetime in the order of several years and millimeter size devices are a target for future sensor nodes while ensuring autonomous energy operation. Increasing battery life is essential when batteries are expen...
详细信息
The applications of Wireless sensor Networks have been envisioned in numerous spheres of life in modern time. Wireless sensors enabled IoT based applications are changing the way modern life is being lived with applic...
详细信息
暂无评论