A STUDY OF ACADEMY ACHIEVEMENT OF GOVERNMENT AND NON GOVERNMENT PRIMARY SCHOOL STUDENTS IN RELATION TO REINFORCEMENT
Abstract
Keywords
Full Text:
PDFReferences
. S. Marti, T.J. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad hoc Networks,” Proc. 6th Annual ACM/IEEE Int’l. Conf. Mobile Computing and Networking (Mobicom’00), Boston, Massachusetts, August 2000, pp. 255-265.
. E.M. Royer, and C.-K. Toh, “A Review of Current Routing Protocols for Ad hoc Mobile Wireless Networks,” IEEE Personal Communications, vol. 2, no. 6, April 1999, pp. 46-55.
. S. Ramanathan, and M. Steenstrup, “A Survey of Routing Techniques for Mobile Communications Networks,” Mobile Networks And Applications, vol. 2, no. 1, October 1996, pp. 89-104.
. T. Clausen, P. Jacquet, and L. Viennot, “Comparative Study of Routing Protocols for Mobile Ad hoc Networks,” Med-Hoc-Net’02, Sardegna, Italy, September 2002, 10 pp.
. C.E. Perkins, and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector (DSDV) for Mobile Computers,” Proc. ACM Conf. Communications Architectures and Protocols (SIGCOMM’94), London, UK, August 1994, pp. 234-244.
. T. Clausen, G. Hansen, L. Christensen, and G. Behrmann, “The Optimized Link State Routing Protocol – Evaluation Through Experiments and Simulation,” Proc. 4th Int’l. Symp. Wireless Personal Multimedia Communications, Aalborg, Denmark, September 2001, 6 pp.
. R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, Addison-Wesley, Reading, MA, 2000.
. J. Moy, “Open Shortest Path First (OSPF) Version 2,” RFC 2328, April 1998.
. C.E Perkins, and E.M. Royer, “Ad hoc On-Demand Distance Vector Routing,” Proc. 2nd IEEE Workshop Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
. D.B. Johnson, D.A Maltz, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad hoc Networks,” Ad Hoc Networking, C.E. Perkins, Ed., Addison-Wesley, 2001, 139-172.
. D.B. Johnson, D.A. Maltz, Y.-C. Hu, and J.G. Jetcheva, “The Dynamic Source Routing Protocol for Mobile Ad hoc Networks (DSR),” Internet Draft, draft-ietf-manet-dsr-07.txt, February 2002.
. C.E Perkins, E.M. Royer, and S. Das, “Ad hoc On-demand Distance Vector (AODV),” RFC 3561, July 2003.
. S. Murphy, “Routing Protocol Threat Analysis,” Internet Draft, draft-murphy-threat-00.txt, October 2002.
. K. Zhang, “Efficient Protocols for Signing Routing Messages,” Proc. Symp. Network and Distributed Systems Security (NDSS’98), San Diego, CA, March 1998, pp. 29-35.
. P. Papadimitratos, and Z.J. Haas, “Securing the Internet Routing Infrastructure,” IEEE Communications, vol. 10, no. 40, October 2002, pp. 60-68.
. R. Perlman, “Network Layer Protocols with Byzantine Robustness,” Ph.D. Dissertation, MIT/LCS/TR-429, MIT, October 1988.
. B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An On-Demand Secure Routing Protocol Resilient to Byzantine Failures,” WISE’02, Atlanta, Georgia, September 2002, pp. 21-30.
. J. Lundberg, “Routing Security in Ad hoc Networks,”http://citeseer.nj.nec.com/400961.html
. J.-F. Raymond, “Traffic Analysis: Protocols, Attacks, Design Issues and Open Problems,” Proc. Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 2000, pp. 7-26.
. Y.-C. Hu, A. Perrig, and D.B. Johnson, “Packet Leashes: A Defense Against Wormhole Attacks in Wireless Ad hoc Networks,” Proc. 22nd Annual Joint Conf. IEEE Computer and Communications Societies (Infocom’03), San Francisco, CA, April 2003.
. Y.-C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad hoc Networks,” Proc. 4th IEEE Workshop on Mobile Computing Systems and Applications, Callicoon, NY, June 2002, pp. 3-13.
. L. Zhou, and Z.J. Haas, “Securing Ad hoc Networks,” IEEE Network Magazine, vol. 6, no. 13, November/December 1999, pp. 24-30.
. F. Stajano, and R. Anderson, “The Resurrecting Duckling: Security Issues for Ad hoc Wireless Networks,” Proc. 7th Int’l. Workshop on Security Protocols, Cambridge, UK, April 1999, pp. 172-194.
. K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields and E.M. Royer, “A Secure Routing Protocol for Ad hoc Networks”, Proc. 10th IEEE Int’l. Conf. Network Protocols (ICNP’02), IEEE Press, 2002, pp. 78-87.
. S. Yi, P. Naldurg, and R. Kravets, “Security-Aware Ad hoc Routing for Wireless Networks,” Proc. 2nd ACM Symp. Mobile Ad hoc Networking and Computing (Mobihoc’01), Long Beach, CA, October 2001, pp. 299-302.
. P. Papadimitratos, and Z.J. Haas, “Secure Routing for Mobile Ad hoc Networks,” Proc. Communication Networks and Distributed Systems, Modeling and Simulation Conf. (CNDS’02), San Antonio, Texas, January 2002, pp. 27-31.
. A. Perrig, R. Canetti, D. Song, and J.D. Tygar, “Efficient and Secure Source Authentication for Multicast,” Proc. Symp. Network and Distributed Systems Security (NDSS’01), San Diego, California, February 2001, pp. 35-46.
. Y.-C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad hoc Networks,” Proc. 8th ACM Int’l. Conf. Mobile Computing and Networking (Mobicom’02), Atlanta, Georgia, September 2002, pp. 12-23.
. T. Imielinski, and J.C. Navas, “GPS-based Geographic Addressing, Routing, and Resource Discovery,” Communications of the ACM, vol. 42, no. 4, April 1999, pp. 86-92.
. S. Toner, and D. O'Mahony, “Self-Organising Node Address Management in Ad hoc Networks,” Personal Wireless Communications, IFIP-TC6 8th Int’l. Conf. (PWC 2003), 2003, pp. 476-483.
. S. Buchegger, and J.-Y. Le Boudec, “Performance Analysis of the CONFIDANT Protocol (Cooperation Of Nodes: Fairness In Dynamic Ad hoc NeTworks),” Proc. 3rd Symp. Mobile Ad hoc Networking and Computing (MobiHoc 2002), ACM Press, 2002, pp. 226-236.
. P. Papadimitratos, and Z.J. Haas, “Secure Link State Routing for Mobile Ad hoc Networks,” Proc. IEEE Workshop on Security and Assurance in Ad hoc Networks, IEEE Press, 2003, pp. 27-31.
. S. Capkun, and J.-P. Hubaux, “BISS: Building Secure Routing out of an Incomplete Set of Security Associations,” Proc. ACM Workshop on Wireless Security, ACM Press, 2003, pp. 21-29.
. B. Schneier, Applied Cryptography – Protocols, Algorithms and Source Code in C, 2nd Ed., John Wiley & Sons, Inc., 1996.
. D. Eastlake, and P. Jones, “US Secure Hash Algorithm 1 (SHA1),” RFC 3174, September 2001.
. R. Rivest, “The MD5 Message-Digest Algorithm,” RFC 1321, April 1992.
Refbacks
- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution 4.0 International License.
Copyright © 2018 INTERNATIONAL EDUCATION AND RESEARCH JOURNAL
Comments on this article
by Gabriela Dias (2018-04-24)
by Ana Luiza da Mata (2018-04-24)
by Gabriela Dias (2018-04-24)
by Davi Lucca Mendes (2018-04-25)
by João Cauã Ferreira (2018-04-25)
by Davi Lucca Mendes (2018-04-26)
by João Theo Ramos (2018-04-26)