Next-Generation Networks

Information and communication technology (ICT) is growing rapidly due to large demand of voice, data, Internet, and intranet. Internet is growing at a rate of 150% per annum, whereas voice/data communication is growing at a rate of 50% per annum. Hence, large bandwidths and high-speed transmission are required to match above growth. High-end technology based on optical fiber communication is now extensively used for communication using optical coherent transmission at 40, 100 Gbps in Japan, Singapore, Hong Kong, USA, and Europe. The trend is to deploy 400 Gbps optical fiber networks during 2015–16. The optical coherent transmission with low form factor, low power consumption, and high reliability is used in high-speed network due to development of low power DSP, pluggable optical modules on single package. Hence, miniaturization of optical devices is required. 25 Gbps Ethernet (25 GbE) and 50 Gbps Ethernet (50 GbE) are used in data center network equipment for connectivity of systems at data rate as high as 100 Gbps. This paper deals with optical coherent transmission technology with coherent detection used in 40 and 100 Gbps networks. The 100 Gbps data centers are now extensively used in metro-access networks, core network, whereas higher data rates based on 400 Gbps systems are going to be used in near future. These are deployed in high-speed broadband networks to achieve maximum transmission at 4 Tera bits per second using DWDM.

The network in which nodes are mobile and these nodes communicate with each other by a wireless system not including any infrastructure is known as Mobile Ad HOC Network. Due to mobility of the nodes in MANET, routing a packet from source to destination becomes more difficult. So, many routing protocols have been purposed with reference to MANET but in a scenario of large nodes with high mobility no protocol is proved to be that efficient due to some particular limitation of that protocol. Therefore, mobility and scalability are alarming issue in mostly all protocols which support routing. The routing depends on the protocol; therefore, mobility and scalability of different routing protocols DSR, AODV and OLSR are evaluated in different network sizes with varying mobility rate. Firstly, the simulation environment is provided by varying some important parameters like pause time, speed and variation in number of nodes together. Then comparison between the three protocols is done to determine the best protocol in real-time scenario. Performance when measured on high scalability on a simulation of OLSR protocol as compared to that of AODV and DSR, the results deduced were far better.

With advancements in technology in the twenty-first century, tiny and cheap but intelligent sensors networked using wireless links and internet are being deployed in physical areas. These are popularly named as WSN; WSNs are powered by microelectronic mechanical systems (MEMS) and wireless communication technologies. Each sensor node is accompanied with a battery which easily gets discharged with time and thus needs to be replaced or recharged. The lifetime expectancy of a WSN can be maximized by reducing the energy or power that is being consumed. Even then, ample amount of energy is wasted by idle node components (CPU, radio, etc.). Sometimes, power management schemes thus suggest turning the node components off when not in use. At an extensive level, there are three strategies: duty cycling approaches, data-driven techniques, and mobility approaches. In this paper, we contemplate on data-driven approaches. Data which is sampled by the sensor nodes is processed, but of all duty cycling approach is insensitive to data sampled. Hence, data-driven approach has been followed as it has been seen to improve the energy efficiency when compared to the other techniques.

Genetic algorithm is a very popular optimization technique in artificial intelligence. In mobile ad hoc networks (MANETs), all the devices are battery operated. The power consumption at nodes in transferring the data is a big issue in MANETs. In this paper, a new protocol for routing in MANETs using genetic algorithms is proposed. This protocol uses the power of genetic algorithms to find a path that consumes minimum power in transferring the data from source to destination node. Simulation results prove that the proposed algorithm performs better than the previous algorithms.

IPv4 has been used over 30 years. It proved robust, interoperable, and easy implementation. The number of users is raising dramatically, the growth and development of IPv6 are vital. This protocol provides many new features like larger address space, auto-configuration, QoS, IPsec, easier TCP/IP administration, mobility, etc. In addition to these features, IPv6 development brings new security issues; however, many attacks were inherited from IPv4, which harm IPv6 networks. Those attacks affect both IPv4 and IPv6 networks. This paper explains and analysis the common threats in IPv4 and IPv6, security threats which introduced by new features of IPv6, and transition threats.

High throughput and reduced delays are the basic necessities of next-generation networks which use multimedia applications (ftp, videoconferencing, VoIP, etc.). In order to make the network function efficiently, these necessities should be improved and maintained at a desired level. This provides a better quality of service (QoS) to the traffic which ensures a maximum customers’ satisfaction. These basic necessities are provided by using the appropriate scheduler mechanism at the router. The data are handled in the form of packets in the required manner. Presently, the scheduler mechanisms which are used have still some drawbacks in them. Therefore, they cannot handle the packets in a proper way in next-generation networks which are real-time applications. In this paper, various existing scheduling techniques are explained like First-In First-Out (FIFO), Priority Queue (PQ), Fair Queue (FQ), and Deficit Weighted Round Robin (DWRR). A new scheduling technique is introduced in this paper which is a combination of PQ and DWRR. Then a comparative analysis of the scheduling technique, i.e., PQ and proposed scheduling technique, i.e., PQDWRR is performed. PQDWRR technique provides a better QoS than the existing queuing mechanisms.

Wireless sensor networks (WSNs) have always been a fascinating area of research among the research fidelity. Random deployment, energy constrains, dynamic topology, physical damage may create the void areas in WSN where there is no coverage at all. This paper makes an attempt to identify and recover such regions based on the coordinate values of the nodes along the void region. The coverage on the right and bottom coordinate points at a distance equal to the sensing radius is calculated by comparing these points with the nearby sensing nodes coordinate values without broadcasting any message. The uncovered points can be clustered to give the rough estimates of the void region dimensions and location in the network. The recovery can be made by deploying more number of nodes in the estimated area.

Wireless multimedia sensor networks (WMSNs) are applicable in a wide range of areas including area monitoring, video surveillance. But due to unreliable error-prone communication medium and application-specific quality of service (QoS) requirements, routing of real-time multimedia traffic in WMSNs poses a serious problem. The proposed routing protocol, optimized QoS node disjoint (OQND) routing, tries to improve the performance of network by considering both average end-to-end delay and hop count for making route decisions and optimizing various resources such as energy, bandwidth. OQND finds two types of routes, and it can be restricted to find node disjoint routes only. Simulation results show that OQND outperforms ad hoc on-demand multipath distance vector (AOMDV) routing protocol.

Wireless sensor networks (WSNs) are the today’s most interesting and exciting research area. It is supporting a large number of application domains and now planning for supporting wide industrial applications. As the requirements for industrial application domain are different from other WSN applications, hence, various standards are defined by some industrial alliances like HART, Zigbee to meet the requirements of industrial domain. This paper discusses various WSN standards specific for industrial domain along with their applications and limitations. It also lists and discusses various unsolved challenges in IEEE 802.15.4e industrial standard. Finally, a comparative analysis of these standards is provided and the research gaps are discussed.

Intensification of mobile devices has triggered use of applications over the web. These applications even put scheduler performance of broadband wireless systems like WiMAX to test. The role of schedulers in such networks had become very challenging, and only adaptive schedulers can survive to fit in user’s demands. This paper has evaluated working of dynamic fuzzy-based scheduler used for bandwidth allocation. The scheduler is implemented as component of the base station and works to grant bandwidth to traffic classes after analysis of their traffic share and quality of service parameters. The performance of proposed method is justified by drawing comparisons with established practices.

Mobile adhoc network (MANET) is a self-configuring agglomeration of wireless nodes with dynamically changing network topology that formed without using any preinstalled infrastructure or any central administrator. Intrusion detection is the security system that is used to automatically detect the problem when someone trying to break information system through violation of security policy. Alone intrusion prevention method is not sufficient because in MANET, network topology is continuously changing, so intrusion detection technique is used. This paper is based upon the intrusion detection in MANET based upon the different parameters of mobile nodes (MNs). Based upon some threshold values of parameters, ACO algorithm is used to detect the intrusion present in the network. And after that, genetic algorithm is used to recover the network.

A mobile ad hoc network is a collection of autonomous mobile devices that communicate with each other. This network may contain foe nodes and trustworthy nodes. Foe nodes imply attacker nodes which are malwares, threats, malicious nodes. To keep away from these nodes, we introducing node position verification protocol. This protocol is utilized for message exchange which is used for transmitting messages among the nodes and checks the location of each and every node in the network. The message exchange protocol manages the distinguishing proof of nodes that are in a communication range. Distance computation is in view of message transmission between the prover and its correspondence adjacent node. Calculated distance is utilized to confirm the location of communicating nodes in network. For node position verification, mainly three methods are utilized. This problem is implemented for mobile ad hoc network and simulation using NS2 tool. The benefit of this technique is to lessen the delay and accomplish the high throughput and can stop attackers not entering into information transmission nodes.

Mobile ad hoc network (MANET) is a collection of mobile nodes that are connected each other. Considering the potential relay nodes based on power constraint is a difficult problem to obtain efficient throughput. This problem can be solved by selecting the minimum distance nodes as relay nodes from destination. In the proposed method, the delay is analyzed by selecting the relay nodes in multi-hop. Relay nodes are selected when the destination node is not in the communication range. There exists more than one relay node between the source and destination in multi-hop. Thus, the packets are transferred from source to destination through these relay nodes. If the destination node is not in the transmission range, then consider one-hop neighbors of source and calculate the distance from destination to these one-hop neighbors. The network topology is designed using the NS2 tool which gives routing tables, to provide the information about neighbors and also about the selected next hop node. The node with minimum distance is taken as selected next hop node. This node is considered as a relay node. In this manner, relay nodes are selected between source and destination. We can reduce the packet loss and delay.

The WMNs are coming up as a new networking trend for setting up a wireless networking infrastructure in metropolitan areas. Network operators prefer WMN because of easy installation and fast deployment of it. It may also result in reduction of monetary investment and cost of operation. The routing in WMNs is challenging task because of the unpredictable variations in the wireless environments. In this paper, three routing protocols, AOMDV, MOLSR, and MHRP, are compared in terms of their performance in WMN.

Environment protection and reduction of operational cost are gaining popularity among researchers. Energy consumption has direct impact on both factors and follows an increasing trend of attentions in recent years. A number of energy-aware approaches have been found in research to trim down superfluous energy expenditure by embedding energy alertness in the protocols, devices and designing of wireless networks. This paper intends to provide a broad review of the various researches at protocol stack for minimizing energy consumption in wireless network.

Software-defined networking (SDN) is a new emerging technology for networking that separates the forwarding and control plane. With SDN static, inflexible and complex network are replaced by dynamic, scalable, and innovative networks. The motivation of developing low-cost portable SDN switch arose when we were developing load balancing and stateful firewall SDN applications during our research work. To test and measure the performance of our applications, we needed low-cost SDN testbed. Existing solutions were utilizing special hardware such as NetFPGA or real switches. But these were not suitable due to high costs and complexity involved. We could have tested these applications using Mininet emulator but there are performance issues. In this paper, we created a small size, low cost, portable SDN switch for testing our SDN applications using Raspberry Pi. Our low-cost switch supports OpenFlow Specification 1.0–1.4. Raspberry Pi is Linux-based small size low-cost device which can be used as a personal computer as well as for making low-cost portable SDN switch.

Internet gateways are used for integration of mobile ad hoc network (MANET) with Internet to increase its usability. Mobile nodes in MANET need to discover an Internet gateway to obtain Internet connectivity. Existing gateway discovery approaches such as reactive, proactive, and hybrid suffer from low network throughput and performance trade-off. In the proposed gateway discovery scheme, proxy nodes are utilized to reduce network overhead as well as dynamically adjust proactive area of gateways according to traffic load on a gateway. The gateway selection scheme uses a timestamp factor besides hop count and queue length for selecting an optimal Internet gateway. The performance of the proposed approach is analyzed through simulation on the basis of routing overhead and gateway discovery time. Results show that our approach has been found outperforming to existing approaches.

Directed signature is a solution of such problems when signed information is sensitive to message holder/signature receiver. Generally, in a directed signature, the signer is a single entity. But, when a sensitive message is signed by an organization and needs the approval of more than one entity, threshold signature scheme is a solution of this situation. To keep in mind, this paper presents a threshold directed signature scheme.

In a network that is wireless, ad hoc, mobile, with forever differing topology, the need for a routing protocol arises for locating routes to nodes of the network so that a sender and a receiver can talk to each other via packets. An important task is to write a routing algorithm that will search, the cost-effective route, in terms of distance and overheads, between every source–target pair. In MANETs, there is a need for multicast routing because data packets are transmitted to dynamically changing groups. Therefore, multicast routing protocols should ensure that certain parameter values are achieved. In such networks, link breakage often happens. But when there are numerous paths available between the same pair of source and sink, the robustness of the network increases. This is the case with mesh-operated multicast routing protocols. This paper describes three of such protocols, compares them, and proposes a solution that overcomes the challenges in the existing protocols.

In this paper, performance metric of orthogonal frequency division multiplexing (OFDM) system is analyzed over a composite fading channel, i.e., generalized K-fading channel. Here, OFDM system is considered which includes repetition code to enhance the wireless link performance with simplicity. Symbol error rate (SER) performance is evaluated using binary phase shift keying (BPSK) and 16-quadrature amplitude modulation (16-QAM) over generalized K-fading channel. This channel model considers Nakagami-m distribution to define multipath and gamma distribution to represent shadowing effects. Simulation results demonstrate that improved system performance can be achieved by using repetition code in severely faded environment. A comparative study of coded and uncoded system is also given in this paper. Consequently, SER performance is improved with the increase of shape parameters.

The multicarrier OFDM technology has been chosen by many recent networking standards as preferred modulation scheme at physical layer as it offers high robustness against multipath effects. Automatic modulation recognition of OFDM signal has been thus intensive research area in cognitive radios. Several algorithms have been proposed in past that carry out effective detection, parameter estimations, and automatic recognition of OFDM signals as part of radio sensing techniques. In this paper, we proposed neural network-based classification of WiMAX IEEE 802.19 physical layer OFDM signal which does not require any a priori information or depends on cooperative embedded information from transmitter. The proposed algorithm classifies WiMAX IEEE 802.16d OFDM signal in a heterogeneous network environment having other digital modulation signals. The proposed features are robust to channel noise and multipath fading effects on wireless channel.

Cognitive radio, CR is a promising technology to authorize the competent usage of restricted natural resource radio frequency spectrum for the wireless devices. The technology authorizes the secondary (unlicensed) users, SU to exploit underutilized spectrum allocated to primary (licensed) user, and PU by renovating the traditional static spectrum access approach to dynamic spectrum access without creating any/allowable interference for PU. Design and implement routing protocol in Cognitive Radio Ad Hoc Networks, is an upcoming challenge. Such protocols require addressing the issues like environmental awareness to identify the licensed spectrum which is comparatively underutilized by PUs and can be use by SUs respecting the privilege of PUs usage and avoidance any interference to them. This paper presents the revised analytical model using domain object model of Dynamic Spectrum Management Functions (DSMF) that also represents the concept of cognitive routing in Cognitive Radio Ad Hoc Networks (CRAHNs). The presented analytical model facilitates to enhance the understanding of the concept of routing protocol in CRAHNs. The paper designates suggested routing protocols in recent years. Based on the literature survey, the paper also provides the research gap in the area of cognitive routing protocol in CRAHNs and ends with concluding remarks.

Network lifetime is a major factor in determining the efficacy of a wireless sensor network. There are several other issues involved, like management in case of link/node failure, node mobility. Since, the nodes in a WSN operate in unattended, battery operated mode, there is a constant need to minimize energy consumption and address topology changes so that the network lifetime may be maximized. Out of the basic tasks, i.e. sensing, local storage and processing and communicating, involved in a WSN, communication uses the largest fraction of the total energy consumed. Techniques like selective forwarding, clustering, data aggregation, are employed in order to reduce energy consumption during communication. It is basically the network topology that decides the scheme used for communicating the sensed data to the sink. Different topologies like flat, clustered, tree and cluster tree use evolving approaches to minimize the energy consumption during communication. This paper discusses and compares the approaches used and their contribution towards the desired behaviour of a prolonged network lifetime.

Vehicular sensor network (VSN) has become an active research topic in the field of networking. VSN is the application of vehicular ad hoc networks (VANETs). Vehicular delay-tolerant network (VDTN) has evolved from delay-tolerant network (DTN) and is formed by vehicular nodes with sensors embedded in it. Many routing protocols have been implemented in VDTN, each having its benefits and shortcomings in the implementation domain. In this paper, performance of two routing protocols, namely MaxProp and packet-oriented routing (POR), are analysed and compared on the basis of different parameters. Both the protocols are simulated on MATLAB.

World is growing in urbanization which has escalated the growth of congestion and accidents on road. Due to increase in traffic, the commute time of people is becoming a huge problem in many cities. Traffic lights aid in smoothening traffic to some extent. To mitigate problem of congestion, safety and commute time of urban workers without leveraging huge expenses on new physical traffic lights a new approach known as virtual traffic lights (VTL) are proposed. Vehicles organize a VTL and help in reducing accidents at intersections. VTL improves the throughput of traffic at an intersection by updating itself to current traffic information and can also reduce carbon emissions and improve energy consumptions in a smart city. We propose a complete VTL algorithm through a finite state machine that will work and explore the horizons on larger environment in high and low mobility scenarios.

A mobile Ad Hoc Network (MANET) is an own and self structuring network of mobile devices, which are connected by wireless and Quality of Service (QoS) routing is a major challenge for research. In this paper, design and analysis of three major versions of QoS with support for effective routing schemes are being proposed. First scheme is improved-LABS, second scheme is context-aware adaptive QoS routing for mobile and wireless network using Fuzzy (COAAF) approach, and finally, context-aware adaptive service (COAAS)-based dynamic channel allocation approach for providing an optimal QoS over MANET, respectively. The proposed schemes are compared with other existing schemes like AODV, DSR, and FSR routing schemes.

Repeated and continuous transmission of data to the sink leads to energy loss in all the nodes in case of flat WSN. Especially, depletion of energy is highly acute in case of nodes that are near to the sink. Conventionally known as energy sink-hole problem, it causes early failure of the network even when there is a substantial amount of residual energy left in it. Though the research fraternity has been continuously addressing this problem and even has provided various solutions to deal with it, the use of mobile agents to meet the above-stated problem is still in its infancy. The paper proposes a mobile agent-based solution for solving energy sink-hole problem. The proposed solution aims to extend the network life by reducing redundant data being passed to the nodes near to the sink thereby reducing the load and saving battery life. The algorithm is implemented using aglets and the analytical results show significant improvement in the network lifetime.

This paper presents a novel, compact, and low-profile 2 × 2 multi-input multi-output (MIMO) antenna for WiMAX 802.16a applications which is very useful for disaster communication systems. Proposed WiMAX-MIMO antenna designed on low cost FR4 substrate with the compact size of 32 × 32 mm2 with dielectric constant of 4.4. The defected ground structure perturbed in the form of L-shaped in the ground plane offer a good isolation up to −26 dB for the entire frequency band of 3–14 GHz. The two patches on the top of substrate perpendicular to each other introduced pattern diversity in the radiation pattern. The good impedance bandwidth of 0–14 GHz, high isolation and low correlation coefficient make the proposed design antenna suitable for WiMAX 802.16a applications.

Regardless of the type of application and place of operation, one of the primary aims of wireless sensor networks (WSNs) is basically to achieve data communication while attempting to preserve the energy in order to function for a longer time and to avoid connectivity collapse by employing effective and robust power management strategies. There are various obstacles which need to be addressed and overcome so as to design suitable and efficient routing protocols for WSNs. The main issues are associated with the limitation of sensor nodes such as restricted power, processing power, and other constrained resources. In this paper, we have presented a comparative study of various routing classes and their key goals in WSNs. This paper aims to explore the most important routing protocols designed for WSNs along with their primary goals and compare them for a better understanding and further researches.

In this research paper, we have analyzed that life and reliability of an integrated circuit are affected when different frequencies have been used to perform the operation on the circuit, FPGA technologies, and design goals. Fibonacci generator has been taken as our target circuit. Our design is capable of working with operating frequency of different WLAN channels. The device operating frequencies of 802.11b/g/n, 802.11y, 802.11a/h/j/n/c, 802.11p, 802.11ad, and 802.11ah are 2.4 GHz, 3.6 GHz, 5 GHz, 5.9 GHz, 60 GHz, and 900 MHz. Along with the frequencies, the device is also operated at different FPGA technologies such as Virtex-6 (40 nm) and Artex-7 (28 nm) FPGA technology. Five different design goals have also been taken into consideration. It has been observed that large amount of power (96.75%) can be saved on operating the device at 28 nm technology instead of 40 nm technology along with area reduction design goal. Also, if the design is being operated at a frequency of 900 MHz instead of a high frequency of 60 GHz, 99.88% of power consumption can be saved by using the balanced design goal.

Internet applications like multimedia are comprised of a large amount of data traffic, and its transmission is increasing continuously due to the growth of Internet. The quality of different applications depends on network conditions and transport protocol. Quality of services needed by today’s Internet applications cannot be fulfilled by the traditional transport protocol like transmission control protocol (TCP) therefore other transport protocols like SCTP and DCCP with advanced features were developed. This paper considered three transport layer protocols they are transport control protocol (TCP), datagram congestion control protocol (DCCP), and stream control transport protocol (SCTP). The analysis of these transport layer protocols is done on the basis of average throughput, number of packets sent, average jitter, delivery ratio, average delay, number of packets lost using NS-2. NS-2 provides virtual environment for simulation. Simulation result shows that DCCP achieves higher throughput with less jitter and less delay. However according to our simulation analysis, it is found that more number of packets is dropped in DCCP protocol than other two protocols. But DCCP overcomes its competitor protocols from all other parameters.

In this paper, a model has been presented which transfers electric power without wires by using microwaves. A breadboard model of receiving antenna called rectenna is developed for preliminary experiments including wireless power transmission. The paper presents one to one MPT system in which electric power is transferred at radio frequencies ranging GHz so that the losses can be reduced which generally occurs during transmission and distribution of electrical power.

MANET is an emerging approach to wireless communication with potential applications in random and dynamic environments. In MANET, there cannot be a central administrator due to mobile nodes and frequent breakage of links. Thus, routing in MANETs becomes a challenging job, and the motivation behind this paper is to discover and study the effect of pause time and mobility of nodes on Dynamic Source Routing (DSR) and Ad hoc On-Demand Distance Vector (AODV) routing protocols. Network Simulator version 2.35 has been used to perform the experiment.

Mobile Ad Hoc Networks are a self-configured, decentralized, and infrastructure-less network which can have different number of active links at any instants. Multihop wireless connectivity, frequently link breakage and mobility of nodes, gives this network a dynamic environment. Because of this dynamicity, it is quite difficult to propose a suitable routing protocol. Experimental analysis of working mechanism and functionality of available on-demand routing protocols (AODV and DSR) has been done using network simulator in this research paper. Results have been discussed using graphs, and analysis has been done.

The paper deals with the Traffic Engineering for online multi-path routing in MPLS networks. The algorithm presented is inspired from the concept of profile classes (in which the traffic demands are classified into various profile classes which are generated based on the SLAs signed by the Internet users). In the proposed algorithm, multi-commodity network flow formulation is used to prevent network bottlenecks and to ensure minimum rejected requests/traffic demands. In the proposed algorithm SLAs, Global and Local quasi-static knowledge about the network are used to generate multi-commodities based “profile classes” in the first phase and then these multi-commodities flows are distributed over Widest Disjoint Paths with respect to the bottleneck links in the second phase. The combination of multi-commodity-based flows and the disjoint paths w.r.t. bottlenecks prevents the network from saturation point which helps in minimizing the congestion, delays, rejected requests, and maximizing the throughput, i.e., improving the overall performance of the network.

Content delivery network (CDN) is increasingly used to improve the network performance for end users. This helps to reduce the load on origin server by delivering the contents from the edge of the network in proximity to end users requesting for the contents. Content providers take the services of CDN service providers to improve the Quality of Service (QoS) requirements of their users, and in return, they have to pay for these services. Therefore, this demands optimal placement of contents on surrogate servers. This paper analyzes the existing strategies suggested for replication of contents on these servers to provide a foundation for devising a more efficient replication strategy in a CDN.

Cognitive radio ad hoc networks (CRAHNs) emerged to solve problems associated with wireless networking due to limited available spectrum. The problem of spectrum inadequacy can be removed by exploiting the usage of existing wireless spectrum intelligently. In a CRAHNs, secondary users SUs (unlicensed users) are able to exploit and utilize underused channel but should vacate the channels if any interference is caused to primary users PUs (licensed users) that own the channels. In this paper, various routing challenges in routing of CRAHNs are introduced. Then reactive routing schemes are discussed along with challenges it addresses. An analytic assessment is carried out in the end to identify the covered and uncovered challenges in reactive routing protocols and further concise of direction to be taken to improve upon the protocol.

Wireless Sensor Network (WSNs) is a collection of small, self-powered devices with sensing capabilities. Sensor nodes are deployed for carrying out various applications such as disaster recovery, industrial control, health monitoring, environmental monitoring, etc. Battery is the main source of energy for sensor nodes. However, because of the limited storage capacity of batteries nodes remain operational for a limited amount of time. Energy efficiency or energy consumption plays a major role in the lifetime of WSN. It is very difficult or sometimes impossible to replace or recharge the battery in remote areas, e.g., deep forest. Hence, an energy saving of a sensor node is a major design issue. There has been a flourish of research efforts on prolonging the lifetime of WSN. Since environmental sensing and transmission of information to the base station are an important task in WSN that consumes energy. Therefore, routing plays a major role. Advancement in WSNs led to the development of various routing protocols. In this paper, we have simulated the LEACH protocol using MANNASIM framework. Network performance is analyzed in terms of total energy consumption, total number of live nodes in the network by varying the number of clusters using Network Simulator (NS-2).

MANETs are composed of sensing nodes which organize themselves into temporary topologies and forward data to each other. Delay prediction of packets in MANET depends on many variables; some of them are length of path from source to destination, hop count, mobility of nodes, interference from other neighbours, bandwidth and past values of delay, etc. In order to make data delivery more reliable, accurate prediction of delay is a necessary task. The goal of this paper is to predict the source to destination delay in MANETs in presence of all the factors affecting the delivery of packet. Simulation environment is NS3, and the prediction of delay involved is done by ANN techniques.

Wireless sensor networks are newer technology consisting of sensor nodes deployed in an unattended environment which collect environmental data by sensing and then forward it to the base station. The security of WSN in such an environment is very difficult. There are many routing protocols for WSN, but LEACH is the widely used energy proficient hierarchical routing protocol which saves nodes energy by forming clusters. In LEACH, cluster member forwards its data to the cluster head, which then aggregate and forward the entire data it received from member nodes to the base station. There are various types of attacks which threaten the services of LEACH are Sybil attack, black hole, selective forwarding, and Hello flooding attack. Hello flooding attack is a type of DoS attack which degrades the performance of LEACH by continuously sending large number of cluster head advertisement packets. Inside this text, firstly, we have discussed LEACH routing protocol and how it can be compromised by Hello flooding attackers. Once we threaten the services of LEACH by Hello flood attack, the impact of attacks on the performance metrics of LEACH is evaluated. In this paper, we have also proposed a detection strategy using coordinator nodes which detect the nodes causing Hello flood attack and then prevent it. The performance of algorithm is then tested using the NS-2 simulator.

Wireless sensor networks (WSN) are mainly deployed in an unattended and hostile environment. So security is a major concern in these types of networks. Many routing protocols have been designed in WSN, which are responsible for maintaining the routes in the network. We mainly focused on LEACH, the most popular hierarchical routing protocol. But the services of LEACH are threatened by various kinds of attacks such as Black Hole, Selective Forwarding (Gray Hole), Sybil, and HELLO flood attacks. In this paper, firstly we have discussed LEACH and then how it can be compromised by Selective Forwarding Attack. The performance of LEACH without the existence of attack and with the attack has been evaluated in terms of various performance metrics such as packet delivery ratio, packet loss, and remaining energy of the network using Network Simulator (NS-2). We have also emphasized on how to secure the network if they have been threatened to Selective Forwarding Attack. To detect the malicious nodes in the network, we have proposed and implemented a detection strategy.

Wireless sensor networks consist of independent sensors that sense and monitor the area of deployment and distributedly communicate this information to base station. The desirables of WSN are to have long longevity and high reliability along with maximized coverage. LEACH is one of the most discussed hierarchical, cluster-based routing protocols for sensor networks owing to its load-balancing characteristics. In this paper, we have presented a hybrid approach (H-LEACH) in which the clusters are fixed, but the cluster heads are chosen dynamically. The approach shows an improved performance that is duly supported by the simulation results using MATLAB. The paper concludes with the limitations and further scope for improvement in the proposed protocol.

Logistic maps, usually preferred for chaotic sequence generation, provide certain challenges while implementing for real applications. Specifically, while considered for applications as a coder or spread factor generators in wireless communication, certain modular and simplified approaches are necessary to mitigate effects of complex designs. The chaotic nature of logistic maps has been exploited for code generation and has been preferred for spread factor generation as part of spread spectrum modulation (SSM). In this paper, we describe an approach of using certain modular designs for reducing the complexities of a logic map coder and spread factor generator, specially the computational load, while implemented using artificial neural networks (ANNs). The learning ability of the ANN is used to track the chaotic and synchronization properties of logistic map and used as an aid to SSM in a wireless setup.

Policy-based LAN infrastructure implementation has always been a challenge for the corporate bodies that has diversified networking situations to be handled in limited resources especially in presence of servers with firewall securities. This paper provides solution to many problems that are compromised by the corporate organizations so far, even when updated technology is present in today’s world. Here, in this paper, we have improved the performance of existing LAN infrastructure by modifying certain corners of the networking scenario in presence of security considerations. Here, we have also implemented AAA and RADIUS security to overcome the remaining loopholes of the system. By proposing a novel approach toward network implementation, we obtained reports that brought overwhelming networking boost. Researchers, field workers at networking site, and all those who are part of the networking world must read this article before starting any implementation of networking scenario to get to know the do’s and don’ts before the implementation phase is initiated.

While protecting a target network for detecting a potential network attack, based on attack signature scanning methodology, stateful inspection plays a vital role to detect protocol-based scanning of sessions thus reducing false positives. We propose an architecture which comprises of session table management scheme to perform stateful packet inspection in real-time network scenarios. The architecture uses efficient data structure to store session information and a methodology to retrieve and modify the protocol state information. The state table also considers flow-based information for more accurately extracting attack signature parameters and thus enhancing accuracy of signature-based detection. A parallel thread for scanning the session table and for dealing with expired sessions is also incorporated to avoid memory overflow scenarios and supports higher number of valid sessions in real-time networks. A methodology to communicate with deep packet inspection engine and terminate those TCP sessions for which attack is detected which is incorporated using multithreading approach. We demonstrate two major architectures to enhance the performance of DPI with stateful inspection enabled in it using multi-processing techniques to achieve parallel processing and the experimental results.

In today’s scenario, cyber threats are becoming labyrinth and difficult to manage. The traditional security management systems are not capable to handle upcoming novel threats resulting in performance deterioration. In this paper, various next-generation technologies have been integrated together that provide an efficient, manageable, robust, and flexible system that not only effectively tackles all the existing attacks but can mutate itself to fight against zero-day attacks. The proposed system includes intelligent techniques that are required for the future cyber world like next-generation intrusion prevention system (NGIPS), network breach exposure system (NBES), cloud-based antivirus, anti-spam, personalized censor-ware, SPARTA (access control service), MONICAN (control and management technique). It will result in a reliable, efficient, and quick responsive system to obtain remarkable results in the network security.

In the mobile ad hoc networks, there exist various challenges in packet data delivery mechanism. Few of the challenges due to which packet delivery fails are route failure and congestion. Because of these effects, it is very stiff to provide data delivery in an efficient way. So we propose a cross-layer approach in which a buffer is initialized in transport layer to buffer packet during failure of route or congestion or both. Because of this cross-layer approach, packet dropping rate of receiver will decrease. Simulation result shows the efficacy of our approach that our proposed scheme proves to be better than the existing schemes which do not use the cross-layer approach.

In past few decades, energy efficiency issue in wireless sensor network (WSN) has attracted researchers due to its constrained power source. Focus on the parameters which affects the energy level of the sensor nodes of the WSN is the key to attain energy optimization. Introduction of heterogeneity increases the capability and lifetime. In this paper, we propose a heterogeneous-model-based energy efficient scheme for clustering. Any clustering algorithm which groups the sensors can contribute in increasing efficiency of the network. This paper proposes an energy conscious clustering method which takes into account the energy of the nodes residing within the proximity of its transmission range. Indecent designed self-organizing clustering algorithm can drop down the lifetime of the nodes. The simulation work of the proposed algorithm is done for heterogeneous energy model with varying parameters. Simulation results ratify the stability period extension of proposed protocol. The proposed algorithm is capable to prolong the stable period of network and balances the overall energy dissipation of the network over its comparatives.

Vehicular ad hoc network is a network of moving vehicles in which a set of road side units (RSUs) are used over vehicular networks to assist and communicate with moving vehicles. Numbers of vehicles are increasing day by day, and the numbers of motor vehicle accidents are also increasing. Therefore, quality of service (QoS) has become very crucial and challenging aspect for safe and convenient driving. Congestion control is one of them that provide quality of service (QoS) in vehicular network. Lots of research has been done in congestion control, and lots of research is to be done to ensure safe and reliable communication. Over the last decades, several algorithms have been proposed to address congestion problem in vehicular ad hoc networks (VANETs). In this paper, various congestion control techniques have been reviewed. These algorithms are compared on different parameters.

In modern digital era, data is one of the important aspects and sensor node is one of the excellent devices to help in collecting data from any type of terrain but security is one of the issues in collection of data. To consider an epidemic $$ SE_{1} E_{2} IR $$SE1E2IR model, where (S)—Susceptible, ($$ E_{1} $$E1)—Exposed category of 1, $$ E_{2} $$E2—Exposed category of 2, (I)—Infective, (R)—Recovered for the transmission of worm in wireless sensor network with two latent categories is formulated. In the present model, we think the trait which creates the difference in worms spreading does not evident itself as a difference in susceptibility; hence, it has only one susceptible state. As per our assumption, the susceptible class enters in E₁ and E₂ with rate $$ p $$p and $$ q $$q where $$ (p + q = 1) $$(p+q=1), respectively. In the digital world, infection less wireless nodes exist without any inactivity. A more infected node will be cured by the higher probability as it normally suffered from a remarkable performance degradation/breakdown. The dynamic study of behavior is evaluated by threshold valued $$ R_{0} $$R0 in the condition when virus and worm are in worm-free equilibrium, if the basic reproduction number $$ R_{0} $$R0 value is ≤1, then infection in the nodes vanish; hence, worms dies out. Also, we show that individuals spent different average amount of time in different states. Simulation results are used for validation.

The underwater wireless sensor networks is a rapidly growing area of research as it monitors and collects data for environmental studies of seismic monitoring, flocks of underwater robots, equipment monitoring and control, pollution monitoring applications. The main purpose is to create a new set of routing protocols optimized various factors from the major differences in the underwater wireless sensor network and terrestrial network. Energy efficiency plays an important role in underwater wireless communication as underwater sensor nodes are powered by batteries which are difficult to replace or charge once the node is deployed. This paper surveys various routing techniques. Modern research trends focus to improve the performance on various issues like propagation delay, mobility, limited link capacity and limited battery power on the sea ground and sea surface.

Clustering technique finds wide applicability in wireless networks. Cluster structures enhance resource reuse as well as increases system capacity. Clustering is a desirable task in MANET if the size of multi-hop wireless network becomes too large. In the existing work, number of cluster formation depends on the radius of cluster chosen in a scenario. But here, we propose a new approach in cluster head selection within a cluster. Here, we consider three parameters, i.e. number of node neighbours, node lifetime and stability of nodes which in turn are used for selection of an appropriate cluster head. We simulated our algorithm and measured performance by considering energy consumption, throughput and control overhead as performance metrics. Our approach has been found outperforming to the existing ones.

Maximization of lifetime of wireless sensor network (WSN) is an emerging area of research in present scenario. Many authors are performing their research work, so that they could achieve lower energy consumption for the sensor network which leads to increase in lifetime of network. Our work focuses on sink mobility in a fixed trajectory within a wireless sensor network while sensed data are required to be collected. We divide the whole sensor network into two different regions as direct communication area (DCA) and multi-hop communication area (MCA). Sensors node that lies in DCA is at one hop count distance from the sink node trajectory while sensors within MCA are at more than one hop count from the trajectory. We considered all the sensors that are within DCA as subsink nodes. During sink mobility, whenever a subsink is closer to the mobile sink node, then it starts transmitting its data to the sink node. But those sensors that are within MCA needs to search an appropriate sink node for sending its sensed data to the subsink so that on further stage, that subsink could provide those data to the sink node whenever it is in nearest proximity of that subsink. Basically, a sink node is the ultimate destination for the data while a subsink node acts as a relay node for the nodes that are within MCA. So our work is to find out the appropriate subsink node from a given set of subsinks. For doing so, we used location-aided routing on global positioning system (GPS)-enabled sensors and sink node. Our work is validated through simulation experiments using NS-2.

Mobile Ad Hoc Network (MANET) is an association of wireless mobile nodes with limited transmission range, resources, quick and easy setup and has no fixed infrastructure. As the nodes in the MANET are mobile so it uses wireless connections for communication with various networks. For the environment of continuous changing topology, routing algorithms with special features are required. The algorithm or protocols have to be chosen based on size, density, and the mobility of the nodes. Currently, there are still ongoing researches on MANETs. These researches may result to even better protocols having better QOS and security measures but it may also possible new protocols will face new challenges. This paper presents an elaborate view of security issues, services, attacks, and security challenges for MANET. Moreover, various cluster-based secure communication methods and their comparison based on a set of measurement schemes are discussed.

Mobile ad hoc networks are self-categorizing and self-configuring multihop networks competent of adaptive reconfiguration network. Node mobility in MANET may cause frequent network topology changes and the impact of noise, fading, and interference degrades the capacity of wireless networks. Due to the lack of infrastructure and the incapability of preventive measures such as encryption, authentication, and cryptography for detecting the newer attacks leads the wireless networks more susceptible to be attacked than wired one. Moreover, the false alarm is one of the major challenges in intrusion detection and prevention measures not assured to work, there is a need to supervise the network and look for abnormal behavior of the node. The mathematical approach for cluster head selection based on the distance and energy gives the realistic result. The proposed algorithm for intrusion detection aggregates all the information before declaring any node as malicious. The proposed algorithm also suggests how the cluster head communicates the malicious node information to all the heads which are in the radio range.

Today, Smartphone device uses are increasing day-by-day such as email, gaming, Internet banking, which requires it to always remain connected with Wi-Fi. This makes it vulnerable to numerous attacks. In this paper, we explore different Smartphone vulnerabilities, malwares, and security challenges. In addition, we also present a classification of various security solutions proposed in the literature. It provides better understanding about current security issues and challenges in Smartphone Wi-Fi access channel, current solution space, and future research direction to protect it from variety of DDoS attacks.

In the era of digitization, there is huge amount of digital data being processed and collected in the repositories. Lots of useful information and data patterns are hidden in this bulk data usually known as Big Data these days. So, it is now becoming important to store and manage this huge data for extracting important patterns and information for future decision-making. Classification is one of the important techniques while dealing with this huge amount of data. It is important to understand the diversity in the given set of data. Classification is the prediction of certain outcome on the basis of given input. In real life also, classification is the most common activity of human life. It is quite common phenomena of the day-to-day life, especially when we are involved in analytical task. It supports the decision-making task in business, research, etc. The classification problem is applicable on assigning label to an object among predefined group of elements on the basis of its properties and behaviour. Classification is the process of classifying the data in the different labels as per similarity measures of the defined groups. These days almost every field of research, medicine, business and industry, etc., are dealing with classification problems. Fraud detection, diagnosis of diseases, pattern recognition, loan approval and others are some of the examples of the classification problem. Data classification and clustering are the important techniques used in data mining. With the emergence of large volume of digital data, it becomes major challenge to manage this data in effective and efficient manner. Data mining is one of the techniques used for extracting required information from the large set of data. Various methods have been adopted in data mining in which data classification and clustering are used for labelling/grouping of data. Data classification may be defined as grouping of objects as per their similar characteristics on the basis of prior knowledge available to the system, i.e. classification groups the entities as per their similar features with available prior knowledge (supervised). Clustering is the method of grouping of objects as per their similar features without having prior knowledge (unsupervised). Neural network or artificial neural network is the mimic of human brain. It is the network of interconnected artificial nodes to process the information and provide its final output. Neural network is one of the tools of classification used in soft computing techniques. Various research studies have been done on neural network for classification task due to its best performance. Neural networks are treated as black box due to its hidden data processing. It can adjust its weight by itself. Usually, neural networks have the ability to learn the pattern itself by means of training process in the network. The error updation feature in the neural network adjusts the error after each iteration to make it more accurate (learning process of the ANN). Neural networks can approximate given function with arbitrary accuracy. Neural networks are nonlinear models, which help them flexible in modelling real world complex relationships. The objective of this paper is to evaluate pattern classification techniques of neural network using clustering technique. The focus of this paper is on the application of data mining in large database system and analysis of pattern classification techniques of neural networks in the database using k-means algorithm.