Advances in remote systems administration, miniaturized scale manufacture and mix, and installed microchips have empowered the creation of another age of monstrous scale remote sensor systems appropriate for a scope of business and military applications. Remote sensor arranges (WSN) is shoddy and power-proficient sensor hubs which adequately transmit information to the base station. The fundamental test of WSN is the separation, vitality and time delay. The power asset is a vitality productive information accumulation. Here the more prominent the separation between the hubs, higher the vitality utilization. For having the powerful transmission of information with less vitality, the group head approach is utilized. It is notable that the time delay is specifically relative to the separation between the hubs and the base station. The group head is chosen so that it is spatially nearer enough to the base station and also the sensor hubs. In this way, the time deferral can be generously lessened. This, thusly, the transmission speed of the information bundles can be increased. A Novel Hybrid Ant-Bee Colony calculation is created to enhance the effectiveness. The system execution is expanded in this strategy when contrasted with the other regular calculation.

Energy Aware Routing Protocol Using Hybrid ANT-BEE Colony Optimization Algorithm For Cluster Based Routing

Achieving optimal field coverage is a significant challenge in various sensor network applications. In some specific situations, the sensor field (target) may have coverage gaps due to the random deployment of sensors; hence, the optimized level of target coverage cannot be obtained. Given a set of sensors in the plane, the target coverage problem is to separate the sensor into different groups and provide them specific time intervals, so that the coverage lifetime can be maximized. Here, the constraint is that the network should be connected. Presently, target coverage problem is widely studied due to its lot of practical application in Wireless Sensor Network (WSN). This paper focuses on target coverage problem along with the minimum energy usage of the network so that the lifetime of the whole network can be increased. Since constructing a minimum connected target coverage problem is known to be NP-Complete, so several heuristics, as well as approximation algorithms, have been proposed. Here, we propose a heuristic for connected target coverage problem in WSN. We compare the performance of our heuristic with the existing heuristic, which states that our algorithm performs better than the existing algorithm for connected target coverage problem. Again, we have implemented the 2-connected target coverage properties for the network which provide fault tolerance as well as robustness to the network. So, we propose one algorithm which gives the target coverage along with 2-connectivity.

Improved Energy-Efficient Target Coverage in Wireless Sensor Networks

The broadcast storm problem in mobile ad hoc networks can be effectively alleviated by a connected dominating set-based virtual backbone network. However, the existing methods of connected dominating sets are not adapted to dynamic ad hoc networks. In this paper, a connected dominating set-based energy-efficient distributed routing algorithm is proposed. Furthermore, in order to select an appropriate relay forwarding node which reflects the energy efficiency of the dominating node and reduces its contribution to the entire network communication overhead, the additional coverage, residual energy and mobility of nodes are taken into overall consideration. To optimize the construction of network topology, the information entropy method is used to quantize each factor’s weight. The numerical results show that compared to the existing algorithm, the proposed algorithm can significantly reduce the network structure construction overhead, guarantee network connectivity, improve energy efficiency and extend the network lifetime.

Connected Dominating Set-based Energy-efficient Distributed Routing Algorithm

The dominating set problem and its variations are growing in importance in the context of power distributions systems in both the communication and monitoring systems of smart grids. One important aspect of such systems is fault tolerance which is well modeled by including the 2-connectivity constraint to the standard dominating set problem. In this paper, we present a constructive heuristic algorithm for the 2-connected m-dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears. The growth procedure is an adaptation of the breadth-first-search which efficiently manages to find open ears. Further, a heuristic function is defined for selecting the best ear out of a list of candidates. The performance of the basic approach is improved by adding a correction procedure which removes unnecessary nodes from a generated solution. Finally, randomization is included and the method is extended towards the GRASP metaheuristic. In our computational experiments, we compare the performance of the proposed algorithm to recently published results and show that the method is highly competitive and especially suitable for dense graphs.

Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems

In this thesis, we study the problem of efficient data dissemination in wireless sensor and mobile ad hoc networks. In wireless sensor networks we study two problems: (1) construction of virtual backbones and clustering hierarchies to achieve efficient routing, and (2) placement of multiple sinks, where each sensor is at a bounded distance to several sinks, to analyze and process data before sending it to a central unit. Often connected dominating sets have been used for such purposes. However, a connected dominating set is often vulnerable due to frequent node failures in wireless sensor networks. Hence, to provide a degree of fault-tolerance we consider in problem (1) a 2-connected (k,r)-dominating set, denoted D(2,k,r), to act as a virtual backbone or a clustering hierarchy, and in problem (2) a total (k,r)-dominating set to act as sinks in wireless sensor networks.

Ideally, the backbone or the number of sinks in the network should constitute the smallest percentage of nodes in the network. We model the wireless sensor network as a graph. The total (k,r)-dominating set and the 2-connected (k,r)-dominating set have not been studied in the literature. Thus, we propose two centralized approximation algorithms to construct a D(2,k,r) in unit disk graphs and in general graphs. We also derive upper bounds on the total (k,r)-domination number in graphs of girth at least 2k+1 as well as in random graphs with non-fixed probability p. 

In mobile ad hoc networks we propose a hexagonal based beacon-less flooding algorithm, HBLF, to efficiently flood the network. We give sufficient condition that even in the presence of holes in the network, HBLF achieves full delivery. Lower and upper bounds are given on the number of forwarding nodes returned by HBLF in a network with or without holes. When there are no holes in the network, we show that the ratio of the shortest path returned by HBLF to the shortest path in the network is constant. We also present upper bounds on the broadcast time of HBLF in a network with or without holes.

/pdf/efficient-data-dissemination-in-wireless-ad-hoc-networks-2c2amvgcse.pdf

Efficient Data Dissemination in Wireless Ad Hoc Networks

Connected dominated subsets (CDS) of nodes in wireless sensor network are always selected to form a virtual backbone. Construction of r-hop 2-connected dominating sets can reduce the size of CDS and the total amount of information to be transmitted. The 2-connected properties can provide higher fault tolerance and robustness as well. In this paper an approximation r-hop 2-connected dominating set algorithm for wireless sensor and ad-hoc networks is presented. The main strategy is partition to three phases: in the first phase, an r-hop independent dominating set is established; in the second phase, the r-hop dominating set is interconnected successively to form a connected subgraph; in the third phase, more vertices are selected and added into dominating set to make it 2-connected. Extensive simulations according to the algorithm steps have been conducted. Performance with detailed analysis has been shown at last.

http://ieeexplore.ieee.org/iel7/6477233/6478258/06478461.pdf

Constructing r-Hop 2-Connected Dominating Sets for Fault-Tolerant Backbone in Wireless Sensor Networks

Connected dominated subsets (CDS) of nodes in wireless sensor network are always selected to form a virtual backbone. Construction of r-hop connected k-dominating sets ((k, r)-CDS) can reduce the size of CDS and the total amount of information to be transmitted. Their multiple dominating properties can provide higher fault tolerance and robustness as well. In this paper a (k, r)-CDS construction approximation algorithm for wireless sensor and ad-hoc networks is presented. The main strategy is partition to clusters, from which the r-hop k-dominating set nodes ((k, r)-DS) are selected separately. Then (k, r)-DS are connected together to form (k, r)-CDS. Extensive simulations according to the algorithm steps have been conducted. Performance with detailed analysis has been shown at last.

Yiqing Zhang

Papers

Constructing r-Hop 2-Connected Dominating Sets for Fault-Tolerant Backbone in Wireless Sensor Networks

Constructing (k, r)-connected dominating sets for robust backbone in wireless sensor networks