Results 1 -
7 of
7
Improving connectivity via relays deployment in wireless sensor networks
- Proc. IEEE Global Telecommunications Conference (Globecom’07
, 2007
"... Abstract — Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivity of a given network by adding a set of relays to it. We characterize the network connectivity by the Fiedler value, whic ..."
Abstract
-
Cited by 17 (2 self)
- Add to MetaCart
(Show Context)
Abstract — Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivity of a given network by adding a set of relays to it. We characterize the network connectivity by the Fiedler value, which is the second smallest eigenvalue of the Laplacian matrix representing the network graph. We propose a network-maintenance algorithm, which finds the best locations for a given set of relays. The proposed algorithm obtains the best relays ’ locations through a multi-level approach. In each level, the search problem can be formulated as a standard semi-definite programming (SDP) optimization problem. We show that the proposed algorithm can increase the average Fiedler value by 35 % by adding one relay only. I.
Algorithms for Minimum m-Connected k-Dominating
- Set Problem, COCOA 2007, LNCS 4616
, 2007
"... Abstract. In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high e ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consider how to establish a small virtual backbone to balance efficiency and fault tolerance. This problem can be formalized as the minimum m-connected k-dominating set problem, which is a general version of minimum CDS problem with m =1andk = 1. In this paper we will propose some approximation algorithms for this problem that beat the current best performance ratios.
Backbone in Wireless Networks
"... Abstract — Virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem in ad hoc networks. Since the nodes in the virtual backbone need to carry other node’s traffic, and node and link failure are inherent in wireless networks, it is desirable that th ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — Virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem in ad hoc networks. Since the nodes in the virtual backbone need to carry other node’s traffic, and node and link failure are inherent in wireless networks, it is desirable that the virtual backbone is fault tolerant. In this paper, we propose a new algorithm called Connecting Dominating Set Augmentation (CDSA) to construct a 2-connected virtual backbone which can resist the failure of one wireless node. We prove that CDSA has guaranteed quality, because the size of the CDSA constructed 2-connected backbone is within a constant factor of the optimal 2-connected virtual backbone size. Through extensive simulations, we demonstrate that CDSA can improve the fault tolerance of virtual backbone with only marginal extra overhead. I.
TOM: Topology Oriented Maintenance in Sparse Wireless Sensor Networks
"... Abstract—The physical number of sensor nodes constitutes a major cost factor for Wireless Sensor Networks (WSN) deployments. Hence, a natural goal is to minimize the number of sensor nodes to be deployed, while still maintaining the desired properties of the WSN. However, sparse networks even while ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—The physical number of sensor nodes constitutes a major cost factor for Wireless Sensor Networks (WSN) deployments. Hence, a natural goal is to minimize the number of sensor nodes to be deployed, while still maintaining the desired properties of the WSN. However, sparse networks even while connected, usually suffer from topology irregularities that negatively impact the network lifetime and responsiveness, i.e., sensor data delivery reliability and latency. In addition, sensor node failures easily complicate/enforce/aggravate these irregularities. Valuable efforts have been conducted to discover topology specific anomalies such as coverage holes or critical/bottleneck nodes. Unfortunately, these efforts suffer from at least one of the following drawbacks: (a) They are centralized and consequently inefficient in largescale networks, (b) they are tailored to one class of anomalies, or (c) do not propose how to remedy the identified anomaly. In this paper, we focus on sparse WSN which usually show varied topology irregularities and propose an in-network and localized strategy that efficiently (i) discovers generic topology irregularities, and (ii) identifies locations for minimal number of new augmented sensor deployments to remedy topology irregularities and sustain the desired operational requirements. We show the effectiveness and efficiency of the solution through a set of extensive simulations. I.
An Optimum Relay Sensor Placement Technique to Enhance the Connectivity of Wireless Sensor Network
"... Abstract—In this paper, we have presented a novel algorithm of sensor deployment for re-establishing the connectivity of a disconnected sensor network. We also address the way of achieving k-connectivity which can provide the sensor network with some level of fault tolerance. We combine the concept ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this paper, we have presented a novel algorithm of sensor deployment for re-establishing the connectivity of a disconnected sensor network. We also address the way of achieving k-connectivity which can provide the sensor network with some level of fault tolerance. We combine the concept of Voronoi diagram, Delaunay triangulation, Spanning tree and Steiner heuristic in order to achieve optimum solution. Our proposed algorithm can find optimum number of required relay sensors with reasonable running time complexity. The algorithm also finds the position where the relay nodes are to be place for repairing or enhancing the connectivity. The performance and complexity of our proposed algorithm are also analysed which is incorporate our simulation result.
Cooperative Control With Improvable Network Connectivity
"... Abstract—In this paper, an efficient approach to improve the connectivity of any given network is provided by introducing an additional node into the network. More specifically, the additional node acts as a neighbor to certain pair of nodes in the network with only changing one link among the exist ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this paper, an efficient approach to improve the connectivity of any given network is provided by introducing an additional node into the network. More specifically, the additional node acts as a neighbor to certain pair of nodes in the network with only changing one link among the existing nodes. The location of the additional node is designed according to the current topology as well as the states, and it has been proved that, controlling the most-connected node will in general improve the convergence rate of the network. Moreover, the proposed method overcomes the dependence of the convergence rate on the Fiedler value. In particular, the convergence problem is converted to a standard stability problem by using the cooperative control Lyapunov function, and a state-feedback controller with switching logic in finding the observed node is designed to guarantee the fast convergence. Simulation results demonstrate the effectiveness of the proposed strategy in speeding up consensus in a network. I.
