Abstract
As of the openness and networks infrastructure's absence of DTN's (Delay/Disrupted Tolerant Networks) network node, visiting control and identifying problem becomes the momentous safe menace of DTN networks. This thesis advanced a node identification scheme based on the trustable Merkle Hash Tree (MHT), adopting dynamic programming algorithm to conform the best binary search tree, conforming trustable Merkle Hash Tree according to the best binary search tree, and signing to the value of root node and information serial number in the Merkle Hash Tree, sending the fragmentation to the next node, and provide this fragmentation's identifying chain, information serial number to identify the fragmentation. Analyzing result shows, on the premise of ensuring the safety of Merkle Trustable Tree signature scheme, this scheme has higher safety on increasing node efficiency and resisting invalid signature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
