NS2

— L'intérêt pour les réseaux de capteurs sans fil s'est considérablement accru. Ils ont fait l'objet de plusieurs travaux de recherche ces dernières années. Néanmoins, ces réseaux sont confrontés à de multiples problèmes. Parmi ces problèmes nous trouvons celui de la localisation. Ce dernier, a reçu une attention importante car plusieurs applications ont besoin de l'information de localisation des capteurs. Ainsi, de nombreux systèmes et algorithmes de localisation ont été proposés pour ce type de réseaux. Dans ce papier nous avons effectué une étude comparative entre les deux protocoles de localisation AT-Free et HT-Refine. Nous avons évalué les performances et discuter les résultats obtenus par simulation.

Wireless Sensor Network (WSN) is an infrastructure less that has no central administration and limited capabilities in term of energy, power consumption, and data storage capacity. Furthermore, WSNs are key technologies for IoT. The routing protocol is one of the most concerned areas in WSNs which is responsible for maintaining the routes in such that network. In this paper, we aim to enhance the security of WSN routing protocol. Our contribution is modified Ad Hoc On-Demand Distance Vector (AODV) routing protocol by building a security layer that utilizes Paillier homomorphic cryptographic mechanism; to protect forwarding packet data and routing during the communication and deliver data integrity and confidentiality The simulation is carried on NS-2 and the results of the proposed scheme are compared to the fundamental AODV routing protocol, these results are examined on various network performance metrices such as packet delivery ratio, throughput and end-to-end delay.

A Network which is form spontaneously by the collection of wireless nodes without any centralized administration or already existing network infrastructure called Mobile Ad-hoc Network (MANET). Performance evaluation of different Ad-Hoc networks routing protocols viz. DSDV, AODV & DSR on the basis of four parameter such as Packet delivery ratio, throughput, packet drop and routing overhead is main objective of this paper. NS-2, which is a discrete event simulation tool, is used in which The Tool Command Language (TCL) is used for simulation of varying parameter for routing algorithm. Importance of selection criteria of routing protocols in dynamic environment is illustrated in the result of this work.

—Mobile ad-hoc networks are autonomous networks of intelligent mobile nodes. Designing an efficient routing protocol with goal efficient route establishment is still a burning research issue. Routing protocols are broadly classified into proactive and reactive protocols on the basis of their nature of working. In this paper, we present comparative simulation analysis of two proactive protocols namely, Optimized Link State Routing (OLSR) and Destination-Sequenced Distance Vector (DSDV). Simulations have been carried out multiple times using Network Simulator-2.35 (NS-2.35), on random scenario patterns and compared in two environments (OLSR and DSDV) by varying the network size and mobility of nodes. We have patched and installed OLSR protocol on NS-2.35 as it's not available as a part of NS-2.35 installation. The simulation results indicate that, OLSR perform better than DSDV protocol for application oriented metrices such as packet delivery fraction, packet loss and end-to-end delay. But, Routing Overheads is significantly consistently higher for OLSR protocol in all the cases considered, which is proven experimentally. Furthermore, based upon the simulation results, work can be done in the direction of improving the performance of the OLSR protocol to make it a choice of proactive protocol for large and denser network.

As the enormous use of internet increases day by day so as security concern is also raise day by day over
the internet. In this paper we discuss the network security and its related threats and also study the types of
protocols and few issues related to protocols in computer networks. We also simulate the design of 5 node
wired network scenario, its packet drop rate analysis through TCP protocol using NS2 as a simulator.
Analyzed the performance of 5-node network when the packet is drop down by graphical method also
called as Xgraph when rate parameter is in mb and also analyzed the performance of same network by
changing the value of rate parameter at same time so no packets would drop down at same time and also
analyzed the performance by Xgraph method.

This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations

2016 - 2017 IEEE NS2 PROJECT TITLES for M.E., M.Tech., B.E., B.Tech., MCA, M.Phil, Ph.D. Students in Mobile Ad-hoc Networks, MANET, Manet Routing, Manet Security, Wirless Sensor Networks, WSN Routing, WsN security, Wirless sensor network security, VANET, Vechicular Ad-hoc Netweork, Wireless Communication Titles for ECE, CSE, IT STudents in NS2. Ns2 projects in Online, Ns2 projects in Chennai, Ns2 projects in Pondicherry

In MANET, the mobiles nodes are connected dynamically with the help of wireless links without
having a fixed infrastructure or centralized administration. These nodes move freely and organize
themselves arbitrarily thus change the network topology rapidly and unpredictably. As a result, there exits
frequent link breakages which leads to path failures and route discoveries. The route discovery can lead to
overhead which cannot be neglected. Therefore, the fundamental challenge of MANET is to develop a
dynamic routing protocol that efficiently establish routes to deliver the packets with minimum overhead,
high throughput and low end to end delay. In order to handle overhead issues, the proposed system has
presented a novel scheme rebroadcast delay and a rebroadcast probability which will help to reduce the
number of retransmissions thereby improving routing performance. In addition, the proposed system is
compared with existing routing protocol AODV in terms of packet delivery ratio, packet loss and end to
end delay

Mobile Ad-hoc Networks (MANETs) are a cluster of self-organizing and self-governing wireless nodes without any backbone infrastructure and centralized administration. The various nodes in MANET move randomly, and this node mobility may pose challenges on the performance of routing protocols. In this paper, an Intra and intergroup performance review of various MANET routing protocols are performed under varying speed of nodes. The routing protocols included in this study are reactive, proactive, and hybrid protocols. This performance review is done using the NS2 simulator and random waypoint model. The routing protocols performance is assessed through standard performance measure metrics including packet delivery ratio, throughput, routing overhead and end to end delivery with varying speed of nodes. The simulations result shows that there is no significant impact of varying speed of nodes on standard performance evaluation metrics. 1. INTRODUCTION With the development of cutting edge technology enabled powerful portable devices and availability of cost effective wireless communication, mobile ad-hoc networks (MANETs) are gaining popularity. MANETs are deploying for different applications ranging from military to natural disaster management. Mobile Ad Hoc Networks (MANETs) connects wireless mobile nodes which have an arbitrary motion which makes the topology unpredictable [1],[2]. It is self-organizing and self-configuring and can be deployed without any wired base stations or infrastructure support. The mobile nodes act as hosts and also as routers to send the data across the networks. A MANET is a collection of free mobile nodes such as laptops, smartphones, tablet PC, etc. It has many characteristics. In MANETs, there is no central server and nodes themselves are responsible for communicating with other nodes to carry out network operations such as on-demand routing[3]. Nodes are free to move anywhere whenever and wherever they want, and they are also free to change their speeds [4]. Therefore, the network topology changes randomly and at uncertain times. Nodes can send messages to other nodes which are not in range or nor directly connected with the help of intermediate nodes [5]. MANET has many advantages. It is scalable as it supports the addition of more mobile nodes in the network. The information can be accessed irrespective of the geographic position of nodes [5]. The use of mobile nodes results in many connection failures. The routing protocols are designed to handle these situations [6]. MANETs are fault tolerant. The main advantage is that the nodes do not need wireless routers to connect to the internet[7].Therefore, it reduces the cost of deploying a router and affordable than a

This paper attempts to establish the fact that Multi State Network Classification is essential for performance enhancement of Transport protocols over Satellite based Networks. A model to classify Multi State network condition taking into consideration both congestion and channel error is evolved. In order to arrive at such a model an analysis of the impact of congestion and channel error on RTT values has been carried out using ns2. The analysis results are also reported in the paper. The inference drawn from this analysis is used to develop a novel statistical RTT based model for multi state network classification. An Adaptive Multi State Proactive Transport Protocol consisting of Proactive Slow Start, State based Error Recovery, Timeout Action and Proactive Reduction is proposed which uses the multi state network state classification model. This paper also confirms through detail simulation and analysis that a prior knowledge about the overall characteristics of the network helps in enhancing the performance of the protocol over satellite channel which is significantly affected due to channel noise and congestion. The necessary augmentation of ns2 simulator is done for simulating the multi state network classification logic. This simulation has been used in detail evaluation of the protocol under varied levels of congestion and channel noise. The performance enhancement of this protocol with reference to established protocols namely TCP SACK and Vegas has been discussed. The results as discussed in this paper clearly reveal that the proposed protocol always outperforms its peers and show a significant improvement in very high error conditions as envisaged in the design of the protocol. The protocol is also evaluated to have very good fairness property under different error conditions.

A mobile adhoc network is a collection of wireless mobile nodes dynamically creating a temporary network without usage of any prevailing network infrastructure or consolidated management. Several routing protocols like Dynamic Source Routing (DSR), Adhoc On-Demand Distance Vector Routing (AODV) and Destination Sequenced Distance-Vector (DSDV) have been implemented. In this paper, an attempt has been made to compare the performance of two prominent on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol. A simulation model with MAC and physical layer models is used to study interlayer interactions and their performance inferences. The On-demand protocols, AODV and DSR perform better than the table-driven DSDV protocol. Although DSR and AODV share similar on-demand performance, the differences in the protocol mechanics can lead to significant performance differentials. A variation of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. The performance analysis is evaluated by means of varying network load, mobility, and network size. These simulations are conceded out based on the Rice Monarch Project that has made considerable additions to the NS-2 network simulator to track adhoc simulations.

The wireless communication is advancement in sensor network which motivates the wireless sensor networking. Network technologies are traditionally based on wireline solutions. But the introduction of the IEEE 802.11 standards have made a huge impact on the market such that laptops, PCs, printers, cellphones, and VoIP phones, in our homes, in our offices and also in public areas have incorporated the wireless LAN technology. Wireless broadband technologies nowadays provide unlimited broadband access to users which were previously offered only to connection oriented users. In this thesis IEEE 802.11, which is a set of physical layer standard for implementing wireless local area network computer communication in the 2.4,3.6,5 and 60GHz frequency band is compared with IEEE 801.11 extension by taking various parameters like throughput, packet delivery ratio and packet drop ratio etc. the simulation is done using NS2 simulator by taking 20,40 and 80 nodes for both IEEE 802.11 as well as IEEE 802.11 extension.

By virtue of their robustness, cost-effectiveness, self-organizing and self-configuring nature, WMNs have emerged as a new network paradigm for a wide range of applications, such as public safety and emergency response communications, intelligent transportation systems, and community networks. It is anticipated that WMNs will not only resolve the limitations of wireless ad hoc networks, local area networks (WLANs), personal area networks (WPANs), and metropolitan area networks (WMANs) but also significantly improve such networks’ performance. One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. In this paper, it is proposed to evaluate the performance of two different channel assignment schemes namely common channel assignment (CCA) and centralized tabu-based search algorithm under WCETT routing protocols for varying traffic load in terms of packet delivery ratio, throughput, average end to end delay and routing overhead using NS2 network simulator. WCETT protocol uses the weighted sum of the cumulative expected transmission time and the maximal value of efficient channels among all channels.

ABTRACT A mobile adhoc network is a collection of wireless mobile nodes dynamically creating a temporary network without usage of any prevailing network infrastructure or consolidated management. Several routing protocols like Dynamic Source Routing (DSR), Adhoc On-Demand Distance Vector Routing (AODV) and Destination Sequenced Distance-Vector (DSDV) have been implemented. In this paper, an attempt has been made to compare the performance of two prominent on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol. A simulation model with MAC and physical layer models is used to study interlayer interactions and their performance inferences. The On-demand protocols, AODV and DSR perform better than the table-driven DSDV protocol. Although DSR and AODV share similar on-demand performance, the differences in the protocol mechanics can lead to significant performance differentials. A variation of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. The performance analysis is evaluated by means of varying network load, mobility, and network size. These simulations are conceded out based on the Rice Monarch Project that has made considerable additions to the NS-2 network simulator to track adhoc simulations.

Extensive use of wireless networks in different fields increases the need to improve their performance, as well as minimize the amplitude of loss messages. Device mobility, where there is no standard topology that can be applied or fixed routing that can be designed, is a topic that received recent attention in wireless networks. In a Mobile Ad Hoc Network (MANET), some nodes may join the network while others may leave. In this paper, we analyze a MANET’s performance for two proactive protocols; Ad Hoc On-Demand Distance Vector (AODV) Protocol, and Dynamic Source Routing (DSR) Protocol. By using network simulator NS2, we setup and evaluate the performance of AODV and DSR protocols with respect to the packets’ size.

In last three decade ,tremendous improvement is made in research area of wireless adhoc network and now a days ,one of the most attractive research topic is inter vehicle communication i.e. realization of mobile adhoc network . A rich literature is available in vehicular networksto explore the special characteristics of VANET but all the protocols are majorly geography based.So to explore much in this context we compare from the literature ,the environment for MANET and VANET and then we choose AODV as the base protocol for evaluation.Simulation is performed on Ns-2.34.Based on the simulation results obtained ,the performance of AODV is analysed and compared in different density and velocity variants with respect to packet delievery ratio.

Worldwide Interoperability for Microwave Access (WiMAX) is one of the most promising technologies for the next generation networks as it provides high data rates at medium and long range with full support of mobility. The technology is based on IEEE 802.16 standards and amendments specifying the MAC and PHY layers for fixed, nomadic, portable and mobile access. High speed mobility scenarios require low
delay handover so as not to degrade end-to-end QoS  indicators, such as delay time or data loss, that are significantly more affected. The WiMAX Forum Network Working Group aims to provide methods for controlled transition of the MS between BSs without significant loss of data or decreased QoS. It has been observed that prediction-based methods reduce handover latency and by the way the packets loss rate. In
this paper we use the linear regression model to build a predictive hard handover algorithm that predict the Received Signal Strength Indicator (RSSI) value and advertize the MS to trigger the scanning procedure and the handover process operations reducing so the total handover latency and packets loss rate. The numerical analysis and simulation results show that the proposed method significantly reduces the handover latency and the packets loss rate.

One of the most important factors in evaluating the performance of routing protocols in MANET is the variation in received signal strength known as fading. Different types of routing protocols have been proposed based on the propagation models that neglect the effect of fading. The choice of propagation models have a great impact on performance, so realistic models are necessary to consider the effect of fading as far as an accurate analysis of performance of the routing protocols is concerned. In this paper, comparative analysis of proactive protocol is performed using NS2, in order to study the impact of propagation model with various topologies. The non-fading models such as free space and two ray ground are simulated for comparison. The simulation results show that the propagation models have a great role in routing protocol of MANET.

The increasing demand for real-time applications has made the Quality of Service (Qos) support for wireless sensor networks (WSN) a fairly new research framework. In this paper, we propose an extended model of the Beacon enabled IEEE 802.15.4 including the Guaranteed Time Slot GTS allocation
mechanism in the aim to analyze and evaluate network performances. Series of extensive simulations were performed to analyze the impact of the Beacon Order BO and the Superframe Order SO on the network performance based on commonly known metrics. In particular, we examine data packet delivery performance and the throughput for different duty cycle rates. Also, we analyze the impact of the number
of nodes on collision probability. Thus, for high number of nodes, collision becomes higher and the reachability begins to decline slightly. We discuss and compare simulation results conducted under various parameter settings to the IEEE 802.11network.

Future mobile Ad hoc networks (MANETs) are expected to be based on all-IP architecture and be capable of carrying multitudinous real-time multimedia applications such as voice, video and data. It is very necessary for MANETs to have a reliable and efficient routing and quality of service (QoS) mechanism to support diverse applications which have variances and stringent requirements for delay, jitter, bandwidth, packet loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with the minimum hop count as the main metric for path selection, hence are not suitable for delay sensitive real time applications. To support such applications delay constrained routing protocols are employed. These Protocols makes path selection between source and destination based on the delay over the discovered links during routing discovery and routing table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on delay constraint. It employs cross-layer communications between MAC and routing layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay incurred at each intermediate node. The performance of the proposed protocol is compared with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and reduced overhead between intermediate nodes.

This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations

Mobile ad hoc networks are self-organizing and self-configuring multi-hop wireless networks capable of adaptive re-configuration when they are affected by node mobility. A mobile ad hoc network is composed of peer nodes with equal networking capabilities which are able to function as mobile routers i.e., to forward packets and maintain routes. Packets can be forwarded in multi-hops from the source nodes to the destination nodes with no need for underlying fixed network infrastructure (e.g. routers and base stations). Therefore, mobile ad hoc networks are not constrained in their deployment by any need for underlying infrastructure and they can be deployed rapidly in situations where wireless access to a backbone is impossible and an infrastructure is difficult to install (e.g., disaster recovery). In mobile ad hoc networks (MANETs), the network topology is autonomously formed and continuously changes, due to the mobility of the nodes. Clustering allows us to organize the topology in a structured manner. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence reconfiguration of the system is often unavoidable. Several existing on-demand clustering algorithms update that topology if needed. In this paper, an improvement to the existing clustering algorithm is done under the energy parameter specification. The effective route is here defined for clustered communication. An inter cluster and intra cluster communication is here performed under mobility vector. In this work, distance and energy adaptive algorithm is suggested to generate the effective communication route and analyze the work under different parameters which enhances the stability of the network in a more efficient way.

By virtue of their robustness, cost-effectiveness, self-organizing and self-configuring nature, WMNs have emerged as a new network paradigm for a wide range of applications, such as public safety and emergency response communications, intelligent transportation systems, and community networks. It is anticipated that WMNs will not only resolve the limitations of wireless ad hoc networks, local area networks (WLANs), personal area networks (WPANs), and metropolitan area networks (WMANs) but also significantly improve such networks’ performance. One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. In this paper, it is proposed to evaluate the performance of two different channel assignment schemes namely common channel assignment (CCA) and centralized tabu-based search algorithm under WCETT routing protocols for varying traffic load in terms of packet delivery ratio, throughput, average end to end delay and routing overhead using NS2 network simulator. WCETT protocol uses the weighted sum of the cumulative expected transmission time and the maximal value of efficient channels among all channels.