Although wireless sensor networks (WSNs) are becoming ubiquitous, the large amount of power consumed by wireless communications in transmitting sensing data from sensors to base stations or between sensor nodes themse...
详细信息
ISBN:
(纸本)9781479932474;9780769550237
Although wireless sensor networks (WSNs) are becoming ubiquitous, the large amount of power consumed by wireless communications in transmitting sensing data from sensors to base stations or between sensor nodes themselves has become a critical problem. Since most sensor nodes are powered by batteries, we need to be more energy efficient to improve our ability to maintain them. As it is well-known that long communication distances between sensor nodes and base stations make WSNs consume more power as well as large amounts of sensing data, we propose a new energy-efficient wireless communication protocol called threshold controlled hierarchical routing (TCHR) to reduce the cost of wireless communication by reducing the communication distance in WSNs which the topology is considered closer to reality. We simulated our proposed protocol, and the simulation results demonstrated that the life of a WSN could be extended approximately 6 times longer than that with the direct data transmission protocol.
This paper proposes a MAC protocol for enhancing the throughput in underwater acoustic sensor networks. Since the transmission speed of acoustic wave is much slower than that of radio, the propagation delay in the wat...
详细信息
ISBN:
(纸本)9781479932474;9780769550237
This paper proposes a MAC protocol for enhancing the throughput in underwater acoustic sensor networks. Since the transmission speed of acoustic wave is much slower than that of radio, the propagation delay in the water is much longer. For solving the long propagation delay and hidden terminal problems, the throughput may become very low. To improve the throughput, this paper proposes an algorithm to increase the communications by using some resources which are originally idle for protecting communication from interference. The proposed protocol is based on synchronized technologies. Performance study reveals that the proposed protocol outperforms existing work in terms of network throughput and waiting time of nodes.
A wireless sensor network (WSN) is usually deployed in a field of interest (FoI) for detecting or monitoring some special events and then forwarding the aggregated data to the designated data center through sink nodes...
详细信息
ISBN:
(纸本)9781538639917
A wireless sensor network (WSN) is usually deployed in a field of interest (FoI) for detecting or monitoring some special events and then forwarding the aggregated data to the designated data center through sink nodes or gateways. Traditionally, the WSN requires the intensive deployment in which the extra sensor nodes are deployed to achieve the required coverage level. Fortunately, depending on the developments of the unmanned aerial vehicle (UAV) techniques, the UAV has been widely adopted in both military and civilian applications. Comparing with the traditional mobile sensor nodes, the UAV has much faster moving speed, longer deployment range and relatively longer serving time. Consequently, the UAV can be considered as a perfect carrier for the existing sensing equipment and used to form a UAV-based WSN (UWSN). In this paper, we theoretically analyse the coverage problem in the UWSN. Based on the integral geometry, we solve the aforementioned question. The experimental results further verifies our theoretical results.
Holistic aggregation results are important for users to obtain summary information from Wireless sensor Networks (WSNs). Holistic aggregation requires all the sensory data to be sent to the sink, which costs a huge am...
详细信息
ISBN:
(纸本)9781467372145
Holistic aggregation results are important for users to obtain summary information from Wireless sensor Networks (WSNs). Holistic aggregation requires all the sensory data to be sent to the sink, which costs a huge amount of energy. Fortunately, in most applications, approximate results are acceptable. We study the approximated holistic aggregation algorithms based on uniform sampling. In this paper, four holistic aggregation operations are investigated. The mathematical methods to construct their estimators and determine the optional sample size are proposed, and the correctness of these methods is proved. Four corresponding distributed holistic algorithms are presented. The theoretical analysis and simulation results show that the algorithms have high performance.
A common method of prolonging the lifetime of wireless sensor networks is to use low power duty cycling protocol. Existing protocols consist of two categories: sender-initiated, and receiver-initiated. In this paper, ...
详细信息
ISBN:
(纸本)9781479932474;9780769550237
A common method of prolonging the lifetime of wireless sensor networks is to use low power duty cycling protocol. Existing protocols consist of two categories: sender-initiated, and receiver-initiated. In this paper, we present SA-MAC, a Self-stabilizing Adaptive MAC protocol for wireless sensor networks. SA-MAC dynamically adjusts the transmission time-slot, waking up time-slot, and packet detection patten according to current network working condition, such as packet length and wake-up patterns of neighboring nodes. In the long run, every sensor node will find its own transmission phase so that the network will enter a stable stage when the network load and qualities are static. We conduct extensive experiments to evaluate the energy consumption, packet reception rate of SA-MAC in real sensor networking systems. Our results indicate that SA-MAC outperforms other existing protocols.
This paper studies means of archiving energy balance in Wireless sensor Networks (WSNs) as criterion to increase network lifetime. While protocols for balancing energy through centralized computation have been establi...
详细信息
ISBN:
(纸本)9781509014590
This paper studies means of archiving energy balance in Wireless sensor Networks (WSNs) as criterion to increase network lifetime. While protocols for balancing energy through centralized computation have been established, effective solutions for more realistic distributed settings are still an open research field. In this work, we present a novel approach for balancing energy in WSNs in a distributed manner by solving a sequence of modular strategic subgames. In addition, we prove theoretical bounds for its solution quality. To the best of our knowledge, we are the first to explicitly provide theoretical bounds for distributed WSN energy balancing schemes. We do so by formulating two specific routing games in which sensor nodes act as strategic agents with interests in energy balance. The first formulated game is a monotone utility game and by exploiting and adapting some existing results, we can prove a meaningful relative bound for its solution value via our distributed modular subgames scheme under realistic conditions. For the second game we provide an absolute bound. We round up our theoretical results by an experimental evaluation, where our modular subgames scheme shows increased performance compared to state-of-the-art algorithms.
The data association problem appears in many applications and is considered as the most challenging problem in intelligent systems. In this paper, we consider the Bayesian formulation of data association problems and ...
详细信息
ISBN:
(纸本)9781457705137
The data association problem appears in many applications and is considered as the most challenging problem in intelligent systems. In this paper, we consider the Bayesian formulation of data association problems and present a deterministic polynomial-time approximation algorithm with guaranteed error bounds using correlation decay from statistical physics. We then show that the proposed algorithm naturally partitions a complex problem into a set of local problems and develop a distributed version of the algorithm. The performance of the proposed algorithm is evaluated in simulation.
In this paper, we present a distributed machine learning based intrusion detection system in Internet of Things (IoT) utilizing Blockchain technology. In particular, spectral partitioning is proposed to divide the IoT...
详细信息
ISBN:
(数字)9781728143514
ISBN:
(纸本)9781728143514
In this paper, we present a distributed machine learning based intrusion detection system in Internet of Things (IoT) utilizing Blockchain technology. In particular, spectral partitioning is proposed to divide the IoT network into autonomous systems (AS) enabling traffic monitoring for intrusion detection (ID) to be performed by the selected AS border area nodes in a distributed manner. The ID system is based on machine learning, where a support-vector machine algorithm is trained using prominent IoT data sets and detection of the attackers is provided. Furthermore, the integrity of the attackers' list is offered by utilizing Blockchain technology, which enables a distributed sharing of the attackers' information among the AS border area nodes of the Blockchain network. Simulations are performed to evaluate different aspects of the proposed IoT system and demonstrate the potential of integrating machine learning based ID to a distributed spectral partitioned Blockchain network.
In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. These processes are well-understood in...
详细信息
ISBN:
(纸本)9781728105703
In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. These processes are well-understood in standard peer-to-peer network models, but little is known about their behavior in models that abstract the smartphone peer-to-peer setting. With this in mind, we begin by studying a simple random gossip process in the synchronous mobile telephone model (the most common abstraction used to study smartphone peer-to-peer systems). We prove that the simple process is actually more efficient than the best-known gossip algorithm in the mobile telephone model, which required complicated coordination among the nodes in the network. We then introduce a novel variation of the mobile telephone model that removes the synchronized round assumption, shrinking the gap between theory and practice. We prove that simple random gossip processes still converge in this setting and that information spreading still improves along with graph connectivity.
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper we propose a multihop reprogramming service designed for Mica-2/XSM mo...
详细信息
ISBN:
(纸本)0769523315
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper we propose a multihop reprogramming service designed for Mica-2/XSM motes. One of the problems in reprogramming is the issue of message collision. To reduce the problem of collision and hidden terminal problem, we propose a sender selection algorithm that attempts to guarantee that in a neighborhood there is at most one source transmitting the program at a time. Further, our sender selection is greedy in that it tries to select the sender that is expected to have the most impact. We also use pipelining to enable fast data propagation. MNP is energy efficient because it reduces the active radio time of a sensor node by putting the node into "sleep" state when its neighbors are transmitting a segment that is not of interest. Finally, we argue that it is possible to tune our service according to the remaining battery level of a sensor i.e., it can be tuned so that the probability that a sensor is given the responsibility of transmitting the code is proportional to its remaining battery life.
暂无评论