Steganalysis using eigenvalues
Steganalysis using eigenvalues Eigenvalues-based Steganalysis
Posts
Wireless Mobile Adhoc Network Security Simulator
Farshid Farhat Academic Website Farshid Farhat Assistantship Website Farshid Farhat GooglePage Farshid Farhat GoogleSite Farshid Farhat Weblog Farshid Farhat Picasaweb Farshid Farhat Blogspot coolteenbuddy farshead Farsheed Farhat frashpix sbisc4sharif BLOGSPOTTER FBLOGGER mp3 music playlist Bahram Radan Sanjesh سنجش Sazman Sanjesh سازمان سنجش 300 THE MOVIE (Three Hundred) Mohammad Reza Golzar HEART frash labels frash83 frash next generation Forgotten Dream frash yahoo! 360 Apple iPhone .ir Persian Girl frash Persian Boy Farshid 2002 Farshid 2007 Farshid 2010 Farshid 2001 DREAM Farshid 2006 Farshid 2011 Farshid 2000 فرشید Farshid 2009 Farshid 2004 Farshid 2008 Farshidus فرحت FARHAT سایت گوگل فرشيد فرحت sbisc4sut فراامنیت کودکان خیال Student Branch of Iranian Society of Cryptology شاخه دانشجويی انجمن رمز ایران در دانشگاه صنعتی شریف THURSDAY, AUGUST 19, 2010 Wireless Mobile Ad-hoc Network Security Simulator WMANET Security Simulator Wireless MANETSec Simulator Wireless MANET Sec Sim
Optical-CDMA Network Simulator (OCNS)
Optical CDMA Network Simulator (OCNS) Optical CDMA Network Simulator OCDMA Network Simulator OCNS
Game Theory Network Simulator
Game Theory Network Simulator Game-Theoretic Network Simulator (GTNS) GTNS Student Branch of Iranian Society of Cryptology
Game-Theoretic Network Simulator (GTNS)
Game-Theoretic Network Simulator (GTNS) 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 floo