iosr-JCE   Volume-1 ~ Issue-1

Paper Type	:	Research Paper
Title	:	Analysis of Binpacking
Country	:	India
Authors	:	Mrs. Nirmala J
	:	10.9790/0661-0110109

ABSTRACT : The main objective of this problem is to pack objects of fixed volume into bins, each of them having a maximum capacity, so as to minimize the total number of bins used. Binpacking is an Np-complete problem as the number items increases, to pack the items in n bins, It cannot be done in polynomial time. Hence we convert the Np problem to P problem in our approach. There are several methods to solve this problem. The most straightforward solution would be the first fit algorithm. Here each object is compared against all the bins to try find the first bin which could accommodate the object. Insert a set of n numbers into as few bins as possible, such that the sum of the numbers assigned to each bin does not exceed the bin capacity, we firstly prove it to be NP problem and solve as P problem after transformation .
Keywords - NP complete, P complete ,Bin Packing

Journal Papers:
[1] Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman.
[2] Martello, S., and Toth, P. 1990a. Bin-packing problem. In Knapsack Problems: Algorithms and Computer Implemen-tations. Wiley. chapter 8, 221–245.
[3] Martello, S., and Toth, P. 1990b. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied.
[4] Mathematics 28:59–70.

Paper Type	:	Research Paper
Title	:	Buffer Overflow Attack
Country	:	India
Authors	:	Samanvay Gupta
	:	10.9790/0661-0111023

ABSTRACT: Exploits, vulnerabilities, and buffer-overflow techniques have been used by malicious hackers and virus writers for a long time. In order to attack and get the remote root privilege, using buffer overflow and suidprogram has become the commonly used method for hackers. This paper include vast idea and information regarding the buffer overflow as history of Vulnerabilities, buffers, stack, registers, Buffer Overflow Vulnerabilities and Attacks, current buffer over flow, Shell code, Buffer Overflow Issues, the Source of the Problem, prevention/detection of Buffer Overflow attacks and Finally how to react towards Buffer Overflows. The objective of this study is to take one inside the buffer overflow attack and bridge the gap between the "descriptive account" and the "technically intensive account"

[1] Michele Crabb. Curmudgeon‟s Executive Summary. In Michele Crabb, editor, The SANS Network SecurityDigest. SANS, 1997. Contributing Editors: Matt Bishop, Gene Spafford, Steve Bellovin, Gene Schultz, Rob Kolstad, Marcus Ranum, Dorothy Denning, Dan Geer, Peter Neumann, Peter Galvin, David Harley, JeanChouanard.
[2] "Aleph One". Smashing The Stack For Fun And Profit. Phrack, 7(49), November 1996.
[3] "Mudge". How to Write Buffer Overflows. http:// l0pht.com/advisories/bufero.html,1997.
[4] Nathan P. Smith. Stack Smashing vulnerabilities in the UNIX Operating System. http://millcomm.com/ nate/machines/security/stack-smashing/natebuffer.ps, 1997.
[5] "DilDog". The Tao of Windows Buffer Overflow.http://www.cultdeadcow.com/cDc_files/cDc-351/, April 1998.
[6] klog. The frame pointer overwrite. Phrack Magazine, 55(9), 1999.
[7] Aleph One. Smashing the stack for fun and pro_t. Phrack Magazine, 49(14), 1996.
[8] C. Cowan, C. Pu, D. Maier, H. Hinton, J. Walpole, P. Bakke,S. Beattie, A. Grier, P. Wagle, and Q. Zhang, "Stackguard:Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks," Proc. Seventh USENIX Security Symp.(Security ‟98), Jan. 1998
[9] T. ckerChiueh and F.-H. Hsu, "Rad: A Compile-Time Solution toBuffer Overflow Attacks," Proc. 21st Int‟l Conf. DistributedComputing Systems (ICDCS), 2001.
[10] R. Chinchani and E.V.D. Berg, "A Fast Static Analysis Approach to Detect Exploit Code inside Network Flows," Proc. Eighth Int‟l Symp.Recent Advances in Intrusion Detection (RAID), 2005.

ABSTRACT:Location aided routing protocol (LAR) is an on demand protocol in MANET which uses GPS in mobile nodes to find the location of node. It calculates routing when it is needed. LAR protocol has two zones namely expected zone and request zone. The expected zone is circular in shape while request zone is rectangular in shape. Expected zone is determined according to the location of destination and request zone is determined according to the location of source node. When communication starts between sources to destination, the node is not within expected zone; packet is dropped. Therefore, packet is lost or destroyed. This paper proposed a method for dropped packet which randomly checks exactly how many packets is dropped during transmission. This paper proposed an algorithm for wireless LAN.
Keywords: Expected zone, GPS, MANET, Request zone, Wireless LAN.

[1] Tracy Camp, Jeff Boleng, Brad Williams, Lucas Wilcox, William Navidi, "Performance Comparison of Two Location Based Routing Protocols for Ad Hoc Networks", Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), pages 1678-1687, 2002.
[2] http://webhome.csc.uvic.ca/~wkui/Courses/wireless/Lecture4.pdf.
[3] Young Bae Ko. and Nitin H. Vaidya, "Location-Aided Routing (LAR) in mobile ad hoc networks", in Proc. 4th annual ACM/IEEE international conference on Mobile computing and networking, 1998.
[4] Young Bae Ko. , Nitin H. Vaidya, "Location-Aided Routing (LAR) in mobile ad hoc networks" Wireless Networks,Vo. 6 issue 4 pp. 307-321,July 2000.
[5] Angajala Srinivasa Rao, Somu Ventateswarku, Gogineni Rajesh Chandra, " LAR Protocol for Ad Hoc Wireless Networks using GPS", March 2009.
[6] V. Hnatyshin, M. Ahmed, R. Cocco, D. Urbano, "A comparative study of location aided routing protocols for MANET" , Wireless Days (WD), IFIP 2011.
[7] F. De Rango, A. Iera, A. Molinaro, S. Marano, "Multi-step increase of the forwarding zone for LAR protocol in ad hoc networks", Proceeding of the 57th IEEE Semiannual Vehicular Technology Conference(2003), Vol. 1, pp. 186 – 190, 2003.
[8] F. De Rango, A. Iera, A. Molinaro, S. Marano, "A modified location-aided routing protocol for the reduction of control overhead in ad-hoc wireless networks" Proceeding of 10th international Conference on Telecommunications (2003), Vol. 2, pp. 1033-1037, 2003.
[9] H. Al-Bahadili, " LAR-1P: An Efficient Hybrid Route Discovery Algorithm for MANETs", Proceeding of the 5th International Workshop on Performance Evaluation for Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 2008), 2008.
[10] Dipankar Deb, Srijita Barman Roy, and Nabendu Chaki, "LACBER: A New Location Aided Routing Protocol For GPS Scarce MANET", International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 1, August 2009.