Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

Multipath Security Aware Routing Protocol for MANET Based on Trust Enhanced Cluster Mechanism for Lossless Multimedia Data Transfer

The dynamic nature of mobile nodes of ad hoc network is mostly affected by security problems which reduce data forwarding rate in multimedia sources. Due to the rapid growth of wireless applications, the different multitalented routing protocols are proposed in recent years. But the recent protocols are not efficient for multimedia applications, till now, specific security aware routing protocols are not proposed for multimedia data transfers. In this paper, we proposed trust enhanced cluster based multipath routing (TECM) algorithm. We use energy efficient PSO algorithm used to create cluster formation and cluster head, super cluster head are selected from trust values, which compute form proposed TECM algorithm. The multi trust factors are used for trust computation, such as frame/packet loss ratio, frame/packet forward energy, frame/packet receiving energy, routing overhead, received signal strength, frame/packet forward rate, average forward delay and protocol deviation flag. We then combine proposed TECM algorithm with standard multipath OLSR protocol (TECM-OLSR) to analyze the performance of proposed algorithm. The simulated results show that proposed TECM-OLSR protocol is very effective in terms of loss and delivery rate, delay, routing overhead and network lifetime compare to FPNT-OLSR.     

Providing Fault-Tolerant Ad hoc Routing Service in Adversarial Environments

Most existing designs of ad hoc networks are based on the assumption of non-adversarial environments, where each node in the network is cooperative and well-behaved. When misbehaving nodes exist in the network, the performance of current routing protocols degrades significantly. Since ad hoc networks, consisting of autonomous nodes, are open and distributed in nature, maintaining a fault-free network environment is extremely difficult and expensive. In this paper, we propose a new routing service named best-effort fault-tolerant routing (BFTR). The design goal of BFTR is to provide packet routing service with high delivery ratio and low overhead in presence of misbehaving nodes. Instead of judging whether a path is good or bad, i.e., whether it contains any misbehaving node, BFTR evaluates the routing feasibility of a path by its end-to-end performance (e.g. packet delivery ratio and delay). By continuously observing the routing performance, BFTR dynamically routes packets via the most feasible path. BFTR provides an efficient and uniform solution for a broad range of node misbehaviors with very few security assumptions. The BFTR algorithm is evaluated through both analysis and extensive simulations. The results show that BFTR greatly improves the ad hoc routing performance in the presence of misbehaving nodes.     

基于博弈的协作路由算法

协作虚拟多输入多输出（VMIMO）传输是一种有效的无线传输性能优化技术。将物理层协作VMIMO技术和网络层路由选择技术相结合,设计跨层VMIMO路由选择方案可以利用VMIMO的分集增益,显著地降低网络传输能耗。如何设计VMIMO协作路由协议抵抗无线网络的自私节点和欺骗行为,保证高数据转发率和低传输能耗成为路由设计中的重大挑战。为了提高自私网络的VMIMO路由性能,提出了一种基于重复路由博弈的VMIMO协作路由算法。该算法将网络划分成多个Group、Group间使用VMIMO传输数据。将Group间路由选择过程建模为重复路由博弈过程。为了提高数据转发的成功率,提出适用度函数评估节点参与数据分组转发的信誉。以此为基础,提出基于适用度的路由选择子算法和路由转发子算法。理论证明所提重复路由博弈可达到帕累托最优。仿真实验结果表明本算法可以促进自私节点相互合作,可获得较高的数据转发率,较好地减少数据传输时延以及能量消耗。     

A general packet replication scheme for multicasting withapplication to shuffle-exchange networks

Multicasting in broadband packet switches and metropolitan networks can be achieved by first replicating the packets and then routing them to their destinations. This paper studies a simple but general replication scheme that can be applied to arbitrary interconnection-network topologies. The replication process of a packet adapts itself according to the network topology and the traffic condition. Hot spots of replication activities are diffused by this scheme which automatically migrates the replication efforts to less active network regions. The scheme can potentially be used in networks (e.g., the Manhattan-street network) in which multicasting was thought to be inherently difficult. This paper, however, focuses on the shuffle-exchange copy network for a detailed study of the replication algorithm and its implementation at the logic-diagram level. It is found that the performance of the algorithm improves with the increase in network dimensions. Cascading the copy network with a point-to-point switch makes a multicast switch. A novel strategy for reducing the memory size of its routing tables is proposed     

Analysis,design and simulation of Internet of Things routing algorithm based on ant colony optimization

In this paper, a routing algorithm to optimize the selection of the best path for the transmitted data within the Internet of Things (IoT) system is proposed. The algorithm controls the use of ant colony ideas in the IoT system to obtain the best routing benefit. It divides the IoT environment into categorized areas depending on network types. Then, it applies the most suitable ant colony algorithm to the concerned network within each area. Furthermore, the algorithm considers routing problem in intersected areas that may arise in case of IoT system. Finally, Network Simulator 2 is used to evaluate the proposed algorithm performance. Simulation results demonstrate the effectiveness of the proposed routing algorithm in terms of end‐to‐end delay, packet loss ratio, bandwidth consumption, throughput, overhead of control bits, and energy consumption ratio. Copyright © 2016 John Wiley & Sons, Ltd.     

Energy efficient watchman based flooding algorithm for IoT-enabled underwater wireless sensor and actor networks

In the task of data routing in Internet of Things enabled volatile underwater environments, providing better transmission and maximizing network communication performance are always challenging. Many network issues such as void holes and network isolation occur because of long routing distances between nodes. Void holes usually occur around the sink because nodes die early due to the high energy consumed to forward packets sent and received from other nodes. These void holes are a major challenge for I-UWSANs and cause high end-to-end delay, data packet loss, and energy consumption. They also affect the data delivery ratio. Hence, this paper presents an energy efficient watchman based flooding algorithm to address void holes. First, the proposed technique is formally verified by the Z-Eves toolbox to ensure its validity and correctness. Second, simulation is used to evaluate the energy consumption, packet loss, packet delivery ratio, and throughput of the network. The results are compared with well-known algorithms like energy-aware scalable reliable and void-hole mitigation routing and angle based flooding. The extensive results show that the proposed algorithm performs better than the benchmark techniques.     

Multilayered Distributed Routing for Power Efficient MANET Performance

In this paper a new power efficient routing algorithm for MANETs with self-organizing and self-routing features is described and its performance analyzed in different simulation scenarios. The algorithm has the logic of a non-cooperative routing algorithm based on the evaluation of a weight parameter, the latter being a function of properties of the MANET nodes related to the nominal available power and the transmission range. A self-estimation of this weight parameter for each node is introduced in the routing process based on the status and functional history of the node. The routing is based on network layering, formation of service areas in each layer and choice of nodes from these areas to have the functionality of default gateways. The proposed algorithm, named service zone gateway prediction (SZGP), is a hybrid type of routing mechanism, incorporating pre-computed multipath hop-by-hop distributed routing, with a periodically updated hierarchical multilayered structure. The results from the simulation experiments show that the performance of the proposed SZGP algorithm in relation to the basic performance parameters such as packet delivery ratio, delay and throughput are similar to those of the well-known AODV algorithm, but in relation to power efficiency the proposed algorithm outperforms AODV significantly. This is due to the fact that such an approach reduces the overall number of broadcasts in the network and ensures a reliable and energy efficient connection by balancing the load among the nodes.     

Automated adaptive on-line Multi-Layer Traffic Engineering through “tailoring” wavelength-paths in the Fragment Graph

In Multi-Layer networks, where more than one layer is switched, i.e., connections are set up using not only the upper, e.g., IP layer but the underlying wavelength layer as well leads often to suboptimal performance due to long wavelength paths, that do not allow routing the traffic along the shortest path. The role of MLTE (Multi-Layer Traffic Engineering) is to cut (fragment) these long wavelength-paths into parts (fragments) that allow better routing at the upper layer, or to concatenate (defragment) two or more fragments into longer paths when the network load is low and therefore fewer hops are preferred.In this paper we present a new model, the Fragment Graph (FG) and an algorithm for this model that supports Fragmentation and De-Fragmentation of wavelength paths making the network always instantly adapt to changing traffic conditions. We introduce the notion of shadow links to model “λ-path tailoring”. We implicitly assume that the wavelength paths carry such, e.g., IP traffic that can be interrupted for a few milliseconds and that even allows minor packet reordering.To show the superior performance of our approach in various network and traffic conditions we have carried out an intensive simulation study where we compare blocking ratios and path lengths and we analyze the dynamic behavior and fairness of the proposed and of reference methods.     

EOMR: An Energy-Efficient Optimal Multi-path Routing Protocol to Improve QoS in Wireless Sensor Network for IoT Applications

The wireless sensor network based IoT applications mainly suffers from end to end delay, loss of packets during transmission, reduced lifetime of sensor nodes due to loss of energy. To address these challenges, we need to design an efficient routing protocol that not only improves the network performance but also enhances the Quality of Service. In this paper, we design an energy-efficient routing protocol for wireless sensor network based IoT application having unfairness in the network with high traffic load. The proposed protocol considers three-factor to select the optimal path, i.e., lifetime, reliability, and the traffic intensity at the next-hop node. Rigorous simulation has been performed using NS-2. Also, the performance of the proposed protocol is compared with other contemporary protocols. The results show that the proposed protocol performs better concerning energy saving, packet delivery ratio, end-to-end delay, and network lifetime compared to other protocols.

     

DABPR: a large-scale internet of things-based data aggregation back pressure routing for disaster management

In this paper, we propose a data aggregation back pressure routing (DABPR) scheme, which aims to simultaneously aggregate overlapping routes for efficient data transmission and prolong the lifetime of the network. The DABPR routing algorithm is structured into five phases in which event data is sent from the event areas to the sink nodes. These include cluster-head selection, maximization of event detection reliability, data aggregation, scheduling, and route selection with multi attributes decision making metrics phases. The scheme performs data aggregation on redundant data at relay nodes in order to decrease both the size and rate of message exchanges to minimize communication overhead and energy consumption. The proposed scheme is assessed in terms of packet delivery, network lifetime, ratio, energy consumption, and throughput, and compared with two other well-known protocols, namely “information-fusion-based role assignment (InFRA)” and “data routing for in-network aggregation (DRINA)”, which intrinsically are cluster and tree-based routing schemes designed to improve data aggregation efficiency by maximizing the overlapping routes. Meticulous analysis of the simulated data showed that DABPR achieved overall superior proficiency and more reliable performance in all the evaluated performance metrics, above the others. The proposed DABPR routing scheme outperformed its counterparts in the average energy consumption metric by 64.78% and 51.41%, packet delivery ratio by 28.76% and 16.89% and network lifetime by 42.72% and 20.76% compared with InFRA and DRINA, respectively.

     

移动Ad Hoc网络中的负载均衡路由算法

移动Ad Hoe网络(MANET)中的路由算法应尽量使网络负载均衡,不均衡不仅导致正在通信的路由由于过度拥塞而引起数据包延时过大、吞吐量下降,而且会使拥塞节点的能量提前耗尽,从而加剧网络拓扑结构的变化及节点之间的不公平性。本文对目前提出的一些负载均衡路由算法进行了简要比较和分析,在此基础上,指出了目前负载均衡路由算法中存在的一些问题,并提出了一个实现负载均衡路由算法的一般模型。基于该模型,文中提出了一种简单的负载均衡路由算法。仿真结果表明,负载均衡路由算法比未考虑负载均衡的路由算法具有更高的数据包投递率和更低的数据包传输延时。     

Adaptive Playout Buffer Algorithm for Enhancing Perceived Quality of Streaming Applications

An end-to-end packet delay in the Internet is an important performance parameter, because it heavily affects the quality of real-time applications. In the current Internet, however, because the packet transmission qualities (e.g., transmission delays, jitters, packet losses) may vary dynamically, it is not easy to handle a real-time traffic. In UDP-based real-time applications, a smoothing buffer (playout buffer) is typically used at a client host to compensate for variable delays. The issue of playout control has been studied by some previous works, and several algorithms controlling the playout buffer have been proposed. These studies have controlled the network parameters (e.g., packet loss ratio and playout delay), not considered the quality perceived by users. In this paper, we first clarify the relationship between Mean Opinion Score (MOS) of played audio and network parameters (e.g., packet loss, packet transmission delay, transmission rate). Next, utilizing the MOS function, we propose a new playout buffer algorithm considering user's perceived quality of real-time applications. Our simulation and implementation tests show that it can enhance the perceived quality, compared with existing algorithms.     

The Impact of Deployment Pattern and Routing Scheme on the Lifetime in Multi-Sink Wireless Sensor Network

Extensive use of sensor and actuator networks in many real-life applications introduced several new performance metrics at the node and network level. Since wireless sensor nodes have significant battery constraints, therefore, energy efficiency, as well as network lifetime, are among the most significant performance metrics to measure the effectiveness of given network architecture. This work investigates the performance of an event-based data delivery model using a multipath routing scheme for a wireless sensor network with multiple sink nodes. This routing algorithm follows a sink initiated route discovery process with the location information of the source nodes already known to the sink nodes. It also considers communication link costs before making decisions for packet forwarding. Carried out simulation compares the network performance of a wireless sensor network with a single sink, dual sink, and multi sink networking approaches. Based on a series of simulation experiments, the lifetime aware multipath routing approach is found appropriate for increasing the lifetime of sensor nodes significantly when compared to other similar routing schemes. However, energy-efficient packet forwarding is a major concern of this work; other network performance metrics like delay, average packet latency, and packet delivery ratio are also taken into the account.

     

TSRN: A Tabu Search-Based Routing Protocol for Named Data Networking

Information-centric network (ICN) has become a basic research topic with regard to the future architecture of the Internet. Storage and routing data is an important feature of ICN, as it improves network performance and content distribution. One of the challenges in this type of network is the routing problem. The objective of this paper is to propose a routing algorithm in the named data network. Owing to the impressive results presented by the enhanced heuristic methods, tabu search has been selected to develop the proposed algorithm. This work has been carried out in five major steps, Creating the initial solution, The mechanisms of generating a neighborhood, Evaluating the neighbor solutions and selecting the appropriate responses, Updating the answer and the tabu list, Controlling the algorithm termination conditions. The proposed protocol has been implemented in the simulator NS3. Important measures such as the packet delivery ratio, satisfied the interest packets ratio, the average number of interest packets, end-to-end delay, route creation delay, transmission delay, loss rate, and control message overhead have been studied. These show the quality of the proposed protocol. To evaluate the performance of the proposed algorithm, the results of the algorithm were compared with OSPFN and OSPF, which are the most well-known algorithms. The results of this assessment of throughput, control message overhead, packet delivery ratio, and end-to-end delay show that the proposed algorithm has the ability to provide appropriate solutions comparable to these algorithms.     

AODV能量优化策略

针对传统的AODV路由协议采用扩展环路由搜索算法导致的路由开销较大,没有考虑节点能量的问题,提出一种新的算法。此算法在路由请求过程中能够根据以前搜索中得到的信息,让多余的节点处于静默状态,不参与下一次的路由发现。并且综合考虑节点能量,尽可能地让低能量节点处于静默状态,从而达到均衡节点能量使用的目的。仿真结果表明改进算法有效延长了网络生存时间,提高了包投递率。     

Sling-shot spider optimization algorithm based packet length control in wireless sensor network and Internet of Things-based networks

Wireless sensor network (WSN) is a well-developed domain suitable in the optimal collection and processing of information needed for the present world. For processing and transmitting the correct data by the network, it is affected by many disrupting factors like interference, battery life, distance between the nodes, and redundant data. There have been many methods proposed in the past. Among all the disrupting factors, routing has been the most studied problem in the WSN literature, whereas packet length sizing has been the most untouched topic compared to routing. Sizing the packet lengths to transmit it through the network is important to get error-free data and run an energy-efficient network. In this paper, we propose a sling-shot spider optimization (S²SO) algorithm for packet length optimization in WSN and Internet of Things (IoT)-based networks. The S²SO algorithm is developed based on the spider's unique behavior of catching prey. The proposed algorithm is implemented in three types of networks: 1-hop, 2-hop, and multi-hop networks. A mathematical model for the communication channel, energy efficiency, and energy consumption is developed for all three types of networks. The proposed packet length optimization model is simulated in MATLAB software and compared with conventional bio-inspired algorithms. The results show that the proposed algorithm is very fast in finding the optimal results and transmits optimal packet size with low error rate of 0.2 p.u. and a high efficiency of 98%.     

Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks

In this paper, we present new algorithms for online multicast routing in ad hoc networks where nodes are energy-constrained. The objective is to maximize the total amount of multicast message data routed successfully over the network without any knowledge of future multicast request arrivals and generation rates. Specifically, we first propose an online algorithm for the problem based on an exponential function of energy utilization at each node. The competitive ratio of the proposed algorithm is analyzed if admission control of multicast requests is permitted. We then provide another online algorithm for the problem, which is based on minimizing transmission energy consumption for each multicast request and guaranteeing that the local network lifetime is no less than gamma times of the optimum, where gamma is constant with 0 < gammaleq 1. We finally conduct extensive experiments by simulations to analyze the performance of the proposed algorithms, in terms of network capacity, network lifetime, and transmission energy consumption for each multicast request. The experimental results clearly indicate that, for online multicast routing in ad hoc wireless networks, the network capacity is proportional to the network lifetime if the transmission energy consumption for each multicast request is at the same time minimized. This is in contrast to the implication by Kar et al. that the network lifetime is proportional to the network capacity when they considered the online unicast routing by devising an algorithm based on the exponential function of energy utilization at each node.     

光无线混合接入网中风险感知节能路由算法

研究了光无线混合接入网中具有抗毁能力的节能路由问题,结合光网络单元(ONU)休眠控制和风险备用路由表维护机制,提出一种有效的可靠绿色路由算法。该算法为每个无线路由器维护一个风险表,以记录网络中路径是否可用以及ONU活跃与否的状态信息,通过鼓励选择ONU活跃的可用路径来传输数据,可降低全网丢包率和能耗。仿真结果表明:该算法能够在稳定丢包率的同时更好地节省能量。