International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013)

Puzzle Based Packet Encoding Technique for Preventing Jamming Attacks in Wireless Network
Jorvekar Priti Prakash 1, Gunjal Baisa L2, Manish Gangwane3
1
3

M.E. Computer, AVCOE, Sangamner,2 Asst. Prof. Computer Dept. AVCOE, Sangamner 5) Receiver then convert cipher text into Plain text i.e. m )) Verify: m is meaningful. If not: discard m II. RELATED WORK As following figure 1 shows Generic communication system. In this Source first send packet to the channel encoder. when source sends the packet to the channel encoder it automatically generate random puzzle. Then encoded data is send to the interleaver. Main function of interleaver is shuffling. it ramdomly organized data and send it to the Multiplexer. Multiplexer send packet through wireless medium. At Destination side, first it solve the puzzle. if that puzzle is correct then only it will forward the packet other wise it will discard the packet. if puzzle is correct then packet is passed to the De-interleaver. It arrange the data into original form. After that it will send the packet to the Cannel decoder for decoding purpose i.e. it will convert coded data into original form. In this way we provide more security to the packets over the wireless network.

Department of Computer Science & Engineering,Parvara Rural Education Society, Sir Visvesvaraya Institute of Technology, Nashik, INDIA.

Abstract- In this Paper we secure our packets from selective jamming attacks using Puzzle based packet hiding technique. Main Objective of puzzle cryptographic schema to force recipient of a puzzle to execute predefined set of computation before extracting packets. It Provide extra security which not rely on PHY layer but it will cost computation cycles. Puzzle based scheme allows to hide packets temporarily at the time of transmission packets are encrypted randomly with AES and puzzles is send to the receiver for attackers this puzzle is not able to solve so he is able to select packets and not able to generate selective jamming attacks. Keywords - Attacks, Autonomous encoding, Interleaving, Selective Jamming, Wireless Network

I. INTRODUCTION Main Objective of puzzle cryptographic schema to force recipient of a puzzle to execute predefined set of computation before extracting packets. It Provide extra security which not rely on PHY layer but it will cost computation cycles. Puzzle based scheme allows to hide packets temporarily at the time of transmission packets are encrypted randomly with AES and puzzles is send to the receiver for attackers this puzzle is not able to solve so he is able to select packets and not able to generate selective jamming attacks. Puzzle cryptography Algorithm: 1) sender S sending packet m to receiver R by selecting a random key k{0,1} and generate puzzles as follows. P=puzzle(k,tp) Puzzle() function has 2 parameters. k Random key and tp-timestamp 2) Now sender broadcast P to network along with cipher text C C= Ek (,(m)) 3) At the Receiver ,it will received C and P 4) Receiver First solve the puzzle K= solve(P)

Figure 1: Generic communication system

465

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013) III. IMPLEMENTATION Crypto arithmetic is a genre of mathematical puzzles in which the digits are replaced by letters of the alphabet or other symbols. If the same letter occurs more than once, it must be assigned the same digit each time. No two different letters may be assigned the same digit. So, the problem is to find the unique digit corresponding to a unique letter. Crypto arithmetic is the science and art of creating and solving crypto arithmetic. Hunter coined the word alphabetic to designate a crypto arithmetic whose letters form sensible words or phrases. S E N D +M O R E ----------------M O N E Y The worlds best known alphabetic puzzle is SEND+MORE = MONEY. Crypto arithmetic is a suitable example of the Constraint Satisfaction Problem. The constraints of defining a crypto arithmetic problem are as follows: Each letter or symbol represents only one and a unique digit throughout the problem. When the digits replace letters or symbols, the resultant arithmetical operation must be correct. These two constraints lead to some other restrictions in the problem. Consider that the base of the numbers is 10. Then there must be at most 10 unique symbols or letters in the problem. Otherwise, it would not be possible to assign a unique digit to each unique letter or symbol in the problem. To be semantically meaningful, a number must not begin with a zero. So, the letters at the beginning of each number should not correspond to zero. Constraints are specific to the problem. Here are some examples. The puzzle SEND + MORE = MONEY, after solving, will appear like this: SEND 9567 +MORE 1085 ------------MONEY 10652 Search for "0" and "9" in additions or subtractions. A good hint to find zero or 9 is to look for columns containing two or three identical letters. Look at these additions: ***A +***A -----------***A ***B +***A ----------***B

The columns A+A=A and B+A=B indicate that A=zero. In math, this is called the "additive identity property of zero"; it says that you add "0" to anything and it doesn't change, therefore it stays the same. Now, look at the same additions in the body of the crypto arithmetic: *A** +*A** -----------*A** *B** +*A** -----------*B**

In these cases, we may have A=zero or A=9. It depends on whether or not "carry 1" is received from the previous column. In other words, the "9" mimics zero every time it gets a carry-over of "1".Search for "1" in additions Look for left hand digits. If single, they are probably "1". Take the world's most famous crypto arithmetic: SEND +MORE ------------MONEY "M" can only equal 1, because it is the "carry 1" from the column S+M=O (+10). In other words, every time an addition of "n" digits gives a total of "n+1" digits, the left hand digit of the total must be "1". A blind search can eventually find the solutions, if there is any, in a bound time. Given that the base of the number is 10, there may be 10n solutions to be checked in the problem space; where n is the number of unique letters or symbols in the problem. A rule based searching technique can provide the solution in minimum time. When constraints are applied to the problem, if there are any, the solution space to be searched decreases.

466

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013) IV. EXPERIMENTAL RESULT In Figure 2, we show average delay E[D] for completing the file transfer, as a function of Jamming Probability P. In Figure 5, It shows fraction of time that the jammer remains active.

Figure 5: T vs P
Figure 2: E|D|(sec) vs Jamming Probability

V. CONCLUSION In this Puzzle based Autonomous encoding system provide solution against selective jamming attacks in wireless network. This system Provide facilities like packet encoding, Packet Interleaving, and Puzzle based system which Provide More secure packets. As more improvement we added AES algorithm as security symmetric algorithm. REFERENCES
[1] Alejandro Proa.no ,Loukas Lazos, Packet-Hiding Methods for Preventing Selective Jamming Attacks, IEEE Transaction on dependable and Secure Computing, VOL. 9, NO. 1, JAN-FEB 2012. Priti P. Jorvekar , B.L.Gunjal, Autonomous Encoding of Packets Agaist Jamming Attacks in Wireless Network International Journal of Emerging Technology and Advanced Engineering,Page 221224,2013 L. Lazos, S. Liu, and M. Krunz, Mitigating control channel jamming attacks in multi-channel ad hoc networks., In Proceedings of the 2nd ACM conference on wireless network security, pages 169-180, 2009. G. Noubir , G. Lin. Low-power, DoS attacks in data wireless lans and countermeasures. Mobile Computing and Communications Review, 7(3):29-30, 2003. W. Xu, W. Trappe, Y. Zhang, T.Wood, The feasibility of launching and detecting jamming attacks in wireless networks. , In Proceedings of MobiHoc, pages 46-57, 2005. W. Xu, T.Wood,W. Trappe, Y. Zhang Channel surfing and spatial retreats: defenses against wireless denial of service, In Proceedings of the 3rd ACM workshop on Wireless security, pages 80-89, 2004. M. K. Simon, J. K. Omura, R. A. Scholtz, B. K. Levitt Spread Spectrum Communications Handbook, McGraw-Hill, 2001. T. X. Brown, J. E. James, A. Seth, Jamming and sensing of encrypted wireless ad hoc networks, pages 120-130, 2006. M. Wilhelm, I. Martinovic, J. Schmitt, V. Lenders, Reactive jamming in wireless networks: How realistic is the threat?, In Proceedings of WiSec, 2011.

In Figure 3, we show average throughput E[T]as a function of P for completing the file transfer, as a function of Jamming Probability P.

[2]

[3] Figure 3: E[T] vs P

In Figure 4, It show the number of packets that were jammed by the adversary for each value of Probability P.

[4]

[5]

[6]

[7] [8] [9] Figure 4: Packet vs P

467

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013)
[10] Y. W. Law, M. Palaniswami, L. V. Hoesel, J. Doumen, P. Hartel, P. Havinga, Energy-efficient link-layer jamming attacks against WSN MAC protocols, ACM Transactions on Sensors Networks, 5(1):138, 2009. [11] T. Dempsey, G. Sahin, Y. Morton, C. Hopper. Intelligent sensing and classification in ad hoc networks: a case study.Aerospace and Electronic Systems Magazine, IEEE, 24(8):23 -30, August 2009.

468