Sensor network localisation based on sorted RSSI quantisation

International Journal of Ad Hoc and Ubiquitous Computing (Impact Factor: 0.9). 01/2006; 1(4):222-229. DOI: 10.1504/IJAHUC.2006.010503
Source: DBLP

ABSTRACT Range estimation is essential in many sensor network localisation algorithms. Although wireless sensor systems usually have available received signal strength indication (RSSI) readings, this information has not been effectively used in the existing localisation algorithms. In this paper, we present a novel approach to localisation of sensors in an ad hoc sensor network based on a sorted RSSI quantisation algorithm. This algorithm can improve the range estimation accuracy when distance information is not available or too erroneous. The range level used in the quantisation process can be determined by each node, using an adaptive quantisation scheme. The new algorithm can be implemented in a distributed way and achieves significant improvement over existing range-free algorithms. The performance advantage for various sensor networks is shown, with experimental results from our extensive simulation with a realistic radio model.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless signals present particular behaviour in indoor environments. Walls, roofs and floors generate reflections and refractions that conduce to constructive and destructive interferences due to the multipath effect. In this paper, we perform an analytical study based on the signal strength generated by an access point (AP) inside a building. The evolution of the signal strength allows us to move away the sensors from the AP without reducing the signal level and link quality. We study the IEEE 802.11 technology. These results are compared with the theoretical distribution channels to know what should be followed to avoid interferences. Finally, taking as a reference the measures provided, we develop a method for estimating indoor signal strength that will help us determine the best position for wireless sensors. Our method will allow saving 15% of sensors. The reduction in the number of sensors provides us economic and energy savings, allowing us to prolong the network lifetime.
    International Journal of Ad Hoc and Ubiquitous Computing 01/2014; 15(1/2/3):68 - 82. DOI:10.1504/IJAHUC.2014.059901 · 0.90 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Due to limited resources and harsh environments, partitioning can be inevitable in wireless sensor networks (WSNs). To re-establish network connectivity, healthy mobile sensor nodes can be repositioned in an on-demand basis. However, the nodes are equipped with limited batteries and their movement requires excessive energy consumption. In this paper, we address the problem of minimising the movement cost when re-establishing network connectivity in delay tolerant WSNs by presenting a distributed heuristic approach based on Game Theory. Compared to centralised heuristics which assume complete knowledge of the network and failures, this approach is self-healing that can work with uncertain network/failure information. Under limited knowledge on partitions and failure locations, Game Theory is used to facilitate decision making on the selection of the nodes to be moved and their movement directions. Extensive simulations have revealed the efficiency of the proposed approach in terms of movement distance and network coverage.
    International Journal of Ad Hoc and Ubiquitous Computing 01/2012; 11(2/3):109 - 124. DOI:10.1504/IJAHUC.2012.050268 · 0.90 Impact Factor
  • Source