نتایج جستجو برای: cumulative routing

تعداد نتایج: 124680  

Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...

Journal: :Journal of the Experimental Analysis of Behavior 1964

Journal: :Math. Oper. Res. 2015
Josh Reed Yair Shaki

We consider the G/GI/N queue with multiple server pools, each possessing a poolspecific service time distribution. The class of non-idling routing policies which we consider are referred to as u-greedy policies. These policies route incoming customers to the server pool with the longest weighted cumulative idle time in order to equitably spread incoming work amongst the server pools in the syst...

The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...

Risk factors are generally defined and assigned to road networks, as constant measures in hazmat routing problems. In fact, they may be dynamic variables depending on traffic volume, weather and road condition, and drivers' behavior. In this research work, risk factors are defined as dynamic variables using the concept of chaos theory. The largest Lyapunov exponent is utilized to determine the ...

Mina Vajed Khiavi Sajjad Jahanbakhsh Gudakahriz, SHahram Jamali

Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...

In recent years mobile networks have expanded dramatically, compared with other wireless networks. Routing protocols in these networks are designed with the assumption that there is no attacker node, so routing protocols are vulnerable to various attacks in these networks. In this paper, we review the network layer attacks and then we simulate the impact of black hole attack on ad hoc on demand...

Journal: :Applied system innovation 2021

Efficient energy utilization and network life prolongation are primary objectives to be considered when designing a Wireless Sensor Network. Cluster-based routing protocols most suitable for achieving such goals. Energy Optimal Inter Cluster Head Distance (EOICHD) is cluster-based hierarchical protocol inspired by the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. EOICHD resolves pr...

2016
Kannan Shanmugam Karthik Subburathinam Arunachalam Velayuthampalayam Palanisamy

MANET is commonly known as Mobile Ad Hoc Network in which cluster of mobile nodes can communicate with each other without having any basic infrastructure. The basic characteristic of MANET is dynamic topology. Due to the dynamic behavior nature, the topology of the network changes very frequently, and this will lead to the failure of the valid route repeatedly. Thus, the process of finding the ...

Journal: :Europhysics News 1985

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید