Results 1 - 10
of
110
Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution
- MOBIHOC'03
, 2003
"... Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor network can be exploited to rv uce the communication cost incurv1 in execution of such quer ies. Anyr eduction in communicatio ..."
Abstract
-
Cited by 168 (7 self)
- Add to MetaCart
(Show Context)
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor network can be exploited to rv uce the communication cost incurv1 in execution of such quer ies. Anyr eduction in communication cost wouldr esult in an e#cient use of the batter y ener gy, which is ver y limited in sensor s. One appr oach to r educe the communication cost of a quer y is to self-or ganize the networ# inr esponse to a quer , into a topology that involves only a small subset of the sensor s su#cient to pr ocess the quer y. The quer y is then executed using only the sensor in the constr ucted topology. In thisar icle, we design and analyze algor thms for such self-or"/0 zation of asensor networ tor educe enerP consumption. In par icular we develop the notion of a connected sensor cover and design a centr alized appr oximation algor thm that constr ucts a topology in ol ing anear optimal connected sensor co er . We pr o e that the size of the const rst ed topology is within an O(log n)factor ofthe optimal size, wher n is the networ size. We also de elop a distr ibuted self-or$1" zationer" on ofour algor thm, and prv ose seer/ optimizations tor educe the communication oer"E1 of the algorithm. Finally, we evaluate the distributed algorithm using simulations and show that our approach results in significant communication cost reduction.
Energy-Efficient Coverage Problems in Wireless Ad-Hoc Sensor Networks
, 2006
"... Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. The sensor coverage problem has received increased attention recently, being considerably driven by recent advances in af ..."
Abstract
-
Cited by 119 (9 self)
- Add to MetaCart
Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. The sensor coverage problem has received increased attention recently, being considerably driven by recent advances in affordable and efficient integrated electronic devices. This problem is centered around a fundamental question: How well do the sensors observe the physical space? The coverage concept is subject to a wide range of interpretations due to a variety of sensors and their applications. Different coverage formulations have been proposed, based on the subject to be covered (area versus discrete points) and sensor deployment mechanism (random versus deterministic) as well as on other wireless sensor network properties (e.g. network connectivity and minimum energy consumption). In this article, we survey recent contributions addressing energy-efficient coverage problems in the context of static wireless sensor networks. We present various coverage formulations, their assumptions, as well as an overview of the solutions proposed.
Connected K-Coverage Problem in Sensor Networks
- In Proceedings of the International Conference on Computer Communications and Networks (IC3N
, 2004
"... one approach to conserve energy is to keep only a small subset of sensors active at any instant. In this article, we consider the problem of selecting a minimum size connected-cover, which is defined as a set of ¡ sensors such that each point in the sensor network is “covered” by at least ..."
Abstract
-
Cited by 83 (5 self)
- Add to MetaCart
(Show Context)
one approach to conserve energy is to keep only a small subset of sensors active at any instant. In this article, we consider the problem of selecting a minimum size connected-cover, which is defined as a set of ¡ sensors such that each point in the sensor network is “covered” by at least
Efficient gathering of correlated data in sensor networks
- In ACM Trans. on Sensor Networks
, 2008
"... In this paper, we design techniques that exploit data cor-relations in sensor data to minimize communication costs (and hence, energy costs) incurred during data gathering in a sensor network. Our proposed approach is to select a small subset of sensor nodes that may be sufficient to re-construct da ..."
Abstract
-
Cited by 69 (0 self)
- Add to MetaCart
(Show Context)
In this paper, we design techniques that exploit data cor-relations in sensor data to minimize communication costs (and hence, energy costs) incurred during data gathering in a sensor network. Our proposed approach is to select a small subset of sensor nodes that may be sufficient to re-construct data for the entire sensor network. Then, during data gathering only the selected sensors need to be involved in communication. The selected set of sensors must also be connected, since they need to relay data to the data-gathering node. We define the problem of selecting such a set of sensors as the connected correlation-dominating set problem, and formulate it in terms of an appropriately de-fined correlation structure that captures general data corre-lations in a sensor network. We develop a set of energy-efficient distributed algorithms and competitive centralized heuristics to select a connected correlation-dominating set of small size. The designed dis-tributed algorithms can be implemented in an asynchronous communication model, and can tolerate message losses. We also design an exponential (but non-exhaustive) centralized approximation algorithm that returns a solution within O(log n) of the optimal size. Based on the approximation algorithm, we design a class of efficient centralized heuris-tics that are empirically shown to return near-optimal so-lutions. Simulation results over randomly generated sensor networks with both artificially and naturally generated data sets demonstrate the efficiency of the designed algorithms and the viability of our technique – even in dynamic condi-tions.
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks,”
- IEEE Transactions on Computer,
, 2004
"... ..."
(Show Context)
Algorithms for Wireless Sensor Network
- International Journal of Distributed Sensor Networks
, 2005
"... This paper reviews some of the recent advances in the development of algorithms for wireless sensor networks. We focus on sensor deployment and coverage, routing and sensor fusion. ..."
Abstract
-
Cited by 35 (6 self)
- Add to MetaCart
(Show Context)
This paper reviews some of the recent advances in the development of algorithms for wireless sensor networks. We focus on sensor deployment and coverage, routing and sensor fusion.
Performance analysis of broadcast protocols in ad hoc networks based on self-pruning
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2004
"... Self-pruning is an effective scheme for efficient broadcasting in ad hoc wireless networks. In a self-pruning broadcast protocol, a node may not forward a broadcast packet if a certain self-pruning condition is satisfied based on the neighborhood information. In a static network with an ideal MAC la ..."
Abstract
-
Cited by 34 (0 self)
- Add to MetaCart
Self-pruning is an effective scheme for efficient broadcasting in ad hoc wireless networks. In a self-pruning broadcast protocol, a node may not forward a broadcast packet if a certain self-pruning condition is satisfied based on the neighborhood information. In a static network with an ideal MAC layer, only a subset of nodes forward the broadcast packet and still guarantee the complete network delivery. Various protocols have been proposed with different self-pruning conditions. Recently, a generic selfpruning protocol was proposed by Wu and Dai [21], which combines the strength of previous conditions and is more effective. In this paper, we first propose an enhanced version of the generic protocol, which is more elegant in interpreting existing protocols and has a simpler correctness proof. Then, we evaluate the performance of the family of self-pruning protocols under various network situations with ns2. The objective is to observe the efficiency and reliability of these protocols as a function of network density, congestion, and mobility, and provide a guideline of implementation in the “real world.” Our performance analysis reveals that the protocol reliability is barely affected by packet collision. However, most self-pruning protocols suffer from low delivery ratio in highly mobile networks. We further explore various techniques that improve the delivery ratio and show that both high efficiency and reliability can be achieved in highly mobile networks.
Mobility Management and Its Applications in Efficient Broadcasting in Mobile Ad Hoc Networks
"... We study an efficient broadcast scheme in mobile ad hoc networks (MANETs). The objective is to determine a small set of forward nodes to ensure full coverage. We first study several methods to select a small forward node set assuming that the neighborhood information can be updated in a timely mann ..."
Abstract
-
Cited by 28 (9 self)
- Add to MetaCart
We study an efficient broadcast scheme in mobile ad hoc networks (MANETs). The objective is to determine a small set of forward nodes to ensure full coverage. We first study several methods to select a small forward node set assuming that the neighborhood information can be updated in a timely manner. Then we consider a general case, where each node updates its neighborhood information based asynchronously on a pre-defined frequency and node move even during the broadcast process. The virtual network constructed from local views of nodes may not be connected, its links may not exist in the physical network, and the global view constructed from collection of local views may not be consistent. In this paper, we first give a sufficient condition for connectivity at the physical network to ensure the connectivity at the virtual network. We then propose a solution using two transmission ranges to address the link availability issue. The neighborhood information as well as the forward node set are determined based on a short transmission range while the broadcast process is done on a long transmission range. The difference between these two ranges is based on the update frequency and the speed of node movement. Finally, we propose a mechanism called aggregated local view to ensure consistency of the global view. By these, we extend Wu and Dai’s coverage condition for broadcasting in a network with mobile nodes. The simulation study is conducted to evaluate the coverage of the proposed scheme.
Variable radii connected sensor cover in sensor networks
- in Proc. of the IEEE International Conference on Sensor and Ad Hoc Communications and Networks (SECON
, 2004
"... Abstract—One of the useful approaches to exploit redundancy in a sensor network is to keep active only a small subset of sensors that are sufficient to cover the region required to be monitored. The set of active sensors should also form a connected communication graph, so that they can autonomously ..."
Abstract
-
Cited by 26 (3 self)
- Add to MetaCart
(Show Context)
Abstract—One of the useful approaches to exploit redundancy in a sensor network is to keep active only a small subset of sensors that are sufficient to cover the region required to be monitored. The set of active sensors should also form a connected communication graph, so that they can autonomously respond to application queries and/or tasks. Such a set of active sensor is known as a connected sensor cover, and the problem of selecting a minimum connected sensor cover has been well studied when the transmission radius and sensing radius of each sensor is fixed. In this article, we address the problem of selecting a minimum energy-cost connected sensor cover, when each sensor node can vary its sensing and transmission radius; larger sensing or transmission radius entails higher energy cost. For the above problem, we design various centralized and distributed algorithms, and compare their performance through extensive experiments. One of the designed centralized algorithms (called CGA) is shown to perform within an O(log n) factor of the optimal solution, where n is the size of the network. We have also designed a localized algorithm based on Voronoi diagrams which is empirically shown to perform very close to CGA, and due to its communicationefficiency results in significantly prolonging the sensor network lifetime. I.
A unified energy-efficient topology for unicast and broadcast
- in MobiCom’05, 2005
"... We propose a novel communication efficient topology con-trol algorithm for each wireless node to select communica-tion neighbors and adjust its transmission power, such that all nodes together self-form a topology that is energy effi-cient simultaneously for both unicast and broadcast com-munication ..."
Abstract
-
Cited by 20 (4 self)
- Add to MetaCart
(Show Context)
We propose a novel communication efficient topology con-trol algorithm for each wireless node to select communica-tion neighbors and adjust its transmission power, such that all nodes together self-form a topology that is energy effi-cient simultaneously for both unicast and broadcast com-munications. We prove that the proposed topology is pla-nar, which guarantees packet delivery if a certain localized routing method is used; it is power efficient for unicast – the energy needed to connect any pair of nodes is within a small constant factor of the minimum under a common power at-tenuation model; it is efficient for broadcast: the energy con-sumption for broadcasting data on top of it is asymptotically the best compared with structures constructed locally; it has a constant bounded logical degree, which will potentially re-duce interference and signal contention. We further prove that the average physical degree of all nodes is bounded by a small constant. To the best of our knowledge, this is the first communication-efficient distributed algorithm to achieve all these properties. Previously, only a centralized algorithm was reported in [3]. Moreover, by assuming that the ID and position of every node can be represented in O(log n) bits for a wireless network of n nodes, our method uses at most 13n messages, where each message is of O(log n) bits. We also show that this structure can be efficiently updated for dynamical network environment. Our theoretical results are corroborated in the simulations.
