‘Power-as-a-Service’ – A Hierarchical On-Demand Charging Model for Recharging the Mobile Nodes of MANETs

Battery energy is a crucial issue that limits battery-powered mobile devices’ operational efficiency in Mobile Ad hoc Networks (MANETs). Failure of a node affects both the lifetime and connectivity of a MANET, which has to initiate finding a new route from source to destination. This initiation causes more energy consumption in nodes. Failure of a node also causes network partitions, thereby resulting in sparse networks being formed. Existing energy-efficient strategies only defer the end of a node’s battery lifetime; they could not guarantee the MANET’s nonstop functioning. To address the issues caused by battery depletion, this paper proposes a “Cloud” oriented approach called Power-as-a-Service (PaaS), a hierarchical on-demand charging model for recharging the mobile nodes of the MANET. In PaaS, the MANET is alienated into non-overlapping disjoint zones, and for each zone, one Zone Charging Cloud Node (ZccN) is deployed to recharge the mobile nodes of that particular zone wirelessly. A High-power Charging Cloud Node (HccN) is deployed to wirelessly recharge the ZccNs in the MANET for the entire network. In PaaS, the ZccN recharges both the selected node for recharge and other nodes around the selected node that requested recharge and has higher power transfer efficiency. This strategy of PaaS improves the charging efficiency of cloud chargers by minimizing the urgent charging requests in the future, and thus the operational efficiency of the MANET improves. Extensive simulations indicate that the proposed PaaS model with a hierarchy of cloud chargers improves the operational efficiency of MANETs in terms of reducing the death rate of mobile nodes, thereby improving the lifetime and connectivity probability of MANETs.

Download Full-text

Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors

The Scientific World JOURNAL ◽

10.1155/2014/790103 ◽

2014 ◽

Vol 2014 ◽

pp. 1-11 ◽

Cited By ~ 10

Author(s):

Trung Kien Vu ◽

Sungoh Kwon

Keyword(s):

Ad Hoc ◽

Routing Algorithm ◽

Mobility Prediction ◽

Location Awareness ◽

Mobile Nodes ◽

Location Errors ◽

On Demand ◽

Demand Routing ◽

Hoc Networks ◽

The Impact

We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.

Download Full-text

A survey on energy efficiency in mobile ad hoc networks

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i2.21.12447 ◽

2018 ◽

Vol 7 (2.21) ◽

pp. 382

Author(s):

Geofrin Shirly ◽

N Kumar

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Mobile Ad Hoc Network ◽

Mobile Nodes ◽

Battery Lifetime ◽

Battery Power ◽

Mobile Ad Hoc ◽

Hoc Networks ◽

New Research

A mobile ad-hoc network is a collection of wireless mobile nodes which temporarily forms a network without any type of centralized administration which is already in use. In adhoc network, the battery lifetime of the mobile nodes is less. If suppose any nodes battery power is drained it leads to spreading of many divisions in the networks. Hence these spreader nodes are the very important spot in this network. For the purpose of data forwarding some very important nodes can drain their battery power in advance because of increase in load and processing for forwarding the data. Because of the variance in loads developed, the network of nodes will be collapsed very badly, the route lifetime will be reduced, network will be partitioned and route reliability is reduced in MANETs. Because of this, the most important criteria which have to be improved is the consumption of energy in mobile ad-hoc networks. The very important technique is power aware routing technique in MANETs. Hence minimization of energy in the network of mobile nodes individually can be done by using some of the routing techniques. The most important thing is to study the power aware protocol in order to help the new research doers and application developers to find a new idea for designing more efficient routing protocols.

Download Full-text

Modeling and verifying the Ariadne protocol using process algebra

Computer Science and Information Systems ◽

10.2298/csis120601009w ◽

2013 ◽

Vol 10 (1) ◽

pp. 393-421 ◽

Cited By ~ 2

Author(s):

Xi Wu ◽

Huibiao Zhu ◽

Yongxin Zhao ◽

Zheng Wang ◽

Liu Si

Keyword(s):

Routing Protocols ◽

Process Algebra ◽

Ad Hoc ◽

Route Discovery ◽

Mobile Nodes ◽

On Demand ◽

Secure Protocol ◽

Mobile Ad Hoc ◽

Demand Routing ◽

Hoc Networks

Mobile Ad Hoc Networks (MANETs) are formed dynamically by mobile nodes without the support of prior stationary infrastructures. In such networks, routing protocols, particularly secure ones are always the essential parts. Ariadne, an efficient and well-known on-demand secure protocol of MANETs, mainly concerns about how to prevent a malicious node from compromising the route. In this paper, we apply the method of process algebra Communicating Sequential Processes (CSP) to model and reason about the Ariadne protocol, focusing on the process of its route discovery. In our framework, we consider the communication entities as CSP processes, including the initiator, the intermediate nodes and the target. Moreover, we also propose an intruder model allowing the intruder to learn and deduce much information from the protocol and the environment. Note that the modeling approach is also applicable to other protocols, which are based on the on-demand routing protocols and have the route discovery process. Finally, we use PAT, a model checker for CSP, to verify whether the model caters for the specification and the non-trivial secure properties, e.g. nonexistence of fake path. Three case studies are given and the verification results naturally demonstrate that the fake routing attacks may be present in the Ariadne protocol.

Download Full-text

Security in Pervasive Computing

Strategic Pervasive Computing Applications ◽

10.4018/978-1-61520-753-4.ch008 ◽

2011 ◽

pp. 123-136

Author(s):

Sunita Prasad ◽

Rakesh Chouhan

Keyword(s):

Black Hole ◽

Pervasive Computing ◽

Routing Protocol ◽

Ad Hoc ◽

Mobile Nodes ◽

Malicious Nodes ◽

On Demand ◽

Reactive Routing ◽

Mobile Ad Hoc ◽

Hoc Networks

Pervasive computing has wide application in military, medical and smart home domain. In pervasive computing, a large number of smart objects interact with one another without the user intervention. Although the technology is promising but security needs to be addressed before the technology is widely deployed. Pervasive networks are formed spontaneously and the devices communicate via radio. Thus, mobile ad hoc networking is an essential technology for pervasive computing. An ad hoc network is a collection of wireless mobile nodes, which acts as a host as well as a router. The communication between the nodes is multihop without any centralized administration. AODV (Ad Hoc On demand Distance Vector) is a prominent on-demand reactive routing protocol for mobile ad hoc networks. But in existing AODV, there is no security provision against well-known attack known as “Black hole attack”. Black hole nodes are those malicious nodes that agree to forward the packets to destination but do not forward the packets intentionally. Thischapter extends the watchdog mechanism for the AODV routing protocol to detect such misbehavior based on promiscuous listening. The proposed method first detects a black hole node and then gives a new route bypassing this node. The experimental results show that in a lightly loaded, hostile environment, the proposed scheme improves the throughput compared to an unprotected AODV protocol.

Download Full-text

DETECTION AND REMOVAL OF BLACK HOLE IN MOBILE AD-HOC NETWORK (MANET)

International Journal of Electronics and Electical Engineering ◽

10.47893/ijeee.2013.1074 ◽

2013 ◽

pp. 88-90

Author(s):

SHRADDHA RAUT ◽

SD CHEDE

Keyword(s):

Black Hole ◽

Ad Hoc Network ◽

Ad Hoc ◽

Mobile Ad Hoc Network ◽

Central Administration ◽

Mobile Nodes ◽

On Demand ◽

Aodv Protocol ◽

Demand Routing ◽

Hoc Networks

This paper gives information about the detection technique of black hole in the MANET. An ad hoc network is a collection of mobile nodes that dynamically form a temporary network. It operates without the central administration. Hence it becomes more susptable to the attacker .Mostly used on- demand routing protocols used in Ad-Hoc networks is AODV (Ad-Hoc On demand DistanceVector) protocol. The security of the AODV protocol is compromised by a particular of attack called “Black Hole” attack. In this attack, a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability, it is proposed to wait and check the replies from all the neighboring nodes to find a safe route.

Download Full-text