Preview

2.3.2: Computation Of Current Trust

Powerful Essays
Open Document
Open Document
1636 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
2.3.2: Computation Of Current Trust
3.2.2. Computation of Current Trust

Let TV(t) represents for a requested node’s historical trust level at the end of time interval t, and

C(t + 1) represents for this node’s capability level on providing service for the next time interval t + 1 (prediction time interval), which includes the remnant utilization ratio of battery, local memory, CPU cycle, and bandwidth at that point. Let TV(t + 1) refers to the same node’s current trust level for the next time interval t + 1.

Assume the fuzzy membership function of TV(t) or TV(t + 1) consists of four fuzzy sets: VeryLow(VL-Malicious node), Low(LSuspect node), Medial(M-Normal trustworthy node) and High(HAbsolute trustworthy node), and the fuzzy member function of C(t + 1) consists of three fuzzy sets: Low(L-Low capability
…show more content…
of Nodes 20,40,60,80 and 100 Area 1000 X 1000 MAC 802.11 Simulation Time 50 sec Traffic Source CBR Rate 100Kb Propagation TwoRayGround Antenna OmniAntenna Attackers 1,2,3,4 and 5

Initial Energy 10.5J Transmission Power 0.660 Receiving Power 0.395

4.2 Performance Metrics

Evaluate performance of the new protocol mainly according to the following parameters. We compare the Trust Based Threshold Revocation (TBTR) [10] scheme with our proposed CTBR scheme.

Average Packet Delivery Ratio: It is the ratio of the number of packets received successfully and the total number of packets transmitted.

Overhead: The overhead is the number of router packets received by the receiver.

Packet Drop: It is the number of packets dropped during the data transmission

Residual Energy: It is the amount of energy remains in the nodes after the flow successful flow transmission.

4.3 Results & Analysis

The simulation results are presented in the next section.

A. Based on Attackers

In our first experiment the number of attackers are varied as 1,2,3,4 and 5 for CBR

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Week 5 6 ILAB SriLakshmi

    • 773 Words
    • 3 Pages

    According to the lab help files it contains random outcomes for the size of generated packets (specified in bytes)…

    • 773 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    3. Indicators: There has been no overt CBRNE activity. The enemy has a CB capability but weapons have not been dispersed or deployed.…

    • 988 Words
    • 7 Pages
    Satisfactory Essays
  • Good Essays

    The Trusted Computing Base (TCB) is the part of a system that is responsible for enforcing system-wide information security policies. The user can define user access to the trusted communication path, which allows secure communication between regular users and the TCB, by installing and…

    • 753 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    of 2 for type-1 calls and 1.6 for type-2 calls (NB: The mean inter-arrival time is the inverse…

    • 958 Words
    • 4 Pages
    Powerful Essays
  • Good Essays

    Securing Windows Media

    • 481 Words
    • 2 Pages

    | Used for receiving packet loss information from clients and providing synchronization information to clients that are streaming by using RTSPU.…

    • 481 Words
    • 2 Pages
    Good Essays
  • Good Essays

    Acute Trust Case Analysis

    • 780 Words
    • 4 Pages

    The second stage (Geraci, 1997) is to assess motivation of the team, and find out the members of the team who are reluctant towards the change, hopefully, this would not occur, as these members of staff will be dealt with in a positive manner, and their strengths built upon, leading to them feeling fulfilled within the project, this will be achieved by using the aforementioned surveys and SWOT analysis. Also, within this stage, solutions can be made regarding any problems that may be encountered when changing the service (Marquis and Huston, 2008). This could be done by using the fishtail diagram, see appendix 5.…

    • 780 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    [11] S. Ketchpel and H. Garc´a-Molina. Making trust exı plicit in distributed commerce transactions. In 16th International Conference on Distributed Computing Systems, 1996. [12] R. A. Malaga. Web-based reputation management systems: Problems and suggested solutions. Electronic Commerce Research, 1(4), 2001. [13] D. W. Manchala. E-commerce trust metrics and models. IEEE Internet Computing, 4(2), 2000. [14] D. H. McKnight and N. L. Chervany. The meanings of trust. Technical Report WP9604, University of Minnesota Management Information Systems Research Center, 1996. [15] L. Ramaswamy and L. Liu. Freeriding: A new challenge for peer-to-peer file sharing systems. In 36th Annual Hawaii International Conference on System Sciences (HICSS-36), 2003. [16] P. Resnick, R. Zeckhauser, E. Friedman, and K. Kuwabara. Reputation systems. Communications of the ACM, 43(12), 2000. [17] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM, 2001. [18] L. Xiong and L. Liu. PeerTrust: A trust mechanism for an open peer-to-peer information system. Technical Report GIT-CC-02-29, Georgia Institute of Technology, College of Computing, 2002. [19] J. E. Youll. Peer to peer transactions in agent-mediated electronic commerce. Master’s thesis, Massachusetts Institute of Technology, 2001. [20] B. Yu and M. P. Singh. A social mechanism of reputation management in electronic communities. In Cooperative Information Agents, 7th International Conference, CoopIS 2000, 2000. [21] G. Zacharia and P. Maes. Trust management through reputation mechanisms. Applied Artificial Intelligence, 14(8), 2000.…

    • 7705 Words
    • 31 Pages
    Powerful Essays
  • Powerful Essays

    1. This will be followed by a description of the fuzzy nature of the problem and a detailed presentation of how the required membership functions are defined.…

    • 2198 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    The receiver utilizes the messages it receives to determine the transit time of each message…

    • 562 Words
    • 3 Pages
    Good Essays
  • Good Essays

    IPv6

    • 1997 Words
    • 8 Pages

    Traffic class (8 bits): Used for QoS. Like the TOS field in IPv4. RFC 2474.…

    • 1997 Words
    • 8 Pages
    Good Essays
  • Powerful Essays

    IEEE 802.15.4 Standard (2003) Part 15.4: Wireless medium access control (MAC) and physical layer (PHY) specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs), IEEE Standard for Information Technology, IEEE-SA Standards Board, 2003. Koubâa A, Alves M, and Tovar E (2006a) Energy/Delay trade-off of the GTS allocation mechanism in IEEE 802.15.4 for wireless sensor networks. IPP-HURRAY Technical Report, HURRAY-TR-060103, (Submitted), Jan. 2006. Koubâa A, Alves M, Tovar E, and Song YQ (2006b) On the performance limits of slotted CSMA/CA in IEEE 802.15.4 for broadcast transmissions in wireless sensor networks. Hurray Technical Report, (submitted). Lu C, Blum BM, Abdelzaher T, Stankovic J, and He T (2002) RAP: A real-time communication architecture for large-scale wireless sensor networks. In IEEE Real-Time and Embedded Technology and Applications (RTAS 2002), Sept. 2002. MICAz datasheet (2004), http://www.xbow.com Mišic J, and Mišic B (2005a) Access delay and throughput for uplink transmissions in IEEE 802.15.4 PAN. Elsevier Computer Communications Journal, vol. 28, N.10, pp.1152-1166, Jun. 2005. Mišic J, Shafi S, and Mišic B (2005b) The impact of MAC parameters on the performance of 802.15.4 PAN. Elsevier Ad hoc Networks Journal, vol. 3, N. 5, pp.509–528, 2005. Park TR, Kim T, Choi J, Choi S, and Kwon W (2005) Throughput and energy consumption analysis of IEEE 802.15.4 slotted CSMA/CA", IEEE Electronics Letters, vol. 41, issue 18, pp. 1017-1019, Sept. 2005. Pollin S, et al. (2005) Performance analysis of slotted IEEE 802.15.4 medium access layer. Technical Report, DAWN Project, Sep. 2005. http://www.soe.ucsc.edu/research/ccrg/DAWN/papers/ZigBee_MACvPV.pdf Shin SY, Choi S, Park HS, and Kwon WH (2005) Packet error-rate analysis of IEEE 802.15.4 under IEEE 802.11b interference. In Proc. of Conference on Wired/Wireless Internet Communications (WWIC '2005), Springer LNCS, vol. 3510, Xanthi (Greece), 11-13 May, 2005. Stankovic J, Abdelzaher T, Lu C, Sha L, and Hou J (2003) Real-Time communication and coordination in embedded sensor networks. Proceedings of IEEE, vol. 91, N. 7, pp.1002-1022. Ye W, Heidemann J, and Estrin D, (2004) Medium access control with coordinated adaptive sleeping for wireless sensor networks. IEEE/ACM Trans. on Networking, vol. 12 , Iss. 3, pp. 493 - 506 Apr. 2004. ZigBee Alliance (2005), ZigBee specification – June 2004, http://www.caba.org/standard/zigbee.html…

    • 5272 Words
    • 22 Pages
    Powerful Essays
  • Powerful Essays

    block codes (OSTBC) is applied to source -destination, sourcerelay and relay-destination link to exploit the maximal diversity…

    • 3946 Words
    • 16 Pages
    Powerful Essays
  • Good Essays

    protocols

    • 1257 Words
    • 6 Pages

    Vehicular Ad Hoc Networks (VANETs) adopt the Public Key Infrastructure (PKI) and Certificate Revocation Lists (CRLs) for their security. In any PKI system, the authentication of a received message is performed by checking if the certificate of the sender is included in the current CRL, and verifying the authenticity of the certificate and signature of the sender. In this paper, we propose an Expedite Message Authentication Protocol (EMAP) for VANETs, which replaces the time-consuming CRL checking process by an efficient revocation checking process. The revocation check process in EMAP uses a keyed Hash Message Authentication Code (HMAC), where the key used in calculating the HMAC is shared only between non-revoked On-Board Units (OBUs). In addition, EMAP uses a novel probabilistic key distribution, which enables non-revoked OBUs to securely share and update a secret key. EMAP can significantly decrease the message loss ratio due to the message verification delay compared with the conventional authentication methods employing CRL. By conducting security analysis and performance evaluation, EMAP is demonstrated to be secure and efficient.…

    • 1257 Words
    • 6 Pages
    Good Essays
  • Powerful Essays

    Sagarxxx

    • 1047 Words
    • 5 Pages

    S.NO 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. PROJECT TITLE Digital Water Marking Secure Data Transmission Intrusion Detection System Snowboards Tanrox Work Force M-banking Mobile Gadgeteer VAS for Hand Held Device Mobile Invoice DCE - DTE Interface In CDMA Finger Graph Generation SIP – Session Initiation Protocol A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc Networks (IEEE) Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode (IEEE) Digital Image Tracing by Sequential Multiple Watermarking (IEEE) Efficient key Agreement for Large and Dynamic Multicast Groups (IEEE) Enhancing Search Performance in Unstructured P2P Networks Based on Users’ Common Interest (IEEE) Extracting Actionable Knowledge from Decision Trees (IEEE) High Resolution Animated Scenes from Stills (IEEE) Location-Based Spatial Query Processing in Wireless Broadcast Environments (IEEE) Long-Term Cross-Session Relevance Feedback Using Virtual Features (IEEE) Provably Secure Three-Party Authenticated Quantum Key Distribution Protocols (IEEE) Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage AJAX Based Online Text Support An Agent Based Testing Approach For Web Application Anti-Theft Library Organizer BULK SMS Cipher data transfer and de-cipher system Client-System Monitoring via Mobile Based Message Integration Corporate Messenger – Always Connected, Stay Connected Desktop controlled Mobile Desktop Email ALERT USING POP3 - SMTP WITHOUT GPRS Desktop IP Phone Desktop E-Mail Reader Digital Image Protector (IEEE) (IEEE)…

    • 1047 Words
    • 5 Pages
    Powerful Essays
  • Powerful Essays

    This term paper provides an overview of topic application of fuzzy automata theory. In this term paper we discuss all formulation of fuzzy automata and also working on fuzzy automata as model of learning system. In this paper we discuss some applications comes under in fuzzy automata theory. Theory of fuzzy sets and fuzzy theory logic has been applied to problem in various fields like topologies, game theory etc also we discuss or described in this term paper. And in this term paper we have also discuss its future work and where we use its applications. There is a deep reason to study fuzzy automata: several languages are fuzzy by nature (e.g.: the language containing words in which many letter “a” occur. That type of stuff comes under in fuzzy automata and all these terms and useful application we all discuss now.…

    • 1323 Words
    • 6 Pages
    Powerful Essays