Enhance Node Lifetime Using Residual Battery Capacity in Mobile Adhoc Networks

2014 ◽  
Vol 573 ◽  
pp. 377-380
Author(s):  
Murugesan Meenakshi ◽  
C.T. Kalaivani
Keyword(s):  
Energy Efficiency ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Source Node ◽  
Battery Power ◽  
Battery Capacity ◽  
Adhoc Networks ◽  
Simulation Results ◽  
Mobile Ad Hoc

In this paper we focus on energy efficiency of the node in mobile ad hoc network with respect to metrics residual battery capacity and relay capacity of the node in the network. We have proposed a multicast algorithm which will use the remaining battery power of the node in an efficient way to increase the lifetime of the network. If the source node wants to send multicast packets, it chooses a node with higher residual-battery capacity. If all the intermediate nodes have equal residual-battery capacity, then it chooses a node with higher relay capacity. Simulation results revealed that the proposed algorithm is more efficient than the existing in terms of node lifetime, delay and throughput.

scholarly journals Selfish Caching and Facsimile Allocation over a Mobile Ad Hoc Network

2019 ◽  
Vol 8 (6S3) ◽  
pp. 1953-1958
Keyword(s):  
Mobile Devices ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Peer To Peer ◽  
Selfish Nodes ◽  
Replica Allocation ◽  
Adhoc Networks ◽  
Mobile Ad Hoc ◽  
Few Vertices

Mobile adhoc networks (MANETs) have drawn attention to multitudinous consideration because of the univerality of mobile devices as well as the developments in wireless era. MANET is a peer-to-peer multi hop cellular wireless era community which does not have both difficult and speedy infrastructure and a relevant server. Every vertex of a MANET performs like a router and communicates with every unique. There exist numerous information duplication strategies which were presented to reduce the execution squalor. All are concluded that everyone cell vertices cooperate completely from the perspective of sharing their memory vicinity. But, via a few methods few vertices might additionally behave selfishly and determine simplest to cooperate in part or never with different vertices. The selfish vertices ought to then lessen the overall information approachability within the network. From this work, we try to take a look at the influence of selfish vertices in a mobile ad hoc community in terms of reproduction issuance i.e Selfish nodes are dealt with in replica allocation.

scholarly journals Increased Routing Algorithm for Mobile AdHoc Networks

2019 ◽  
Vol 8 (9S3) ◽  
pp. 1606-1608
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Mobile Adhoc Networks ◽  
Adhoc Networks ◽  
Mobile Ad Hoc ◽  
End To End ◽  
Two Stages

A Mobile Ad-hoc Network (MANET) is an accumulation of portable hubs which impart over proportion. These systems have an essential preferred standpoint; they don't require any current foundation or focal organization. Portable specially appointed systems are appropriate for transitory correspondence joins. One of the significant issues in MANET is steering because of the versatility of the hubs. Directing means the demonstration of moving data over a web work from a source to a goal. The Enhanced Ant Routing Algorithm (EARA) depends on subterranean insect calculations. This calculation is enlivened from the insect states life. Forward bundles are utilized to gather data about the system and in reverse parcels are utilized to refresh the directing data in the hubs. EARA has two stages course disclosure and course support and furthermore utilities the idea of backtracking when the parcels are achieves goal hub. Re-enactment comes about accomplish better parcel conveyance proportion and lessen the normal end-to-end defer as contrast with its partner

Fangled Protocol for Black Hole Detection in Ad Hoc Networks

2013 ◽  
Vol 11 (9) ◽  
pp. 2994-3003
Author(s):  
Reeta Mishra
Keyword(s):  
Black Hole ◽  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Base Station ◽  
Source Node ◽  
Network Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Now a day, security in Mobile Ad hoc Network is very important issue. Due to dynamic topology and mobility of nodes, Mobile Ad hoc Networks are more vulnerable to security attacks than conventional wired and wireless network. Nodes of Mobile Ad hoc Network communicate directly without any central base station. That means in ad hoc network, infrastructure is not required for establishing communication. Therefore attacks in this are very frequent than other networks. In this research paper we are describing black hole attacks which are easy to launch in wireless ad hoc network. Black hole attack is referred to as a node dropping all packets and sending forged routing packets to route packets over itself. Ad hoc networks are vulnerable to different kinds of attacks such as: denial of services, impersonation, and eavesdropping.This paper discusses one of the security problems in ad hoc networks called the black hole problem. It occurs when a malicious node referred as black hole joins the network. The black hole conducts its malicious behaviour during the process of route discovery. For any received REQ, the black hole claims having a route and propagates a faked REP. The source node responds to these faked REPs and sends its data through the received routes. Once the data is received by the black hole, it is dropped instead of being sent to the desired destination.The proposed protocol is built on top of the original AODV. It extends the AODV to include the following functionalities: source node waits for a reliable route; each node has a table in which it adds the addresses of the reliable nodes; REP is overloaded with an extra field to indicate the reliability of the replying node. 

Evaluation of Maximum Lifetime Power Efficient Routing in Ad hoc Network Using Magnetic Resonance Concept

2019 ◽  
Vol 13 (3) ◽  
pp. 256-260 ◽  
Author(s):  
Manish Bhardwaja ◽  
Anil Ahlawat
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Wireless Power Transfer ◽  
Power Transfer ◽  
Wireless Power ◽  
Power Efficient ◽  
Maximum Lifetime ◽  
Battery Power ◽  
Mobile Ad Hoc

Background: A mobile Ad-hoc Network is a network in which each node is independent of all other nodes of the network. In MANETs, nodes do not have proper infrastructure. The power source of the Mobile Ad-hoc network is battery power. As we all know, battery power has a certain limit and problems. Objective: The main objective of this manuscript is to resolve the power problem of nodes of mobile ad hoc networks and increase the lifetime of the network. Methods: This paper implements the concept of wireless power transfer between the nodes of Adhoc network and transfers the power to these nodes wirelessly and uses the maximum lifetime power efficient routing algorithm (MLPER) to reduce the consumption of power used by the nodes. The wireless power transfer can be achieved with the help of one type of near-field techniques called magnetic resonance which works at the same resonance frequency. This technique is nonradiative in nature. Results: This paper reduces the problem of power of the ad hoc network nodes nearly 70 to 80 % from the traditional concept used for lifetime optimization of these nodes. Conclusion: In this manuscript, performance optimization can be analysed with the help of AODV (Ad hoc On-Demand Distance Vector Routing Protocol) on-demand routing protocol. This manuscript shows that the proposed algorithm gives significant better results than AODV protocol with some performance metrics. We revised some patents relating to Wireless power transfer.

scholarly journals Improving the Energy Efficiency in Mobile Ad-Hoc Network Using Learning-Based Routing

2020 ◽  
Vol 34 (3) ◽  
pp. 337-343
Author(s):  
Vijay Aroulanandam ◽  
Thamarai Latchoumi ◽  
Karnan Balamurugan ◽  
Tiruchengode Yookesh
Keyword(s):  
Energy Efficiency ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Ad Hoc

scholarly journals Periodically updating the content in mobile Ad hoc network with secured synchronization

2011 ◽  
pp. 11-13
Author(s):  
R. Banu Priya ◽  
V. Komath ◽  
A. Karthika
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Battery Power ◽  
Duty Cycles ◽  
Mobile Ad Hoc

The content and presence updates were used to transmit updates to nearby nodes over an ad hoc network using duty cycles; our algorithms synchronize the transmissions of nodes periodically. By this approach, nodes can save battery power without missing updates from their neighbors by switching off their network cards .The algorithms and protocols used here provides more security.

scholarly journals Global Consistency Management Methods Based on Escrow Approaches in Mobile ad Hoc Networks

2010 ◽  
Vol 6 (1) ◽  
pp. 5-26 ◽  
Author(s):  
Takahiro Hara ◽  
Shojiro Nishio
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Data Availability ◽  
Consistency Management ◽  
Global Consistency ◽  
Simulation Results ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Network Consistency

In a mobile ad hoc network, consistency management of data operations on replicas is a crucial issue for system performance. In our previous work, we classified several primitive consistency levels according to the requirements from applications and provided protocols to realize them. In this paper, we assume special types of applications in which the instances of each data item can be partitioned and propose two consistency management protocols which are combinations of an escrow method and our previously proposed protocols. We also report simulation results to investigate the characteristics of these protocols in a mobile ad hoc network. From the simulation results, we confirm that the protocols proposed in this paper drastically improve data availability and reduce the traffic for data operations while maintaining the global consistency in the entire network.

Sign in / Sign up

Export Citation Format

Share Document