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

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 pap...

Full description

Saved in:
Bibliographic Details
Main Authors: Erfianto, Bayu, Trilaksono, Bambang Riyanto, Hindersah, Hilwadi
Format: Conference Proceeding
Language:English
Subjects:
Eigenvalues and eigenfunctions
Laplace equations
Mobile communication
Mobile computing
Mobile robots
Network topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ICoICT.2013.6574581