In this paper, we propose a new routing algorithm which calculates bandwidth-delay constrained routes in the fast and efficient manner. The algorithm is designed for the software-defined backbone networks, where the c...
详细信息
ISBN:
(纸本)9781467394864
In this paper, we propose a new routing algorithm which calculates bandwidth-delay constrained routes in the fast and efficient manner. The algorithm is designed for the software-defined backbone networks, where the control plane is separated from the data plane and logically centralized. Besides providing the required quality of service (QoS), the algorithm aims to maximize utilization of network resources, as that is the major interest of the infrastructure providers. To reduce the computational complexity of this complex traffic engineering task, we consider the control framework which classifies traffic flows in a finite number of categories based on the level of delay sensitivity. The simulation results show that the proposed approach to QoS provisioning, although relatively simple, leads to smaller amount of rejected QoS requests under a wide range of system parameters than the competitive complex solutions.
This paper proposes a decision model based on fuzzy logics to assign the route between source-destination nodes in elastic optical networks. The route is chosen dynamically based on the lowest cost criterion, which is...
详细信息
ISBN:
(纸本)9781509028399
This paper proposes a decision model based on fuzzy logics to assign the route between source-destination nodes in elastic optical networks. The route is chosen dynamically based on the lowest cost criterion, which is calculated based on a weighted summation of three metrics, called availability of contiguous slots on the route, average availability of slots on the route and physical length of the lightpath. To accomplish this task, we use the Takagi-Sugeno defuzzification process to calculate the cost of the route under analysis. By using our proposal in three different scenarios, we obtained a better network performance regarding blocking probability and an increase in the throughput when compared to other well-known routing algorithms, such as Shortest Path, Minimum Hop, Congested Aware Shortest Path and Spectrum Continuity based Shortest Path.
routing problem is one of the most important issues to a wireless sensor network(WSN), and multi-hop transmission is one of its characteristics, so the idea of dynamic programming(DP) is very suitable for routing prob...
详细信息
ISBN:
(纸本)9781424436927
routing problem is one of the most important issues to a wireless sensor network(WSN), and multi-hop transmission is one of its characteristics, so the idea of dynamic programming(DP) is very suitable for routing problem of a WSN. Based on dynamic programming, we propose an efficient energy routing algorithm. In this algorithm, we firstly propose an energy consumption model of sensor nodes and a method to transform WSN structure into standard DIP model. Next we put forward a routing algorithm with minimal energy expends according to the DP model. Finally, in order to balance energy expends and to prolong the network lifetime, we adjust its set of state variable on the basis of average residual energy of each stage in the DIP model. Experiments indicate that our algorithm has more efficient energy expends and a longer lifespan.
Wireless ad hoc network (MANET) is a kind of network that can communicate without infrastructure. It has the characteristics of dynamic topology, limited bandwidth and constrainted terminal energy, and so on. These ch...
详细信息
ISBN:
(纸本)9781728146898
Wireless ad hoc network (MANET) is a kind of network that can communicate without infrastructure. It has the characteristics of dynamic topology, limited bandwidth and constrainted terminal energy, and so on. These characteristics make the MANET impose many specific and strict requirements on routing protocols. In order to solve the problem of high packet loss rate and network congestion, a cross-layer routing algorithm based on congestion prediction (CLRACP) is proposed. In this algorithm, a congestion prediction mechanism is proposed, which makes high-load nodes do not need to forward routing request messages and effectively avoids high-load nodes being selected as forwarding nodes. A cross-layer routing algorithm is also proposed, which combines underlying link quality information to choose and select routing to improve the routing timeliness.
This paper applies the theory of Evolutionary Game to QoS routing algorithm for wireless mesh networks which can not only improve the performance of traditional QoS routing protocols but also be able to reduce the cos...
详细信息
ISBN:
(纸本)9781538639818
This paper applies the theory of Evolutionary Game to QoS routing algorithm for wireless mesh networks which can not only improve the performance of traditional QoS routing protocols but also be able to reduce the cost of the routing algorithm.
RBMC-a novel routing algorithm based on multi-parameter constraints for wireless sensor network was proposed. The algorithm found out the minimum cost path from source sensor to sink by ants with multi-parameter, and ...
详细信息
ISBN:
(纸本)9783037854488
RBMC-a novel routing algorithm based on multi-parameter constraints for wireless sensor network was proposed. The algorithm found out the minimum cost path from source sensor to sink by ants with multi-parameter, and the source sensor could transmit information along the shortest path. Thus the transmission path length and the corresponding network delay could be efficiently reduced. We analyzed the performance of RBMC through compared with the existing other routing algorithms in simulation experiment. Results show that the proposed method can reduce energy cost and balance the energy load effectively.
Power management in wireless sensor networks has always been a concern for network engineers and hardware manufacturers. Wireless sensor nodes are supposed to operate for extended periods of time, perhaps years, witho...
详细信息
ISBN:
(纸本)9781467325912;9781467325899
Power management in wireless sensor networks has always been a concern for network engineers and hardware manufacturers. Wireless sensor nodes are supposed to operate for extended periods of time, perhaps years, without physical interaction from human beings. Replacing batteries is also not possible or is an inconvenience in most of these networks. Thus, in order to extend the life of entire wireless sensor network system, either higher capacity of batteries needs to be used on each node or the energy consumption of batteries itself needs to be reduced. Energy consumption, from a software point of view, may be reduced both logically and physically by minimizing the involvements of nodes while transferring data from source to destination, which is decided by the routing protocol. This paper proposes a routing protocol that is based on coordinate mathematics. The path selected to transfer the data from source to destination is almost the shortest active path. Generally, this routing protocol at maximum, only sends the information to two of its neighboring nodes, while not influencing other neighboring nodes in idle state. Beside this, location of all the nodes are previously assigned, so the physical location of source node can be easily located for further procedure. This paper, in summary, proposes a routing protocol designed to sort out two key issues of wireless sensor networks namely power conservation and locating the nodes that have detected information that needs to update.
It is especially important to save energy and prolong the network lifetime because the WSN nodes energy is limited. Optimizing the routing algorithm for WSN is one of the important ways to reduce energy consumption. L...
详细信息
ISBN:
(纸本)9783038350194
It is especially important to save energy and prolong the network lifetime because the WSN nodes energy is limited. Optimizing the routing algorithm for WSN is one of the important ways to reduce energy consumption. LEACH routing protocol is the first cluster-based routing protocol for wireless sensor networks. But LEACH have some deficiencies, such as agreement of uneven clustering, the nodes energy imbalance, frequent clustering and consume too much energy. The paper proposes an improved LEACH protocol to solve the above problem. It takes the residual energy of the nodes into account when nodes selected the cluster-head so that the nodes that hold high-energy have the high possibility to be selected as cluster-head. The improved algorithm uses the incomplete clustering which does not need to cluster every round but interval cluster. Simulation results show that the improved LEACH protocol effectively increases the nodes energy utilization and extends the network lifetime.
Opportunistic network as a representative network evolved from social networks and ad hoc networks, has been on cutting edges in recent years. Due to its inherent characteristics serving for intermittent networking se...
详细信息
ISBN:
(纸本)9781467360852;9781467360845
Opportunistic network as a representative network evolved from social networks and ad hoc networks, has been on cutting edges in recent years. Due to its inherent characteristics serving for intermittent networking setting specifically, the opportunistic network has been also widely applied in the domain of Internet of Things (IoT). Many researchers have focused on the realistic mobility model and cost-effective routing scheme. Community as one of the most inherent attributes of the opportunistic network has been proved to be much helpful in simulating mobility traces of human society and selecting suitable message forwarders. This paper proposes a community-structured mobility model with consideration of geographical location preference and time-variance in human behavior patterns. Based on this model, a novel routing algorithm is presented by jointly considering utilities generated by social degree and relation. The results show that our routing scheme is able to improve success rate while control the routing cost and transmission delay into a reasonable range.
Low earth orbit (LEO) satellite networks can provide global coverage, low-latency services to users. The satellite networks are multi-hop networks, and the dynamic characteristics of the networks bring great challenge...
详细信息
ISBN:
(纸本)9781728173078
Low earth orbit (LEO) satellite networks can provide global coverage, low-latency services to users. The satellite networks are multi-hop networks, and the dynamic characteristics of the networks bring great challenges to design efficient routing algorithms. In this paper, we proposed an improved routing algorithm based on inter-satellite link(ISL) state information and it is on-board autonomous control. The routing algorithm is divided into three phases, namely topology establishment phase, routing calculation phase and link failure response phase. Satellites make routing decisions for each hop based on the link state information with neighbor satellites and the network topology. The simulation results show that our routing algorithm has significant advantages in delivery ratio and end-to-end delay.
暂无评论