A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
A Self-optimizing Routing Algorithm using Local Information in a 3-dimensional Virtual Grid Network with Theoretical and Practical Analysis
2017
International Journal of Networking and Computing
Preserved Fulltext
In this paper, we present a self-optimizing routing algorithm using only local information, in a three-dimensional (3D) virtual grid network. ...
A virtual grid network is a well-known network model for its ease of designing algorithms and saving energy consumption. ...
Conclusion In this paper, we proposed a self-optimizing routing algorithm which construct the shortest path in a 3D virtual grid network. ...
doi:10.15803/ijnc.7.2_349
fatcat:hinaxodwn5erlbxpoxjqb23wm4
Enabling Autonomic Grid Applications: Dynamic Composition, Coordination and Interaction
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This paper introduces AutoMate architecture and describes the Rudder coordination framework and its use in enabling autonomic behaviors. ...
Project AutoMate investigates conceptual models and implementation architectures to enable the development and execution of self-managing applications. ...
Fig. 1 . 1 A schematic overview of AutoMate
Fig. 2 .Fig. 3 . 23 A Routing using a simple keyword tuple in Squid: (a) the simple keyword tuple (2, 1) is viewed as a point in a multi-dimensional space; ...
doi:10.1007/11527800_21
fatcat:exlxz4cf4bgproppcnv2sdqcee
Prospects and research issues in multi-dimensional all optical networks
2016
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
optical switching, software-defined optical network, optical network virtualization, all optical network innovation ...
in this article. ...
In addition, owing to the computational difficulty in solving ILP models for a large network, efficient heuristic algorithms were provided based on the multi-iteration optimization technique and three ...
doi:10.1007/s11432-016-0324-7
fatcat:ygnxanuju5daljjjlsbkbn53l4
Self-Adjusting Networks to Minimize Expected Path Length
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
In this work we initiate a study on self-adjusting networks: networks that use local-distributed mechanisms to adjust the position of the nodes (e.g., virtual machines) in the network to best fit the route ...
In particular, we consider grid networks in which the distribution of requests is a symmetric product distribution. ...
Improving the energy efficiency of routing in networks was also considered. Batista et al. [13] used traffic engineering on grids to self-adjust to routing requests. ...
arXiv:1110.0196v3
fatcat:7jznowueqvfrhbjzwfownfmnje
A Sensor Network Data Compression Algorithm Based on Suboptimal Clustering and Virtual Landmark Routing Within Clusters
2010
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
A kind of data compression algorithm for sensor networks based on suboptimal clustering and virtual landmark routing within clusters is proposed in this paper. ...
Virtual node landmarks in clusters can be established based on cluster heads. Routing in clusters can be realized by combining a greedy algorithm and a flooding algorithm. ...
Acknowledgements The work described in this paper was supported by the National Natural Science Foundation of China (NSFC60974012), the Natural Science Foundation of ZheJiang province (Y1100054), the Key ...
doi:10.3390/s101009084
pmid:22163396
pmcid:PMC3230967
fatcat:2gjhki2ytbbctomgxfazoul3ha
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
2004
Journal of Grid Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It uses an iterative or single attribute dominated query routing algorithm to resolve multi-attribute based queries. Each node in MAAN only has O(log N) neighbors for N nodes. ...
This paper proposes a Multi-Attribute Addressable Network (MAAN) that extends Chord to support multi-attribute and range queries. ...
Figure 3 . 3 The number of neighbors as a logarithmic function of network size. ...
doi:10.1007/s10723-004-1184-y
fatcat:zynrar53lrh3flxgephwqg6veu
Turning heterogeneity into an advantage in overlay routing
2003
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Our simulation results show that our expressway can achieve close to optimal routing performance (on average, 1.07 and 1.41 times optimal routing for an Internet-like topology and a large synthesized transit-stub ...
graph, respectively) in overlay networks. ...
Fig. 3 . 3 Mapping a 3-dimensional landmark space (a) to 2 dimensional CAN space (b) using the Hilbert curve. equal to 1 it is a point. ...
doi:10.1109/infcom.2003.1208985
dblp:conf/infocom/XuMK03
fatcat:tjomrkqwvrb7vnoyklsr3lwmam
Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks
2007
2007 Fourth International Conference on Networked Sensing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This paper presents a novel routing algorithm which takes into account information concerning coverage and energy and using the advantages of scale free networks. ...
This paper investigates the energy problem in sensor networks. After random deployment, nodes have to observe a region and transmit their sensor data to a central station. ...
A virtual 2-dimensional grid is placed on the observed area. If the transmission range is at least twice the sensing range the size of a cell depends on the sensing range R S , shown in Fig. 5 a) . ...
doi:10.1109/inss.2007.4297393
fatcat:izirxm3ak5a25k73fq5up2p35m
A WSN Clustering Multi-Hop Routing Protocol Using Cellular Virtual Grid in IoT Environment
2020
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In order to prolong network lifetime and balance network energy consumption, a WSN clustering multi-hop routing protocol for electric vehicles using cellular virtual grid is proposed. ...
The simulation results show that the protocol has obvious advantages in reducing network energy consumption compared with several traditional algorithms when the running time reaches 1200 s and the network ...
appreciation to the reviewers for their helpful suggestions, which greatly improved the presentation of this paper. is work was supported by the Software Science Foundation of Shanxi (No. 2019041016-3) ...
doi:10.1155/2020/8886687
fatcat:3xbuj7vbpzarpl47n7joihb6w4
Hybrid Algorithm for Optimal Load Sharing in Grid Computing
2012
Journal of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Approach: In order to avoid such reduction in the performances of the grid system, an optimal resource sharing algorithm is required. ...
Results: In this study a hybrid algorithm for optimization of load sharing is proposed. The hybrid algorithm contains two components which are Hash Table ( HT) and Distributed Hash Table ( DHT). ...
The proposed Grid resource discovery service organises data by maintaining a logical d-dimensional publish/subscribe index over a network of distributed Grid brokers/Grid sites. ...
doi:10.3844/jcssp.2012.175.180
fatcat:3tfcfec3une5piegqpryflgxdi
Supply and Demand Oriented Energy Management in the Internet of Things
2016
Advances in Internet of Things
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, a taxonomy model is established in reference to the IoT layers (i.e., sensor-actuator layer, network layer, and application layer), and IoT energy management is addressed from the perspectives ...
In this context, energy management with the purposes of energy saving and high efficiency is a challenging issue. ...
In particular, it was supported by the Science and Technology Foundation of Beijing (Z141100002714003, Z151100002115041) and Cybermatics and Cyberspace International Science and Technology Cooperation ...
doi:10.4236/ait.2016.61001
fatcat:6tlbn7x4wfablgjs7etpkkscci
Integration of a Self-Organizing Map and a Virtual Pheromone for Real-Time Abnormal Movement Detection in Marine Traffic
2017
Informatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The paper presents a new self-learning adaptive classification algorithm based on the combination of a self-organizing map (SOM) and a virtual pheromone for abnormal vessel movement detection in maritime ...
Thus, rapid self-learning algorithms for the decision support system have to be developed to detect the abnormal vessel movement in intense marine traffic areas. ...
Integration of a Self-Organizing Map and a Virtual Pheromone
Clustering with SOM The self-organizing map (SOM) is a neural network-based method that is trained in an unsupervised way using a competitive ...
doi:10.15388/informatica.2017.133
fatcat:aqyazcuisjcytihmul23jpompe
An Improved Greedy Routing Algorithm For Grid Using Pheromone-Based Landmarks
2009
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
He introduced the structure of small-world in a grid and shows with a greedy algorithm using only local information able to find route between source and target in delivery time O(log2n). ...
His fundamental model for distributed system uses a two-dimensional grid with longrange random links added between any two node u and v with a probability proportional to distance d(u,v)-2. ...
We generated a small-world network; two-dimensional grid sized 10,000 nodes (100x100). ...
doi:10.5281/zenodo.1077115
fatcat:zepae4zozbcvzlkcgs6e3fjfdi
Optimal Deployment with Self-Healing Movement Algo-rithm for Particular Region in Wireless Sensor Network
2009
Wireless Sensor Network
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Optimizing deployment of sensors with self-healing ability is an efficient way to solve the problems of coverage, connectivity and the dead nodes in WSNs. ...
This work discusses the particular relationship between the monitoring range and the communication range, and proposes an optimal deployment with self-healing movement algorithm for closed or semi-closed ...
We compare the number of sensor being deployed as comparison metric in four different methods including ours optimal algorithm, coverage-first algorithm, connect-first algorithm, grid algorithm discussed ...
doi:10.4236/wsn.2009.13028
fatcat:almvpynmqfe6vgnfzcjsikedqq
A Survey on Deployment Algorithms in Underwater Acoustic Sensor Networks
2013
International Journal of Distributed Sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Node deployment for UASNs is an attractive research topic upon which a large number of algorithms have been proposed recently. ...
, routing, and boundary detection. ...
Figure 2 : 2 Classification of deployment algorithms for UASNs.
Figure 3 : 3 Triangular-grid deployment: (a) grid structure and side margins and (b) uncovered area (Δ ). ...
doi:10.1155/2013/314049
fatcat:2da6hinz4fde7jgleqnvrrc4ga
« Previous
Showing results 1 — 15 out of 8,712 results