Posts

Showing posts from May, 2011

Best Golf Bags For Sale

Image
golf bag golf bags best golf bags golf bag for sale golf bag off golf bag off for slae best golf bags off for sale This Week Only: FREE Shipping To Mainland USA & NO US Sales Tax on All Golf Bags For Sale! Golf Cart Bags Golf Stand Bags Golf Staff Bags Specials for May Callaway X-22 Stand Bag List Price: $208.35 Sale Price: $159.99   Buy Now       TaylorMade Pure-Lite 2.0 Stand Bag List Price: $201.62 Sale Price: $159.99   Buy Now       Callaway Org.14 Xtreme Cart Bag List Price: $195.46 Sale Price: $149.99   Buy Now       Looking for the   best golf bags for sale   online? Then you've come to the right golf store. We carry a wide selection of stand, cart, and staff bags, from major brand names including   Callaway   and   TaylorMade . At Golf Bag Center you can be sure to find the best golf bags to protect your clubs and gear, while giving you the best price on the Internet. A quality bag may not directly improve your game, but it can definit

Security Improvement of Ad-hoc Networks Routing Protocol

Security Improvement of Ad-hoc Networks Routing Protocol ارتقاء امنیت پروتکل های مسیریابی در شبکه های اقتضایی

Game-theoretic approach to mitigate packet dropping in wireless Ad-hoc networks

Image
Game-theoretic approach to mitigate packet dropping in wireless Ad-hoc networks Tootaghaj , Diman Zad   ;   Farhat, Farshid   ;   Pakravan, Mohammad-Reza   ;   Aref, Mohammad-Reza   ;   Information Systems and Security Lab (ISSL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran This paper appears in:     Consumer Communications and Networking Conference (CCNC), 2011 IEEE   Issue Date :    9-12 Jan. 2011   On page(s):  163   Print ISBN:  978-1-4244-8789-9   Digital Object Identifier :     10.1109/CCNC.2011.5766444   Date of Current Version :     12 May 2011 ABSTRACT Performance of routing is severely degraded when misbehaving nodes drop packets instead of properly forwarding them. In this paper, we propose a Game-Theoretic Adaptive Multipath Routing (GTAMR) protocol to detect and punish selfish or malicious nodes which try to drop information packets in routing phase and defend against collaborative attacks in which nodes try to disrupt c

Risk of attack coefficient effect on availability of Ad-hoc networks

Image
Risk of attack coefficient effect on availability of Ad-hoc networks Tootaghaj , Diman Zad   ;   Farhat, Farshid   ;   Pakravan, Mohammad-Reza   ;   Aref, Mohammad-Reza   ;   Information Systems and Security Lab (ISSL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran This paper appears in:     Consumer Communications and Networking Conference (CCNC), 2011 IEEE   Issue Date :    9-12 Jan. 2011   On page(s):  166   Print ISBN:  978-1-4244-8789-9   Digital Object Identifier :     10.1109/CCNC.2011.5766445   Date of Current Version :     12 May 2011 ABSTRACT Security techniques have been designed to obtain certain objectives. One of the most important objectives all security mechanisms try to achieve is the availability, which insures that network services are available to various entities in the network when required. But there has not been any certain parameter to measure this objective in network. In this paper we consider availability as

Game-Theoretic Approach in Network Security, Availability and Privacy

Image
Game-Theoretic Network Simulator   This is GTNS: game theoretic network simulator help document. In order to download GTNS click it. To download samples click it! Introduction: GTNS is a discrete-event network simulator targeted primarily for research and educational use. GTNS is written in Visual C++ programming language and supports different network topologies. This simulator was first produced to implement locally multipath adaptive routing (LMAR) protocol, classified as a new reactive distance vector routing protocol for MANETs. LMAR can find an ad-hoc path without selfish nodes and wormholes using an exhaustive search algorithm in polynomial time. Also when the primary path fails, it discovers an alternative safe path if network graph remains connected after eliminating selfish/malicious nodes. The key feature of LMAR to seek safe route free of selfish and malicious nodes in polynomial time is its searching algorithm and flooding stage that its generated traffic is equi-