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
Computer Networks (Impact Factor: 1.28). 06/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.

1 Follower
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, topology evolution problem is addressed for improving the network performance in wireless multi-hop networks. A novel topology model based on social inspired mechanism with energy-aware and local-world features is proposed to handle the time-varying nature of wireless multi-hop network. A series of theoretical analysis and numerical simulation to the social inspired evolution network are conducted. Firstly, the degree distribution of this social inspired model represents a transition between exponential to power-law scaling with increasing the local world scale. Secondly, the clustering coefficient and the average path length decrease sharply as generally local-world scale increases a little. Finally, we found that the robustness and fragility of the proposed network model against random failures and attacks also display a transition between the random and the scale-free ones when the scale of local-world increasing. This local-world social inspired network model can maintain the robustness of scale-free networks and can improve the network reliance against intentional attacks.
    Physica A: Statistical Mechanics and its Applications 11/2014; 416. DOI:10.1016/j.physa.2014.09.033 · 1.72 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this study, the robustness of small-world networks to three types of attack is investigated. Global efficiency is introduced as the network coefficient to measure the robustness of a small-world network. The simulation results prove that an increase in rewiring probability or average degree can enhance the robustness of the small-world network under all three types of attack. The effectiveness of simultaneously increasing both rewiring probability and average degree is also studied, and the combined increase is found to significantly improve the robustness of the small-world network. Furthermore, the combined effect of rewiring probability and average degree on network robustness is shown to be several times greater than that of rewiring probability or average degree individually. This means that small-world networks with a relatively high rewiring probability and average degree have advantages both in network communications and in good robustness to attacks. Therefore, simultaneously increasing rewiring probability and average degree is an effective method of constructing realistic networks. Consequently, the proposed method is useful to construct efficient and robust networks in a realistic scenario.
    Chinese Physics B 06/2014; 23(8):088902. DOI:10.1088/1674-1056/23/8/088902 · 1.39 Impact Factor
  • [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 wide network characteristics. Studies have shown that Small-World properties, primarily low average path length (APL) 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 of 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 APL and retain the clustering coefficient. To achieve our goal, our algorithm first identifies logical regions using the 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 APL, clustering coefficient and connectivity.
    The Computer Journal 08/2012; 55(8):909-931. DOI:10.1093/comjnl/bxs024 · 0.89 Impact Factor