AN AGENT BASED POWER AND BANDWIDTH AWARE ROUTING FOR MOBILE AD-HOC NETWORKS

2004 ◽  
Vol 12 (supp02) ◽  
pp. 83-100 ◽  
Author(s):  
S. S. MANVI ◽  
M. M. KODABAGI ◽  
BHANU PRASAD
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Software Reuse ◽  
Intelligent Agents ◽  
Ad Hoc ◽  
Optimal Path ◽  
Mobile Node ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Battery Energy

Ad-hoc wireless networks are power constrained as the nodes operate with limited battery energy. To maximize the lifetime of these networks, transactions through each mobile node must be controlled in such a way that the power dissipation rates for the nodes are almost the same. At the same time, providing QoS for ad-hoc networks is a complex task due to the ever-changing network topology. This paper addresses the problem of power and bandwidth aware routing. We propose a power and bandwidth aware source initiated routing model for mobile ad-hoc networks. The model uses both the static and mobile intelligent agents. The agents together find an optimal path among the available routes. The model is simulated to test its operational effectiveness in various network scenarios. We observed that the agents provide more flexible and adaptable routing services and also support component based software engineering features such as software reuse, maintainability, customization, and encapsulation.

Offline/Online Security in Mobile Ad Hoc Networks

2013 ◽  
pp. 199-222 ◽  
Author(s):  
Wen-Jung Hsin ◽  
Lein Harn
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Node ◽  
Mobile Nodes ◽  
Online Security ◽  
Autonomous Network ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc network is a network comprised of mobile nodes quickly forming an autonomous network for a particular purpose such as emergency search and rescue. One of the most prominent security challenges for such a network is the limited capacity in the mobile nodes, thereby preventing costly computation operations. However, this limitation on a mobile node manifests itself only when the mobile node is dispatched on an active duty (i.e., online). One can prepare the mobile nodes as much as possible offline in anticipation of an upcoming deployment. In this chapter, the authors present three offline/online authentication and key agreement schemes and one offline/online non-repudiation scheme, all aiming at fast online computation for mobile nodes in mobile ad hoc networks.

scholarly journals EFFICIENT MANET- INTERNET INTEGRATION FOR MOBILE DEVICES

2014 ◽  
Vol 14 (1) ◽  
pp. 5343-5351
Author(s):  
Mahesh kumar Tiwari ◽  
UDAI SHANKAR ◽  
AJAY KUMAR
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Node ◽  
The Internet ◽  
Mobile Nodes ◽  
Gateway Discovery ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A mobile ad hoc network (MANET) consists of wireless mobile nodes without having a fixed infrastructure support. The communication between these mobile nodes is carried out without any centralized control. The communication among the nodes within the infrastructure less networks is done through Ad-Hoc routing protocols, But whenever any mobile node want to communicate to a node in a network that is outside the ad hoc network such as internet, there should be an appropriate mechanism for establishing this connection with the internet node or host. Gateway discovery is a fundamental process in connecting MANET with the internet. A mobile node can connect to the internet by discovery of some specialized nodes called as gateway nodes. These Gateway nodes act as a bridge between the mobile ad hoc networks node and the internet. The basic aim of the gateway discovery approach is to modify the route discovery process so that it is not only used for discovery of destination mobile nodes but also the gateways. In this paper we are going to present a review of various gateway discovery approaches which are used for establishing the interconnection of mobile ad hoc networks and internet and going to propose a algorithm that reduce the discovery time of the gateway by selective forwarding and simultaneously also optimize the gateway discovery control overheads.

scholarly journals A Review Of Internet Gateway Discovery Approaches For Mobile Adhoc Networks

2005 ◽  
Vol 4 (2) ◽  
pp. 495-508 ◽  
Author(s):  
Deepak Kumar Patel ◽  
Rakesh Kumar
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Node ◽  
The Internet ◽  
Mobile Nodes ◽  
Gateway Discovery ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A mobile ad hoc network (MANET) consists of wireless mobile nodes without having a fixed infrastructure. The communication between these mobile nodes is carried out without any centralized control. The communication among the nodes within the infrastructure less networks is done through some routing protocol. But whenever any mobile node want to communicate a node in a network that is outside the ad hoc network such as internet, there should be an appropriate mechanism for establishing this connection. Gateway discovery is a fundamental process in connecting MANET with the internet. A mobile node can connect to the internet by discovery of some specialized nodes called as gateway nodes These Gateway nodes act as a bridge between the mobile ad hoc networks and the internet. The basic aim of the gateway discovery approach is to modify the route discovery process so that it is not only used for discovery of destination mobile nodes but also the gateways. In this paper we are going to present a review of various gateway discovery approaches which are used for establishing the interconnection of mobile ad hoc networks and internet.

scholarly journals Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networks

2021 ◽  
Vol 12 (2) ◽  
pp. 1-14
Author(s):  
Mohammed Tarique ◽  
Rumana Islam
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Node ◽  
Optimum Number ◽  
Network Simulator ◽  
Static Case ◽  
Mobile Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks

This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks (MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11 as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there is no global optimum number of neighbors for the mobility case.

scholarly journals Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 70-74
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Network Size ◽  
Base Station ◽  
Ad Hoc Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks are an independent wireless network that is built without permanent infrastructure and base station support. Each node in the network uses a wireless connection for connections and acts not only as an end system but also as a path to accelerating packets. Meanwhile, the network nodes are mobile and can move in each path with changing steps, creating a great dynamic of the network. Therefore, the protocols set for general ad hoc networks are inappropriate for such a situation. In addition, the performance of ad hoc routing protocols decreases with increasing network size. In this context, suggest a new way to extend the recital of routing in MANETs: the on-demand Progressive Distance Vector (PAODV). It is a modified variant of the standard AODV routing protocol, which shrinks the dynamic path when an optimal path exists and switches the traffic to it. Simulation studies with NS2 show that the proposed method improves network performance as network size, weight, or flexibility increase.

scholarly journals Energy-efficient and reliable routing protocol for dynamic-property-based clustering mobile ad hoc networks

2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668360 ◽  
Author(s):  
Young-jun Oh ◽  
Kang-whan Lee
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimal Path ◽  
Base Station ◽  
Delivery Ratio ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks comprise mobile nodes. The nodes both send and receive messages and can communicate with each other. Thus, the network builds its own network structure that is not dependent on the infrastructure. Owing to the characteristics of mobile ad hoc networks, they have been used in environments of poor communication, such as those in which the infrastructure cannot be built; for example, disaster areas and war zones. In this article, we propose an advanced energy-conserving optimal path schedule algorithm. The proposed algorithm sets the routing path using the relative angle, which is the distance between the source node and the base station. Using simulation results, we compared the proposed algorithm to existing algorithms. The protocol used by the proposed algorithm provides a higher packet delivery ratio and lower energy consumption than the lowest ID clustering algorithm and the mobility-based metric for clustering in the mobile ad hoc network algorithm.

Sign in / Sign up

Export Citation Format

Share Document