On the design of resilient heterogeneous wireless sensor networks based on small world concepts

Department of Computer Science, Federal University of Minas Gerais, Belo Horizonte, MG, Brazil; Department of Computer Science, Pontifical Catholic University of Minas Gerais, Belo Horizonte, MG, Brazil
Computer Networks (Impact Factor: 1.23). 01/2010; DOI: 10.1016/j.comnet.2009.10.021
Source: DBLP

ABSTRACT In this work, we propose on-line models to design heterogeneous sensor network topologies with small world features. The proposed model takes into account the data communication flow in this kind of network to create network shortcuts toward the sink node in such a way that the communication between the sink and the sensor nodes is optimized. The endpoints of these shortcuts are nodes with more powerful hardware, leading to a heterogeneous sensor network. We evaluate the on-line models and show that they present the same small world features observed in the theoretical models. When the shortcuts are created toward the sink node, with a small number of powerful sensors, the network presents better small world features and interesting tradeoffs between energy and latency in the data communication when compared with the Random Additional Model. We evaluate the resilience of the on-line models considering general and specific failures and, in both cases, the proposed model is more robust and presents a graceful degradation of the network latency, which shows the resilience of those models.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The Internet has become essential to all aspects of modern life, and thus the consequences of network disruption have become increasingly severe. It is widely recognised that the Internet is not sufficiently resilient, survivable, and dependable, and that significant research, development, and engineering is necessary to improve the situation. This paper provides an architectural framework for resilience and survivability in communication networks and provides a survey of the disciplines that resilience encompasses, along with significant past failures of the network infrastructure. A resilience strategy is presented to defend against, detect, and remediate challenges, a set of principles for designing resilient networks is presented, and techniques are described to analyse network resilience.
    Computer Networks. 01/2010;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: It is highly desirable and challenging for a wireless ad hoc network to have self-organization properties in order to achieve network wide characteristics. Studies have shown that Small World properties, primarily low average path length and high clustering coefficient, are desired properties for networks in general. However, due to the spatial nature of the wireless networks, achieving small world properties remains highly challenging. Studies also show that, wireless ad hoc networks with small world properties show a degree distribution that lies between geometric and power law. In this paper, we show that in a wireless ad hoc network with non-uniform node density with only local information, we can significantly reduce the average path length and retain the clustering coefficient. To achieve our goal, our algorithm first identifies logical regions using Lateral Inhibition technique, then identifies the nodes that beamform and finally the beam properties using Flocking. We use Lateral Inhibition and Flocking because they enable us to use local state information as opposed to other techniques. We support our work with simulation results and analysis, which show that a reduction of up to 40% can be achieved for a high-density network. We also show the effect of hopcount used to create regions on average path length, clustering coefficient and connectivity.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The success and intensive use of social networks makes strategies for efficient document location a hot topic of research. In this paper, we propose a common vector space to describe documents and users to create a social network based on affinities, and explore epidemic routing to recommend documents according to the user’s interests. Furthermore, we propose the creation of a SoftDHT structure to improve the recommendation results. Using these mechanisms, an efficient document recommender system with a fast organization of clusters of users based on their affinity can be provided, preventing the creation of unlinked communities. We show through simulations that the proposed system has a short convergence time and presents a high recall ratio.
    Computer Communications. 12/2012; 36(1):90–104.