Approaches such as increasing the number of intermediate stages are introduced to increase the reliability and throughput of Multistage Interconnection Networks (MINs). However, they mainly try to change the network architecture to achieve the goal of having more reliable network. When multiple sources in such a network try to send data, collision of packets and blocking problems are inevitable. Using existing networks, they cant be prevented completely and a multiple access protocol must be used to that end. Time division multiple access (TDMA) protocol can be used to overcome these problems. To improve the performance of this protocol, we propose an adaptive slot allocation approach using Monte Carlo random sampling method. This approach is applied to Shuffle-exchange network (SEN) and Shuffle-exchange network with one additional stage (SEN+).

Sample Code
$ns_ simplex-link $n0 $n8 2Mb 10ms DropTail orient right
$ns_ simplex-link $n0 $n9 2Mb 10ms DropTail orient left-up
$ns_ simplex-link $n1 $n10 2Mb 10ms DropTail orient right-down
$ns_ simplex-link $n1 $n11 2Mb 10ms DropTail orient right-down
$ns_ simplex-link $n2 $n12 2Mb 10ms DropTail orient right-down
$ns_ simplex-link $n2 $n13 2Mb 10ms DropTail orient right-down
$ns_ simplex-link $n3 $n14 2Mb 10ms DropTail orient right-down
$ns_ simplex-link $n3 $n15 2Mb 10ms DropTail orient right-down

This paper introduces the plan and assessment of a portable information benefit which misuses parallel multi-way transmission over numerous cell systems to accomplish critical execution picks up. Multi-arrange get to is roused by the actuality that multi-radio cell phones are quick turning into a genuineity, making it workable for end-clients to build their administration speed and accessibility by means of system decent variety. Rather than beforehand proposed procedures at the application or transport layers, we propose a novel system helped engineering for multi-homed (NAMH) cell get to. In the proposed framework, arrange components, for example, switches and base stations give the important multihoming usefulness including distinguishing proof of a bifurcation switch and dynamic part of the information stream relating to as of now achievable piece rates on the cell base stations. A point by point assessment is accommodated the multi arrange benefit with LTE base stations, utilizing both ns3 reenactment also, follow driven copies. The outcomes demonstrate that huge picks up are accomplished with multi-organize access with bit-rates of 1.9x utilizing two LTE organizes in parallel. Examination with the surely understood MPTCP strategy is given, indicating additions of about 40% with NAMH for the follow driven two-organize situation

As of late, the Mobile Adhoc Network (MANET) assumes a crucial part in systems administration inquire about condition for sharing data from one to others. MANET is a versatile, which is shaped by radio waves with no attractive base stations. The primary issue of Goal Sequenced Distance Vector Routing Protocol (DSDV) is steering overhead ceaselessly, on the grounds that it keeps up the breakthrough data amid information transmission. The fundamental hindrance of Dynamic Source Steering Protocol (DSR) is course creation delay amid course development and end-to-end defer amid transmission. To settle the above issue, this paper proposed an imaginative approach called Hybrid of Goal Sequenced and Dynamic Source steering convention (HDS2) in MANET. The new approach of HDS2 enhances the bundle conveyance proportion and throughput and limits end-to-end postpone and course creation. The proposed approach has been executed and tried in NS2 test system lastly it is contrasted and existing DSDV steering convention.

Congestion control has become a research focus with the development of network communication technology. Random early detection (RED) for queue management techniques is the most effective method. However, RED is particularly sensitive to the traffic load and the parameters of the scheme itself. When the traffic load is low, the bandwidth is underutilized, whereas when the traffic load is high, the delay is large. This paper presents a minimal adjustment to RED called three-section random early detection (TRED) based on nonlinear RED, in which the packet dropping probability function is divided into three sections to distinguish between light, moderate, and high loads to achieve a tradeoff in the delay and the throughput between low and high traffic loads. The NS2 simulation results show that TRED effectively improves the insufficiencies of RED to achieve better congestion control.

Wireless sensor systems working in the permit free range experience the ill effects of uncontrolled obstruction as those range groups turn out to be progressively swarmed. The rising cognitive radio sensor systems (CRSNs) give a promising answer for address this test by empowering sensor hubs to craftily get to authorized channels. Be that as it may, since sensor hubs need to expend extensive vitality to help CR functionalities, for example, channel detecting and exchanging, the artful channel getting to ought to be precisely contrived for enhancing the vitality effectiveness in CRSN. To this end, we examine the dynamic channel getting to issue to enhance the vitality effectiveness for a grouped CRSN. Under the essential clients' security necessity, we examine the asset portion issues to expand the vitality effectiveness of using an authorized channel for intragroup and between bunch information transmission, individually. In addition, with the thought of the vitality utilization in channel detecting and exchanging, we additionally decide the condition when sensor hubs should detect and change to an authorized channel for enhancing the vitality proficiency, as per the parcel misfortune rate of the permit free channel. What's more, two dynamic channel getting to plans are proposed to distinguish the channel detecting and exchanging successions for intra-group and between bunch information transmission, individually. Broad reenactment comes about exhibit that the proposed channel getting to plans can altogether diminish the vitality utilization in CRSNs.

Energy savings optimization becomes one of the major concerns in the wireless sensor network (WSN) routing protocol design,due to the fact that most sensor nodes are equipped with the limited nonrechargeable battery power. In this paper, we focus on minimizing energy consumption and maximizing network lifetime for data relay in one-dimensional (1-D) queue network. Following the principle of opportunistic routing theory, multihop relay decision to optimize the network energy efficiency is made based on the differences among sensor nodes, in terms of both the irdistance to sink and the residual energy of each other. Specifically,an Energy Saving via Opportunistic Routing (ENS_OR) algorithmis designed to ensure minimum power cost during data relay andprotect the nodes with relatively low residual energy. Extensivesimulations and real testbed results show that the proposed solutionENS_OR can significantly improve the network performanceon energy saving and wireless connectivity in comparison withother existingWSN routing schemes.

In Wireless Sensor Networks (WSN), some sensor nodes are mobile in nature. Due to mobility ofnodes, there is no guarantee of reliable delivery of information. To ensure reliability, manysensor nodes are deployed in the monitoring environment. These sensor nodes sense the samekind of data and forward it to the sink node. This redundant information sustains the reliability;but at the same time, sink node wastes its energy in processing the redundant data. So there is aneed to eliminate the redundancy in sensed data up to adequate level in order to maintain thetradeoff between energy conservation and reliability. There exist many data aggregationtechniques that perform data redundancy removal in order to improve life time of sensor nodes.Data aggregation is a technique in which each intermediate node in the routing path receivesmultiple input packets, process them and transmits a single packet. In this paper we have studieddifferent data aggregation strategies and focused on some data aggregation techniques based onthese strategies. Further we havediscussed advantages and limitations of these techniques.

We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks:energy-efficiency, reliability, and prolonging network lifetime. It considers the energy consumption and the remaining battery energy ofnodes as well as quality of links to find energy-efficient and reliable routes that increase the operational lifetime of the network. RMER,on the other hand, is an energy-efficient routing algorithm which finds routes minimizing the total energy required for end-to-end packettraversal. RMER and RMECR are proposed for networks in which either hop-by-hop or end-to-end retransmissions ensure reliability.Simulation studies show that RMECR is able to find energy-efficient and reliable routes similar to RMER, while also extending theoperational lifetime of the network. This makes RMECR an elegant solution to increase energy-efficiency, reliability, and lifetime ofwireless ad hoc networks. In the design of RMECR, we consider minute details such as energy consumed by processing elements oftransceivers, limited number of retransmissions allowed per packet, packet sizes, and the impact of acknowledgment packets. Thisadds to the novelty of this work compared to the existing studies.

Wireless Sensor Networks (WSNs) play a vital role in today’s real world applications. The effectiveness of WSNs purely depends on the data collection scheme. Numerous data collection schemes such as multipath, chain, tree, cluster and hybrid topologies are available in literature for collecting data in WSNs. However, the existing data collection schemes fail to provide a guaranteed reliable network in terms of mobility, traffic, and end-to-end connection. In this paper, a Velocity Energy-efficient and Link-aware Cluster-Tree (VELCT) scheme for data collection in WSNs is proposed which would effectively
mitigate the problems of coverage distance, mobility, delay, traffic, tree intensity, and end-to-end connection. The proposed VELCT constructs the Data Collection Tree (DCT) based on the cluster head location. The data collection node in the DCT does not participate in sensing on this particular round, however, it simply collects the data packet from the cluster head and delivers it to the sink. The designed VELCT scheme minimizes the energy exploitation, reduces the end-to-end delay and traffic in cluster head in WSNs by effective usage of the DCT. The strength of the VELCT algorithm is to construct a simple tree
structure, thereby reducing the energy consumption of the cluster head and avoids frequent cluster formation. It also maintains the cluster for a considerable amount of time. Simulation results have demonstrated that VELCT provides better QoS in terms of energy consumption, throughput, end-to-end delay, and network lifetime for mobility-based WSNs.

In wireless sensor networks energy is limited source. We must manage accurate use of energy for growing sensor lifetime. The hierarchy networks like Low-energy Adaptive Clustering Hierarchy (LEACH) choosing of cluster heads probability in some part of network haven't cluster head and other parts have cluster head with amount of density is high. Choosing of cluster heads in this algorithm done randomlyand it is probability low energy nodes was selected as cluster head. Thus fault has a high probability. This problem was solving by Stable Election Protocol (SEP). The New Hierarchical Stable Election Protocol (NHSEP) clustering is done symmetrically and the best node with respect to remained energy and distance of other nodes in comparing with each that selected as a cluster head. In this paper performance of the LEACH, SEP and NHSEP protocols have to evaluate and simulation results were carry out using NS2 simulator and compare with parameters Energy Consumed, Energy Remaining, Packet Delivery Fraction, End to End Delay and Dead Nodes.

Secure data collection is an important problem in wireless sensor networks. Different approaches have been proposed. One of them is overhearing. We investigate the problem of constructing a shortest path overhearing tree with the maximum lifetime. We propose three approaches. The first one is a polynomial-time heuristic. The second one uses ILP (Integer Linear Programming) to iteratively find a monitoring node and a parent for each sensor node. The last one optimally solves the problem by using MINLP (Mixed- Integer Non-Linear Programming). We have implemented the three approaches using MIDACO solver and MATLAB Intlinprog, and performed extensive simulations using NS2.35. The simulation results show that the average lifetime of all the network instances achieved by the heuristic approach is 85.69% of that achieved by the ILP-based approach and 81.05% of that obtained by the MINLP-based approach, and the performance of the ILP-based approach is almost equivalent to that of the MINLP-based approach.

In a Wireless Sensor Networks (WSNs), energy consumption is a key challenge due to its dynamic topology, highly decentralized infrastructure and resource constraint sensors. These entities make WSNs easily compromised by various denials of service attacks resulting in disastrous consequences. In the development of various cluster basedenergy efficient protocols to improve the lifetime of WSNs compromised with some malicious nodes, a challenging problem is how to adopt the most effective energy efficient cluster head selection approach to extend lifetime of WSNs. Gray-Hole and Black-Hole attack are those denial of service attacks that reduces the performance of WSNs. In order to achieve energy efficiency in WSNs, an efficient and trust based secure protocol is proposed to defend against single and cooperative Gray-Hole and Black Hole attacks. A proposed protocol incorporates efficient estimation to determine honest nodes during packets transmission phase. A proposed energy efficient technique is builds to evaluate in detecting and preventing compromised node to become cluster head. Besides, NS2 simulation result compare proposed protocol with LEACH proves that proposed system is efficiently reduces possibility of compromised node to be a part of network communication process and achieves better packet delivery ratio, throughput , less end-to-end delay and extend the lifetime of network significantly.

Wireless sensor network (Wsn) refers to a group of spatially dispersed and dedicated sensors for monitoring and recording the physical conditions of the environment and orginizing the collected data at a central location.WSNs measure environmental conditions like temperature sound,pollution levels humidity,wind peed,direction,pressure..etc. Sensors are usually attached to microcontrollers and are powered by battery. Energy consideration is a critical issue for designing the routing protocols. Routig protocols are most important for the network while resources are limited. LEACH is one of the first heirerachical approaches for sensor networks. Most of the clustering algorithms are derived from this algorithm. In this paper we propose on the improvement on LEACH protocol. In our proposed algorithm ,network is logically divided into 4 zone. In first select the CH the node that close to center of every zone forward its location to BS. Then BS select node that are very closer than other node to center of regions. In addition
residual energy of each node is also considered. We have evaluate LEACH ,PR-LEACH and Energy-zone LEACH (EZ-LEACH) through simulation using ns2 simulator which shows that LR-LEACH performs better than LEACH and PR-LEACH protocols.

In a wireless sensor network the delivery of the data packet from source to destination may be failed for various reasons and major due to failure-prone environment of networks. This may happen due to the topology changes, node failure due to battery, exhaust or breakdown of the communication module in the wireless node and results in the link failure. This paper addressed the major problem of link failure due to the failure of the nodes in the WSN and with the aim of providing robust solutions to satisfy the QoS-based stern end-to-end requirements of communication networks. In this paper, we propose the new solution by modifying the existing extended fully distributed cluster-based routing algorithm (EFDCB). In this proposed algorithm the faulty nodes or nodes that are more prone to failure in the every cluster of the network get identified by exchanging data and mutually testing among neighbor nodes. When we established the path between source and destination these faulty nodes get excluded in the path selection process and more stable, less prone to failure path will be formed. The performance of this new modified fault-tolerant fully distributed cluster-based routing algorithm is evaluated by simulating it in NS2 environment. Simulation results show that it performs better than the existing algorithm and provide novel solution for fault detection and fault management along the QoS paths and achieves a high degree of fault tolerance.

Several applications have been proposed for mobile
wireless sensor networks. Some of these applications require the
transfer of a large amount of data in a short period of time. This
is challenging, since mobility can lead to a deterioration in the
quality of an established link. Frequent link disconnection may in
turn require a mobile node to repeatedly establish new links with
the surrounding relay nodes to proceed with the data transfer.
The new link establishment may cause extra data communication
latency and make most of the applications delay sensitive. To
evaluate the effect of mobility on latency, this paper first sets
up a mathematical model based on a hybrid medium access
control (MAC) protocol in mobile scenarios. It then uses NS2
simulation to further analyze the latency associated with mobility.
Both results show that the latency increases with an increment
in the network density and the duty cycle.

Routing Algorithms are driving the growth of the data transmission in wireless sensor networks. Contextually, many algorithms considered the data gathering and data aggregation. This paper uses the scenario of clustering and its impact over the SPIN protocol and also finds out the effect over the energy consumption in SPIN after uses of clustering. The proposed scheme is implemented using TCL/C++ programming language and evaluated using Ns2.34 simulator and compare with LEACH. Simulation shows proposed protocol exhibits significant performance gains over the LEACH for lifetime of network and guaranteed data transmission India

Routing algorithm are driving the growth of the data transmission in wireless sensor networks. Contextually many algorithm considered the data gathering and data aggregation scenario like battle field, it is important and critical task in data transmission. Therefore through this paper handles the event generated by sensor nodes and provide the guaranteed transmission to sink using clustering process and node density with SPIN. Proposed scheme having better data gathering stability period and lifetie than the LEACH scheme. The proposed scheme is implemented usng TCL / C++ programming language and evaluated using Ns2.34 simulator with LEACH. Simulation shows proposed protocol exhibits significant performance gains over the LEACH for lifetime of network and guaranteed data transmissions.

Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networking, with most research conducted for stationary wireless networks. One of the reasons why opportunistic data forwarding has not been widely utilized in mobile ad hoc networks (MANETs) is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. In this paper, we propose a lightweight proactive source routing (PSR) protocol. PSR can maintain more network topology information than distance vector (DV) routing to facilitate source routing, although it has much smaller overhead than traditional DV-based protocols [e.g., destination-sequenced DV (DSDV)], link state (LS)-based routing [e.g., optimized link state routing (OLSR)], and reactive source routing [e.g., dynamic source routing (DSR)]. Our tests using computer simulation in Network Simulator 2 (ns-2) indicate that the overhead in PSR is only a fraction of the overhead of these baseline protocols, and PSR yields similar or better data transportation performance than these baseline protocols.

Abnormalities in sensed data streams indicate the spread of malicious attacks, hardware failure and software corruption among the different nodes in a Wireless Sensor Network. These factors of node infection can affect generated and incoming data streams resulting in high chances of inaccurate data, misleading packet translation, wrong decision making and severe communication disruption. This problem is detrimental to real-time applications having stringent Quality-of-Service (QoS) requirements. The sensed data from other uninfected regions might also get stuck in an infected region should no prior alternative arrangements are made. Although several existing methods (BOUNDHOLE and GAR) can be used to mitigate these issues, their performance is bounded by some limitations, mainly due to the high risk of falling into routing loops and involvement in unnecessary transmissions. This paper provides a solution to by-pass the infected nodes dynamically using twin rolling balls technique and also divert the packets that are trapped inside the identified area. The identification of infected nodes is done by adapting a Fuzzy data clustering approach which classifies the nodes based on the fraction of anomalous data that is detected in individual data streams. This information is then used in the proposed By-Passed Routing (BPR) which rotates the balls in two directions simultaneously: clockwise and counter-clockwise. The first node that hits any ball in any direction and is uninfected, is selected as the next hop. We are also concerned with the incoming packets or the packets-on-the-fly that may be affected when this problem occurs. Besides solving both of the problems in the existing methods, the proposed BPR technique has greatly improved the studied QoS parameters as shown by almost 40% increase in the overall performance.

Due to different requirements in application environment, wireless heterogeneous sensor networks (WHSNs) formed by sensors with various capacities are built. Data routing in WHSNs poses special challenges: First, it should be redesigned because the existing ones may not be directly used due to asymmetric links caused by diverse sensor transmission ranges. Second, it should guarantee an assured delivery rate because data is routed through lossy links. Third, it should be energyefficient due to the limitation of sensor batteries and the difficulty
of replacing them after deployment. To address these issues, we propose EgyHet: an Energy-saving routing protocol for Heterogeneous sensor networks. EgyHat deals with asymmetric links by establishing reverse paths. It saves energy by taking the shortest path, considering the remaining energy in sensors and reducing the number of forwarding nodes while guarantees an assured delivery rate. Simulation results show that EgyHat can save more energy yet keep the similar delivery ratio and latency to those of the existing routing protocol for WHSNs.

In recent years, applications of wireless sensor networks (WSNs) have been increased due to its vast potential to connect the physical world to the virtual world. Also, an advance in microelectronic fabrication technology reduces the cost of manufacturing portable wireless sensor nodes. It becomes a trend to deploy the large numbers of portable wireless sensors in WSNs to increase the quality of service (QoS). The QoS of such WSNs is mainly affected by the failure of sensor nodes. Probability of sensor node failure increases with increase in number of sensors. In order to maintain the better QoS under failure conditions, identifying and detaching such faults are essential. In the proposed method, faulty sensor node is detected by measuring the round trip delay (RTD) time of discrete round trip paths and comparing them with threshold value. Initially, the suggested method is experimented on WSNs with six sensor nodes designed using microcontroller and ZigBee. Scalability of proposed method is verified by simulating the WSNs with large numbers of sensor nodes in NS2. The RTD time results derived in hardware and software implementations are almost equal, justifying the real time applicability of the investigated method. Necessity of received signal strength measurement in cluster head variation and assigning separate wavelength for each link in other fault detection techniques are overcome here.

Multipath routing does not minimize the consequences of security attacks. Due to this many WSNs are still in danger of most security attacks even when multipath routing is used. In critical situations, for example, in military and health applications this may lead to undesired, harmful and disastrous effects. These applications need to get their data communicated efficiently and in a secure manner. In this paper, we show the results of a series of security attacks on a multipath extension to the ad hoc on-demand distance vector AODV protocol, AOMDV. It is proved that many security parameters are negatively affected by security attacks on AOMDV, which is contradictory to research claims. This means that alternative refinements have to be made to present multipath routing protocols in order to make them more effective against network security attacks.

Wireless sensor networks are gaining their popularity in application like consumer, defense, industrial sectors monitoring and collecting environmental data. Wireless Sensor networks are in areas which are not having any human monitoring. Being unmonitored, wireless sensor networks are vulnerable to different kinds of the attack. Misdirection attack in one the Denial of Service Attack, which causes the nodes to route information on long paths and ultimately creates situations of network jam. Misdirection attack that reduces throughput, network life time and increases the delay. There is only one solution to misdirection attack is third party monitoring. The work here in this dissertation proposes third party monitoring by cluster head and also monitoring of cluster head by source and destination transmission. Furthermore the work also improves the cluster head election procedure for security, so that initially intruder should not be selected as a cluster head.

Wireless sensor network (WSN) is one of the most emerging technology which consists of large number of sensor nodes with each having the capacity to sense, compute and communicate the data. WSN has great deal of applications in various fields like military, agriculture, industry healthcare etc. Sensor nodes are randomly and densely deployed. This kind of deployment creates large number of redundant sensor data. Routing of such redundant data not only saturates network resources, but also consumes more energy. Data aggregation is the effective technique which reduces the number of transmissions to sink node by aggregating the similar packets in an energy efficient manner to enhance the lifetime of network. There exists different data aggregation techniques which perform aggregation in single level or two levels. In this paper we are proposing multilevel hierarchical data aggregation technique which handles the redundancy in sensor data very efficiently.

Although existing flooding protocols can provideefficient and reliable communication in wireless sensor networkson some level, further performance improvement has been hampered by the assumption of link independence, which requires costly acknowledgments (ACKs) from every receiver. In this paper, we present collective flooding (CF), which exploits the link correlation to achieve flooding reliability using the concept of collective ACKs. CF requires only 1-hop information at each node, making the design highly distributed and scalable with low complexity. We evaluate CF extensively in real-world settings, using three different types of testbeds: a single-hop network with 20 MICAz nodes, a multihop network with 37 nodes, and a linear outdoor network with 48 nodes along a 326-m-long bridge. System evaluation and extensive simulation show that CF achieves the same reliability as state-of-the-art solutions while reducing the total number of packet transmission and the dissemination delay by 30%–50% and 35%–50%, respectively

We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing and reliable minimum energy routing .Reliable minimum energy cost routing addresses three important requirements of ad hoc networks: energy-efficiency, reliability, and prolonging network lifetime. It considers the energy consumption and the remaining battery energy of nodes as well as quality of links to find energy-efficient and reliable routes that increase the operational lifetime of the network. Reliable minimum energy routing, on the other hand, is an energy-efficient routing algorithm which finds routes minimizing the total energy required for end-to-end packet traversal. Reliable minimum energy routing and RELIABLE MINIMUM ENERGY COST ROUTING are proposed for networks in which either hop-by-hop or end-to-end retransmissions ensure reliability. Simulation studies show that RELIABLE MINIMUM ENERGY COST ROUTING is able to find energy-efficient and reliable routes similar to Reliable minimum energy routing, while also extending the operational lifetime of the network. This makes RELIABLE MINIMUM ENERGY COST ROUTING an elegant solution to increase energy-efficiency, reliability, and lifetime of wireless ad hoc networks. In the design of RELIABLE MINIMUM ENERGY COST ROUTING, we consider minute details such as energy consumed by processing elements of transceivers, limited number of retransmissions allowed per packet, packet sizes, and the impact of acknowledgment packets. This adds to the novelty of this work compared to the existing studies.

Energy efficient privacy preserving data aggregation is important in power constrained wireless sensor etworks. Existing hop by hop encrypted privacy preserving data aggregation protocols does not provide efficient solutions for energy constrained and security required WSNs due to the overhead of performing power consuming decryption and encryption at the aggregator node for the data aggregation and the increased number of transmissions for achieving data privacy. The decryption of data at the aggregator node will increase the frequency of node compromise attack. Thereby aggregator node reveals large amounts of data to adversaries. The proposed privacy homomorphism based privacy preservation protocol achieves non delayed data aggregation by performing aggregation on encrypted data. Thereby decreases the node compromise attack frequency. So high chance to get accurate aggregated results at the sink with reduced communication and computation overhead. The PEPPDA technique is best suited for time critical, secure applications such as military application, since it achieves privacy, authenticity, accuracy, end to end confidentiality, data freshness and energy efficiency during data aggregation. Our main aim is to provide a secure data aggregation scheme which guarantees the privacy, authenticity and freshness of individual sensed data as well as the accuracy and confidentiality of the aggregated data without introducing a significant overhead on the battery limited sensors