一种应急通信中业务感知的宽带自组网路由协议

随着科技进步,我国在应急通信系统建设上也正高速发展,当前应急通信网络对多媒体业务有着迫切需求,对网络带宽要求更高。而当网络存在多种不同业务时,传统通用的路由协议不再适用,它们大多以最小跳数为路由度量或者是某个单一度量,未能考虑不同业务的服务质量(Quality of Service, QoS)需求,因而无法同时兼顾不同业务流的传输要求。提出了一种应急通信中业务感知的宽带自组网路由策略,对不同类型业务在路由和转发优先级上进行区分。经多次仿真验证,该策略能使网络在满足应急语音业务QoS需求的同时,也能兼顾承载的视频、数据等其他业务的性能。     

CAMP: cluster aided multi-path routing protocol for wireless sensor networks

Wireless Networks - In this article, we propose a novel routing algorithm for wireless sensor network, which achieves uniform energy depletion across all the nodes and thus leading to prolonged...     

无线网络的多径源路由协议研究

对目前AdHoc无线移动网络中存在的路由问题进行分析，并从多路径路由的要求出发，讨论把动态源路由协议DSR改造成多源路径协议的可行性，并提出了具体的实现算法。文中所提出的多径源路由协议为无线网络的路由协议的研究提供了重要的理论支持。     

移动Ad Hoc网络中基于Qos的多路径路由协议研究

针对现有移动Ad Hoc网在大流量业务下无法提供高质量QoS保障的问题,通过推导证明提出了路径长度限制的路径稳定的约束关系,进而将QoS的判定因子引入一种确定性的最优权值约束路由算法进行实例化,并在该路由算法的基础上提出了基于QoS保障的多路径路由协议(MP-QAODV).通过仿真,验证了MP-QAODV协议在平均端到端时延、端到端数据分组投递率、归一化路由开销等方面优于AODV和AOMDV协议.     

RAARPL: End-to-end Reliability-Aware Adaptive RPL routing protocol for Internet of things

The RPL protocol has been accepted by the Internet Engineering Task Force as the only routing standard for the Internet of things (IoT). Although RPL has been significantly used in IoT routing, it still has extensive challenges. One of the most basic challenges is related to the reliability of routing. The severe limitations of resources, wireless communication, and variable topology, along with other limitations of IoT, have caused reliability in these networks to be a challenging topic. However, in RPL, no measures are provided to support the reliability of routing. To improve this issue, in this article, RPL was improved based on reliability requirements, and a new protocol was proposed called the Reliability-Aware Adaptive RPL routing protocol (RAARPL). RAARPL selects the parents based on the evaluation of various criteria related to reliability and forms the network topology. In addition, the conditions of the paths were also considered in the decision-making so that the reliability depends on the paths and parents. In order to maintain stability, RAARPL had controlled the parent selection and children assignment in a way that will prevent errors as much as possible. The simulation results by Cooja and compared with CLRPL and RPL protocols in various scenarios indicated the high efficiency of RAARPL in improving the reliability of data exchange and successful delivery ratio, reducing the instability of topology and the network throughput.     

面向智能工业物联的灵活地址可信协议架构

IP网络在过去50年里取得了瞩目成绩,已经成为人们生产和生活过程中不可或缺的一部分。然而,随着互联网的广泛应用,IP协议体系的一些原始设计缺陷也日益暴露,难以满足未来网络的发展需求。讨论了面向2030年的互联网业务场景和关键技术挑战,提出了面向智能工业物联的灵活地址可信协议架构。新协议架构在传统IP协议全球可达、高生存性的基础之上,构建万物万网互联、确定性服务、内生安全可信、高通量传输和用户可定义等新能力,并基于这些新能力使能更多新型网络业务。     

A greedy-based stable multi-path routing protocol in mobile ad hoc networks

With the increasing popularity of multimedia, there is a growing tendency in mobile ad hoc networks (MANETs) to establish stable routes with long route lifetimes, low control overhead and high packet delivery ratios. According to recent analytical result, the lifetime of a route, which can reflect the route stability, depends on the length of the route and the lifetime of each link in the route. This paper presents a Greedy-based Backup Routing (GBR) protocol that considers both route length and link lifetime to achieve high route stability. In GBR, the primary path is constructed primarily based on a greedy forwarding mechanism, whereas the local-backup path for each link is established according to the link lifetime. Both analytical and simulation results demonstrate that GBR has excellent performance in terms of route lifetime, packet delivery ratio, and control overhead.     

Ad hoc网络中基于多径路由协议的信誉机制

基于多径路由协议,采用RS编码技术,设计了一种将数据信息编码后分片沿不同路径传输的方法,在目的节点对恶意篡改行为进行检测,确定恶意节点的具体位置或将恶意节点锁定在恶意节点组内.在此基础上提出了一个完整的抵制篡改数据攻击的信誉机制,充分利用了从数据传输和恶意节点检测过程中获得的信息,采用简单贝叶斯模型方法,对节点进行信誉评价,引入了恶意节点组的概念.数据在正常传输过程中无需重复加密和签名.实验表明,该信誉机制能够有机地与多径路由协议相结合,快速准确地孤立篡改数据的恶意节点.     

Analysis of multi-path routing

In connection-oriented networks, resource reservations must be made before data can be sent along a route. For short or bursty connections, a selected route must have the required resources to ensure appropriate communication with regard to desired quality-of-service (QoS). For example, in ATM networks, the route setup process considers only links with sufficient resources and reserves these resources while it advances toward the destination. The same concern for QoS routing appears in datagram networks such as the Internet, when applications with QoS requirements need to reserve resources along pinned routes. In this paper, we analyze the performance of multi-path routing algorithms and compare them to single-path reservation that might be persistent, i.e., retry after a failure. The analysis assumes that the routing process reserves resources while it advances toward the destination, thus there is a penalty associated with a reservation that cannot be used. Our analysis shows that while multi-path reservation algorithms perform comparably to single-path reservation algorithms, either persistent or not, the connection-establishment time for multi-path reservation is significantly lower. Thus, multi-path reservation becomes an attractive alternative for interactive applications such as World Wide Web browsing     

A location prediction based routing protocol and its extensions for multicast and multi-path routing in mobile ad hoc networks

This paper discusses a new location prediction based routing (LPBR) protocol for mobile ad hoc networks (MANETs) and its extensions for multicast and multi-path routing. The objective of the LPBR protocol is to simultaneously minimize the number of flooding-based route discoveries as well as the hop count of the paths for a source–destination (s–d) session. During a regular flooding-based route discovery, LPBR collects the location and mobility information of nodes in the network and stores the collected information at the destination node of the route search process. When the minimum-hop route discovered through flooding fails, the destination node locally predicts a global topology based on the location and mobility information collected during the latest flooding-based route discovery and runs a minimum-hop path algorithm. If the predicted minimum-hop route exists in reality, no expensive flooding-based route discovery is needed and the source continues to send data packets on the discovered route. Similarly, we propose multicast extensions of LPBR (referred to as NR-MLPBR and R-MLPBR) to simultaneously reduce the number of tree discoveries and the hop count per path from the source to each multicast group receiver. Nodes running NR-MLPBR are not aware of the receivers of the multicast group. R-MLPBR assumes that each receiver node also knows the identity of the other receiver nodes of the multicast group. Finally, we also propose a node-disjoint multi-path extension of LPBR (referred to as LPBR-M) to simultaneously minimize the number of multi-path route discoveries as well as the hop count of the paths.     

Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks

In this paper, a distributed traffic-balancing routing algorithm is proposed for multi-sink wireless sensor networks that effectively distributes traffic from sources to sinks. Each node has a gradient field that is used to decide on a neighbor node to reach a sink. The node’s gradient index contains (1) the distance cost from a source to a respective sink, and (2) traffic information from neighboring nodes. The proposed algorithm considers the traffic being faced by surrounding neighbors before forwarding packets to any sink using gradient search for routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The key objective of this work is to achieve traffic-balancing by detecting congested areas along the route and distributing packets along paths that have idle and underloaded nodes. Extensive simulations conducted to evaluate the performance of the proposed scheme indicate that it effectively reduces the overall packet delay, energy consumption and improves the packet delivery ratio under heavy traffic.     

基于流量感知的多径低能量的光网络设计

针对建立在共享多点对多点的光广域网,提出了一个多径全光网络解决方案及多径共享网络系统架构,该网络可以使用已有的组件,能源功耗低,更简单有效。给出了基于流量感知的动态带宽分配算法,仿真分析结果表明,该系统设计在吞吐量和延迟方面有出色表现。     

Sandpiper optimization algorithm with cosine similarity based cross-layer routing protocol for smart agriculture in wireless sensor network assisted internet of things systems

The Internet of Things (IoT) has recently attained a prominent role in enabling smooth and effective communication among various networks. Wireless sensor network (WSN) is utilized in IoT to collect peculiar data without interacting with humans in specific applications. Energy is a major problem in WSN-assisted IoT applications, even though better data communication is achieved through cross-layer models. This paper proposes a new cross-layer-based clustering and routing model to provide a scalable and energy-efficient long data communication in WSN-assisted IoT systems for smart agriculture. Initially, the fuzzy k-medoids clustering approach is used to split the network into various clusters since the formation of clusters plays an important role in energy consumption. Then, a new swarm optimization known as enhanced sparrow search algorithm (ESSA), which is the combination of SSA and chameleon swarm algorithm (CSA), has been introduced for optimal cluster head (CH) selection to solve the energy-hole problems in WSN. A cross-layer strategy has been preferred to provide efficient data transmission. Each sensor node parameter of the physical layer, network layer and medium access control (MAC) is considered for processing routing. Finally, a new bio-inspired algorithm is known as the sandpiper optimization algorithm (SOA), and cosine similarity (CS) has been employed to determine the optimal route for efficient data transmission and retransmission. The simulation of the proposed protocol is implemented by network simulator (NS2), and the simulation results are taken in terms of end-to-end delay, PDR, communication overhead, communication cost, average consumed energy, and network lifetime.     

物联网广泛协议适配接口系统设计与研究

针对目前物联网发展过程中终端协议繁多、不统一且复杂等问题,本论文采用了NIO、NoSQL、XML和JavaEE等技术,对物联网广泛协议通用适配进行了研究与实现。主要研究成果有：(1)统一协议、通用适配,兼容多数主流的物联网终端协议,并提供接口可扩展;(2)快速接入终端,减少开发成本和时间;(3)高并发和高效能处理大量的数据交互。以上结果阐明了物联网广泛协议通用适配的重要意义,为物联网上层应用提供了简单、快速、高效的基础平台。     

物联网广泛协议标准化适配接口系统设计与研究

针对目前物联网发展过程中终端协议繁多、不统一且复杂等问题,本论文采用了NIO、NoSQL、XML和JavaEE等技术,对物联网广泛协议的标准化适配进行了研究与实现。研究结果阐明了物联网广泛协议标准化适配的重要意义,为物联网上层应用提供了简单、快速、高效的基础平台。     

Developing multi-path routing protocol in MANET using hybrid SM-CSBO based on novel multi-objective function

One of the infrastructure-free networks is mobile ad hoc networks (MANETs) that are built with limited battery life using wireless mobile devices. This restricted battery capability in MANETs creates the necessity of considering the energy-awareness constraint in designing them. As routing protocols, the major aim of MANETs is to create the energy awareness in the network; it improves the network's lifetime through effectively utilizing the available restricted energy. Moreover, it creates some limitations like the mobility constraint, wireless link's sensitivity to environmental impacts, and restricted transmission range and residual energy of nodes that causes rapid modifications in the network topology and frequent link failure. By taking those problems, this paper plans to develop a new multipath routing protocol, where the hybrid optimization algorithm with the integration of cuckoo search optimization (CSO) and butterfly optimization algorithm (BOA) is proposed and named sensory modality-based cuckoo search butterfly optimization (SM-CSBO) for determining the optimal path between the source and destination. The main goal is to select the path with better link quality and more stable links to guarantee reliable data transmission. The multi-objective function is considered with the factors regarding distance, normalized energy, packet delivery ratio, and control overhead to develop an effective routing protocol in MANET. The proposed model of SM-CSBO algorithm has superior than 5.8%, 30.4%, 36.7%, and 39.3%, correspondingly maximized than PSO, SFO, CSO, and SFO algorithms while considering the number of nodes as 150. The simulation outcomes proved that it enhances network performance when compared with the other traditional protocols.     

EATMR: an energy-aware trust algorithm based the AODV protocol and multi-path routing approach in wireless sensor networks

Telecommunication Systems - Queueing models play a significant role in analysing the performance of power management systems in various electronic devices and communication systems. This paper...     

Multi-layer based multi-path routing algorithm for maximizing spectrum availability

Last 2 decades have witnessed the spectrum resources scarcity which is caused by wireless networks’ ubiquitous applications. To utilize the rare spectrum resources more efficiently, Cognitive Radio (CR) technology has been developed as a promising scheme. However, in CR networks, a novel NP-Hard disjoint multi-path routing problem has been encountered due to the Primary Users’ (PUs’) random movements. To settle this problem, we present a Spectrum History Matrix mechanism to define long-term spectrum sensing information on time-spectrum level such that spectrum availability and communication efficiency can be quantized in CR networks. To lessen the possibility for an active PU to interrupt all paths simultaneously, a sub-optimal Multi-layer based Multi-path Routing Algorithm (MMRA) is provided to determine how to route multiple paths which are not under the same PUs’ interference ranges. Through theoretical and simulation analyses, MMRA can not only settle the disjoint multi-path routing problem in polynomial time complexity, but also maximize communication efficiency.     

Novel multi-path routing scheme for UWB Ad hoc network

1 Introduction Ad hoc networks and ultra-wideband communications technology are a key factor in the evolution of wireless communications. In ad hoc networks, wireless hosts can communications with each other in the absence of a fixed infrastructure. These networks typically consist of equal nodes that communication over wireless links without central control .The followings can be used to describe the ad hoc network[1]: ? Dynamic network topology ? Limited resource ? Multi-hop communication …     

Correction to: EATMR: an energy-aware trust algorithm based the AODV protocol and multi-path routing approach in wireless sensor networks

Telecommunication Systems -