tag:blogger.com,1999:blog-47171748213395494392024-03-13T13:25:12.078-07:00NS2Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.comBlogger33125tag:blogger.com,1999:blog-4717174821339549439.post-44418117337200509912020-03-19T18:49:00.001-07:002020-03-19T18:49:11.055-07:00Cryptography and PKI<div dir="ltr" style="text-align: left;" trbidi="on">
<br /></div>
Guys I am working on Public Key Infrastructure so if you need any clarification on those area let me know Ns2 and Ns3 will helps to expert in these ares especially developing their own algorithmsPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com0tag:blogger.com,1999:blog-4717174821339549439.post-15321728710491318032019-06-01T20:13:00.001-07:002020-04-14T06:16:22.978-07:00NS2 and NS3<div dir="ltr" style="text-align: left;" trbidi="on">
<br /></div>
Hi All,
Its been long time and now I am back on research please let me know if anyone need help in TCL or C++ coding will try my best to help you out. Thanks
Regards,
Prasanna RPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com3tag:blogger.com,1999:blog-4717174821339549439.post-11518708519223262392014-11-29T00:14:00.002-08:002014-12-03T19:21:41.745-08:00Xgraph for Throughput, Delay, PDR in Awk script Hi All
Here iam going to explain how to do the xgraph in Ns2
for the any output like
A) Comparison of protocols like TCP & UDP
B) Packet deliver ratio
C) Throughput
D) Delay
Please contact email : clickprasan@gmail.com so that code can be delivered Thanks
Office: Ambattur ,ChennaiPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com17tag:blogger.com,1999:blog-4717174821339549439.post-19738942479054962014-09-23T23:38:00.001-07:002014-09-23T23:38:28.849-07:00Symmetric Key Encryption in Ns2HI All,
Thanks for using my blog , just to explain about the Symmetric key encryption is an algorithm used to encrypt using the cryptography technique and two nodes will share the secret keys (i.e) like an prviate communication and destination node will decrypt it and get the message. The main drawback is comparison of public key.
We can implement the ECC algorithm,RSA,DES and triple DES algorithm that will give more security in network . maximum 70 - 80 percent security can be implemented in network using these algorithm in ns2 .
Email : clickprasan@gmail.com to see the algorithms and simulation results
Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com26tag:blogger.com,1999:blog-4717174821339549439.post-7968451134611958042014-09-18T00:28:00.002-07:002014-09-18T00:28:25.697-07:00Wireless Networking Projects in NS3HI All
NS3 is pretty cool and doing many projects in c++ and Python, please contact clickprasan@gmail.com for ns3 projects will help you on it with less charge. My experience is compare to NS2 , Ns3 have much more graphical interface in terms of NAM simulation and graph. more advance technology added in namespace as well our works in NS2 some protocols are added. please joins us in that research Thanks.
Soon will post a installation procedure and sample codes in NS3 Hope beginners will benefit on it.
Regards,
Prasanna RPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com2tag:blogger.com,1999:blog-4717174821339549439.post-42171128562183219812014-02-25T21:21:00.003-08:002014-02-25T21:22:55.544-08:00Wireless Projects Network Projects IEEE projects Ns2 projects
Dear All
All Network and woreless projects is done any doubts and clarification teaching of ns2 conference, journels alll projects done contact : clickprasan@gmail.com
Note: Please accept only email from above mail id .
Regards,
Prasan
<div dir="ltr" style="text-align: left;" trbidi="on">
<br /></div>
Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com29tag:blogger.com,1999:blog-4717174821339549439.post-62412971163439299182012-02-18T06:41:00.000-08:002012-02-18T06:52:26.663-08:00Cluster formation in NS2 using TCLDear Ns2 Learners,<br /><br />Thanks for this support ,iam once again back for updates,<br /><br />After a long time once again going to update the information:<br /><br />In cluster two types <br /><br />1) static and dynamic<br /><br />Static :<br /><br />Cluster will be formed static suppose all nodes position will be fixed and data exchange between cluster heads,and cluster algorithm is used for that.<br /><br />Like distance calculation and threshold value will be calculated based on that the cluster will be formed .<br /><br />Dynamic :<br /><br />is rally touch one but in ns2 simulation we can try by movement random selectionPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com228tag:blogger.com,1999:blog-4717174821339549439.post-43470059433451750342011-09-20T21:03:00.000-07:002011-09-20T21:04:47.028-07:00NS2 Mobility Model<span style="font-weight:bold;">Mobility models </span><br /><br />Node mobility in MIRACLE is ruled by two classes named BMPosition and GMPosition, derived from Position class. The former utilizes a Basic Movement (BM) model and the latter uses a Gauss-Markov (GM) model. <br />These models are those we provide with the MIRACLE release, but you can feel free to create your own! <br /><br />The Basic Movement model moves nodes in uniform straightforward way. Nodes are moved by setting their destination by using the Tcl command setdest, which accepts as inputs the coordinates of the destination and the speed (in meters per second) of the node. The true position of the node is updated only when needed, e.g. when the destination is changed or a calculation (as freespace attenuation or upon a getPosition() call) is requested by an external module. In this model no control is added about borders of simulation field, so this means that a node, reached the setdest coordinates, will move in that direction and will not stop since a new destination is set. <br /><br />The GMPosition Model is more complex than the previous one. In this case, nodes perform direction changes autonomously and a control of the behavior at borders is provided. Nodes adopting this mobility model requires mean direction (in radians) and a mean speed as inputs. <br />Speed and direction are calculated form mean values given as inputs multiplicating them by a random value, according to the following law (the law for direction is the same): <br /><br />speed_ = (alpha_*speed_) + (((1.0-alpha_))*speedMean_) +<br /> + (sqrt(1.0-pow(alpha_,2.0))*Gaussian());<br /><br />As could be seen, the current (in this case) speed is calculated from previous value of speed and the mean speed, given as input. The incidence of the mean value is controlled by the alpha parameter, which assumes values between 0 and 1. So the variations of speed are due to the ``old'' current speed and a random value provided by the Gaussian() function. It must be noticed that even if speedMean_ is 0, the current speed could be non-zero. As in the previous model, position update is calculated when needed, but in this case every step from previous update is computed (because a gaussian walk is made of several gaussian steps). The time resolution of each step is provided by the updateTime_ variable. <br /><br />There are four different behaviors for nodes reaching boundaries. These are REBOUNCE, HARDWALL, SPHERIC and THOROIDAL. In the first case the node rebounces on the border line, it means that if at least one of the coordinates exceeds the x or y field width it will be carried back in the field by a value equal to the difference between the exceeding coordinate and the field maximal coordinate. For example, if the simulation field is 100 meters wide and the new coordinate is 102 meters, then rebounce algo will carry back coordinate to 98 which is 100 - (102 - 100). <br />The HARDWALL behavior expects that the node stops its movement at the border of the field, if trepassed. In case of SPHERIC behavior the node will be put on the other side of the field, like an overflow. In the last case, THOROIDAL, the node is put at the centre of the field.Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com9tag:blogger.com,1999:blog-4717174821339549439.post-78821695158908148752011-09-20T20:58:00.000-07:002011-09-20T21:03:36.792-07:00Interface of two networks Ns2 Miracle<span style="font-weight:bold;">NS2 Miracle:</span><br /><br />Here iam like to aware about ns2 miracle which connect two interface in the networks for wg if you want to connect the UMTS and VANET you can use this or any two interface can be connected by this ns2 miracle<br /><br />MIRACLE is an extension for the ns2 simulator developed by the Department of Information Engineering at the University of Padova. The acronym stands for Multi InteRfAce Cross Layer Extension and describes one of its new capabilities intoduced by modularity. In fact, using MIRACLE you will be able to manage your nodes in a cross layer fashion and additionally multi technology support (whithin the same node) is provided.<br /><br />The possibility of loading library dinamically has been introduced in standard ns2 simulator, starting from release 33. By now, we will suppose that you are using this simulator or a more recent one. <br /><br />In MIRACLE every modification can constitute a stand alone library and can be loaded when necessary with the load command. In this case modifications could be rapidly intercharged, loading the appropriate library. Furtermore a modification of a library requires only to recompile the code associated to that library and it usually requires some seconds. So you can save memory space (you need only a ns2 distribution) and precious time for debugging and simulations. <br /><br />A motivation for creating the MIRACLE Extension is to fill the gap between ns2 and the simulation of multi technology enviroments and provide the possibility of performing cross layer messaging. This is one of the most advanced field of research and an opportune instrument for simulation is needed. The way MIRACLE reached this goal is a generic and technology independent approach. <br /><br />MIRACLE node is based on generic entities connected by each other. The protocol stack is implemented through entities called Modules. The novel idea consists in allowing presence of more than one Module per layer. Every Module is connected to another entity called Node Core. It goes off the layer ordering scheme and has the task of coordinating message exchange between modules. It also stores the node actual position in the simulation field in order to allow position-dependent calculations such those related to propagation and interference models. <br /><br />There are also another kind of entities connected to the Node Core, called PlugIns. As Node Core, they don't depend on layer classification. Due to their independence from the OSI stack, the PlugIn may be exploited for node coordination functionalities (e.g., cognitive engines and multi interfaces manager) and cross layer intelligence. <br /><br />Communication among different layers is provided by Service Access Points (SAP), accordingly to OSI structure. As in ns2, connections between Modules, NodeCore and PlugIns are made by Connectors, but the latter are completely reprojected to trace packets passing through them according to rules extablished by user.Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com4tag:blogger.com,1999:blog-4717174821339549439.post-79831658946711868072011-06-21T21:13:00.000-07:002011-06-21T21:23:36.731-07:00Upscheduler using Ns2 in WimaxHi Ns2 followers,<br /><br />Here like to share some article regarding the Wimax Upscheduling and downscheduling is ths latest article and some research is going on.<br /><br />Here like to share in terms of Ns2 as well as in the Technial part share my experience incase if missed out or somw wrong excuse me.<br /><br />The existing wimax scheduler( NIST) has the patch file can install in Ns2 to run the wimax . For the uplinking and downlinking some algorithms like Weighted Round Robin(WRR) as uplink scheduler,Deficit Round Robin (DRR) as downlink scheduler are the existing algorithms and interm of wimax static wimax is used to allocate the different Quality of service to allocate and to transfer from one location to another location.<br /><br />Here iam attaching certain reference paper kindly look after it .<br /><br />There are many VOIP channels avaliable to send the file from one to another end i mean source to destination. <br /><br />[1] Deploying license-exempt wimax solutions. Technical<br />report, Intel, 2005.<br />[2] Considerations for deploying mobile wimax at various<br />frequencies. Technical report, Nortel, 2006.<br />[3] The design and implementation of wimax module for<br />ns-2 simulator.<br />http://ndsl.csie.cgu.edu.tw/wimax ns2.php,<br />September 2007.<br />[4] The network simulator ns-2.<br />http://www.isi.edu/nsnam/ns/, September 2007.<br />[5] Seamless and secure mobility.<br />http://www.antd.nist.gov/seamlessandsecure.shtml,<br />September 2007.<br />[6] C. F. Ball, F. Treml, X. Gaube, and A. Klein.<br />Performance analysis of temporary removal scheduling<br />applied to mobile wimax scenarios in tight frequency<br />reuse. European Transactions on Telecommunications,<br />2(16):888{894, September 2005.Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com3tag:blogger.com,1999:blog-4717174821339549439.post-23336887065071787262011-05-22T02:03:00.000-07:002011-05-22T02:04:59.564-07:00Public Key in NS2 (Cryptography)<span style="font-weight:bold;">Public Key in Ns2</span><br /><br />HI everybody here like to brief or just info about the Public Key infrastructure (Pki). Public Key is one of the method for cryptography using digital certificates used to transfer the data safe and securely. Explains how is done in Ns2.General explanation follows<br /><br />Public-key cryptography requires that entities that want to communicate in a secure manner, possess certain security credentials. This collection of security credentials is stored in a wallet. Security credentials consist of a public/private key pair, a "user" certificate, a certificate chain, and "trusted" certificates.<br />The secrecy of encrypted data generally depends on the existence of a secret key shared between the communicating parties. Providing and distributing such secret keys is one aspect of key management. In a multiuser environment, secure key distribution may be difficult; public key cryptography was invented to solve this problem.<br /><br />Public key cryptography is based on a secure secret key pair. Each key (one half of the pair) can only decrypt information encrypted by its corresponding key (the other half of the pair). A key pair includes:<br />• The private key, known only to its owner<br />• The public key, distributed widely, but still associated with its owner<br />Use of the cryptographic key pair to set up a secure, encrypted channel ensures the privacy of a message and validates the authenticity of the sender of the message. It also provides an important benefit: the ability to widely distribute the public key on a server, or in a central directory, without jeopardizing the integrity of the private key component of the key pair. This eliminates the need to transmit the public key to every correspondent in the system.<br />Each entity that participates in a public key system must have a public/private key pair. The public key for an entity is published by a certificate authority (CA) in a user certificate. Then, other entities that want to send it secure information can encrypt the information with the recipient entity's public key. Another use for a public key is for an entity that receives a communication to validate the sender's organizational affiliation.<br /><br /><span style="font-weight:bold;">Main Useful of Public Key</span><br /><br />The PKI approach to security does not take the place of all other security technologies; rather, it is an alternative means of achieving security. The following advantages of PKI have led to its emergence as an industry standard for securing Internet and e-commerce applications.<br /><br />• PKI is a standards-based technology.<br /><br />• It allows the choice of trust provider.<br /><br />• It is highly scalable. Users maintain their own certificates, and certificate authentication involves exchange of data between client and server only. This means that no third party authentication server needs to be online. There is thus no limit to the number of users who can be supported using PKI.<br /><br />• PKI allows delegated trust. That is, a user who has obtained a certificate from a recognized and trusted certificate authority can authenticate himself to a server the very first time he connects to that server, without having previously been registered with the system.<br /><br />• Although PKI is not notably a single sign-on service, it can be implemented in such a way as to enable single sign-on.<br />A certificate authority (CA) is a trusted third party that certifies that other entities--users, databases, administrators, clients, servers--are who they say they are. When it certifies a user, the certificate authority verifies the user's identity and grants a certificate, signing it with the certificate authority's private key. The certificate authority has its own certificate and public key, which it publishes, as well as a private key, which is securely maintained. Servers and clients use the CA's root certificate to verify signatures that the certificate authority has made. A certificate authority might be an external company that offers certificate services, or an internal organization such as a corporate MIS department<br />Public certificates<br /><br />A certificate is like an electronic passport that proves the identity of a user or device that seeks to access the network. The certificate ensures that the entity's information is correct and that the public key actually belongs to that entity. A certificate is created when an entity's public key is signed by a trusted identity (a certificate authority). It contains information such as the following:<br />• the certificate user's name<br />• an expiration date<br />• a unique serial number assigned to the certificate by the CA<br />• the user's public key<br />• information about the rights and uses associated with the certificate<br />• the name of the certificate authority that issued the certificate<br />• the CA's signature<br />• an algorithm identifier that identifies which algorithm was used to sign the certificate<br /><br />A trusted certificate, sometimes known as a root key certificate, typically belongs to a third party entity that is trusted to issue certificates. It is obtained in a secure manner and, operationally, does not need to be validated for its authenticity each time it is accessed because it is self-signed. A client or a server can validate that an entity is who it claims to be by verifying that the entity's certificate was issued by a known and trusted certificate authority.<br />Typically, certificate authorities whom you trust issue the user certificates. Oracle provides several default trusted certificates, so users do not have to install their own. These trusted certificates also enable servers to perform SSL authentication to clients who have wallets containing only trusted certificates.Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com34tag:blogger.com,1999:blog-4717174821339549439.post-56552124947109953582011-05-13T11:57:00.000-07:002011-05-13T12:00:18.826-07:00Synopsis of NS2Hi Students<br /><br />Here like to discuss few points in NS2<br /><br />1) Ns2 is the nice tool using for research and study purpose.<br />2) Mostly Ns2 is made up of C++<br />3) Even other language like Java, Dot net can also use only with separate patches<br />4) Flexible language but difficult to get materials and datas<br />5) Excellent tool for network engineers research people<br /><br /><br />Enjoy learning NS2Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com9tag:blogger.com,1999:blog-4717174821339549439.post-8612737646811744312011-04-05T22:23:00.000-07:002011-04-05T22:24:30.682-07:00Sample Coding in WirelessHere Guys this is an sample tcl coding <br /><br /><br /># Define options<br />set val(chan) Channel/WirelessChannel ;# channel type<br />set val(prop) Propagation/TwoRayGround ;# radio-propagation model<br />set val(netif) Phy/WirelessPhy ;# network interface type<br />set val(mac) Mac/802_11 ;# MAC type<br />set val(ifq) Queue/DropTail/PriQueue ;# interface queue type<br />set val(ll) LL ;# link layer type<br />set val(ant) Antenna/OmniAntenna ;# antenna model<br />set val(ifqlen) 50 ;# max packet in ifq<br />set val(nn) 50 ;# number of mobilenodes<br />set val(rp) DSDV ;# routing protocol<br />set val(x) 1000 ;# X dimension of topography<br />set val(y) 1000 ;# Y dimension of topography <br />set val(stop) 150 ;# time of simulation end<br /><br />set ns [new Simulator]<br />set tracefd [open simple.tr w]<br />set namtrace [open simwrls.nam w] <br /><br />$ns trace-all $tracefd<br />$ns namtrace-all-wireless $namtrace $val(x) $val(y)<br /><br /># set up topography object<br />set topo [new Topography]<br /><br />$topo load_flatgrid $val(x) $val(y)<br /><br />create-god $val(nn)<br /><br /><br /><br /># configure the nodes<br /> $ns node-config -adhocRouting $val(rp) \<br /> -llType $val(ll) \<br /> -macType $val(mac) \<br /> -ifqType $val(ifq) \<br /> -ifqLen $val(ifqlen) \<br /> -antType $val(ant) \<br /> -propType $val(prop) \<br /> -phyType $val(netif) \<br /> -channelType $val(chan) \<br /> -topoInstance $topo \<br /> -agentTrace ON \<br /> -routerTrace ON \<br /> -macTrace OFF \<br /> -movementTrace ON<br /> <br /> for {set i 0} {$i < $val(nn) } { incr i } {<br /> set n($i) [$ns node] <br /> }<br /><br /># Provide initial location of mobilenodes<br />$n(0) set X_ 347.0<br />$n(0) set Y_ 3.0<br />$n(0) set Z_ 0.0<br /><br />$n(1) set X_ 345.0<br />$n(1) set Y_ 36.0<br />$n(1) set Z_ 0.0<br /><br />$n(2) set X_ 330.0<br />$n(2) set Y_ 121.0<br />$n(2) set Z_ 0.0<br /><br />$n(3) set X_ 316.0<br />$n(3) set Y_ 152.0<br />$n(3) set Z_ 0.0<br /><br />$n(4) set X_ 246.0<br />$n(4) set Y_ 90.0<br />$n(4) set Z_ 0.0<br /><br />$n(5) set X_ 379.0<br />$n(5) set Y_ 6.0<br />$n(5) set Z_ 0.0<br /><br /><br /><br /># Set a TCP connection between n(1) and n(31)<br />set tcp [new Agent/TCP/Newreno]<br />$tcp set class_ 2<br />set sink [new Agent/TCPSink]<br />$ns attach-agent $n(1) $tcp<br />$ns attach-agent $n(31) $sink<br />$ns connect $tcp $sink<br />set ftp [new Application/FTP]<br />$ftp attach-agent $tcp<br />$ns at 10.0 "$ftp start" <br /><br /># Set a TCP connection between n(31) and n(43)<br />set tcp [new Agent/TCP/Newreno]<br />$tcp set class_ 2<br />set sink [new Agent/TCPSink]<br />$ns attach-agent $n(31) $tcp<br />$ns attach-agent $n(43) $sink<br />$ns connect $tcp $sink<br /><br />#defining heads<br />$ns at 0.0 "$n(0) label CH"<br />$ns at 0.0 "$n(1) label Source"<br />#$ns at 0.0 "$n(2) label N2"<br /><br /><br /><br />$ns at 10.0 "$n(5) setdest 785.0 228.0 5.0" <br />$ns at 13.0 "$n(26) setdest 700.0 20.0 5.0" <br />$ns at 15.0 "$n(14) setdest 115.0 85.0 5.0" <br /><br />#Color change while moving from one group to another<br />$ns at 73.0 "$n(2) delete-mark N2"<br />$ns at 73.0 "$n(2) add-mark N2 pink circle"<br />$ns at 124.0 "$n(11) delete-mark N11"<br />$ns at 124.0 "$n(11) add-mark N11 purple circle"<br />$ns at 103.0 "$n(5) delete-mark N5"<br />$ns at 103.0 "$n(5) add-mark N5 white circle"<br />$ns at 87.0 "$n(26) delete-mark N26"<br />$ns at 87.0 "$n(26) add-mark N26 yellow circle"<br />$ns at 92.0 "$n(14) delete-mark N14"<br />$ns at 92.0 "$n(14) add-mark N14 green circle"<br /><br /># Define node initial position in nam<br />for {set i 0} {$i < $val(nn)} { incr i } {<br /># 20 defines the node size for nam<br />$ns initial_node_pos $n($i) 20<br />}<br /><br /># Telling nodes when the simulation ends<br />for {set i 0} {$i < $val(nn) } { incr i } {<br /> $ns at $val(stop) "$n($i) reset";<br />}<br /><br /># ending nam and the simulation <br />$ns at $val(stop) "$ns nam-end-wireless $val(stop)"<br />$ns at $val(stop) "stop"<br />$ns at 150.01 "puts \"end simulation\" ; $ns halt"<br />proc stop {} {<br /> global ns tracefd namtrace<br /> $ns flush-trace<br /> close $tracefd<br /> close $namtrace<br />exec nam simwrls.nam &<br />}<br /><br />$ns runPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com293tag:blogger.com,1999:blog-4717174821339549439.post-45175625319617273422010-11-15T06:17:00.000-08:002010-11-15T06:19:48.019-08:00Reduction of Rekeyying process to overcome SecurityHello Peoples<br /><br /> Here This topic is to discuss the overhead problem while continuous rekeying, The experts can suggest idea are the students can discuss about that , actually using the Tree structure other than that new ideas needed . share with usPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com0tag:blogger.com,1999:blog-4717174821339549439.post-35456985483000682352010-10-11T20:17:00.001-07:002010-10-11T20:25:38.395-07:00Installation of Wimax in NS2.31Hello Guys<br /><br /> First of all i like to apologies for delay posting in Ns2 , because busy with my Research area. Now i like to share some thoughts in Wimax 3G, here iam going to give the installation of Wimax in ns 2.31<br /><br /> 1) at present the UMTS and the Wimax 3G research going on the Area6 but now iam posting for startup people to implement the wimax <br /><br /> 2) download ns-allinone-2.31 <br /><br /><br /><br />#########################<br /><br /><br />wimax implementation ....<br /><br /> The patch file is only provided for ns-2.31. <br /> <br /> a- Using the ns-allinone installation<br /> step1: install the patch by running "patch -p0 <patch-ns-2.31-041707" from the ns-allinone-2.31 directory.<br /> step2: re-run "./configure ; make clean ; make" in the ns-2.31 directory.<br /> <br /> b- From the ns-2.31 directory <br /> step1: install the patch by running "patch -p1 <patch-ns-2.31-041707"<br /> step2: re-run "./configure ; make clean ; make" in the ns-2.31 directory.<br /><br />download file from here<br />http://www.mediafire.com/file/apk8x0dvkj6hl5x/wimaximp.rarPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com13tag:blogger.com,1999:blog-4717174821339549439.post-84776197663210310212010-09-20T04:13:00.000-07:002010-09-20T04:19:37.654-07:00RSA algorithm in Ns2RSA This algorithm is used in cryptography Technique in that RSA is added along with it. These are procedures followed<br /><br /><br /><br />Key generation<br /><br />RSA involves a public key and a private key. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key. The keys for the RSA algorithm are generated the following way:<br /><br /> 1. Choose two distinct prime numbers p and q.<br /> * For security purposes, the integers p and q should be chosen uniformly at random and should be of similar bit-length. Prime integers can be efficiently found using a primality test.<br /> 2. Compute n = pq.<br /> * n is used as the modulus for both the public and private keys<br /> 3. Compute φ(pq) = (p − 1)(q − 1). (φ is Euler's totient function).<br /> 4. Choose an integer e such that 1 < e < φ(pq), and e and φ(pq) share no divisors other than 1 (i.e., e and φ(pq) are coprime).<br /> * e is released as the public key exponent.<br /> * e having a short bit-length and small Hamming weight results in more efficient encryption. However, small values of e (such as e = 3) have been shown to be less secure in some settings.[4]<br /> 5. Determine d (using modular arithmetic) which satisfies the congruence relation d e \equiv 1\pmod{\varphi(pq)}.<br /> * Stated differently, ed − 1 can be evenly divided by the totient (p − 1)(q − 1).<br /> * This is often computed using the extended Euclidean algorithm.<br /> * d is kept as the private key exponent.<br /><br />The public key consists of the modulus n and the public (or encryption) exponent e. The private key consists of the private (or decryption) exponent d which must be kept secret.<br /><br />Note:<br /><br /> * An alternative, used by PKCS#1, is to choose d matching e d ≡ 1 (mod λ) with λ = lcm(p-1,q-1), where lcm is the least common multiple. Using λ instead of φ(n) allows more choices for d. λ can also be defined using the Carmichael function λ(n).<br /> * For efficiency the following values may be precomputed and stored as part of the private key:<br /> o p and q: the primes from the key generation,<br /> o d\mod (p - 1) and d\mod(q - 1),<br /> o q^{-1} \mod(p).<br /><br />[edit] Encryption<br /><br />Alice transmits her public key (n,e) to Bob and keeps the private key secret. Bob then wishes to send message M to Alice.<br /><br />He first turns M into an integer 0 < m < n by using an agreed-upon reversible protocol known as a padding scheme. He then computes the ciphertext c corresponding to:<br /><br /> c = m^e\,\bmod\,n<br /><br />This can be done quickly using the method of exponentiation by squaring. Bob then transmits c to Alice.<br />[edit] Decryption<br /><br />Alice can recover m from c by using her private key exponent d by the following computation:<br /><br /> m = c^d\,\bmod{\,n}.<br /><br />Given m, she can recover the original message M by reversing the padding scheme.<br /><br />(In practice, there are more efficient methods of calculating cd using the pre computed values above.)<br />[edit] A worked example<br /><br />Here is an example of RSA encryption and decryption. The parameters used here are artificially small, but one can also use OpenSSL to generate and examine a real keypair.<br /><br /> 1. Choose two prime numbers<br /><br /> p = 61 and q = 53 Make sure that these prime numbers are distinct.<br /><br /> 2. Compute n = pq<br /><br /> n=61\cdot53=3233<br /><br /> 3. Compute the totients of product. For primes the totient is maximal and equals the prime minus one. Therefore \varphi(pq) = (p-1)(q-1) \,<br /><br /> \varphi(61\cdot53) = (61 - 1)\cdot(53 - 1) = 3120\,<br /><br /> 4. Choose any number e > 1 that is coprime to 3120. Choosing a prime number for e leaves you with a single check: that e is not a divisor of 3120.<br /><br /> e = 17<br /><br /> 5. Compute d such that d e \equiv 1\pmod{\varphi(pq)}\, e.g., by computing the modular multiplicative inverse of e modulo \varphi(pq)\,:<br /><br /> d = 2753<br /> since 17 · 2753 = 46801 and 46801 mod 3120 = 1, this is the correct answer.<br /> (iterating finds (15 times 3120)+1 divided by 17 is 2753, an integer, whereas other values in place of 15 do not produce an integer. The extended euclidean algorithm finds the solution to Bézout's identity of 3120x2 + 17x-367=1, and -367 mod 3120 is 2753)<br /><br />The public key is (n = 3233, e = 17). For a padded message m the encryption function is m^{17} \mod {3233} or abstractly:<br /><br /> c = m^e\mod {n}<br /><br />The private key is (n = 3233, d = 2753). The decryption function is c^{2753} \mod {3233} or in its general form:<br /><br /> m = c^d\mod {n}<br /><br />For instance, in order to encrypt m = 65, we calculate<br /><br /> c = 2790 = 65^{17}\mod {3233}<br /><br />To decrypt c = 2790, we tap<br /><br /> m = 65 = 2790^{2753}\mod {3233}.<br /><br />Both of these calculations can be computed efficiently using the square-and-multiply algorithm for modular exponentiation. In real life situations the primes selected would be much larger; in our example it would be relatively trivial to factor n, 3233, obtained from the freely available public key back to the primes p and q. Given e, also from the public key, we could then compute d and so acquire the private key.<br /><br />These Procedures implemented in TCL coding to run in NS2 .For codings and queries please send the mail to admin.Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com92tag:blogger.com,1999:blog-4717174821339549439.post-62221327243881140722010-09-20T03:59:00.000-07:002010-09-20T04:06:56.196-07:00NS2 ProjectsHello Everyone<br /> sorry for not posting about NS2 about two months.I know many students facing difficulties in doing Projects in Ns2. Here iam helping out doing Projects in NS2 ,<br />I can help Masters,PHD students,UG students and also for Researchers.<br />But for doing the Projects Cost will be added .<br /> The services will be available like Online chatting, Voice Chatting,Even remote connection and i will help you people to know about Ns2. Any networking Projects can be done in NS2.<br /><br /> For this please contact to this mail id : clickprasan@gmail.com <br /><br />still more post will be added on this blog keep reading, Ns2 Rocks.<br />still any doubts can ask me are can mail me I will clarify the doubts with my Best.Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com42tag:blogger.com,1999:blog-4717174821339549439.post-58577650616527160742010-07-13T23:11:00.000-07:002010-07-13T23:12:20.905-07:00Ns2 in MAC ProtocolMAC PROTOCOL<br /> Several researchers have proposed simple medications of IEEE 802.11 to incorporate power control. The main idea of these power control schemes is to use different power levels for RTS-CTS and DATA-ACK. Specially, maximum transmit power is used for RTS-CTS, and the minimum required transmit power is used for ATA-ACK transmissions in order to save energy. However, we show that these schemes can degrade network throughput and can result in higher energy consumption than when using IEEE 802.11 without power control. We propose a power control protocol which does not degrade throughput and yields energy saving. <br /><br />A power control mechanism that can be incorporated into the IEEE 802.11 RTS-CTS handshake. The scheme in allows a node, A, to specify its current transmit power level in the transmitted RTS, and allows receiver node B to include a desired transmit power level in the CTS sent back to A. On receiving the CTS, node A then transmits DATA using the power level specified in the CTS. This scheme allows B to help A choose the appropriate power level, so as to maintain a desired signal-to-noise ratio. A similar protocol is utilized, wherein the RTS and CTS packets are sent at the highest power level, and the DATA and ACK may be sent at a lower power level. We refer to this scheme as the BASIC power control MAC protocol. We found that the BASIC scheme has a shortcoming that can degrade the throughput. Furthermore, the BASIC<br /><br />Scheme may potentially increase the energy consumption, instead of decreasing it. We elaborate a power-aware routing optimization, determines routes which consume low energy. PARO chooses a cost function based on the transmit power level at each hop on a<br /><br />Route, to determine a low energy-consuming route between a pair of nodes. PARO also uses a power control MAC protocol similar to BASIC. Several other routing metrics. A power control protocol presented is also similar to the BASIC scheme. It maintains a table for the minimum transmits power necessary to communicate with neighbor nodes. This scheme allows each node to increase or decrease its power level dynamically. However, different power levels among nodes result in asymmetric links, causing col-<br />lesions’ power control protocol proposed in uses one control channel and multiple data channels. A control channel is used to assign data channels to nodes. An RTS, CTS,<br /><br />RES (a special packet), and broadcast packets are transmitted through the control channel using the highest transmit power. By an RTS-CTS handshake, source and destination<br />Nodes decide which channel and what power level to use for data transmissions. On the reception of CTS, the source sends an RES to the destination to reserve a data channel.<br /><br />Then, DATA and ACK transmissions occur on the reserved data channel using the negotiated power level from the RTS-CTS handshake. Transmit power is controlled according to packet size. The proposed scheme is based on the observation<br />that reducing transmission power can result in energy savings, but can also result in more errors. A higher bit error rate can lead to increased retransmissions, consuming more<br /><br />Energy. Thus, the protocol chooses an appropriate transmission power level based on the packet size. An adaptive scheme is also presented in to choose MAC frame<br />Size based on the channel conditions. IEEE 802.11 may result in unfairness (performance degradation) for nodes which use lower transmission power than their neighbor nodes. Poojary et al. propose a scheme to improve the fairness. COMPOW selects a common power level at all nodes in the network to ensure bi-directional links. Each node runs several routing daemons, each at a different power level. The power level is chosen to be the smallest power level which achieves the same level of network connectivity as the highest power level.Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com3tag:blogger.com,1999:blog-4717174821339549439.post-8547865167088589132010-05-20T18:39:00.000-07:002010-05-20T18:40:49.519-07:00Self- Organized Public Key ManagementOverview<br /><br /> A self-organized approach for public key certificates, which is similar to PGP , but unlike PGP it does not depend on the certificate directories for the distribution of certificates. In this key management service the need for the existence of a centralized certification authority is omitted and every node in the network is responsible for generating their keys, issuing, storing and distributing public key certificates. The key management scheme is said to be self-organized, as it does not require any external configuration or management.<br /><br /> The relationship between users of the system is denoted by a directed trust graph G (V, E), where the vertices represent the nodes and an edge E denotes a public key certificate.<br /><br /> The main working principle is, each user maintains a local repository, which contains a limited number of certificates selected by the users based on an algorithm. When a user u wants to verify the public key certificates of another user v, then they merge the local certificate repositories and user u tries to find a certificate chain to user v in the merged repository.<br /><br /> Following sub-sections discusses and analyses the various operations of the self organized key management scheme:<br /><br />Generating Keys, Each user of the system generates its own public key and corresponding private key locally.<br /><br />Issuing Certificates, Each user in the system has the capability to issue a public key certificate. Suppose user u gets a public key of another user v through a secure channel or from another user whom user u trusts. If a user u believes that a public key Kpub belongs to a user v, then it can issue a public key certificate for v, which is signed by u. The system assumes that users are honest and do not issue false certificates. So, if user u issues a public key certificate for user v, then there must exist a directed edge form vertex u to vertex v in the trust graph G (V, E)<br /><br />Storing Certificates, As mentioned earlier, each user of the system maintains a local repository where it stores the public key certificates. The local repository consists of two parts; first, each user stores the certificates that it issues and the certificates issued to it. This is necessary, as in this process all the certificates that have been issued is stored at least once. Along with these each user stores a set of other certificates issued by other users. The later set of certificates is selected using a common algorithm. In terms of the system model, each user u selects a sub graph of the trust graph G (V, E) which consists of the outgoing edges and corresponding vertices from user u and an additional set of selected edges and corresponding vertices.<br /><br />Analysis<br /><br /> This key management scheme that does not require any existing infrastructure and nodes in the networks are responsible for issuing, distributing and storing certificates in a distributed manner. The key management service works like PGP, but instead of using separate directories, it uses the local repositories maintained by each user. Uses of public key cryptography ensure confidentiality and a decentralized approach means that there is no single point of failure. The proposal does not discuss about the scalability issue.<br /><br />Some of the key points need to be mentioned regarding the efficiency of the proposed scheme:<br />• The proposed key management service lacks the certificate revocation mechanism, which is an important issue that should be considered.<br /><br />• The authenticity of a received public key is achieved based on the probability of finding a certificate chain in the merged directory. Though, it was shown that the probability is always high if each user uses the same algorithm. Even though, all nodes may not be honest and issue false certificates. So, there is a risk using this type of model in applications where security and accountability is a prime issue.<br /><br />• As discusses earlier that the proposed scheme is similar to PGP. Like PGP It has a problem in the initial stages of its execution before the number of certificates issued reaches to a certain number consider the scenario shown in fig, where a dashed line represent only friendship and a directed line represents a certificate. Now, if node 9 wants to communicate securely with node 1, it has to find a chain of certificate in the graph. But, as it is the initial stage and only nodes 2,8 and 9 have issued a certificate. So, node 9 has to wait for some other nodes to issue certificates to find a certificate chain between node 1 and 9Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com2tag:blogger.com,1999:blog-4717174821339549439.post-82676439114741569202010-05-20T18:35:00.000-07:002010-05-20T18:39:48.895-07:00Key Distribution in Cluster Formation<span style="font-weight:bold;"> Asymmetric decentralize approaches for key distribution</span><br /><br />As key distribution based on a centralized key management server (i.e., Certification Authority) can leads the whole system to a single point of failure, the idea to share the :ask of key distribution in a distributed manner was attempted. The two schemes in the following sub sections, one is based on a partially distributed CA and another scheme uses a fully distributed certification authority (CA).<br /><span style="font-weight:bold;">Partially distributed certification authority</span><br /><br />Overview <br /><br /> A decentralized approach based on a public key infrastructure for key management where task of the CA is divided to a subset of nodes in the networks. Threshold Cryptography is used for establishing trust among the set of servers and the proposed key management service also uses share refreshing to achieve proactive security.<br /><br />Architecture<br /><br /> The task of the key management service is distributed over a certain number of nodes in the network called servers. The service as a whole has a service private key (skpriv) / public key (skpub). All the nodes in the system know the public key (skpub) of the service and trust any certificates that have been signed with the corresponding private key (skpriv). The normal nodes (i.e., client nodes), can requests to the key management service for other client's public key or for an update of its own public key. Fig shows the architecture of the key management services.<br /><br /> The n servers that are chosen arbitrarily, configured with an (n, H 1) threshold cryptographic scheme, where (n3t+ 1) and t is the maximum number of servers that can be compromised within a given period of time. Each server has its own public (Ki) / private key (ki) pair and knows the public key of all other servers. The private key of the service skpriv is divided into n shares (sl, s2, s3, s4 ..., sn) where each of the n servers gets one share each.<br /><br /><span style="font-weight:bold;">Analysis</span><br /><br /> The key management scheme discussed ensures confidentiality as it uses threshold cryptography and the task of the CA is shared among some nodes. So, there is no single point of failure and authenticated nodes get the service done as and when requested. Thus, it ensures availability and by using share refreshing it keeps the shares of the secret key fresh. The key management service can changes its configuration to changing situations, which helps ensuring the scalability requirement.<br /><br /> Though the management technique is concrete and good one for distributing the task of a CA to a set of servers, it still have some lacking while implementing in a mobile ad hoc network environment from an efficiency point of view:<br /><br />• The scheme do not addresses the issue of certificate revocation mechanism, which is very important for a service implementing public key infrastructure.<br /><br />• It requires that all the server store certificates of all the nodes in the network. In that case, a new certificate is propagated to all the servers. Consider a segmentation of the network, and then a synchronization mechanism between the servers will be required.<br /><br />• The use of public key and threshold cryptography requires a lot of computational tasks, which could consume the energies of small Energy constrained devices used in ad hoc networks.<br /><br />• The availability of the key management service depends on an Assumption that in a given time at most t number of servers can be compromised, where t is the threshold parameter. So, higher the t is chosen, higher the security.<br /><br />• The key management service requires that a given set of nodes do some specific task at a given time, which is suitable for a military environment. In a normal environment nodes may not behave in a pre- defined wayPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com1tag:blogger.com,1999:blog-4717174821339549439.post-42285742909360562252010-04-27T09:28:00.000-07:002010-04-27T09:35:41.942-07:00Wireless examples in Ns2As many one requested iam posting wireless with many examples<br /><br />Here iam posting the sample wireless examples the cluster formation methods<br />for cluster formation many algorithm are there but this is an simple basic wireless example one<br /><br />Along with iam posting ping option in NS2 pinging of nodes<br /><br />any ideas regarding in Ns2 can discuss here<br /><br />http://hotfile.com/dl/40110673/190aa97/ns2eg.rar.htmlPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com119tag:blogger.com,1999:blog-4717174821339549439.post-91737971005141266192010-04-22T18:59:00.000-07:002010-04-22T19:09:05.294-07:00Cluster Formation In ManetThe cluster formation Every group of node is formed together and the arranged in one Group . The main purpose of cluster formation is the reduce the Transfer Rate and allocation of group in to subgroups and finally one leader will be selected.<br /><br />For the Selection of Group various method will be used<br /><br />1) Mine own favorite method is the Finding the near by neighbors and joined as the group <br />2) per group can have any no of nodes but mostly i assume 5 for maintanence<br />3) In cluster formation many groups can be made Inside cluster can also be made <br />4) Like tree structure also be made to reduce the level so reduce the traffic<br />5) These cluster formation many research are made iam also doing certain research and formed particular cluster formation with my algorithm along with existing and obtain a new one <br />6) Since it an combination two members i cannot post the algorithm in my Blog<br /><br />7) so if want the cluster formation mail me I can help for the CodingsPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com213tag:blogger.com,1999:blog-4717174821339549439.post-13112767764727801532010-04-02T20:26:00.000-07:002010-04-02T20:30:33.135-07:00Wireless in Ns2 Example oneHI<br /><br /> Here I like to post the Wireless in Ns2 .Mostly there are two types <br /><br /> 1) Wired <br /> 2) Wireless<br /><br />The main difference in coding extra antenna header files will be added in wireless as well as in the wired little bit tougher than the wireless one now iam posting wireless one in that any doubt you can contact me no problem<br /><br />http://hotfile.com/dl/36019878/37bb647/wireless.rar.html<br /><br />Enjoy learning NS2Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com29tag:blogger.com,1999:blog-4717174821339549439.post-25481723596046812022010-03-24T08:56:00.000-07:002010-03-24T09:01:38.750-07:00Traffic creation in Ns2 and SecenariosHi everybody<br /><br /> Here I give the Link where you can download the Tcl scripts regarding the Traffic generation in Ns2 as well as the Scenarios .<br />This will help to know the Traffic creation in Ns2 .<br /><br />http://hotfile.com/dl/34402030/a7070ed/scenarios.rar.html<br /><br />http://hotfile.com/dl/34402106/5bf2ab6/traffic.rar.html<br /><br />I have many Projects related to NS2 day by day I will keep on Posting Check Regularly.<br />Enjoy the Network Simulation.<br /><br />Any Queries comment it.Prasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com29tag:blogger.com,1999:blog-4717174821339549439.post-30284043732968845832010-03-19T09:20:00.000-07:002010-03-19T09:25:13.820-07:00Let us know about 802.15.4 and ZigBee Routing SimulationBasic<br />1) Version: P802.15.4/D18<br />2) Simulation Platform: NS 2.26 or above<br /> Code Size<br />1) C++ Source Codes: 12k lines<br />2) Tcl Scripts: 500 lines<br />• Functionality<br />1) Pure CSMA-CA and Slotted CSMA-CA<br />2) Legacy application support (802.11b compatible)<br />3) Star and Peer-to-Peer topologies<br />4) Beacon enabled and non-beacon enabled modes<br />5) Beacon tracking and synchronization<br /><br />Functionality <br />– Association and Disassociation<br />– Peer-to-Peer Tree and Cluster Tree Formation<br />– Direct and Indirect (data polling and extraction)<br />transmissions<br />– Energy Detection (ED)<br />– Clear Channel Assessment (CCA)<br />– Link Quality Detection (LQD)<br />– Multiple channel support<br />– Channel Scan (ED/Active/Passive/Orphan)<br />– Filtering (channel, beacon, duplication, interference, etc.)<br />– Simulation Tracing<br />– Deterministic Error Models (Node/Link)<br />– Enhanced Nam Animation<br /><br /><span style="font-weight:bold;">SSCS Interface</span><br /><br />$node sscs startPANCoord <txBeacon = 1> <beaconOrder = 3><br /><SuperframeOrder = 3><br />– This command can be used to start a new PAN, and the<br />corresponding node will serve as the PAN coordinator.<br />– If some parameters are omitted, the default values shown above<br />will be assumed.<br /><br /><span style="font-weight:bold;">– Examples:</span><br />• $node_(0) sscs startPANCoord<br />• $node_(0) sscs startPANCoord 1 2 2<br />• $node sscs startDevice <isFFD = 1> <assoPermit = 1> <txBeacon<br />= 0> <beaconOrder = 3> <SuperframeOrder = 3><br />– This Command can be used to start a device or coordinator.<br />– If some parameters are omitted, the default values shown above<br />will be assumed.<br /><br />– <span style="font-weight:bold;">Examples:</span><br /><br />• $node_(0) sscs startDevice 0 //device<br /><br />• $node_(0) sscs startDevice //coor., non-beacon<br /><br />• $node_(0) sscs startDevice 1 1 1 //coor., beacon enabledLR<br /><br />• $node sscs startCTPANCoord <txBeacon = 1><br /><beaconOrder = 3> <SuperframeOrder = 3><br />– Similar to “startPANCoord”, except it is used to start a<br />Cluster Tree based PAN.<br /><br />• $node sscs startCTDevice <isFFD = 1> <assoPermit =<br />1> <txBeacon = 0> <beaconOrder = 3><br /><SuperframeOrder = 3><br />– Similar to “startDevice”, except it is used to start a Device<br />in a Cluster Tree based PAN.<br /><br />• $node sscs startBeacon <beaconOrder = 3><br /><SuperframeOrder = 3><br />– Start to transmit beacons if originally in non-beacon mode,<br />or change the beacon order and superframe order if<br />originally in beacon mode.<br /><br />• $node sscs stopBeacon<br />– Stop the transmission of beacons<br /><br /><br />Further Tutorials and demo codings and Installation procedure can downloaded from here<br />http://hotfile.com/dl/33586869/ec7b5a8/wpan_zbr.rar.htmlPrasannahttp://www.blogger.com/profile/08379057192176374719noreply@blogger.com14