9,548 Hits in 9.2 sec

On self adaptive routing in dynamic environments - an evaluation and design using a simple, probabilistic scheme

Haiyong Xie, Lili Qiu, Yang Richard Yang, Yin Zhang
Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004.  
In this paper we propose a simple, distributed, probabilistic routing scheme for scalable, efficient, self adaptive routing in dynamic, realistic environments.  ...  Also, it remains an open question how to design an adaptive scheme that ensures convergence to a traffic equilibrium in practice.  ...  This emergence of adaptive routing, in particular, self adaptive routing, poses challenging research questions in both design and evaluation.  ... 
doi:10.1109/icnp.2004.1348074 dblp:conf/icnp/QiuYZX04 fatcat:2xtttpvrffb5rptugsf2pxiidq

Self-managing and self-organising mobile computing applications

Jose Luis Fernandez-Marquez, Giovanna Di Marzo Serugendo, Graeme Stevenson, Juan Ye, Simon Dobson, Franco Zambonelli
2014 Proceedings of the 29th Annual ACM Symposium on Applied Computing - SAC '14  
Self-organising systems are being developed in an ad-hoc way, without reusing functionalities, thus producing a software di cult to maintain and to reuse in other applications.  ...  The development of self-organising applications and a fortiori the one of self-organising mobile applications is limited to developers who are experts in specific self-organising mechanisms.  ...  Acknowledgment This work has been supported by the EU-FP7-FET Proactive project SAPERE Self-aware Pervasive Service Ecosystems, under contract no.256873.  ... 
doi:10.1145/2554850.2555042 dblp:conf/sac/Fernandez-MarquezSSYDZ14 fatcat:fvoatekehfg3nfcabbcvlnlfkq

Learning-Based Routing in Cognitive Networks

Tahir Alyas, Nadia Tabassum, Shahid Naseem, Fahad Ahmed, Qura Tul Ein
2014 IARS' International Research Journal  
In this paper we will focus machine learning in routing scheme that includes routing awareness, a routing reconfiguration.  ...  Learning from the network environment, in order to optimally adapt the network settings, is an essential requirement for providing efficient communication services in such environments.  ...  Q-Routing is an adaptation from Q-Learning that is able to distributively route packets in a network.  ... 
doi:10.51611/iars.irj.v4i2.2014.40 fatcat:6vg3tueddnbppai4cylzml3tg4

Analysis of routing overhead in route discovery based on PHY, MAC in noisy MANETs

Haitham Y. Adarbah, Scott Linfoot
2013 2013 IEEE Third International Conference on Consumer Electronics ¿ Berlin (ICCE-Berlin)  
thermal noise on on-demand routing protocols and third, evaluation of pure flooding and probabilistic broadcasting schemes under noisy and noiseless conditions.  ...  Broadcasting is used in on-demand routing protocols to discover routes in Mobile Adhoc Networks (MANETs).  ...  The novel scheme is called a Channel Adaptive Probabilistic Broadcast (CAPB) that uses a cross layer design solution.  ... 
doi:10.1109/icce-berlin.2013.6698031 dblp:conf/icce-berlin/AdarbahL13 fatcat:s763s742sbca3ptpil7ehlbcve

A new adaptive broadcasting approach for mobile ad hoc networks

Mustsfa Bani Khalaf, Ahmed Y. Al-Dubai, William Buchanan
2010 2010 Wireless Advanced 2010  
In an attempt to enhance and promote the quality of the probabilistic scheme, this paper proposes a new probabilistic approach to overcome these limitations.  ...  Under the umbrella of this scheme, many dynamic probabilistic broadcasting algorithms have been proposed in the literature to solve the BSP.  ...  A fixed probabilistic scheme is the first probabilistic approach and considered as the base for all later dynamic probabilistic schemes.  ... 
doi:10.1109/wiad.2010.5544944 fatcat:3pyjev6uezgdzpyhhb2b5zlunq

Minimizing Redundant Messages and Improving Search Efficiency under Highly Dynamic Mobile P2P Network

Ajay Arunachalam, Department of Computer Science , Graduate School of Applied Statistics, National Institute of Development Administration , Thailand, Ohm Sornil, Department of Computer Science , Graduate School of Applied Statistics, National Institute of Development Administration , Thailand
2016 Journal of Engineering Science and Technology Review  
Resource Searching is one of the key functional tasks in large complex networks. With the P2P architecture, millions of peers connect together instantly building a communication pattern.  ...  We also perform a comprehensive analysis of the resource discovery schemes to verify the impact of varying node speed and different network conditions.  ...  Adaptive Probabilistic Search (APS) scheme builds knowledge on the basis of the past experience. An improvement of APS was proposed in [19] .  ... 
doi:10.25103/jestr.091.05 fatcat:viaf23cwwjcbnfoxxi3xu7udw4

Bio-Inspired Networking — Self-Organizing Networked Embedded Systems [chapter]

Falko Dressler
2009 Understanding Complex Systems  
The turn to nature has brought us many unforeseen great concepts and solutions. This course seems to hold on for many research domains.  ...  Based on a review of the needs and requirements in such networks, we study selected bio-inspired networking approaches that claim to outperform other methods in specific domains.  ...  Attractor-based routing and task allocation As a specific example to demonstrate the capabilities of swarm intelligence methods in networking, we chose an attractor scheme for routing and task allocation  ... 
doi:10.1007/978-3-540-77657-4_13 fatcat:b5itvfopuvdbpcaxw663bzwv7m

Realizing and benchmarking broadcast algorithms in wireless mesh networks

Ying-Dar Lin, Shun-Lee Chang, Shi-Hung Tao, Jui-Hung Yeh
2011 Computer Communications  
This paper examines six representative broadcast algorithms: simple flooding, dynamic probabilistic, efficient counter-based broadcast, scalable broadcast, domain pruning, and connected-dominating-set  ...  Since the network control, routing, and topology maintenance of a WMN highly rely on layer-2 broadcasting, unreliable broadcast algorithms directly destabilize a WMN.  ...  Dynamic probabilistic algorithm: Zhang and Agrawal proposed the dynamic probabilistic algorithm [10] , which combines the probabilistic scheme with the density information of neighboring nodes.  ... 
doi:10.1016/j.comcom.2010.11.011 fatcat:4etptoct6ratphnu4it43tuj3a

A Survey on Biologically Inspired Algorithms for Computer Networking

Chenyu Zheng, Douglas C. Sicker
2013 IEEE Communications Surveys and Tutorials  
Such future networks will require more scalable, adaptive and robust designs to address the dynamic changes and potential failures caused by high heterogeneity and large scale networks.  ...  A variety of biological algorithms demonstrate characteristics desirable to network design, and significant effort has been placed on analyzing and developing the corresponding BIAs and applying them to  ...  We also provide an integrated framework to help readers better understand and utilize the application of BIAs to network systems in figures 1, 2, 4, and 5.  ... 
doi:10.1109/surv.2013.010413.00175 fatcat:kl426uhbl5gahpqqprlxchu3yq

Modeling, Analysis & Implementation of Improved AODV Routing Protocol in MANETs

Mahesh KumarYadav, Ram Kishan Khola, Deepak Dembla
2012 International Journal of Computer Applications  
The proposed protocol is modeled, analyzed and implemented on base AODV routing protocol, based on improved method of route discovery and the proposed protocol adjusts itself dynamically based on the network  ...  All the routing protocols use a basic technique of route request transmission i.e. blind flooding which causes a lot of overheads in terms of end to end delay, packet delivery ratio, no. of routing packets  ...  Many research studies have been carried-out to develop and evaluate the performance of this mechanism in an error-free (noiseless) environment.  ... 
doi:10.5120/5825-8101 fatcat:pukqfu3yzbbwbdtgqzppb47jzy


2013 Journal of Computer Science  
In this study, we propose a software tool to simulate and evaluate the six evaluation metrics presented for non-deterministic wireless sensor network in which are: Scalability, Key Connectivity, Memory  ...  The evaluation metrics were simulated as well as evaluated to help the network designer choosing the best probabilistic security key management algorithm for certain randomly distributed sensory network  ...  The results showed that the pairwise key scheme can be adapted in several diverse environment satisfying most of our study factors.  ... 
doi:10.3844/jcssp.2013.635.645 fatcat:aq22rxddmbcgbp2aqvowpisiwe

Condensation-Based Routing in Mobile Ad-Hoc Networks

Francesco Palmieri, Aniello Castiglione
2012 Mobile Information Systems  
Accordingly, this work exploits and analyzes an adaptive probabilistic broadcast containment technique based on a particular condensation phenomenon borrowed from Quantum Mechanics and transposed in self-organizing  ...  The provision of efficient broadcast containment schemes that can dynamically cope with frequent topology changes and limited shared channel bandwidth, is one of the most challenging research topics in  ...  Adaptive probabilistic schemes To cope with the above problems, a more adaptive and flexible probabilistic route discovery scheme is needed.  ... 
doi:10.1155/2012/149697 fatcat:to2ilhfgqbc4fbhumzqnsmdequ

Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach

Sungwook Kim
2014 The Scientific World Journal  
Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem.  ...  In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach.  ...  For real network implementation, the proposed scheme is designed in self-organizing, dynamic online, and interactive process.  ... 
doi:10.1155/2014/872526 pmid:25032241 pmcid:PMC4083879 fatcat:opoudpmhgrft3hi6yckuw56hay

Energy Optimization in Wireless Sensor Network through Natural Science Computing: A Survey

Sanjeev Wagh, Ramjee Prasad
2013 Journal of green engineering  
and security, design of the future ideas, and so on.  ...  Some time it is expensive in terms of space and time to create reliable artefacts with conventional process that design the elements like intelligence, controlling operations, process optimization, threat  ...  The future network demands great dynamism in the networking environment. It will be based on dynamics of the system which will be scalable, self organized and adaptive.  ... 
doi:10.13052/jge1904-4720.342 fatcat:yqfecenhkzcnlboif3ueh7torq

Routing Algorithm for Vehicular Ad Hoc Network Based on Dynamic Ant Colony Optimization

A. M. Oranj, R. M. Alguliev, Farhad Yusifov, Shahram Jamali
2016 International Journal of Electronics and Electrical Engineering  
In this paper, we proposed a routing algorithm based on ant colony optimization and DYMO (Dynamic MANET On-demand) protocol which copes with changes in environment.  ...  Ant colony optimization algorithm is a probabilistic technique which has been widely used in finding routes through graphs.  ...  The authors have also adapted the Dynamic MANET Ondemand (DYMO) routing protocol [21] to make use of the ACO procedures. III.  ... 
doi:10.18178/ijeee.4.1.79-83 fatcat:enriymcfpjg3rbpv22p2ncg44u
« Previous Showing results 1 — 15 out of 9,548 results