Multi-path routing based on load-balance for cognitive packet networks

Quality of service(QoS)routing algorithms have been hardly discussed in the scientific community,most previous work on QoS routing concentrates on the performance of the single route.Cognitive packet network(CPN)has been designed for providing QoS routing.In this paper,to balance the loads among networks,we present a multi-path routing algorithm based on load-balance(MPRLB),which is carried out in two steps.The algorithm with low computational complexity is firstly applied to establish multi path routing for each source and destination node pairs(SD-pair)nodes in the network.Then,we propose the hopfield neural network algorithm,which is applied to improve the efficiency of the flow deviation method for fast flow allocation among the links of the network based on load balance.Extensive simulation results demonstrate that the proposed scheme significantly improves the performance compared with the existing scheme that ignores load balancing.     

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.     

Status adaptive routing with delayed rebroadcast scheme in AODV-based MANETs

An efficient solution is proposed in this article to determine the best reliable route and to prolong the lifetime of the mobile Ad-hoc networks （MANETs）. In the proposed solution, the route discovery process of the Ad-hoc on-demand distance vector routing protocol （AODV） has been modified using a novel delayed rebroadcast scheme. It combines the shortest route selection criterion of AODV with the real network status including the wireless link quality, the remaining power capacity, as well as the traffic load at each node. Simulation results show that the proposed scheme can significantly extend the network lifetime and provide fewer packet losses than the conventional AODV protocol.     

Packet track and traceback mechanism against denial of service attacks

The denial of service attack is a main type of threat on the Internet today. On the basis of path identification （Pi） and Internet control message protocol （ICMP） traceback （iTrace） methods, a packet track and traceback mechanism is proposed, which features rapid response and high accuracy. In this scheme, routers apply packet marking scheme and send traceback messages, which enables the victim to design the path tree in peace time. During attack times the victim can trace attackers back within the path tree and perform rapid packet filtering using the marking in each packet. Traceback messages overcome Pi＇s limitation, wherein too much path information is lost in path identifiers; whereas path identifiers can be used to expedite the design of the path-tree, which reduces the high overhead in iTrace. Therefore, our scheme not only synthesizes the advantages but also compromises the disadvantages of the above two methods. Simulation results with NS-2 show the validity of our scheme.     

Performance Analysis of Wireless Network Coding via Percolation

In order to investigate the effect of net- work connectivity on the performance of wireless network coding, we introduce percolation theory to construct the system model of multi-hop wireless network for asymp- totic connectivity. Concretely, we proposed a normaliza- tion algorithm for random network to layer the nodes of the largest connected component in multi-hop wireless net- work, and derived the theoretical conditions of percola- tion occurrence for the normalized hierarchical network of the largest connected component. Furthermore, accord- ing to the critical threshold of percolation phenomenon, we derived the performance of wireless network coding for the largest connected component. The mean delay and throughput were quantified in terms of network coding parameters such as coding window size, transmission ra- dius, and node density. These conclusions clarify the ef- fective performance of wireless network coding for random network, and will contribute to the evaluation of optimal performance of wireless network coding.     

Grid-Based Localization Mechanism with Mobile Reference Node in Wireless Sensor Networks

Wireless sensor networks(WSNs) are based on monitoring or managing the sensing area by using the location information with sensor nodes. Most sensor nodes require hardware support or receive packets with location information to estimate their locations, which needs lots of time or costs. In this paper we proposed a localization mechanism using a mobile reference node(MRN) and trilateration in WSNs to reduce the energy consumption and location error. The simulation results demonstrate that the proposed mechanism can obtain more unknown nodes locations by the mobile reference node moving scheme and will decreases the energy consumption and average location error.     

Impact of MAC frame length on energy efficiency in 6LowPAN

To reach necessary end-to-end connectivity between the Internet and wireless sensor networks （WSNs）, the Internet Engineering Task Force （IETF） IPv6 over low power wireless personal area network （6LowPAN） working group has been established and introduced an adaptation layer for integration of IEEE 802.15.4 physical layer/media access control （PHY/MAC） layers and the upper layers of any Intemet protocol （IP）-based networks, such as the Internet. The energy efficiency is one of the most important performance measures in WSNs because most sensor nodes are only battery powered so we should reduce the energy consumption to the lowest to extend the life of nodes. Therefore the determination of MAC frame length should be carefully considered since that the radio frequency （RF） module consumes most the energy of a sensor node meanwhile the MAC protocol is the direct controller of RF module. In this paper, we provide a star-shaped 6LowPAN non-beacon mode with unslotted carrier sense multiple access with collision avoidance （CSMA/CA） mechanism to access to the channel and model the stochastic behavior of a target end node as the M/G/1 queuing system. Analytical expressions for some parameters such as channel busy probability, packet loss probability and energy efficiency are obtained in this paper and our analytical results can clearly show the impact of MAC frame length on the energy efficiency of a target node in both ideal and lossy channel.     

Improved multipath muting with WNN for the open networks

Multipath routing mechanism is vital for reliable packet delivery, load balance, and flexibility in the open network because its topology is dynamic and the nodes have limited capability. This article proposes a new multipath switch approach based on traffic prediction according to some characteristics of open networks. We use wavelet neural network （WNN） to predict the node traffic because the method has not only good approximation property of wavelet, but also self-learning adaptive quality of neural network. When the traffic prediction indicates that the primary path is a failure, the alternate path will be occupied promptly according to the switch strategy, which can save time for the switch in advance The simulation results show that the presented traffic prediction model has better prediction accuracy; and the approach based on the above model can balance network load, prolong network lifetime, and decrease the overall energy consumption of the network.     

RESS: A Reliable and Effcient Storage Scheme for Bitcoin Blockchain Based on Raptor Code

The Bitcoin system uses a fully replicated data storage mechanism in which each node keeps a full copy of the blockchain. As the number of nodes in the system increases and transactions get more complex, more and more storage space are needed to store block data.The scalability of storage has become a bottleneck, limiting the practical application of blockchain. This paper proposes a node storage scheme, called RESS, to integrate erasure coding technology into the blockchain to encode multiple b...     

Cost-aware and Reliable Mesh-under Routing for Delivering IPv6 Packets over Low Power Wireless Personal Area Network

The 6LoWPAN protocol is used in delivering IPv6 packet over IEEE 802.15.4 based low power Wireless personal area network （WPAN）. The Mesh-under routing （MUR） presented in the 6LoWPAN conducts routing in the adaptation layer. When delivering an IPv6 packet over a route consisting of multiple unreliable links, the probability that the IPv6 packet reaches the destination via MUR is very low. This drawback is remedied by the proposed Cost-aware and reliable MUR （CAR-MUR） scheme, which extends the MUR to incorporate a packet redelivery mechanism in the transport layer and is able to find the best number of trials in the transport layer, the best number of the retrials in the MAC layer, and the best number of fragments in each packet so that the total cost for packet delivery is minimized while guaranteeing all the packets to reach the destination with a preset probability. The numerical analysis shows that, compared to the MUR, the proposed CAR-MUR has better performance as it minimizes the packet delivery cost while guaranteeing that all the packets are delivered to the destination with an intended probability.     

Balance energy-efficient and real-time with reliable communication protocol for wireless sensor network

In many wireless sensor network applications, it should be considered that how to trade off the inherent conflict between energy efficient communication and desired quality of service such as real-time and reliability of transportation. In this paper, a novel routing protocols named balance energy-efficient and real-time with reliable communication (BERR) for wireless sensor networks (WSNs) are proposed, which considers the joint performances of real-time, energy efficiency and reliability. In BERR, a node, which is preparing to transmit data packets to sink node, estimates the energy cost, hop count value to sink node and reliability using local information gained from neighbor nodes. BERR considers not only each sender’ energy level but also that of its neighbor nodes, so that the better energy conditions a node has, the more probability it will be to be chosen as the next relay node. To enhance real-time delivery, it will choose the node with smaller hop count value to sink node as the possible relay candidate. To improve reliability, it adopts retransmission mechanism. Simulation results show that BERR has better performances in term of energy consumption, network lifetime, reliability and small transmitting delay.     

OpenFIow Based Flow Slice Load Balancing

Today＇s data center networks are designed using densely interconnected hosts in the data center.There are multiple paths between source host and destination server.Therefore,how to balance traffic is key issue with the fast growth of network applications.Although lots of load balancing methods have been proposed,the traditional approaches cannot fully satisfy the requirement of load balancing in data center networks.The main reason is the lack of efficient ways to obtain network traffic statistics from each network device.As a solution,the OpenFlow protocol enables monitoring traffic statistics by a centralized controller.However,existing solutions based on OpenFlow present a difficult dilemma between load balancing and packet reordering.To achieve a balance between load balancing and packet reordering,we propose an OpenFlow based flow slice load balancing algorithm.Through introducing the idea of differentiated service,the scheme classifies Internet flows into two categories：the aggressive and the normal,and applies different splitting granularities to the two classes of flows.This scheme improves the performance of load balancing and also reduces the number of reordering packets.Using the trace-driven simulations,we show that the proposed scheme gains over 50%improvement over previous schemes under the path delay estimation errors,and is a practical and efficient algorithm.     

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.     

A Learning Automata Based Area Coverage Algorithm for Wireless Sensor Networks

One way to reduce energy consumption in wireless sensor networks is to reduce the number of active nodes in the network. When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field （referred to as a ＂cover＂）, whereas the rest of the sensors should be put to sleep to conserve their batteries. In this paper, a learning automata based algorithm for energy-efficient monitoring in wireless sensor networks （EEMLA） is proposed. Each node in EEMLA algorithm is equipped with a learning automaton which decides for the node to be active or not at any time during the operation of the network. Using feedback received from neighboring nodes, each node gradually learns its proper state during the operation of the network. Experimental results have shown that the proposed monitoring algorithm in comparison to other existing methods such as Tian and LUC can better prolong the network lifetime.     

A Throughput-Aware Joint Vehicle Route and Access Network Selection Approach Based on SMDP

In intelligent transportation system(ITS), the interworking of vehicular networks(VN) and cellular networks(CN) is proposed to provide high-data-rate services to vehicles. As the network access quality for CN and VN is location related, mobile data offloading(MDO), which dynamically selects access networks for vehicles, should be considered with vehicle route planning to further improve the wireless data throughput of individual vehicles and to enhance the performance of the entire ITS. In this paper, we investigate joint MDO and route selection for an individual vehicle in a metropolitan scenario. We aim to improve the throughput of the target vehicle while guaranteeing its transportation efficiency requirements in terms of traveling time and distance. To achieve this objective, we first formulate the joint route and access network selection problem as a semi-Markov decision process(SMDP). Then we propose an optimal algorithm to calculate its optimal policy. To further reduce the computation complexity, we derive a suboptimal algorithm which reduces the action space. Simulation results demonstrate that the proposed optimal algorithm significantly outperforms the existing work in total throughput and the late arrival ratio.Moreover, the heuristic algorithm is able to substantially reduce the computation time with only slight performance degradation.     

A Security Enhancement Model Based on Switching Edge Strategy in Interdependent Heterogeneous Cyber-Physical Systems

With the advent of cross-domain interconnection,large-scale sensor network systems such as smart grids,smart homes,and intelligent transportation have emerged.These complex network systems often have a CPS(Cyber-Physical System)architecture and are usually composed of multiple interdependent systems.Minimal faults between interdependent networks may cause serious cascading failures between the entire system.Therefore,in this paper,we will explore the robustness detection schemes for interdependent networks.Firstly,by calculating the largest giant connected component in the entire system,the security of interdependent network systems under different attack models is analyzed.Secondly,a comparative analysis of the cascade failure mechanism between interdependent networks under the edge enhancement strategy is carried out.Finally,the simulation results verify the impact of system reliability under different handover edge strategies and show how to choose a better handover strategy to enhance its robustness.The further research work in this paper can also help design how to reduce the interdependence between systems,thereby further optimizing the interdependent network system’s structure to provide practical support for reducing the cascading failures.In the later work,we hope to explore our proposed strategies in the network model of real-world or close to real networks.     

Top-K Query Framework in Wireless Sensor Networks for Smart Grid

The smart grid has caught great attentions in recent years, which is poised to transform a centralized, producer-controlled network to a decentralized, consumer- interactive network that＇s supported by fine-grained monitoring. Large-scale WSNs （Wireless Sensor Networks） have been considered one of the very promising technologies to support the implementation of smart grid. WSNs are applied in almost every aspect of smart grid, including power generation, power transmission, power distribution, power utilization and power dispatch, and the data query processing of ＇WSNs in power grid＇ become an hotspot issue due to the amount of data of power grid is very large and the requirement of response time is very high. To meet the demands, top-k query processing is a good choice, which performs the cooperative query by aggregating the database objects＇ degree of match for each different query predicate and returning the best k matching objects. In this paper, a framework that can effectively apply top-k query to wireless sensor network in smart grid is proposed, which is based on the cluster-topology sensor network. In the new method, local indices are used to optimize the necessary query routing and process intermediate results inside the cluster to cut down the data traffic, and the hierarchical join query is executed based on the local results.Besides, top-k query results are verified by the clean-up process, and two schemes are taken to deal with the problem of node＇s dynamicity, which further reduce communication cost. Case studies and experimental results show that our algorithm has outperformed the current existing one with higher quality results and better efficiently.     

Inter-Carrier Interference-Aware Sparse Time-Varying Underwater Acoustic Channel Estimation Based on Fast Reconstruction Algorithm

In this paper,a fast orthogonal matching pursuit(OMP)algorithm based on optimized iterative process is proposed for sparse time-varying underwater acoustic(UWA)channel estimation.The channel estimation consists of calculating amplitude,delay and Doppler scaling factor of each path using the received multi-path signal.This algorithm,called as OIP-FOMP,can reduce the computationally complexity of the traditional OMP algorithm and maintain accuracy in the presence of severe inter-carrier interference that exists in the time-varying UWA channels.In this algorithm,repeated inner product operations used in the OMP algorithm are removed by calculating the candidate path signature Hermitian inner product matrix in advance.Efficient QR decomposition is used to estimate the path amplitude,and the problem of reconstruction failure caused by inaccurate delay selection is avoided by optimizing the Hermitian inner product matrix.Theoretical analysis and simulation results show that the computational complexity of the OIP-FOMP algorithm is reduced by about 1/4 compared with the OMP algorithm,without any loss of accuracy.     

无线Ad Hoc网络中基于业务感知的多信道MAC协议(英文)

Existing multi-channel Medium Access Control (MAC) protocols have been demonstrated to significantly increase wireless network performance compared to single channel MAC protocols. Traditionally, the channelization structure in IEEE 802.11 based wireless networks is pre-configured, and the entire available spectrum is divided into subchannels and equal channel widths. In contrast, this paper presents a Traffic-Aware Channelization MAC (TAC-MAC) protocol for wireless ad hoc networks, where each node is equipped with a single half duplex transceiver. TAC-MAC works in a distributed, fine-grai-ned manner, which dynamically divides variable-width subchannels and allocates subchannel width based on the Orthogonal Frequency Division Multiplexing (OFDM) technique according to the traffic demands of nodes. Simulations show that the TAC-MAC can significantly improve network throughput and reduce packet delay compared with both fixed-width multi-channel MAC and single channel 802.11 protocols, which illustrates a new paradigm for high-efficient multi-channel MAC design in wireless ad hoc networks.     

An Optimization Forwarding Range Routing Protocol for VANET in City Environments

In city environment, the vehicle communi- cation is affected by the around obstacles due to the espe- cial condition of wireless channels. However, most of prior works adopt the fixed radio range value of vehicles to trans- mit packets. In this paper, we design an optimization for- warding range routing protocol for VANET in urban area. It has an optimized and adjustable forwarding range, which changes with different environments based on the path loss and the city model. And the proposed geo-routing protocol has a novel idea in computing the connectivity of roads and the adjustable strategy in a sparse network. Simulation re- suits indicate that the OFRR enjoys desirable performance in the urban area.