NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

Considerations on Novel Network Routing Mechanism

Routing is the cornerstone of network architecture, and a new routing mechanism is a requisite for constructing new network architecture. The current routing mechanism of the Internet layer is basically the single next-hop routing mechanism, which is the root of transmission congestion in the network. To solve this congestion problem, a fundamental measure is to change the route selection mode of current routing mechanism to allow parallel transmission over multiple routes. Currently, Border Gateway Protocol (BGP) is the only inter-domain routing protocol used in the Internet, but the routing system using BGP suffers scalability problem. To solve the scalability issue of the current inter-domain routing system, a new hierarchical routing system, i.e. Scalable Inter-Domain Routing Architecture (s-idra), is suggested. In addition to scalability, the current routing system is facing other challenges including security, Quality of Service (QoS), multicasting, mobility and dynamic network topology. Therefore, the research on routing protocols, especially the protocol for the new network architecture, is still a tough task and has a long way to go.     

Theories and Key Technologies for New-generation Internet System

There exist serious problems in the trustworthiness (security, reliability, controllability and manageability) of the Internet. In order to solve these problems, a new-generation network architecture model, based on the research of the basic theories of new-generation Internet system, is proposed. The solution creates a switching routing model and theory for the new-generation Internet system, and defines the access identifier, generalized switching routing identifier and their mapping principles. It also establishes a pervasive service system architecture and theory, defines the service identifier, connection identifier and their mapping principles. This paper discusses key technologies for the new-generation Internet system, such as access control and management, trusted routing and Quality of Service (QoS), multi-streaming, and network monitoring and management.     

A Survey on Routing Algorithms for Opportunistic Mobile Social Networks

Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performance of routing algorithms.Users in OMSNs communicate to share and disseminate data to meet needs for variety of applications.Such networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city initiatives.Devices carried by human is the carrier of message transmission,so the social features of human can be used to improve the ability of data transmission.In this paper,we conduct a comparative survey on routing algorithms in OMSNs.We first analyze routing algorithms based on three social features.Since node selfishness is not really considered previously in aforementioned routing algorithms,but has significant impact on network performance,we treat node selfishness as another social feature,classify and elaborate routing algorithms based on incentive mechanism.To assess the impact of social features on routing algorithms,we conducted simulation for six routing algorithms and analyzed the simulation result.Finally,we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.     

A DISTRIBUTED QOS ROUTING BASED ON ANT ALGORITHM FOR LEO SATELLITE NETWORK

Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. To satisfy the QoS requirements of multimedia applications, satellite routing protocols should consider handovers and minimize their effect on the active connections. A distributed QoS routing scheme based on heuristic ant algorithm is proposed for satisfying delay bound and avoiding link congestion. Simulation results show that the call blocking probabilities of this al- gorithm are less than that of Shortest Path First (SPF) with different delay bound.     

MILITARY MULTI-HOP ROUTING PROTOCOL

Military tactical network is one of the most important applications of ad hoc network. Currently the existing routing protocols are put forward based on the simple and universal network model which has the ability of multi-hop routing but cannot work efficiently in the special military applications. The narrow bandwidth and limited energy of the wireless network make general routing protocols seem to be more redundant. In order to satisfy military needs properly, this letter makes a detailed analysis of physical nodes and traffic distribution in military network, uses cross-layer design concept for reference, combines traffic characteristic of application layer with routing protocol design. It categorized routing problem as crucial routes and non-crucial routes which adopted separate maintenance methods. It not only realizes basic transmission function but also works efficiently. It is quite fit for military application.     

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

In wireless sensor network （MSN）, reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.     

一种新型的基于PCE的多层多域GM-PLS／ASON光网络体系结构

With the development of large-scale, multi-region and multi-layer networks, policy-based and constraint-based path computation is more and more complicated and dynamic routing becomes one of the key issues in GMPLS/ASON networks. To combine the advantages of both GMPLS control plane and PCE, novel dual routing engine architecture of multi-layer and multi-region scalable optical networks is proposed in this paper. The collaboration of group engine and unit engine makes it effective to optimize path computation especially under the condition of complex multi-constraints. The functional architecture of dual routing engine is detailed. Different potential co, operation relationships between group engine and unit engine are investigated and simulation results for multi-region and multi-layer routing schemes are analyzed.     

ESMD-Flow: An Intelligent Flow Forwarding Scheme with Endogenous Security Based on Mimic Defense in Space-Air-Ground Integrated Network

The Space-Air-Ground Integrated Network(SAGIN) realizes the integration of space, air,and ground networks, obtaining the global communication coverage.Software-Defined Networking(SDN) architecture in SAGIN has become a promising solution to guarantee the Quality of Service(QoS).However, the current routing algorithms mainly focus on the QoS of the service, rarely considering the security requirement of flow. To realize the secure transmission of flows in SAGIN, we propose an intelligent flow forwarding scheme with endogenous security based on Mimic Defense(ESMD-Flow). In this scheme, SDN controller will evaluate the reliability of nodes and links, isolate malicious nodes based on the reliability evaluation value, and adapt multipath routing strategy to ensure that flows are always forwarded along the most reliable multiple paths. In addition, in order to meet the security requirement of flows, we introduce the programming data plane to design a multiprotocol forwarding strategy for realizing the multiprotocol dynamic forwarding of flows. ESMD-Flow can reduce the network attack surface and improve the secure transmission capability of flows by implementing multipath routing and multi-protocol hybrid forwarding mechanism. The extensive simulations demonstrate that ESMD-Flow can significantly improve the average path reliability for routing and increase the difficulty of network eavesdropping while improving the network throughput and reducing the average packet delay.     

On Channel Assignment for Multicast in Multi-Radio Multi-Channel Wireless Mesh Networks:A Survey

The major challenge faced by wireless mesh networks is the capacity reduction caused by interference,and interference can be reduced or even eliminated through appropriate channel assignment.This article presents a comprehensive survey of channel assignment schemes for multicast in multi-radio multi-channel wireless mesh networks.We analyze the state-of-the-art channel assignment schemes for multicast and provide comprehensive taxonomy of the latest work.In general,we classify the channel assignment schemes for multicast into two types,that is,sequential multicast routing and channel assignment(SMRCA)and joint multicast routing and channel assignment(JMRCA).Detailed review of channel assignment schemes in each category is provided.Possible future research directions and corresponding solutions are also explored to motivate research interests in the field of channel assignment for multicast in wireless mesh networks.     

Energy Efficient Forwarding Algorithm in Opportunistic Networks

In opportunistic networks,a successful message transmission between node pairs depends on the message size,the transmission speed and the connection duration time.This paper proposes a new message forwarding algorithm to improve the message delivery ratio and reduce the energy consumption.Previous encounter characteristics between nodes are used to estimate future connection duration time using a three point estimation method.Furthermore,the buffer utilization of nodes is used as a weight for the likelihoods to meet destinations according to the hop count of messages stored in the buffer.The simulation results show that the proposed forwarding algorithm achieves higher delivery ratio and less overhead ratio than the other four popular routing protocols.In addition,the proposed algorithm gains a better average residual energy performance among all the compared protocols.     

Energy‐aware geographic routing in wireless sensor networks with anchor nodes

Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

A probabilistic routing algorithm based on node communication capability and message strength

In delay-tolerant networks (DTN), node connection time and message transmission time are two important influencing factors that can improve the delivery rate. In this paper, we first define a new concept called communication capability (CC) and then apply this concept to the delivery predictability formulation in Prophet and improve it. Then, in Prophet, the selection of relay nodes relies only on the delivery predictability and ignores the caching and forwarding capability of the node. Therefore, we combine delivery predictability, buffering, and forwarding capability to develop a new adaptive relay node selection strategy. Subsequently, we define two metrics called message priority (MP) and message strength (MS). The node forwards messages sequentially based on message priority and discards messages based on message strength. Finally, we present a probabilistic routing algorithm based on node communication capability and message strength (CAMS). The simulation results show that compared with traditional routing algorithms, the CAMS can effectively improve the message delivery rate, reduce the overhead ratio, and keep average hop counts low.     

一种能量平衡的无线体域网络AODV多播路由发现协议

在动态网络拓扑中,AODV协议通过数据源节点S泛洪广播RREQ消息请求到任意目标节点D的路由,而在无线体域网络中,只有一个sink目标节点,除最短跳数路由上的节点外,其他参与RREQ接收和转发的节点浪费了能量。提出了一种能量平衡的无线体域网络AODV多播路由发现协议,通过在节点广播的hello消息中增加到sink的最小跳数hops、到sink的下一跳节点next和节点本身是否具备转发能力isforward 3 个参数,只选择能到达sink节点的邻居节点参与转发RREQ消息,变广播为多播,有效地降低了路由发现的能量开销,并通过能量平衡延长了WBAN的使用寿命。性能分析与模拟实验表明,该协议在RREQ数量、数据传输率和能量消耗等方面优于相似协议EAAODV。     

基于粒子滤波步行长度预测的移动ad hoc网络路由算法

针对移动ad hoc网络拓扑结构变化大、路由复杂度高、数据传输性能低等问题,提出了一种新的移动通信系统自适应路由算法。为了使得网络拓扑结构更接近移动网络间歇性连接的特点,该算法在网络结构上采用了一种改进的Levy Walk移动模型。采用一种粒子滤波步行长度预测的方法,通过蒙特卡罗抽样得到递归贝叶斯滤波器,并在粒子滤波后进行步行长度预测,确定消息的副本数量,从而减少由于节点转发过多消息副本带来的能量消耗量,提高消息的传递效率。实验仿真结果表明：与基于改进蚁群优化和利润优化模型的路由算法相比,该算法的消息传递成功率分别提高了0.08和0.04,节点平均能量效率提高了17.9%和13.4%,在提升数据传输成功率和节能上具有较好效果。     

An Improved Routing Algorithm Based on Social Link Awareness in Delay Tolerant Networks

The routing efficiency in delay tolerant networks is degraded due to intermittent connection and high latency. Additionally, socially selfish nodes in social networks refuse to provide message forwarding service since there are limited resources. To solve these problems, an improved routing algorithm based on the social link awareness is proposed. In this algorithm, multiple social features of the nodes’ behaviors are utilized to quantify the nodes pairs’ social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and increases the successful delivery ratio, thereby improving the routing efficiency.     

延迟容忍移动传感器网络中基于概率复制的数据传输策略及其性能研究

该文提出了一种基于概率复制的数据传输策略PRD(Probability Replication Delivery scheme)用于空间中间断连通的延迟容忍移动传感器网络(DTMSN)数据传输。PRD由选择复制策略和队列管理组成,前者根据节点将消息传递给汇聚点的可能性,选择下一跳进行复制传输;队列管理则利用引入传输概率及复制数的消息生存时间决定队列中消息丢弃原则。仿真分析表明,与现有的几种数据传输策略相比,PRD能以较低的数据复制数及传输延迟获得较高的数据传输成功率。     

A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.     

Optimal energy efficiency routing strategy based on community in mobile social network

An optimal energy efficiency routing strategy based on community was proposed,which minimized the network energy consumption under the given delay constraint.Firstly the expected energy consumption and delay of message delivery in the connected network were obtained through Markov chain.Then the comprehensive cost function for delivering message from source node to destination node was designed,which was combined with energy consumption and delay.Thus,the optimization function to comprehensive cost of relay node delivering message was obtained,and further the reward function of relay node was gotten.Finally the optimal expected reward of optimal relay node was achieved using the optimal stopping theory,so as to realize the optimal energy efficiency routing strategy.In simulations,the average energy consumption,the average delay and the average delivery ratio of routing optimization strategy were compared with those of other routing strategies in related literatures.The results show that the strategy proposed has smaller average energy consumption,shorter average delay and higher average delivery ratio,gaining better energy consumption optimization effect.     

基于社会属性的PSN消息路由算法

在PSN（pocket switched network）中实现数据传输成功率与传输延迟的有效平衡是当前有待解决的问题。提出一种基于社会属性的PSN路由算法——BridgingCom算法,该算法使用带有衰退机制的局部社区识别方法,引入桥接中心度（bridging centrality）作为中继节点的选择依据,将社会网络中节点重要性与移动社会网络的特征相结合,考虑了节点社区关系和节点活跃度对路由算法的影响。实验表明,该算法与现有经典算法相比能够获得较高的传输效率和较低的传输延迟。