The effects of central leader and candidates in Ad Hoc Networks

Title
The effects of central leader and candidates in Ad Hoc Networks
Author(s)
김종근우매리정영석[정영석]
Keywords
QUERY TRANSFORMATION; SOCIAL NETWORKS
Issue Date
201111
Publisher
INT INFORMATION INST
Citation
INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, v.14, no.11, pp.3601 - 3609
Abstract
A leader in a network has important roles to collect data and control the network. Therefore, when a node with high centrality is selected as the leader node in the network, the network can be controlled efficiently, and the amount of network resource consumed in controlling can be reduced. This study proposes a leader election method based on centrality in ad hoc networks. A representative centrality measure of social network analysis (SNA), degree or closeness is used for leader selection criteria. Each node's degree or closeness can be simply calculated by the proposed method, based on the distance matrix which is generated based on adjacency matrix. To minimize the amount of control messages for leader election in ad hoc networks which have limited resources, a tree-based data transmission and candidate nodes election method are proposed. Our experiments show that the complexity of the proposed centrality calculation method is simpler compared with that of Floyd-Warshal algorithm, every node-source shortest paths algorithm. The proposed election method is expected to be used effective for the leader election on the limited resource in ad hoc networks.
URI
http://hdl.handle.net/YU.REPOSITORY/24295
ISSN
1343-4500
Appears in Collections:
공과대학 > 컴퓨터공학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE