Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,480
Constructing Minimum Relay Connected Sensor Cover in Heterogeneous Wireless Sensor Networks
"... Abstract. Energy efficiency is an important problem in wireless sensor net-works. In this paper, we consider the energy efficiency problem in a hetero-geneous wireless sensor network which consists of energy-constrained sensor nodes and resource-rich relay nodes. We firstly formulate the minimum rel ..."
Abstract
- Add to MetaCart
nodes must be relay connected to the backbone network formed by all relay nodes. Then we propose a distributed algorithm to construct the MRCSC of a randomly deployed heterogeneous sensor network. The basic idea of this algorithm is to construct the minimum sensor cover firstly and then ensure its relay
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract
-
Cited by 541 (19 self)
- Add to MetaCart
as the number of nodes in the network goes to infinity. It is shown that if n nodes are placed in a disc of unit area in ! 2 and each node transmits at a power level so as to cover an area of ßr 2 = (log n + c(n))=n, then the resulting network is asymptotically connected with probability one if and only
Energy Aware Routing for Low Energy Ad Hoc Sensor Networks
, 2002
"... The recent interest in sensor networks has led to a number of routing schemes that use the limited resources available at sensor nodes more efficiently. These schemes typically try to find the minimum energy path to optimize energy usage at a node. In this paper we take the view that always using lo ..."
Abstract
-
Cited by 428 (5 self)
- Add to MetaCart
The recent interest in sensor networks has led to a number of routing schemes that use the limited resources available at sensor nodes more efficiently. These schemes typically try to find the minimum energy path to optimize energy usage at a node. In this paper we take the view that always using
On the Minimum Node Degree and Connectivity of a Wireless Multihop Network
- ACM MobiHoc
, 2002
"... This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k–connectivity. Both topology attributes depend on the spa-tial distribution of the nodes and their transmission range. Using typical modeling assumptions — a random uniform distri ..."
Abstract
-
Cited by 318 (4 self)
- Add to MetaCart
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k–connectivity. Both topology attributes depend on the spa-tial distribution of the nodes and their transmission range. Using typical modeling assumptions — a random uniform
A general approximation technique for constrained forest problems
- SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract
-
Cited by 414 (21 self)
- Add to MetaCart
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization
Efficient routing in intermittently connected mobile networks: The multiple-copy case
, 2008
"... Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc net ..."
Abstract
-
Cited by 303 (18 self)
- Add to MetaCart
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc
Unreliable Sensor Grids: Coverage, Connectivity and Diameter
- In Proceedings of IEEE INFOCOM
, 2003
"... We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity of the network. We first show that the necessary and sufficient conditions for the random grid network to cover the unit square reg ..."
Abstract
-
Cited by 223 (9 self)
- Add to MetaCart
We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity of the network. We first show that the necessary and sufficient conditions for the random grid network to cover the unit square
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
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
Relay sensor placement in wireless sensor networks
"... This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors is globally connected. This problem is motivated by p ..."
Abstract
-
Cited by 81 (2 self)
- Add to MetaCart
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors is globally connected. This problem is motivated
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
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
Results 1 - 10
of
1,480
