DocumentCode :
2156756
Title :
Node centrality in wireless sensor networks: Importance, applications and advances
Author :
Jain, Abhishek ; Reddy, B.V.R.
Author_Institution :
GGSIP Univ., New Delhi, India
fYear :
2013
fDate :
22-23 Feb. 2013
Firstpage :
127
Lastpage :
131
Abstract :
Protocols for wireless sensor network are based upon the application for which the network is deployed for. It is also the individual node characteristics which may lead to different network characteristics as well as protocols. Centrality measure defines the importance and role of a node within a network. It also helps in calculating its importance and relationship with its neighboring nodes. Hence centrality measures may help in resolving various inherent problems and developing efficient algorithms for wireless sensor networks. In this paper we present various graph centrality measures that are applicable to wireless sensor networks. The utility and importance of these graph centrality measures have also been discussed. Further we have proposed a new graph centrality measure named as cluster centrality for WSNs.
Keywords :
graph theory; protocols; wireless sensor networks; cluster centrality; graph centrality; graph centrality measurement; individual node characteristics; protocols; wireless sensor networks; Computer architecture; Mobile communication; Peer-to-peer computing; Protocols; Relays; Routing; Wireless sensor networks; Wireless sensor networks; centrality measures; optimization; scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advance Computing Conference (IACC), 2013 IEEE 3rd International
Conference_Location :
Ghaziabad
Print_ISBN :
978-1-4673-4527-9
Type :
conf
DOI :
10.1109/IAdCC.2013.6514207
Filename :
6514207
Link To Document :
بازگشت