• DocumentCode
    628101
  • Title

    Signal strength-based adjacency matrix and its eigenvalue in mobile robotic networks

  • Author

    Erfianto, Bayu ; Trilaksono, B. Riyanto ; Hindersah, Hilwadi

  • Author_Institution
    Sch. of Electr. Eng. & Inf., Inst. Teknol. Bandung, Bandung, Indonesia
  • fYear
    2013
  • fDate
    20-22 March 2013
  • Firstpage
    247
  • Lastpage
    252
  • Abstract
    Generally the adjacency matrix is constructed as the function of distance between two nodes in unit disk graph. Although the distance between both robots meet the requirement to form adjacency matrix, however, actually the reliable communication is determined by the function of distance. In this paper, the adjacency matrix that express connectivity in mobile robotic networks are expressed by means of the quality of received wireless signal, which is indicated by received signal strength indicator (RSSI) value. The metric measured in this paper is second semallest eigenvalue or λ2, that represents the connectedness of communication topology in mobile robotics networks. As the results from the simulation, it is shown that the rssi-based adjacency model still satisfy the requirement of connectedness, that is λ2 > 0.
  • Keywords
    eigenvalues and eigenfunctions; graph theory; matrix algebra; mobile robots; RSSI-based adjacency model; communication topology; eigenvalue; mobile robotic networks; received signal strength indicator value; signal strength-based adjacency matrix; unit disk graph; wireless signal; Eigenvalues and eigenfunctions; Laplace equations; Mobile communication; Mobile computing; Mobile robots; Network topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information and Communication Technology (ICoICT), 2013 International Conference of
  • Conference_Location
    Bandung
  • Print_ISBN
    978-1-4673-4990-1
  • Type

    conf

  • DOI
    10.1109/ICoICT.2013.6574581
  • Filename
    6574581