In wireless mesh network many problems encountered we present a jamming aware traffic allocation in single path as well as multiple path routing. In this paper we observed and consider jamming problem for traffic allocation from source to destination i.e. based on non experience traffic jammed on any network node. We distribute this traffic allocation in lossy network flow optimization problem using portfolio selection theory from financial statistics. We also show multisource traffic allocation from source to destination, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in network utility maximization. We demonstrate the network ability to estimate the impact of jamming, effect of jammer in network, end to end packet success rate and overall network throughput in network. Finally we show the achievable throughput using network simulator.

 

Published In : IJCSN Journal Volume 3, Issue 3

Date of Publication : 01 June 2014

Pages : 17 - 20

Figures : 07

Tables : --

Publication Link : Integration of Signature Based and Anomaly Based Detection

 

 

 

Sagar Tete : received the B.E. degree in computer technology from Nagpur university in Nagpur city in 2006 and M.tech perusing from autonomous institute yeshwantrao chavan college of engineering from Nagpur university, his research interest include wireless sensor network for jamming.

Vaidehi Baporikar : received the B.E degree in information technology from Nagpur university in Nagpur city in 2004 and compted her master degree from G.H. college of engineering in 2006 from Nagpur university and currently working as a associate professor in YCCE, her research include embedded system and wireless sensor network

 

 

 

 

 

 

 

effect of Jammer Mobility on Network

jamming

multiple-path routing

packet Success rates

We studied the problem of traffic allocation in multiplepath routing in the presence of jammers whose effect can only be characterized statistically. We formulated multiple-path traffic allocation in multisource networks as a lossy network flow optimization. We have thus shown that multiple-path source routing can optimize the throughput performance by effectively incorporating the empirical jamming impact into the allocation of traffic to the set of paths. We presented simulation results using network simulator.

 

 

 

 

 

 

 

 

 

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless mesh networks: A survey,” Comput. Netw., vol. 47, no. 4, pp. 445–487, Mar. 2005.

[2] E. M. Sozer, M. Stojanovic, and J. G. Proakis, “Underwater acoustic networks,” IEEE J. Ocean. Eng., vol. 25, no. 1, pp. 72–83, Jan. 2000.

[3] R. Anderson, Security Engineering: A Guide to Building Dependable Distributed Systems. New York: Wiley, 2001.

[4] J. Bellardo and S. Savage, “802.11 denial-of-service attacks: Real vulnerabilities and practical solutions,” in Proc. USENIX Security Symp., Washington, DC, Aug. 2003, pp. 15–28.

[5] D. J. Thuente and M. Acharya, “Intelligent jamming in wireless networks with applications to 802.11 b and other networks,” in Proc. 25th IEEE MILCOM, Washington, DC, Oct. 2006, pp. 1–7.

[6] A. D.Wood and J. A. Stankovic, “Denial of service in sensor networks,” Computer, vol. 35, no. 10, pp. 54– 62, Oct. 2002.

[7] G. Lin and G. Noubir, “On link layer denial of service in data wireless LANs,”Wireless Commun. Mobile Comput., vol. 5, no. 3, pp. 273–284, May 2005.

[8] W. Xu, K. Ma, W. Trappe, and Y. Zhang, “Jamming sensor networks:Attack and defense strategies,” IEEE Netw., vol. 20, no. 3, pp. 41–47, May/Jun. 2006.

[9] D. B. Johnson, D. A. Maltz, and J. Broch, DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks. Reading, MA: Addison-Wesley, 2001, ch. 5, pp. 139–172.

[10] E. M. Royer and C. E. Perkins, “Ad hoc on-demand distance vector routing,” in Proc. 2nd IEEE WMCSA, New Orleans, LA, Feb. 1999, pp. 90–100.

[11] R. Leung, J. Liu, E. Poon, A.-L. C. Chan, and B. Li, “MP-DSR: A QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks,” in Proc. 26th Ann. IEEE LCN, Tampa, FL, Nov. 2001, pp. 132–141.

[12] H. Markowitz, “Portfolio selection,” J. Finance, vol. 7, no. 1, pp. 77–92, Mar. 1952.

[13] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.

[14] D. P. Palomar and M. Chiang, “A tutorial on decomposition methods for network utility maximization,” IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 1439–1451, Aug. 2006.

[15] M. Evans, N. Hastings, and B. Peacock, Statistical Distributions, 3rd ed. New York: Wiley, 2000.

[16] S. W. Roberts, “Control chart tests based on geometric moving averages,” Technometrics, vol. 42, no. 1, pp. 97–101, Feb. 2000.

[17] V. Paxson and M. Allman, “Computing TCP’s retransmission timer,” RFC 2988, Nov. 2000 [Online]. Available: http://www.ietf.org/rfc/ rfc2988.txt

[18] I. R. James, “Products of independent beta variables with applications to Connor and Mosimann’s generalized dirichlet distribution,” J. Amer. Stat. Assoc., vol. 67, no. 340, pp. 910–912, Dec. 1972.

[19] W. F. Sharpe, Investors and Markets: Portfolio Choices, Asset Prices, and Investment Advice. Princeton, NJ: Princeton Univ. Press, 2007.