Mobility management is a crucial problem for wireless mobile communication, especially in industrial wireless sensor networks. Our mobility approach resides on the fact we need to adaptively combine globally available...
详细信息
ISBN:
(纸本)9781479946181
Mobility management is a crucial problem for wireless mobile communication, especially in industrial wireless sensor networks. Our mobility approach resides on the fact we need to adaptively combine globally available information in order to produce a successful handoff. In this paper, we propose an adaptive fuzzy logic mobility system to support the handoff procedure in industrial wireless sensors. The results clearly show that the proposed adaptive fuzzy logic mobility controller performs better compared to the non-adaptive fuzzy logic controller, in terms of packet loss, power consumption, and on-time triggering.
The Deterministic and Synchronous Multi-Channel Extension (DSME) protocol is a recent amendment to the ieee 802.15.4 standard. It combines contention-based and time-division medium access, offers channel diversity, an...
详细信息
ISBN:
(纸本)9781728105703
The Deterministic and Synchronous Multi-Channel Extension (DSME) protocol is a recent amendment to the ieee 802.15.4 standard. It combines contention-based and time-division medium access, offers channel diversity, and is aimed to support IIoT applications with stringent requirements in terms of timeliness and reliability. In this paper, we show how to configure DSME for a given data collection task. This includes the definition of the slot and frame length and the slot and channel schedule. We formulate different scheduling strategies as linear programs minimizing latency and energy. We verify our results through theoretical analysis and simulations and compare them with state-of-the-art scheduling algorithms. The results indicate a reduced delay of up to 80% for deep networks while also increasing reliability. Additionally, the proposed scheduling strategies significantly reduce the required buffer size.
Self-stabilizing systems have in theory the unique and provable ability, to always return to a valid system state even in the face of failures. These properties are certainly desirable for domains like wireless ad-hoc...
详细信息
ISBN:
(纸本)9781509014590
Self-stabilizing systems have in theory the unique and provable ability, to always return to a valid system state even in the face of failures. These properties are certainly desirable for domains like wireless ad-hoc networks with numerous unpredictable faults. Unfortunately, the time in which the system returns to a valid state is not predictable and potentially unbound. The failure rate typically depends on physical phenomena and in self-stabilizing systems each node tries to react to failures in an inherently adaptive fashion by the cyclic observation of the states of its neighbors. When state changes are either too quick or too slow the system might never reach a state that is sufficiently stable for a specific task. In this paper, we investigate the influences of the error rate on the (stability) convergence time on the basis of topology information acquired in real network experiments. This allows us to asses the asymptotic behavior of relevant self-stabilizing algorithms in typical wireless networks.
In this paper, we study the integration between Compressed Sensing (CS) and clustering methods in Wireless sensor Networks (WSNs) that significantly reduce power consumption for the networks. In theory, a base station...
详细信息
ISBN:
(纸本)9781479946181
In this paper, we study the integration between Compressed Sensing (CS) and clustering methods in Wireless sensor Networks (WSNs) that significantly reduce power consumption for the networks. In theory, a base station (BS) needs to collect M measurements from the network with N sensors, then applies CS to obtain precisely all N sensor readings. In clustered networks, a cluster-head (CH) collects data from non-CH sensors in its cluster, adds all received and its own data and then sends the combined measurement to the BS. We further analyze the clustered network with the measurement matrix created by clustering methods, and formulate the total power consumption. Finally, we suggest the optimal number of clusters for the networks to consume the least power in practice.
Wireless sensor networks (WSNs) are being widely used in sensing, collecting, and disseminating data for various applications in environmental, industrial, and military applications. In this paper we present MAConf, a...
详细信息
ISBN:
(纸本)9781457705137
Wireless sensor networks (WSNs) are being widely used in sensing, collecting, and disseminating data for various applications in environmental, industrial, and military applications. In this paper we present MAConf, a layer-2 detection mechanism for mobile WSNs. We propose the use of radio channel analysis to predict the underlying MAC protocol and addressing scheme, facilitating interconnections among WSN while ensuring an energy-efficient detection strategy. By implementing the intelligence using a neural network, we show that a 99% hit rate can be achieved in a variety of scenarios.
This paper presents a distributed serial data aggregation approach, called Spreading Aggregation (SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet...
详细信息
ISBN:
(纸本)9781538639917
This paper presents a distributed serial data aggregation approach, called Spreading Aggregation (SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-ofthe-art serial approaches, particularly in very large scale network deployments.
We study the Traveling Salesman Problem (TSP) in the Congested Clique Model (CCM) of distributedcomputing. We present a deterministic distributed algorithm that computes a tour for the TSP using O(1) rounds and O(m) ...
详细信息
ISBN:
(纸本)9798350369458;9798350369441
We study the Traveling Salesman Problem (TSP) in the Congested Clique Model (CCM) of distributedcomputing. We present a deterministic distributed algorithm that computes a tour for the TSP using O(1) rounds and O(m) messages for a given undirected weighted complete graph of n nodes and m edges with an approximation factor 2 of the optimal. The TSP has wide applications in logistics, planning, manufacturing and testing microchips, DNA sequencing etc., and we claim that our proposed O(1)-rounds approximation algorithm to the TSP, which is fast and efficient, can also be used to minimize the energy consumption in Wireless sensor Networks.
distributed and collaborative computation has never been considered before in networks of batteryless sensors. This can bring many advantages for applications (e.g. longer transmission ranges, lower network costs), ho...
详细信息
ISBN:
(纸本)9781728105703
distributed and collaborative computation has never been considered before in networks of batteryless sensors. This can bring many advantages for applications (e.g. longer transmission ranges, lower network costs), however introducing new research challenges. In this paper, we focus on the well-known distributedsensor fusion but in an intermittently-powered batteryless sensor network. The goal is to estimate a parameter collaboratively by considering individual sensor measurements. We show that, even though the nodes stop operation with high probability due to random power failures and they neither communicate with their neighbors nor perform computation most of the time, the simplest implementation of the fully-distributedsensor fusion based on average consensus improves the overall estimation quality of the network considerably. In the light of this, we anticipate that if harvested energy is used efficiently so that nodes have more opportunity to receive and send packets, existing fully-distributed protocols can be implemented with tiny modifications in networks of batteryless sensors.
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 (WSN) are self-organizing and resource-constrained networks composed of battery-powered small devices called sensor nodes. WSNs are typically deployed in unattended areas. In order to secure W...
详细信息
ISBN:
(纸本)9781457705137
Wireless sensor Networks (WSN) are self-organizing and resource-constrained networks composed of battery-powered small devices called sensor nodes. WSNs are typically deployed in unattended areas. In order to secure WSNs, firstly cryptographic keys must be distributed in a secure and robust way. Key distribution problem is extensively studied for static WSNs, but has not been studied widely for mobile WSNs (MWSN) in the literature. In this paper we propose a key distribution mechanism for MWSNs in which both sensor nodes and the BS are mobile. In our scheme BS acts as a mobile key distribution center which distributes pairwise keys to sensor nodes in a single hop. Our performance evaluations show that the proposed scheme outperforms mobile versions of two existing schemes in the literature. Moreover, our scheme has perfect resilience against node capture attacks.
暂无评论