MANET Routing protocols

Transmission control protocol is a connection oriented and reliable transport layer protocol. Initially TCP was mainly used for in wired networks but due to its efficiency was adopted initially for wireless and subsequently for Ad-Hoc Networks as well. Since TCP was originally designed to be meant for Wired Networks, it faced severe performance degradation when deployed in the wireless world. The reason for those performance failures included causes and effects such as route failures, channel losses and channel contention issues. This review is all about TCP working process with challenges of deploying TCP over wireless ad-hoc networks such as route failure and network partition, hidden and visible node problem, cross layer technique and improved inter layer communication. Finally, based on deriving best practices from the past works, authors have recommended for their own improvisation that is expected to address these limitations.

Recent trends in compact computing and wireless technologies are expansion of ad hoc network.
Ad hoc network consists of versatile flat forms which are free to move expeditiously. Ad hoc networks are
multi-hop network that use wireless communication for transmission without any fixed infrastructure.
The networks are form and deform on-the-fly without the need for any system. Ad hoc structure does not
require an access point, it is easy to setup, especially in a small or temporary network. Each node in the
network forwards the packet without the need of central administration. In ad hoc network, node acts as a
router to send and receive the data. An advantage of the system is robustness, flexibility and mobility.
Ad hoc network are capable for analyzing radio propagation environment to optimize the performance.
This typically requires that the network node have positioning capability as well as memory to recall
geographical local condition. An ad hoc network typically refers to any set of network where all devices have
equal status on a network and are free to associate with any other ad hoc network device in link range.
Ad hoc network often refers to a mode of operation of IEEE802.11 wireless networks. This review is focused
on the applications, advantages and challenges of ad hoc networks.

The hierarchical routing algorithm is categorized as a kind of routing method using node clustering to create a hierarchical structure in large‐scale mobile ad hoc network (LMANET). In this paper, we proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchical routing in LMANET. The HCAL is designed based on a cost metric in the form of the link expiration time and node's relative degree. Correspondingly, the routing protocol for HCAL adopts a reactive protocol to control the existing cluster head (CH) nodes and handle proactive nodes to be considered as a cluster in LMANET. Hierarchical clustering algorithm jointly utilizes table‐driven and on‐demand routing by using a combined weight metric to search dominant set of nodes. This set is composed by link expiration time and node's relative degree to establish the intra/intercommunication paths in LMANET. The performance of the proposed algorithm and protocol is numerically evaluated in average end‐ to‐end delay, number of CH per round, iteration count between the CHs, average CH keeping time, normalized routing overhead, and packet delivery ratio over a number of randomly generated benchmark scenarios. Furthermore, to corroborate the actual effectiveness of the HCAL algorithm, extensive performance comparisons are carried out with some state‐of‐the‐art routing algorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic‐Based Clustering, Dynamic Link Duration Clustering, and mobility‐based clustering algorithms. KEYWORDS cluster head (CH), clustering, cost metrics, hierarchical routing algorithm, mobile ad hoc networks (MANET)

MANETs (Mobile Ad hoc Network) is a self-governing system in which different mobile nodes are connected by wireless links. MANETs comprise of mobile nodes that are independent for moving in and out over the network. Nodes are the devices or systems that is laptops, mobile phone etc. those are participating in the network. These nodes can operate as router/host or both simultaneously. These nodes can form uninformed topologies as per their connectivity among nodes over the network. Security in MANETs is the prime anxiety for the fundamental working of network. MANETs frequently will be ill with security threats because of it having features like altering its topology dynamically, open medium, lack of central management & monitoring, cooperative algorithms and no apparent security mechanism. These factors draw an attention for the MANETs against the security intimidation. In this paper we have studied about security attack in MANET and its consequences, proposed technique for black hole detection is hybrid in nature which combines the benefit of proactive and reactive protocol and proposed technique is compared with AODV.

A VLAN is a logical connection that allows hosts to be grouped together in the same broadcast domain, so that packets are delivered only to ports that are combined to the same VLAN. We can improve wireless network performance and save bandwidth through the characteristic VLAN network. In addition, the implementation of VLAN greatly improves wireless network security by reducing the number of hosts receiving copies of frames broadcast by switches, thus keeping hosts holding critical data on a separate VLAN. In this paper we compare wireless network with VLAN via wireless network. The proposed network is evaluated within terms of delay and average throughput using web browsing applications and file transfer in heavy traffic. The simulation was carried out using OPNET 14.5 modeler and the results show that the use of VLAN via wireless network improved performance by reducing traffic resulting in a minimized delay time. Furthermore, VLAN implementation reduces network throughput because...

Mobile Ad-hoc Networks (MANETs) exhibit unpredictable topology with heterogeneous node contact rates, high mobility and limited information. When dealing with such challenging environments, the mobility model has a key role in testing the performance and proving the expected behavior of routing algorithms. While synthetic mobility models have been largely used to measure quantitative aspects of routing protocols, they are not sufficient as they do not capture reliably the properties of movement in the real life scenarios. In this paper we present some experimentation done in THE_ONE simulation environment, involving our M2MShare, a peer-to-peer (P2P) delay tolerant file sharing platform for mobile networks. For testing purposes we have chosen the Working Day Movement (WDM) model which is shown to make a good approximation of human mobility patterns and provides the flexibility of configuring real life test scenarios.

In this paper, we discuss security issues and their current solutions in the mobile ad hoc network. Owe to the vulnerable nature of the mobile ad hoc network, there are numerous security threats that disturb the development of it. We first analyze the main vulnerabilities in the mobile ad hoc networks, which have made it much easier to suffer from attacks than the traditional wired network. Then we discuss the security criteria of the mobile ad hoc network and present the main attack types that exist in it. Finally we survey the current security solutions for the mobile ad hoc network.

We consider the problem of routing short-burst data in Mobile Ad Hoc Networks (MANETs) characterized by ultra-low data rates. Existing routing protocols exhibit poor scalability in such low-capacity regimes due to their use of control packets. We present a novel on-demand zero-control-packet routing protocol called VINE that computes cost gradients to nodes by inspecting packet headers of the received data packets, which are then used to forward the future data packets. VINE provides data reliability via per-hop implicit acknowledgments and end-to-end acknowledgments.

We describe VINE and derive an expression for its communication complexity. We present ns3 simulation results across a wide range of network sizes, densities, and traffic that show that VINE significantly outperforms AODV across all of these scenarios, with up to ∼2.5x higher delivery ratio. VINE also provides better security by eliminating scope for control attacks. VINE has been implemented on the goTenna Pro mesh networking device for the military and public safety markets.

This paper investigates the research issues in routing protocols of the Wireless Sensor Networks (WSNs), since WSNs are becoming increasingly essential technology that would be used in a different type of applications such as home automation, physical monitoring, habitat monitoring, military applications, noise detection, and forest fire detection. The survey revealed that designing efficient routing protocols for sensor networks that suits sensor networks serving various applications is important. After reviewing many routing protocols the conclusion was that, swarm intelligence based routing protocols can eliminate at least one or more of the existing routing protocols limitations, such as, energy efficiency, scalability, mobility, deployment and fault tolerance.

Vehicular Sensor Networks (VSNs) are an emerging area of research that combines technologies developed in the domains of Intelligent Transport Systems (ITS) and Wireless Sensor Networks. Data dissemination is an important aspect of these networks. It enables vehicles to share relevant sensor data about accidents,
traffic load, or pollution. Several protocols are proposed for Vehicle to Vehicle (V2V) communication, but they are prone to intermittent connectivity. In this chapter, the authors propose a roadside infrastructure to ensure stable connectivity by adding vehicle to infrastructure to the V2V communication. They introduce a data dissemination protocol, Hexagonal Cell-Based Data Dissemination, adapting it for VSNs within a metropolitan area. The virtual architecture of the proposed data dissemination
protocol exploits the typical radial configuration of main roads in a city, and uses them as the basis for the communication infrastructure where data and queries are stored. The design of the communication infrastructure in accordance with the road infrastructure distributes the network data in locations that are close or easily reachable by most of the vehicles. The protocol performs a geographical routing and is suitable for highly dynamic networks, supporting a high number of mobile sources and destinations of data. It ensures reliable data delivery and fast response. The authors evaluate the performance of the proposed protocol in terms of data delivery ratio and data delivery delay. The simulation results show that HexDD significantly improves the data packet delivery ratio in VANETs.

Over the most recent couple of years, the Internet of Things (IoT) has ended up being an intriguing and promising worldview that plans to add to incalculable applications by interfacing more physical "things" to the Internet. Although it rose as a significant empowering influence for some cutting edge applications, it additionally acquainted new difficulties with virtually soaked networks. The IoT is becoming animated, particularly in medical care and shrewd climate applications, including countless low fueled sensors and actuators to improve life and acquaint new administrations with the network. The Internet Engineering Task Force (IETF) created RPL as the steering convention for low force and lossy networks (LLNs) and normalized it in RFC6550 in 2012. RPL immediately picked up intrigue, and many exploration papers were acquainted with assessing and improve its presence in various applications. In this paper, we present a conversation of the fundamental parts of RPL and ...

A Vehicular Ad hoc Network (VANET) is a sort of mobile Peer-To-Peer wireless network that permits giving communication among adjacent vehicles and in the middle of vehicles and close-by settled roadside gear. The absence of concentrated framework, high node portability and expanding number of vehicles in VANET bring about a few issues examined in this paper, for example, interfering with associations, troublesome routing, security of correspondences and adaptability. Existing framework for VANET correspondence is demonstrated to have a few disadvantages. We have proposed a component so as to give secure and effective communication in VANET environment. We conquer the disadvantages of the current framework by utilizing Malicious Vehicular Analyzer algorithm and Elliptic Curve Cryptography (ECC). Utilizing these algorithms, vindictive messages are recognized. It likewise recognizes the mishap and different issues in the way of the vehicles. Elliptic Curve Cryptography (ECC) calculation is utilized for stronger security amid correspondence.

International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.

—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.

Mobile Ad hoc Network (MANET) is a self-organizing wireless network for mobile devices. It does not require any fixed infrastructure
to be configured which makes it more suitable to be used in environments that require on-the-fly setup. This paper discusses
the challenging issues in MANET routing security. It presents FrAODV, a trust-based scheme for securing AODV routing protocol
in MANET using the friendship mechanism. The nodes can evaluate the routing paths according to some selected features (such
as node reputation and identity information) before forwarding the data through these routes. We have used two types of implementation
in our scheme, simulation (using NS2) and real test-bed (using JADHOC). This scheme is believed to provide a robust environment where MANET nodes can trust each other in a secure community.

The field of Wireless Sensor Networks (WSNs) is experiencing a resurgence of interest and a continuous
evolution in the scientific and industrial community. The use of this particular type of ad hoc network is
becoming increasingly important in many contexts, regardless of geographical position and so, according
to a set of possible application. WSNs offer interesting low cost and easily deployable solutions to perform
a remote real time monitoring, target tracking and recognition of physical phenomenon. The uses of these
sensors organized into a network continue to reveal a set of research questions according to particularities
target applications. Despite difficulties introduced by sensor resources constraints, research contributions
in this field are growing day by day. In this paper, we present a comprehensive review of most recent
literature of WSNs and outline open research issues in this field.

The need, popularity and easy deployment of MANET with less cost has increase its application areas from military to day-today life and research to business. The application uses MANET need best performance. MANETs are autonomous and infrastructureless in which nodes are free to move arbitrary, makes network topology unstable and the routing become complex in such dynamic nature of topology. The set of applications for MANETs is diverse, ranging from small to large-scale networks. The network area scalability is an important consideration while measuring the performance of MANET routing protocols. This paper evaluates the performance of MANET Routing Protocols OLSR, AODV, DSR, GRP and TORA on varying network area size using OPNET simulator. The performance of these routing protocols are measured and compared on 'Average Routing Load', 'Average end-to-end delay' and 'Average Throughput' metrics. The performance rank tables give insight to select better then the best routing protocol for application scenario.

Decentralized off-grid short-burst communications for public safety and other applications require mobile wireless networks that can be inexpensively and instantly deployed to cover a large area. Maximizing coverage often necessitates trading bit-rate for range. The resulting capacity is insufficient to support existing mesh networking protocols due to their excessive control overhead, and motivates a fresh approach. We present the networking architecture of goTenna-a long-range lightweight device for mobile mesh networking. Our protocol uses a novel zero-control-packet approach for broadcasting and unicasting that builds state by observing packet header information. We describe its experimental evaluation using ns3, and on a goTenna testbed, concluding with some research challenges. I. MOTIVATION There is a need for an infrastructure-free communications system for short-burst data communications such as collab-orative mapping in the context of public safety, military, and recreation, and for sensing in the context of Internet-of-Things (IoT). Such a system should be decentralized (for robustness), inexpensive, lightweight (for portability), have a very long battery life, allow mobility (of first-responders), and network a significant area with a limited number of devices. The last point is crucial. A number of mesh and ad hoc networking products and prototypes based on WiFi and similar technologies have failed to address the problem because their short range results in inadequate connectivity or excessive deployment cost which renders them impractical and susceptible to the "zero-start" problem [1]. Unfortunately, with all else equal, any practical range-increasing technique results in a reduction in bit-rate. As a case in point, LoRa [2], a fast-growing standard for long-range communication, has bit-rates of 0.25-50 kbps. While this may be sufficient for short-burst data if we consider just the data, the problem is that networking protocols do not scale at these low bit-rates. The literature is replete with thousands of MANET broadcast and unicast routing protocols, and several standards exist, such as AODV [3]. However, most if not all such protocols use dedicated control packets such as Hellos, Link-State Update, Route Request/Response etc. The ultra-low capacities characteristic of long-range short-burst communications cannot support this control packet overhead even for modestly-sized networks (further discussed in section II), motivating a dramatic reduction if not elimination of control packet overhead.

International Journal on Cryptography and Information Security ( IJCIS) is an open access peer reviewed journal that focuses on cutting-edge results in applied cryptography and Information security. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.

In recent years, many energy-efficient routing protocols have been proposed. However, very little efforts have been taken in studying the energy consumption of individual node, overhead and route maintaining issues. While not considering the design of energy efficient routing protocol, it may perform very worst than the normal routing protocol. Here, we have proposed On Demand Based Energy Efficient Routing Protocol (ODBEERP). The main aim of proposed
protocol is to discover the minimum power-limitation route. The power limitation of a route is decided by the node which has the minimum energy in that route. So compared with the minimum node energy in any other route, the minimum node energy in the minimum power-limitation route has more energy. We have also proposed a more accurate analysis to track the energy consumptions due to various factors, and improve the performance during path discovery and in mobility scenarios. The proposed protocol is evaluated with object oriented discrete event simulator environment. Simulation results shows that the ODBEERP achieves good throughput, less delay, high packet delivery ratio and good energy efficiency than the existing protocol PEER.

This paper was designed to provide Intranet traffic monitoring by sniffing the packets at the local Area Network (LAN) server end to provide security and control. It was implemented using five computer systems configured with static Internet Protocol (IP) addresses used in monitoring the IP traffic on the network by capturing and analyzing live packets from various sources and destinations in the network. The LAN was deployed on windows 8 with a D-link 16-port switch, category 6 Ethernet cable and other LAN devices. The IP traffics were captured and analyzed using Wireshark Version 2.0.3. Four network instructions were used in the analysis of the IP traffic and the results displayed the IP and Media Access Control (MAC) address sources and destinations of the frames, Ethernet, IP addresses, User Datagram Protocol (UDP) and Hypertext Transfer Protocol (HTTP). The outcome can aid network administrators to control Intranet access and provide security.

Named Data Networking (NDN) is an emerging Internet architecture that employs a new network communication model based on the identity of Internet content. Its core component, the Pending Interest Table (PIT) serves a significant role of recording Interest packet information which is ready to be sent but in waiting for matching Data packet. In managing PIT, the issue of flow PIT sizing has been very challenging due to massive use of long Interest lifetime particularly when there is no flexible replacement policy, hence affecting PIT performance. The aim of this study is to propose an efficient PIT Control Management (PITCM) approach to be used in handling incoming Interest packets in order to mitigate PIT overflow thus enhancing PIT utilization and performance. PITCM consists of Adaptive Virtual PIT (AVPIT) mechanism, Smart Threshold Interest Lifetime (STIL) mechanism and Highest Lifetime Least Request (HLLR) policy. The AVPIT is responsible for obtaining early PIT overflow prediction and reaction. STIL is meant for adjusting lifetime value for incoming Interest packet while HLLR is utilized for managing PIT entries in efficient manner. A specific research methodology is followed to ensure that the work is rigorous in achieving the aim of the study. The network simulation tool is used to design and evaluate PITCM. The results of study show that PITCM outperforms the performance of standard NDN PIT with 45% higher Interest satisfaction rate, 78% less Interest retransmission rate and 65% less Interest drop rate. In addition, Interest satisfaction delay and PIT length is reduced significantly to 33% and 46%, respectively. The contribution of this study is important for Interest packet management in NDN routing and forwarding systems. The AVPIT and STIL mechanisms as well as the HLLR policy can be used in monitoring, controlling and managing the PIT contents for Internet architecture of the future.

Security[16] is an essential feature for wired and wireless network[1]. But due to its unique characteristics of MANETs[10], it creates a number of consequential security challenges to network. MANETs are vulnerable to various attacks[2], blackhole[12] is one of the possible attack. In this paper, we represent an intrusion detection[5] system for MANETs against blackhole attack using fuzzy logic[4]. Our system successfully detects the blackhole in the network and this information is passed to other nodes also. We also provide a detailed performance evaluation based on various network parameters. Our results show that the proposed system not only detects the blackhole[12] node, but improves the performance of AODV under the blackhole attack. General Terms Computer Network, Wireless Network, Manets, Security Issues.

NS2 IEEE Project Titles 2017 | 2018 Network Simulator IEEE Projects
2017 - 2018 NETWORK SIMULATOR - NS2 IEEE FINAL YEAR Projects
MANET (Mobile Ad-hoc Networks)
A Delay-Sensitive Multicast Protocol for Network Capacity Enhancement in Multirate MANETs
A Novel Approach for Efficient Usage of Intrusion Detection System in Mobile Ad Hoc Networks
Contradiction Based Gray-Hole Attack Minimization for Ad-Hoc Networks
Delay Analytical Models for Opportunistic Routing in Wireless Ad Hoc Networks
Energy Efficient Multipath Routing Protocol for Mobile ad-hoc Network Using the Fitness Function
Fine-Grained Analysis of Packet Loss in MANETs
SUPERMAN: Security Using Pre-Existing Routing for Mobile Ad hoc Networks
WSN – Wireless Sensor Networks (Routing)
A Distributed Delay-Efficient Data Aggregation Scheduling for Duty-cycled WSNs
A Joint Routing and MAC Protocol for Transmission Delay Reduction in Many-to-One Communication Paradigm for Wireless Sensor Networks
A Self-Adaptive Sleep/Wake-Up Scheduling Approach for Wireless Sensor Networks
E2HRC: An Energy-Efficient Heterogeneous Ring Clustering Routing Protocol for Wireless Sensor Networks
Energy Efficient Clustering Algorithm for Multi-Hop Wireless Sensor Network Using Type-2 Fuzzy Logic
Load Balanced Coverage with Graded Node Deployment in Wireless Sensor Networks
Load-Balanced Opportunistic Routing for Duty-Cycled Wireless Sensor Networks
Low-Cost Collaborative Mobile Charging for Large-Scale Wireless Sensor Networks
Near Optimal Data Gathering in Rechargeable Sensor Networks with a Mobile Sink
Optimal Privacy-Preserving Probabilistic Routing for Wireless Networks
Optimization of Watchdog Selection in Wireless Sensor Networks
QoS-Aware and Heterogeneously Clustered Routing Protocol for Wireless Sensor Networks
Routing Protocol for Wireless sensor networks Using Swarm intelligence-ACO with ECPSOA
SEND: A Situation-Aware Emergency Navigation Algorithm with Sensor Networks
Speed Up-Greedy Perimeter Stateless Routing Protocol for Wireless Sensor Networks (SU-GPSR)
WSN – Wireless Sensor Networks (Security)
A Key Distribution Scheme for Mobile Wireless Sensor Networks: q-s-composite
A Novel Authentication and Key Agreement Scheme for Implantable Medical Devices Deployment
A Secure and Efficient ID-Based Aggregate Signature Scheme for Wireless Sensor Networks
Intrusion Detection Based on State Context and Hierarchical Trust in Wireless Sensor Networks
Lightweight Three-factor Authentication and Key Agreement Protocol for Internet-integrated Wireless Sensor Networks
Location-Based Key Management Strong Against Insider Threats in Wireless Sensor Networks
Research on Trust Sensing based Secure Routing Mechanism for Wireless Sensor Network
Resilience of DoS Attacks in Designing Anonymous User Authentication Protocol for Wireless Sensor Networks
ROSE: Robustness Strategy for Scale-Free Wireless Sensor Networks
Traffic Decorrelation Techniques for Countering a Global Eavesdropper in WSNs
TruFiX: A Configurable Trust-based Cross-Layer Protocol for Wireless Sensor Networks
VANET – Vehicular Ad-hoc Networks (Routing)
Adaptive Quality of Service based Routing for Vehicular Ad hoc Networks with Ant Colony Optimization
CBS: Community-based Bus System as Routing Backbone for Vehicular Ad Hoc Networks
DIVERT: A Distributed Vehicular Traffic Re-routing System for Congestion Avoidance
EcoTrec—A Novel VANET-Based Approach to Reducing Vehicle Emissions
Enhancing Quality of Service Conditions Using a Cross-Layer Paradigm for Ad-hoc Vehicular Communication
MoZo: A Moving Zone Based Routing Protocol Using Pure V2V Communication in VANETs
Trustworthiness Evaluation-based Routing Protocol for Incompletely Predictable Vehicular Ad hoc Networks
VANET – Vehicular Ad-hoc Networks (Security)
Distributed Aggregate Privacy-Preserving Authentication in VANETs
EAAP: Efficient Anonymous Authentication With Conditional Privacy-Preserving Scheme for Vehicular Ad Hoc Networks
Efficient Privacy-Preserving Dual Authentication and Key Agreement Scheme for Secure V2V Communications in an IoV Paradigm
Enhancing Security and Privacy for Identity-based Batch Verification Scheme in VANET
GDVAN: A New Greedy Behavior Attack Detection Algorithm For VANETs
REPLACE: A Reliable Trust-based Platoon Service Recommendation Scheme in VANET
WIRELESS COMMUNICATIONS & OTHERS
Congestion Control Scheme Performance Analysis Based on Nonlinear RED
Distributed Learning for Energy-Efficient Resource Management in Self-Organizing Heterogeneous Networks
End-to-end Throughput Maximization for Underlay Multi-hop Cognitive Radio Networks with RF Energy Harvesting
Robotic Message Ferrying for Wireless Networks using Coarse-Grained Backpressure Control
Spectrum-Availability based Routing for Cognitive Sensor Networks
Towards Effective Trust-based Packet Filtering in Collaborative Network Environments
Virtual Multipath Attack and Defense for Location Distinction in Wireless Networks

Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.

Radio frequency (RF) energy transfer and harvesting techniques have recently become alternative methods to power the next generation wireless networks. As this emerging technology enables proactive energy replenishment of wireless devices, it is advantageous in supporting applications with quality of service (QoS) requirements. In this paper, we present an extensive literature review on the research progresses in wireless networks with RF energy harvesting capability, referred to as
RF energy harvesting networks (RF-EHNs). First, we present
an overview of the RF-EHNs including system architecture, RF
energy harvesting techniques and existing applications. Then, we present the background in circuit design as well as the state-of-the-art circuitry implementations, and review the communication protocols specially designed for RF-EHNs. We also explore various key design issues in the development of RF-EHNs according to the network types, i.e., single-hop networks, multi-antenna networks, relay networks, and cognitive radio networks. Finally, we envision some open research directions.

In mobile ad hoc networks (MANETs), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we propose a formulation of the routing problem in multi-services MANETs, as well as the implementation of an adaptation of the dynamic source routing (DSR) protocol.

Completely GPS-free positioning systems for wireless, mobile, ad-hoc networks typically stress on building a network-wide coordinate system. Such systems suffer from lack of mobility and high computational overhead. On the other hand, specialized hardware in GPS-enabled nodes tends to increase the solution cost. A number of GPS free position based routing algorithms have been studied by the authors before proposing a new positioning framework in this paper. The proposed positioning framework is characterized by using only a handful of GPS enabled nodes. Lower dependence on specialized GPS hardware reduces the total cost of implementing the framework. A new location aided routing protocol called Location Aided Cluster Based Energy-efficient Routing (LACBER) has been proposed in the paper. Simulation results show that using the proposed positioning framework, LACBER turns out to be efficient in lowering mean hop and hence in utilizing the limited energy of mobile nodes.

The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.

AIRCC's International Journal of Computer Network & Communications( IJCNC) is dedicated to strengthen the field of Computer Networks and Communications and publishes only good quality papers. IJCNC is highly selective and maintains less than 5% acceptance rate. All accepted papers will be tested for plagiarism manually as well as by Docoloc. Papers published in IJCNC has received enormous citations and has been regarded as one of the best Journal in the networking research field.

The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.Wireless Network

A Mobile ad hoc Network is a kind of wireless network, and also an infrastructure less network. All the nodes are independent of each other and hence nodes can easily join and leave the network at any time. MANETs are highly dynamic in nature which makes its topology change very frequently. As the nodes both mobile and wireless, there will be no continuous power supply making the network resource-constraint. The nodes are free to move randomly and manage themselves and also perform the task of routing. Because of the very unpredictable nature of this type of network, routing becomes a challenging task. Also, the very dynamic nature of a MANET attracts more possibilities for the intruders to launch attacks easily. Security in MANET has become a significant and active topic within the research community. This is because of high demand in sharing streaming video and audio in various applications of computers and communication industry. A MANET could be setup quickly to facilitate communications in a hostile environment such as battlefield or emergency situation like disaster rescue operation.
Due to the ad hoc and dynamic nature of MANET’s, they are open to malicious activity from intruders. In spite of the several attacks aimed at specific nodes in MANET that have been uncovered, some attacks involving multiple nodes still receive little attention. The main reason for this is that people use the same security measures that can be used for wired networks also to MANET. Furthermore, it may also have to do with the fact that no survey or taxonomy has been done to clarify the characteristics of different multiple node attacks. There are many routing protocols proposed for MANET's but most of them exhibit poor performance in the presence of attacks. A new hybrid secure routing protocol SDSR that establishes a secure communication path across the nodes in the network which improves the packet delivery ratio, throughput and reduces the end to end
delay, overhead incurred across the network and also the number of packet losses has been proposed. This protocol works for both proactive and reactive networks and hence can be considered as a hybrid protocol for MANET’s. It reduces the multiple node attacks if there are malicious nodes in the network. It uses metrics like reputation, trust, packets received, delayed and dropped to create a trust environment in the network. This method also helps to identify malicious nodes based on the sequence number of the reply packet reieved. The proposed protocol has been
implemented using NS-2 .The new hybrid secure routing protocol SDSR achieved better packet delivery ratio and throughput when compared with protocols like AODV, AOMDV DSDV,DSR etc. and reduced the amount of packet losses, overhead incurred and the End-to-End delay in routing the packets from source to destination.

International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.