|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
EBSCO_on1089930891 |
| 003 |
OCoLC |
| 005 |
20231017213018.0 |
| 006 |
m o d |
| 007 |
cr cnu|||unuuu |
| 008 |
190315s2018 xx o 000 0 eng d |
| 040 |
|
|
|a N$T
|b eng
|e rda
|e pn
|c N$T
|d EBLCP
|d N$T
|d OCLCF
|d YDX
|d OCLCQ
|d K6U
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|
| 019 |
|
|
|a 1090175461
|
| 020 |
|
|
|a 9783960676850
|q (electronic bk.)
|
| 020 |
|
|
|a 3960676859
|q (electronic bk.)
|
| 020 |
|
|
|z 9783960671855
|
| 020 |
|
|
|z 3960671857
|
| 035 |
|
|
|a (OCoLC)1089930891
|z (OCoLC)1090175461
|
| 050 |
|
4 |
|a TK5105.77
|
| 072 |
|
7 |
|a COM
|x 013000
|2 bisacsh
|
| 072 |
|
7 |
|a COM
|x 014000
|2 bisacsh
|
| 072 |
|
7 |
|a COM
|x 018000
|2 bisacsh
|
| 072 |
|
7 |
|a COM
|x 067000
|2 bisacsh
|
| 072 |
|
7 |
|a COM
|x 032000
|2 bisacsh
|
| 072 |
|
7 |
|a COM
|x 037000
|2 bisacsh
|
| 072 |
|
7 |
|a COM
|x 052000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.6
|2 23
|
| 049 |
|
|
|a UAMI
|
| 100 |
1 |
|
|a Kumar, C. Sathiya,
|e author.
|
| 245 |
1 |
0 |
|a Secure Self Re-Organizing of Nodes Using Closeness Technique in Cluster MANET /
|c C. Sathiya Kumar, K. Duraiswamy.
|
| 264 |
|
1 |
|a [Place of publication not identified] :
|b Anchor Academic Publishing,
|c 2018.
|
| 300 |
|
|
|a 1 online resource
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 588 |
0 |
|
|a Online resource; title from PDF title page (EBSCO, viewed April 2, 2019).
|
| 505 |
0 |
|
|a Secure Self Re-Organizing of Nodes Using Closeness Technique in Cluster MANET; ABSTRACT; TABLE OF CONTENTS; CHAPTER 1 INTRODUCTION; 1.1 BACKGROUND; 1.2 STATEMENT OF THE PROBLEM; 1.3 SECURITY IN MANET; 1.3.1 Attacks in MANET; 1.3.2 Denial of Service Attack; 1.3.3 Channel Aware Detection; 1.4 NODE CLUSTERING IN MANET; 1.5 PURPOSE OF THE STUDY; 1.6 ORGANIZATION OF CHAPTERS; CHAPTER 2 LITERATURE REVIEW; 2.1 INTRODUCTION; 2.2 A SECURE KEY MODEL FOR EFFICIENT NODECLUSTERING BASED ON REPUTATION AND RANKING; 2.3 A HYBRID APPROACH FOR NODE CO-OPERATIONBASED CLUSTERING IN MANET
|
| 505 |
8 |
|
|a 2.4 EFFICIENT NODE COOPERATION AND SECURITY INMANET USING CLOSENESS -- A DEGREE OF SEPARATION2.5 RESEARCH GAP; 2.6 OBJECTIVES OF THE RESEARCH; 2.7 CONTRIBUTIONS OF RESEARCH; CHAPTER 3 SECURE KEY MODEL WITH REPUTATION ANDRANKING SYSTEM IN MANET; 3.1 INTRODUCTION; 3.2 SECURITY ISSUES IN MANET; 3.2.1 Reputation Based Self Re-Organized Node Clustering; 3.3 SECURE KEY MODEL ON NODE CLUSTERING USINGREPUTATION AND RANKING; 3.4 NODE CLUSTERING BASED ON REPUTATION ANDRANKING; 3.5 GROUP KEY MANAGEMENT; 3.5.1 Need For Group Key Management; 3.6 PSEUDO CODE FOR SECURE KEY MODEL; 3.7 EXPERIMENTAL EVALUATION
|
| 505 |
8 |
|
|a 3.8 RESULTS AND DISCUSSION3.8.1 Malicious Node Detection Efficiency; 3.8.2 Node Reputation; 3.8.3 Performance Rate; 3.8.4 Computational Cost; 3.9 SUMMARY; CHAPTER 4 A HYBRID APPROACH FOR NODE CO-OPERATIONBASED CLUSTERING IN MANET; 4.1 INTRODUCTION; 4.2 NEED FOR NODE CO-OPERATION BASED CLUSTERINGIN MANET; 4.2.1 Challenges of Node Cooperation in MANET; 4.3 HYBRIDIZATION OF NODE CO-OPERATION BASEDCLUSTERING; 4.3.1 Evaluation of Weightage of Node Cooperativeness; 4.3.2 Process of Self-organization and Node Clustering Based onCooperativeness
|
| 505 |
8 |
|
|a 4.3.3 Clustering Based on Weightage and Self Organization of Nodes4.3.4 Node Clustering using HANCC; 4.3.5 Algorithm for HANCC; 4.4 EXPERIMENTAL EVALUATION; 4.5 RESULTS AND DISCUSSIONS; 4.5.1 Node Cooperativeness; 4.5.2 Clustering Energy Dissipation; 4.5.3 Network Lifetime; 4.6 SUMMARY; CHAPTER 5 EFFICIENT NODE COOPERATION AND SECURITY INMANET USING CLOSENESS TECHNIQUE; 5.1 INTRODUCTION; 5.2 VULNERABILITIES OF THE MOBILE AD HOCNETWORKS; 5.2.1 Lack of Secure Boundaries; 5.2.2 Threats from Jeopardize Nodes Inside the Network; 5.2.3 Lack of Centralized Management Facility
|
| 505 |
8 |
|
|a 5.2.4 Restricted Power Supply5.2.5 Scalability; 5.3 ACHIEVING COOPERATION AMONG NODES; 5.4 ENHANCING SECURITY OVER MANET; 5.5 EFFICIENT NODE COOPERATION AND SECURITY INMANET USING CLOSENESS TECHNIQUE; 5.5.1 Algorithmic Flow of ENCS Mechanism; 5.6 PERFORMANCE EVALUATION; 5.7 RESULTS AND DISCUSSION; 5.7.1 Average Information Leakage; 5.7.2 Packet Transmission Efficiency; 5.7.3 Security Level; 5.7.4 Average Cost; 5.8 SUMMARY; CHAPTER 6 PACKET RESERVING AND CLOGGINGCONTROL VIA ROUTING AWARE PACKETRESERVING FRAMEWORK IN MANET; 6.1 INTRODUCTION
|
| 590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
| 650 |
|
0 |
|a Ad hoc networks (Computer networks)
|
| 650 |
|
0 |
|a Computer networks
|x Security measures.
|
| 650 |
|
6 |
|a Réseaux ad hoc (Réseaux d'ordinateurs)
|
| 650 |
|
6 |
|a Réseaux d'ordinateurs
|x Sécurité
|x Mesures.
|
| 650 |
|
7 |
|a COMPUTERS
|x Computer Literacy.
|2 bisacsh
|
| 650 |
|
7 |
|a COMPUTERS
|x Computer Science.
|2 bisacsh
|
| 650 |
|
7 |
|a COMPUTERS
|x Data Processing.
|2 bisacsh
|
| 650 |
|
7 |
|a COMPUTERS
|x Hardware
|x General.
|2 bisacsh
|
| 650 |
|
7 |
|a COMPUTERS
|x Information Technology.
|2 bisacsh
|
| 650 |
|
7 |
|a COMPUTERS
|x Machine Theory.
|2 bisacsh
|
| 650 |
|
7 |
|a COMPUTERS
|x Reference.
|2 bisacsh
|
| 650 |
|
7 |
|a Ad hoc networks (Computer networks)
|2 fast
|
| 650 |
|
7 |
|a Computer networks
|x Security measures
|2 fast
|
| 700 |
1 |
|
|a Duraiswamy, K.
|
| 776 |
0 |
8 |
|i Print version:
|a Kumar, C. Sathiya.
|t Secure Self Re-Organizing of Nodes Using Closeness Technique in Cluster MANET.
|d [Place of publication not identified] : Anchor Academic Publishing, 2018
|z 3960671857
|z 9783960671855
|w (OCoLC)1013721565
|
| 856 |
4 |
0 |
|u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2070386
|z Texto completo
|
| 938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL5735878
|
| 938 |
|
|
|a EBSCOhost
|b EBSC
|n 2070386
|
| 938 |
|
|
|a YBP Library Services
|b YANK
|n 16115340
|
| 994 |
|
|
|a 92
|b IZTAP
|
