No abstract

Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. The coverage problem for Wireless Sensor Network (WSN) has been studied extensively in recent years, especially when combined with connectivity and energy efficiency. This paper focuses on the sensor replacement problem in wireless sensor networks consists of mobile sensors. Mobility equipped sensors are utilized to recover and maintain the overall coverage using the dynamic cluster concept. The proposed fault repair solution does not assume the localization information is available. Mobile sensor nodes make use of simple geometric operation to locate and replace dying nodes to recover or increase the existing coverage and connectivity.

No abstract

No abstract

No abstract

Abstract-Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vital for planning and risk management. Existing approaches to vulnerability assessments of large-scale systems mainly focus on investigating inhomogeneous properties of the underlying graph elements. These measures and the associated heuristic solutions are limited in evaluating the vulnerability of large-scale network topologies. Furthermore, these approaches often fail to provide performance guarantees of the proposed solutions. In this paper, we propose a vulnerability measure, pairwise connectivity, and use it to formulate network vulnerability assessment as a graph-theoretical optimization problem, referred to as β-disruptor. The objective is to identify the minimum set of critical network elements, namely nodes and edges, whose removal results in a specific degradation of the network global pairwise connectivity. We prove the NP-Completeness and inapproximability of this problem, and propose an O(log n log log n) pseudoapproximation algorithm to computing the set of critical nodes and an O(log 1.5 n) pseudo-approximation algorithm for computing the set of critical edges. The results of an extensive simulation-based experiment show the feasibility of our proposed vulnerability assessment framework and the efficiency of the proposed approximation algorithms in comparison with other approaches.

The benefits of cognitive radio networking have been well recognized with the emerging wireless applications in recent years. While many existing works assume that the secondary transmissions are negative interferences to the primary users (PUs), in this paper, we take secondary users (SUs) as positive potential cooperators for the PUs. In particular, we consider the problem of cooperative relay selection, in which the PUs actively select appropriate SUs as relay nodes to enhance their transmission performance. The most critical challenge for such a problem is how to select a relay efficiently. Due to the potentially large number of secondary users, it is infeasible for a PU to first scan all the SUs and then pick the best one. Basically, the PU transmitter intends to observe the SUs sequentially. After observing an SU, the PU needs to make a decision regarding whether to terminate its observation and use the current SU as its relay or to skip it and observe the next SU. We address this problem by using the optimal stopping theory and derive the optimal stopping rule. We also discuss the optimal observation order of the SUs and analyze the collision probability. To evaluate the performance of our proposed scheme, we compare our optimal stopping policy with the random selection policy through simulation study, and the results demonstrate the superiority of our policy. Extensive simulation study is conducted to investigate the impact of different parameters on the system performance, and the results indicate that our algorithm can satisfy different system requirements by carefully tuning the corresponding system parameters.Index Terms-Cognitive radio networks; cooperative relay selection; optimal stopping theory; spectrum sensing order. 0018-9545 (c)

No abstract