Results 1 - 10
of
16
In-network outlier detection in wireless sensor networks
- In ICDCS
, 2006
"... To address the problem of unsupervised outlier detection in wireless sensor networks, we develop an algorithm that (1) is flexible with respect to the outlier definition, (2) works in-network with a communication load proportional to the outcome, and (3) reveals its outcome to all sensors. We examin ..."
Abstract
-
Cited by 44 (3 self)
- Add to MetaCart
(Show Context)
To address the problem of unsupervised outlier detection in wireless sensor networks, we develop an algorithm that (1) is flexible with respect to the outlier definition, (2) works in-network with a communication load proportional to the outcome, and (3) reveals its outcome to all sensors. We examine the algorithm’s performance using simulation with real sensor data streams. Our results demonstrate that the algorithm is accurate and imposes a reasonable communication load and level of power consumption. 1.
Dynamic point coverage problem in wireless sensor networks: a cellular learning automata approach
- Journal of Ad hoc and Sensors Wireless Networks
, 2010
"... One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynamic point coverage problem, which is to detect some moving target points in the area of the sensor network, a node is need ..."
Abstract
-
Cited by 15 (9 self)
- Add to MetaCart
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynamic point coverage problem, which is to detect some moving target points in the area of the sensor network, a node is needed to be active only when a target point is in its sensing region. A node can be aware of such times using a predicting mechanism. In this paper, we propose a solution to the problem of dynamic point coverage using irregular cellular learning automata. In this method, learning automaton residing in each cell in cooperation with the learning automata residing in its neighboring cells predicts the existence of any target point in the vicinity of its corresponding node in the network. This prediction is then used to schedule the active times of that node. In order to show the performance of the proposed method, computer experimentations have been conducted. The results show that the proposed method outperforms the existing methods such as LEACH, GAF, PEAS and PW in terms of energy consumption.
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks. Computer Networks doi:10.1016/j
, 2010
"... The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way to deal with this problem is to schedule sensor nodes in such a way that a node is activated only at the times a target p ..."
Abstract
-
Cited by 12 (6 self)
- Add to MetaCart
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way to deal with this problem is to schedule sensor nodes in such a way that a node is activated only at the times a target point is in its sensing region. In this paper we propose SALA, a scheduling algorithm based on learning automata, to deal with the problem of dynamic point coverage. In SALA each node in the network is equipped with a set of learning automata. The learning automata residing in each node try to learn the maximum sleep duration for the node in such a way that the detection rate of target points by the node does not degrade dramatically. This is done using the information obtained about the movement patterns of target points while passing throughout the sensing region of the nodes. We consider two types of target points; events and moving objects. Events are assumed to occur periodically or based on a Poisson distribution and moving objects are assumed to have a static movement path which is repeated periodically with a randomly selected velocity. In order to show the performance of SALA, some experiments have been conducted. The experimental results show that SALA outperforms the existing methods such as LEACH, GAF, PEAS and PW in terms of energy consumption.
A selfselection technique for flooding and routing in wireless ad-hoc networks
- Journal of Network and Systems Management
"... There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast c ..."
Abstract
-
Cited by 11 (4 self)
- Add to MetaCart
(Show Context)
There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node’s delay of transmitting a signal is dependent on the probability of the node’s ability to best perform a pertinent task and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding named Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.
Threshold-Controlled Global Cascading in Wireless Sensor Networks
- the Procedings of INSS 2006
"... Abstract — We investigate cascade dynamics in thresholdcontrolled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, robust, and reliable prototypical activation protocol in sensor networks in responding to various alarm scenarios. We al ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
(Show Context)
Abstract — We investigate cascade dynamics in thresholdcontrolled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, robust, and reliable prototypical activation protocol in sensor networks in responding to various alarm scenarios. We also consider the same dynamics on a modified network by adding a few long-range communication links, resulting in a small-world network. We find that such construction can further enhance and optimize the speed of the network’s response, while keeping energy consumption at a manageable level. I.
Analysis of Cost-Quality Tradeoff in Cooperative Ad Hoc Sensor Networks
"... Abstract—In wireless ad hoc sensor networks, cooperation of nodes provides sensors with a broader range of information, often leading to an improvement in network’s ability to meet its global objectives. However, increased communication caused by cooperation leads to a cost-quality tradeoff in the n ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In wireless ad hoc sensor networks, cooperation of nodes provides sensors with a broader range of information, often leading to an improvement in network’s ability to meet its global objectives. However, increased communication caused by cooperation leads to a cost-quality tradeoff in the network operation. We model the cooperation based on the range of its information sharing. In h-cooperation, each node shares its information with those nodes that are at most h hops away. We analyze the tradeoff in three different applications and show that significant performance improvements arise when the optimal cooperation level is chosen. I.
A Cost-Quality Tradeoff in Cooperative Sensor Networking
"... Abstract—Wireless sensor networks consist of a large number of sensor nodes, each of which senses, computes and communicates with other nodes to collect and process data about the environment. Those networks are emerging as one of the new paradigms in networking with great impact on industry, govern ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Wireless sensor networks consist of a large number of sensor nodes, each of which senses, computes and communicates with other nodes to collect and process data about the environment. Those networks are emerging as one of the new paradigms in networking with great impact on industry, government and military applications. A sensor network attempts to collect sensing data from the entire domain of its deployment, to process this data to understand phenomena and activities going on in this domain, and finally to communicate the results to the outside world to enable actuators to execute the necessary reactions. However, a sensor node is only capable of sensing events within its limited sensing range, so it has only a localized information about its environment. Hence, to provide the coverage of the entire domain, sensors need to collaborate and share their information with each other. Such sharing increases the knowledge of each sensor about the environment, but it also brings extra communication cost and increases the network operation complexity. In other words, cooperation and data sharing invokes a cost-quality tradeoff in the network. In this paper, we study two different sensor network applications: (i) finding an efficient sleep schedule based on sensing coverage redundancy, and (ii) adjusting traffic light periods to optimize traffic flow. In both applications the cost-quality tradeoff arises. In the paper, we study how fast network functionality increases when the level of cooperation raises and how much this increased functionality is offset by the raising cooperation costs. We simulated both applications with different level of cooperation and without it and demonstrated significant improvements in the overall system quality resulting from the properly selected levels of cooperation between the network’s nodes. I.
Biologically Inspired Self Selective Routing with Preferred Path Selection ⋆
"... Abstract. This paper presents a biologically inspired routing protocol called Self Selective Routing with preferred path selection (SSR(v3)). Its operation resembles the behavior of a biological ant that finds a food source by following the strongest pheromone scent left by scout ants at each fork o ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract. This paper presents a biologically inspired routing protocol called Self Selective Routing with preferred path selection (SSR(v3)). Its operation resembles the behavior of a biological ant that finds a food source by following the strongest pheromone scent left by scout ants at each fork of a path. Likewise, at each hop of a multi-hop path, a packet using the Self Selective Routing (SSR) protocol moves to the node with the shortest hop distance to the destination. Each intermediate node on a route to the destination uses a transmission back-off delay to select a path to follow for each packet of a flow. Neither an ant nor a packet knows in advance the route that each will follow as it is decided at each step. Therefore, when a route becomes severed by a failure, they can dynamically and locally adjust their routing to traverse the shortest surviving path. Preferred path selection reduces transmission delay by essentially removing back-off delay for the node that carried the previous packet of the same flow. The results reported here for both simulation and execution of a MicaZ mote implementation, show that this is an efficient and fault-tolerant protocol with small transmission delay, high reliability and high delivery rate.
BALANCING COST-QUALITY TRADEOFF IN COOPERATIVE AD HOC SENSOR NETWORKS
"... Abstract—In wireless ad hoc and sensor networks, each node is capable of functioning using only its local information about the environment. However, such a node can reach only locally optimal decisions that may prevent the network from ever reaching the global optimum performance for the given appl ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—In wireless ad hoc and sensor networks, each node is capable of functioning using only its local information about the environment. However, such a node can reach only locally optimal decisions that may prevent the network from ever reaching the global optimum performance for the given application. To avoid this problem, each node needs to cooperate with others to gain knowledge about the overall network and environment properties so that its decision contributes to the network’s global objectives. This paper models the cooperation between nodes by measuring the level of information sharing between the neighbors. If h-cooperation is applied, each node shares its information with all nodes which are at most h hop away from it. As the cooperation level raises, knowledge of each individual node about its environment increases, thus, it can make better decisions in meeting the main objective of the network application. On the other hand, it also brings extra communication cost and increases the network operation complexity. Therefore, these two contradicting aspects of cooperation cause a cost-quality tradeoff. In this paper, we investigate the effects of this tradeoff in three different types of sensor network applications: (i) finding an efficient sleep schedule based on sensing coverage redundancy (ii) routing in a network with failureprone nodes (iii) routing in a network with a mobile sink node. In all of these applications, we simulated different levels of cooperation and showed significant improvements in the overall system quality when the optimal level of cooperation between the network’s nodes is chosen. I.
Paper Comparative Study of Wireless Sensor Networks Energy-Efficient Topologies and Power Save Protocols
"... Abstract — Ad hoc networks are the ultimate technology in wireless communication that allow network nodes to communicate without the need for a fixed infrastructure. The paper addresses issues associated with control of data transmission in wireless sensor networks (WSN) – a popular type of ad hoc ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract — Ad hoc networks are the ultimate technology in wireless communication that allow network nodes to communicate without the need for a fixed infrastructure. The paper addresses issues associated with control of data transmission in wireless sensor networks (WSN) – a popular type of ad hoc networks with stationary nodes. Since the WSN nodes are typically battery equipped, the primary design goal is to optimize the amount of energy used for transmission. The energy conservation techniques and algorithms for computing the optimal transmitting ranges in order to generate a network with desired properties while reducing sensors energy consumption are discussed and compared through simulations. We describe a new clustering based approach that utilizes the periodical coordination to reduce the overall energy usage by the network.
