scholarly journals Levenberg–Marquart logistic deep neural learning based energy efficient and load balanced routing in MANET

2021 ◽  
Vol 23 (2) ◽  
pp. 1002
Author(s):  
A. Sangeetha ◽  
T. Rajendran
Keyword(s):  
Energy Efficient ◽  
Ad Hoc ◽  
New Technologies ◽  
Activation Function ◽  
Mobile Node ◽  
Residual Energy ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Neural Learning ◽  
Load Balanced

As the advent of new technologies grows, the deployment of mobile ad hoc networks (MANET) becomes increasingly popular in many application areas. In addition, all the nodes in MANET are battery operated and the node mobility affects the path stability and creates excessive traffic leads to higher utilization of energy, data loss which degrades the performance of routing. So, in this paper we propose Levenberg–Marquardt logistic deep neural learning based energy efficient and load balanced routing (LLDNL-EELBR) which is a machine learning method to deeply analyze the mobile nodes to calculate residual load and energy and it also uses logistic activation function to select the mobile node having higher residual energy and residual load to route the data packet. Experimental evaluations of three methods (LLDNL-EELBR, multipath battery and mobility-aware routing scheme (MBMA-OLSR) and opportunistic routing with gradient forwarding for MANETs (ORGMA)) were done and the result reveals that LLDNL-EELBR method is able to increase the through put and minimizes the delay and energy consumption in MANET when compared to works under consideration.<br /><div> </div>

The Research of Data Gathering Protocol for Mobile Sensor Networks

2011 ◽  
Vol 216 ◽  
pp. 621-624
Author(s):  
Xin Lian Zhou ◽  
Jian Bo Xu
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
Mobile Sink ◽  
Mobile Node ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Node Mobility ◽  
Sink Node ◽  
Mobile Sensor ◽  
The Impact

This paper first proposed an energy-efficient distributed clustering technology for mobile sensor nodes and sink node mobility, select the higher residual energy and the nearest node from fixed nodes as cluster heads responsible for collecting sensed data, and all the fixed nodes form routing backbone to forward data, both can save energy and avoid cluster head away. Then, proposed a cross-layer scheduling mechanism to avoid the impact of mobile node and meet expectations cluster coverage. With energy-efficient clustering technology, efficient network topology control technology and mobile sink node, the data collection algorithm MSDBG, not only has considered mobility of nodes and energy saving, but also has achieved prolonging network lifetime.

scholarly journals Energy Efficient and robust routing with RPAR Protocol in Ad Hoc Networks

2017 ◽  
Vol 7 (1.1) ◽  
pp. 477
Author(s):  
Joshua Reginald Pullagura ◽  
D Venkata Rao
Keyword(s):  
Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Life Time ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Mechanism ◽  
Hoc Networks

In ad hoc network, the topology of network changes frequently due to the mobile nature of nodes where the communication is possible without any fixed network infrastructure. Mobile nodes are battery operated and so energy efficient routing should be provided which increases the network life time. The existing routing mechanisms do not consider both hop count and energy of nodes for data transmission. In this paper we propose a routing mechanism where data transfer from source to destination is based on the minimum hop count and residual energy of mobile nodes. The proposed RPAR protocol shows better performance when compared to existing Energy power aware routing  protocol .The analysis is carried out by using network simulator (NS-2), the simulation results shows that the proposed routing mechanism provides energy efficient and reliable  routing in ad hoc networks.

scholarly journals A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
B. Sivakumar ◽  
N. Bhalaji ◽  
D. Sivakumar
Keyword(s):  
Load Balancing ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Recent Literature ◽  
Mobile Nodes ◽  
Critical Nodes ◽  
Mobile Ad Hoc ◽  
Critical Links ◽  
Hoc Networks

In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing.

scholarly journals ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)

2013 ◽  
pp. 218-223
Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL
Keyword(s):  
Swarm Intelligence ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Ant Colony Algorithms ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).

scholarly journals Optimally-balanced Hash Tree Generation in Ad Hoc Networks

2011 ◽  
Vol 6 (1) ◽  
Author(s):  
Vijay Ram Ghorpade ◽  
Yashwant V. Joshi ◽  
Ramchandra R. Manthalkar
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Node ◽  
Public Key ◽  
Mobile Nodes ◽  
Tree Structures ◽  
Tree Generation ◽  
Balanced Structure ◽  
Hoc Networks ◽  
Specific Number

Ideally a hash tree is a perfect binary tree with leaves equal to power of two. Each leaf node in this type of tree can represent a mobile node in an ad hoc network. Each leaf in the tree contains hash value of mobile node’s identification (ID) and public key (PK). Such a tree can be used for authenticating PK in ad hoc networks. Most of the previous works based on hash tree assumed perfect hash tree structures, which can be used efficiently only in networks with a specific number of mobile nodes. Practically the number of mobile nodes may not be always equal to a power of two and the conventional algorithms may result in an inefficient tree structure. In this paper the issue of generating a hash tree is addressed by proposing an algorithm to generate an optimally-balanced structure for a complete hash tree. It is demonstrated through both the mathematical analysis and simulation that such a tree is optimally-balanced and can efficiently be used for public key authentication in ad hoc networks.

scholarly journals Leveraging Mobile Nodes for Preserving Node Privacy in Mobile Crowd Sensing

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Qinghua Chen ◽  
Shengbao Zheng ◽  
Zhengqiu Weng
Keyword(s):  
Mobile Node ◽  
Privacy Preserving ◽  
Sensitive Information ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Mobile Crowd Sensing ◽  
Sensitive Data ◽  
Sensing Data ◽  
Crowd Sensing ◽  
Mobile Crowd

Mobile crowd sensing has been a very important paradigm for collecting sensing data from a large number of mobile nodes dispersed over a wide area. Although it provides a powerful means for sensing data collection, mobile nodes are subject to privacy leakage risks since the sensing data from a mobile node may contain sensitive information about the sensor node such as physical locations. Therefore, it is essential for mobile crowd sensing to have a privacy preserving scheme to protect the privacy of mobile nodes. A number of approaches have been proposed for preserving node privacy in mobile crowd sensing. Many of the existing approaches manipulate the sensing data so that attackers could not obtain the privacy-sensitive data. The main drawback of these approaches is that the manipulated data have a lower utility in real-world applications. In this paper, we propose an approach called P3 to preserve the privacy of the mobile nodes in a mobile crowd sensing system, leveraging node mobility. In essence, a mobile node determines a routing path that consists of a sequence of intermediate mobile nodes and then forwards the sensing data along the routing path. By using asymmetric encryptions, it is ensured that a malicious node is not able to determine the source nodes by tracing back along the path. With our approach, upper-layer applications are able to access the original sensing data from mobile nodes, while the privacy of the mobile node is not compromised. Our theoretical analysis shows that the proposed approach achieves a high level of privacy preserving capability. The simulation results also show that the proposed approach incurs only modest overhead.

A New Secure Ad-Hoc on Demand Distance Vector Routing Protocol to Ensure Less Power Consumption in Mobile Ad-Hoc Network

2020 ◽  
Vol 17 (6) ◽  
pp. 2483-2487
Author(s):  
Nippun Kamboj ◽  
Dalip ◽  
Munishwar Rai
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Real Life ◽  
Data Communication ◽  
Mobile Nodes ◽  
Energy Aware ◽  
Average Delay ◽  
Current Time

Current time represents the era of communication technology and in this revolution MANET is widely used and act as a key star for data communication in real life decisive scenario for e.g., disaster management, traffic control, military services etc. MANET is infrastructureless data communication network comprising of mobile nodes. For MANET it requires secure and energy efficient framework for the underlying routing protocol. To meet the need of efficient data communication in MANET, an Energy Efficient and Secure AODV (EES-AODV) protocol is proposed. In the projected routing protocol, first the order of network nodes happen dependent on energy and afterward encryption has been done. Simulation of projected protocol is performed for such as Average Delay, PDR and Throughput. Simulated results shows that modified AODV gives optimized performance and provides a more secure and energy aware protocol.

scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

scholarly journals Analysis on Privacy and Reliability of Ad Hoc Network-Based in Protecting Agricultural Data

2014 ◽  
Vol 8 (1) ◽  
pp. 777-781
Author(s):  
Xiangju Liu
Keyword(s):  
Routing Protocol ◽  
Data Transmission ◽  
Ad Hoc Network ◽  
Information Transfer ◽  
Ad Hoc ◽  
Mobile Node ◽  
Transfer System ◽  
Mobile Nodes ◽  
Wireless Data ◽  
Wireless Data Transmission

To analyze the privacy and reliability of Ad Hoc Network-based algorithms used in agricultural wireless data transmission, the paper introduces the routing protocols including DSDV, AODV and DSR, based on which a farmland model is built to simulate the speed and density of mobile node, and regards the success rate of data transmission (R/S Rate), average latency of end-to-end (E2E Delay) and average hops as the evaluation indicator of farmland information transfer system. As a result of the analysis, the privacy and reliability are influenced by the speed and density of mobile nodes; the higher the speed is and the lower the density is, the lower the R/S Rate is; AODV routing protocol is better in R/S Rate while DSDV routing protocol does better in both E2E Delay and average hops. It is concluded that DSDV routing protocol suits most the Ad Hoc network-based farmland information transfer system.

Sign in / Sign up

Export Citation Format

Share Document