Agile computing: bridging the gap between grid computing and ad-hoc peer-to-peer resource sharing

2003 ◽  
Author(s):  
N. Suri ◽  
J.M. Bradshaw ◽  
M.M. Carvalho ◽  
T.B. Cowin ◽  
M.R. Breedy ◽  
...  
Keyword(s):  
Grid Computing ◽  
Resource Sharing ◽  
Ad Hoc ◽  
Peer To Peer

Performance Evaluation of Reactive Routing in Mobile Grid Environment

2011 ◽  
Vol 3 (3) ◽  
pp. 45-53 ◽  
Author(s):  
L. Shrivastava ◽  
G. S. Tomar ◽  
S. S. Bhadauria
Keyword(s):  
Grid Computing ◽  
Resource Sharing ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Delivery Ratio ◽  
Grid Environment ◽  
On Demand ◽  
Reactive Routing ◽  
Grid Topology ◽  
Mathematical Problems

Grid computing came into existence as a manner of sharing heavy computational loads among multiple computers to be able to compute highly complex mathematical problems. The grid topology is highly flexible and easily scalable, allowing users to join and leave the grid without the hassle of time and resource-hungry identification procedures, having to adjust their devices or install additional software. The goal of grid computing is described as “to provide flexible, secure and coordinated resource sharing among dynamic collections of individuals, institutions and resources”. AODV is an on-demand (reactive) algorithm capable of both unicast and multicast routing. In this paper, AODV has been modified by varying some of the configuration parameters used in this algorithm to improve its performance. This modified protocol i.e. A-AODV (advanced ad hoc on demand distance vector) has been compared with AODV in grid environment. The simulations have shown that A-AODV is able to achieve high throughput and packet delivery ratio and average end-to-end delay is reduced.

Performance Evaluation of Reactive Routing in Mobile Grid Environment

2013 ◽  
pp. 159-167
Author(s):  
L. Shrivastava ◽  
G. S. Tomar ◽  
S. S. Bhadauria
Keyword(s):  
Grid Computing ◽  
Resource Sharing ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Delivery Ratio ◽  
Grid Environment ◽  
On Demand ◽  
Reactive Routing ◽  
Grid Topology ◽  
Mathematical Problems

Grid computing came into existence as a manner of sharing heavy computational loads among multiple computers to be able to compute highly complex mathematical problems. The grid topology is highly flexible and easily scalable, allowing users to join and leave the grid without the hassle of time and resource-hungry identification procedures, having to adjust their devices or install additional software. The goal of grid computing is described as “to provide flexible, secure and coordinated resource sharing among dynamic collections of individuals, institutions and resources”. AODV is an on-demand (reactive) algorithm capable of both unicast and multicast routing. In this paper, AODV has been modified by varying some of the configuration parameters used in this algorithm to improve its performance. This modified protocol i.e. A-AODV (advanced ad hoc on demand distance vector) has been compared with AODV in grid environment. The simulations have shown that A-AODV is able to achieve high throughput and packet delivery ratio and average end-to-end delay is reduced.

Peer-to-Peer Networking Platform and Its Applications for Mobile Phones

2011 ◽  
pp. 374-396 ◽  
Author(s):  
Norihiro Ishikawa ◽  
Hiromitsu Sumino ◽  
Takeshi Kato ◽  
Johan Hjelm ◽  
Shingo Murakami ◽  
...  
Keyword(s):  
Mobile Phones ◽  
Resource Sharing ◽  
Ad Hoc ◽  
Resource Discovery ◽  
Peer To Peer ◽  
Distributed Search ◽  
Distribution Of Resources ◽  
Enormous Number ◽  
Ubiquitous Networking ◽  
Peer To Peer Networking

Compared with traditional Internet technologies, peer-to-peer technologies has functions to realize resource discovery, resource sharing, and load balancing in a highly distributed manner. In addition to the Internet, new networks such as home network, ad-hoc network and sensor network are emerging. An easy prediction is the emergence of a new environment in which many sensors, people, and many different kinds of devices coexist, move, and communicate with one another over such heterogeneous networks. Peer-to-peer technology is one of the most important and suitable technologies for such ubiquitous networking since it supports discovery mechanisms, simple one-to-one communication, free and extensible distribution of resources, and distributed search to handle the enormous number of resources. The authors have designed and implemented a peer-to-peer networking platform for realizing applications, which include various applications for mobile phones. This chapter presents their peer-to-peer networking architecture, protocols, and applications for mobile phones.

scholarly journals A Fluid Model for a Relay Node in an Ad Hoc Network: Evaluation of Resource Sharing Policies

2008 ◽  
Vol 2008 ◽  
pp. 1-25 ◽  
Author(s):  
Michel Mandjes ◽  
Werner Scheinhardt
Keyword(s):  
Resource Sharing ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Fluid Model ◽  
Waiting Times ◽  
Relay Node ◽  
Arbitrary Point ◽  
Fluid Particle ◽  
Flow Transfer

Fluid queues offer a natural framework for analyzing waiting times in a relay node of an ad hoc network. Because of the resource sharing policy applied, the input and output of these queues are coupled. More specifically, when there are users who wish to transmit data through a specific node, each of them obtains a share of the service capacity to feed traffic into the queue of the node, whereas the remaining fraction is used to serve the queue; here is a free design parameter. Assume now that jobs arrive at the relay node according to a Poisson process, and that they bring along exponentially distributed amounts of data. The case has been addressed before; the present paper focuses on the intrinsically harder case , that is, policies that give more weight to serving the queue. Four performance metrics are considered: (i) the stationary workload of the queue, (ii) the queueing delay, that is, the delay of a “packet” (a fluid particle) that arrives at an arbitrary point in time, (iii) the flow transfer delay, (iv) the sojourn time, that is, the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. We explicitly compute the Laplace transforms of these random variables.

scholarly journals Resource-Aware Cooperative Caching on Mobile Ad-hoc Peer to Peer Networks

2021 ◽  
Author(s):  
Hoda R.K. Nejad
Keyword(s):  
Ad Hoc Networks ◽  
Overlay Networks ◽  
Ad Hoc ◽  
Data Access ◽  
Peer To Peer ◽  
Data Availability ◽  
Cooperative Caching ◽  
P2p Systems ◽  
Hoc Networks ◽  
Resource Aware

With the emergence of wireless devices, service delivery for ad-hoc networks has started to attract a lot of attention recently. Ad-hoc networks provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad-hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. On the other hand, data access applications in Ad-hoc networks suffer from restricted resources. In this thesis, we explore how to use Cooperative Caching to improve data access efficiency in Ad-hoc network. We propose a Resource-Aware Cooperative Caching P2P system (RACC) for data access applications in Ad-hoc networks. The objective is to improve data availability by considering energy of each node, demand and supply of network. We evaluated and compared the performance of RACC with Simple Cache, CachePath and CacheData schemes. Our simulation results show that RACC improves the lay of query as well as energy usage of the network as compared to Simple Cache, CachePath and CacheData.

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.

Sign in / Sign up

Export Citation Format

Share Document