Trust Value Algorithm: A Secure Approach against Packet Drop Attack in Wireless Ad-Hoc Networks

Aaseri, Rajendra; Choudhary, Pankaj; Roberts, Nirmal

doi:10.5121/ijnsa.2013.5309

Search citation statements

Order By: Relevance

Paper Sections

Select...

Splay Trees1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

2019

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the help of splaying an element we can bring most frequently used element closer to the root of the tree so that any operation on those elements performed quickly [13] [14]. That means the splaying operation automatically brings more frequently used elements closer to the root of the tree.…”

Section: Splay Treesmentioning

confidence: 99%

A Survey on Different Method of Balancing a Binary Search Tree

2017

IJAERD

View full text Add to dashboard Cite

-This paper empirically examines the various ways of balancing the binary search tree. Since we know how to construct a binary search tree the only thing left is to keep it balanced. Obviously, we will need to re-balance the tree on each insert and delete, which will make this data structure more difficult to maintain compared to non-balanced search trees, but searching into it will be significantly faster.

show abstract

Section: Splay Treesmentioning

confidence: 99%