In considering home network environment, there is a possibility which provides limited/specific services by configuring the network in accordance with the particular context when linked to a variety of devices. In thi...
详细信息
ISBN:
(纸本)9781457705137
In considering home network environment, there is a possibility which provides limited/specific services by configuring the network in accordance with the particular context when linked to a variety of devices. In this paper, a distributed TDMA slot scheduling with prioritized control based on Lamport's bakery algorithm is proposed. The scheduling aims at the realization of media access control methods which can constitute a localized network by measuring the distance to respective node. The proposed scheme can be shown as a possible replacement of DRAND algorithm for Z-MAC scheme with a distance-measurement-oriented manner. The scheme can contribute to the efficient TDMA slot allocation.
Executing analytics functionalities over data from highly distributed data sources and data streams is at the very core of the vast majority of Industrial Internet of Things (IIoT) applications. State of the art strea...
详细信息
ISBN:
(纸本)9781728105703
Executing analytics functionalities over data from highly distributed data sources and data streams is at the very core of the vast majority of Industrial Internet of Things (IIoT) applications. State of the art streaming engines provide the means for high performance analytics over high velocity IIoT streams, yet they still need significant programming and customization efforts when deployed in heterogeneous industrial environments. This paper introduces a configurable engine for distributed data analytics for IIoT applications. The engine leverages the performance of state of the art data streaming middleware platforms, which it augments with a set of digital models for configuring DDA operations. As such the introduced engine reduces the effort needed to implement and deploy distributed data analytics in IIoT environments. The engine is available as open source software and has been validated in a various real-life IIoT applications in different environments.
In the current protocol stack for Internet of Things in general and wireless sensor network in particular, many devices rely on the ContikiMAC protocol at their MAC layer. This protocol is widely used and enabled by d...
详细信息
ISBN:
(纸本)9781479946181
In the current protocol stack for Internet of Things in general and wireless sensor network in particular, many devices rely on the ContikiMAC protocol at their MAC layer. This protocol is widely used and enabled by default for several industrial environments and time sensitive monitoring and control applications. However, few work exists regarding the performance of this protocol because it lacks of an underlying theoretical model for analysing its performance. In this paper, we propose a novel approach relying on process mining technique that aims to obtain a Markov chain model for networks running the ContikiMAC protocol. In particular, we present a comprehensive specification of the protocol and a Markov chain model obtained through the analysis and instrumentation of its reference implementation. We used the obtained Markov chain to analyze and estimate the end to end delay distribution for a multi-hops transmission with static routing. The approach can also be extended to a wide range of protocols.
Topology Control Protocols configure transmission power of nodes in order to achieve specific properties to a given topology. These properties include the creation and maintenance of neighborhoods or other topological...
详细信息
ISBN:
(纸本)9781479946181
Topology Control Protocols configure transmission power of nodes in order to achieve specific properties to a given topology. These properties include the creation and maintenance of neighborhoods or other topological entities (like trees or clusters), load balancing in terms of connectivity degrees and provision of link symmetry. We see topology control as a two-fold problem where topological properties can also be affected by local network throughput. We propose SCLD-A2TP, a protocol that operates in a two phase adaptive scheme. First transmission power is adaptively adjusted with low throughput settings and nodes achieve a sufficient degree of symmetric and coherent links. Secondly throughput is maximized insofar as the degree is maintained. We assess various distributed heuristics for SCLD-A2TP via testbed experiments and show that up to an extend, link quality and symmetry as well as degree conformity of links can be regulated successfully by transmission power and adaptive throughput control.
In this paper, we propose a novel approach for efficiently sensing a remote field using wireless sensor networks. Our approach, the infer algorithm, is fully distributed, has low overhead and saves considerable energy...
详细信息
ISBN:
(纸本)0769523315
In this paper, we propose a novel approach for efficiently sensing a remote field using wireless sensor networks. Our approach, the infer algorithm, is fully distributed, has low overhead and saves considerable energy compared to using just the data aggregation communication paradigm. This is accomplished by using a distributed algorithm to put nodes into sleep mode for a given period of time, thereby trading off energy usage for the accuracy of the data received at the sink. Bayesian inference is used to infer the missing data from the nodes that were not active during each sensing epoch. As opposed to other methods that have been considered, such as wavelet compression and distributed source coding, our algorithm has lower overhead in terms of both inter-node communication and computational complexity. Our simulations show that on average our algorithm produces energy savings of 59% while still maintaining data that is accurate to within 7.9%. We also show how the parameters of the algorithm may be tuned to optimize network lifetime for a desired level of data accuracy.
作者:
Ammari, Habib M.Fordham Univ
Grad Sch Arts & Sci Dept Comp & Informat Sci Fordham Wireless Sensor & Mobile Ad Hoc Networks Bronx NY 10458 USA
The coverage problem of a three-dimensional (3D) space has similarity with the 3D tiling problem, which can be stated as follows: How can a 3D space be tiled by replicas of tiles? This is an instance of the second par...
详细信息
ISBN:
(纸本)9781538639917
The coverage problem of a three-dimensional (3D) space has similarity with the 3D tiling problem, which can be stated as follows: How can a 3D space be tiled by replicas of tiles? This is an instance of the second part of Hilbert's 18th problem [14]: "What convex polyhedra exist for which a complete filling of all space is possible by juxtaposition of congruent copies?" In this paper, we propose a polyhedral framework to investigate the connected coverage problem in 3D wireless sensor networks. First, we restrict the sensors' sensing sphere to a variety of convex polyhedral space-fillers. Our study aims to find the largest enclosed convex polyhedral space-filler in the sensors' sensing sphere, with a goal to maximize their utilized sensing volume. Second, based on this analysis, we select a minimum number of sensors to cover a 3D space for deterministic and random sensor deployment. Third, we compute the ratio of the communication range to the sensing range of the sensors to ensure network connectivity. Fourth, we corroborate our analysis with various simulation results.
This paper presents an efficient sensing approach for activity recognition using multi-sensor fusion. The main achievement of the approach is to accurately recognize the human activity with the minimum body sensor usa...
详细信息
ISBN:
(纸本)9781457705137
This paper presents an efficient sensing approach for activity recognition using multi-sensor fusion. The main achievement of the approach is to accurately recognize the human activity with the minimum body sensor usage through the use of dynamic sensor collaboration. The Naive Bayes Classifier is adopted as the classification engine due to not only its easy implementation but also the advantages for multi-sensor fusion. The sensor selection is based on the real-time assignment information value of each sensor node. The platform is composed of a base station and a number of sensor nodes. The base station is used to assign the real-time information value for each sensor node, and fuse the chosen sensor data.
Wireless sensor Networks (WSNs) are becoming a key enabling technology for Internet of Things (IoT) by virtue of providing a highly unstructured cloud of wireless devices. Despite these advances, the current Internet ...
详细信息
ISBN:
(纸本)9781509014590
Wireless sensor Networks (WSNs) are becoming a key enabling technology for Internet of Things (IoT) by virtue of providing a highly unstructured cloud of wireless devices. Despite these advances, the current Internet architecture is not able to cater to the high volume of new traffic patterns delivered by these smart sensing devices. In this context, Software Defined Networking (SDN) has emerged as an intelligent solution to deliver dramatic improvements in network programmability, agility and flexibility. However, SDN was originally targeted to wired networks deployed in cloud data centers, and does not lend itself well to WSNs due primarily to its higher footprint and lack of WSN programmable interfaces. To address these challenges, this paper describes an approach to realize software-defined wireless sensor networks by introducing a novel SDN-enabled architecture for WSNs that can be used for diverse IoT systems. Specifically, we propose new control plane services for supporting automatic topology discovery, sensor virtualization as well as managing network policies. Additionally, we introduce new customized SDN-enabled flow tables to meet the requirements of sensor network packets. Finally, we introduce a programmable MAC layer to support fine-grained flow processing.
Code dissemination in wireless sensor networks refers to the process of disseminating a new code image via wireless links to all sensor nodes after they are deployed. It is desirable and often necessary due to the nee...
详细信息
ISBN:
(纸本)9780769543642
Code dissemination in wireless sensor networks refers to the process of disseminating a new code image via wireless links to all sensor nodes after they are deployed. It is desirable and often necessary due to the need for, e. g., removing program bugs and adding new functionalities in a multi-task sensor network. A sound code dissemination scheme need be both loss-resilient and attack-resilient, which are crucial for sensor networks deployed in lossy and hostile environments. To the best of our knowledge, no existing scheme simultaneously satisfies both requirements. This paper fills this gap with the design and evaluation of LR-Seluge, a novel loss-resilient and secure code dissemination scheme. The efficacy and efficiency of LR-Seluge are confirmed by both theoretical analysis and extensive simulation results. In particular, LR-Seluge can reduce up to 40% communication overhead in lossy environments with the same level of attack resilience in contrast to existing schemes.
The routing stretch in a sensor network with a large hole can be controlled if the network nodes have certain information about the hole location and shape, possibly by using some mechanism for hole boundary approxima...
详细信息
ISBN:
(纸本)9781479946181
The routing stretch in a sensor network with a large hole can be controlled if the network nodes have certain information about the hole location and shape, possibly by using some mechanism for hole boundary approximation and information dissemination. Here, the nodes on the hole boundary cooperate to approximately compute the hole shape, and then a compact description info can be created and disseminated to the surrounding area. However, a finer approximation (for smaller stretch) leads to a higher cost of dissemination, which could unlikely be affordable for the sensors. We provide an insightful analysis to this fundamental trade-off of the hole approximation problem, using a geometric model. Based on this we discuss an efficient approximation-dissemination scheme using a natural, heuristic approximation technique. For reasonable conditions (network is dense enough apart from the hole), we assure that the routing stretch is under a predefined threshold. alpha > 1 while the dissemination cost is also under tight control. Our initial experiment results also confirm that our approach is significantly more efficient and economical, compared to existing proposals.
暂无评论