IJIRST (International Journal for Innovative Research in Science & Technology)ISSN (online) : 2349-6010

 International Journal for Innovative Research in Science & Technology

A Dynamic Trust Computation Model for Secured Communication in Multi-Agent Systems


Print Email Cite
International Journal for Innovative Research in Science & Technology
Volume 5 Issue - 10
Year of Publication : 2019
Authors : Mrs. R. SudhaPriya ; Khirthi Vas G; Manoj Kumar R. P; Balaji Arunachalam K. K; Gowthaman R

BibTeX:

@article{IJIRSTV5I10011,
     title={A Dynamic Trust Computation Model for Secured Communication in Multi-Agent Systems},
     author={Mrs. R. SudhaPriya, Khirthi Vas G, Manoj Kumar R. P, Balaji Arunachalam K. K and Gowthaman R},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={5},
     number={10},
     pages={54--56},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV5I10011.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}



Abstract:

A Wireless Sensor Network (WSN) is a wireless network consisting of spatially distributed independent devices using sensors to monitor physical or environmental conditions. A data has to transferred between peer to peer transmission in more investigate performance by increasing the number of inserted branch. When increasing the number of branch to Increase the time consumption of end to end data delivery. A Transport Protocol is needed in Wireless Sensor Networks to control congestion and ensure reliable delivery of messages from the sensor nodes to the end to end data delivery. Transport Protocol to handle congestion and packet loss recovery in Wireless Sensor Network has been debated to Peer to Peer transmission. The proposed method using a Buffer Bloat Nagle algorithm is used to automatically concatenate a number of Network Buffer. This process increases the efficiency of a network application system by decreasing the number of packets that must be sent. The algorithms rely on measuring the occurrence of packet drops to determine the available bandwidth between two ends of a connection. The peer to peer transmission there is no Centralized Server between sources to destination. With this method, it is shown that even without a Network Buffer, it is possible to achieve better reliability in harsh environments than others well-known methods. In this way, this protocol guarantees the end-to-end data delivery, using a minimum amount of device memory.


Keywords:

Wireless Sensor Network, Buffer Bloat Nagle algorithm, Peer to Peer transmission, Centralized Server


Download Article