Integrating Mobile Ad Hoc Network to the Internet

A novel scheme is presented to integrate mobile ad hoc networks （MANETs） with the lnternet and support mobility across wireless local area networks （WLANs） and MANETs. The mobile nodes, connected as a MANET, employ the optimize d link state routing （OLSR） protocol for routing within the MANET. Mobility management across WLANs and MANETs is achieved through the hierarchical mobile IPv6 （HMIPv6） protocol. The performance is evaluated on a HMIPv6 based test-bed composed of WLANs and MANETs. The efficiency gain obtained from using HMIPv6 in such a hybrid network is investigated. The investigation result shows that the use of HMIPv6 can achieve up to 27% gain on reducing the handoff latency when a mobile roams within a domain. Concerning the reduction of the signaling load on the lnternet, the use of HMIPv6 can achieve at least a 54% gain and converges to 69%.     

Energy efficient TDMA-based MAC protocol associated with GAF for wireless sensor networks

The design of media access control (MAC) protocol for wireless sensor networks (WSNs) with the idea of cross layer attracts more and more attention. People can improve the MAC protocol by obtaining certain information regarding the network layer and physical layer. This article synthesizes and optimizes certain cross-layer protocols which have existed. On the basis of the routing, topology information in the network layer, and transmission power information in the physical layer, the time slot assignment algorithm has been improved in the MAC layer. By using geographical adaptive fidelity algorithm (GAF) to divide the grids, controlling of transmission power and scheduling the work/sleep duty cycle for sensor nodes, a new MAC protocol has been proposed to decrease energy consumption and enlarge the lifetime of WSNs. Simulation results show that the MAC protocol functions well.     

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.     

Routing metric of interference-aware link quality： an improved ETX in wireless mesh networks

This article addresses the problem of route selection in wireless mesh networks （WMNs）. The traditional routing metrics adopt packet delivery ratio （PDR） as a representative metric of wireless link quality assessment. However, PDR measured by the broadcast-based probe method is affected by the size, number and transmission rate of probe packets, which influences the metric accuracy. In this paper, improved expected transmission count （iETX）, a new routing metric of interference-aware link quality, is proposed for WMNs. Dispensing with traditional broadcast-based probing method, the iETX uses regional physical interference model to obtain PDR. Regional physical interference model is built upon the relationship between signal to interference plus noise ratio （SINR） and PDR, which contributes to the improvement of metric accuracy. The iETX comprehensively considers the effects of interference and link quality and minimizes the expected number of packet transmissions required for successful delivery, which helps find a path with minimum interference and high throughput. Simulation shows that the proposed metric can significantly improve the network performance.     

Optimized Multicast Routing Algorithm Based on Tree Structure in MANETs

Mobile Ad hoc Networks （MANETs） play an important role in emergency communications where network needs to be constructed temporarily and quickly. Since the nodes move randomly, routing protocols must be highly effective and reliable to guarantee successful packet delivery. Based on the data delivery structure, most of the existing multicast routing protocols can be classified into two folders： tree-based and mesh-based. We observe that tree-based ones have high forwarding efficiency and low consumptions of bandwidth, and they may have poor robustness because only one link exists between two nodes. As a tree- based multicast routing protocol, MAODV （Multicast Ad hoc On-demand Vector） shows an excellent performance in lightweight ad hoc networks. As the load of network increases, QoS （Quality of Service） is degraded obviously. In this paper, we analyze the impact of network load on MAODV protocol, and propose an optimized protocol MAODV-BB （Multicast Ad hoc On-demand Vector with Backup Branches）, which improves robustness of the MAODV protocol by combining advantages of the tree structure and the mesh structure. It not only can update shorter tree branches but also construct a multicast tree with backup branches. Mathematical analysis and simulation results both demonstrate that the MAODV-BB protocol improves the network performance over conventional MAODV in heavy load ad hoc networks.     

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.     

混合无线Mesh网络中基于链路层协作的路由方案(英文)

In a Wireless Mesh Network(WMN),the convenience of a routing strategy strongly depends on the mobility of the intermediate nodes that compose the paths.Taking this behaviour into account,this paper presents a routing scheme that works differently accordingly to the node mobility.In this sense,a proactive routing scheme is restricted to the backbone to promote the use of stable routes.Conversely,the reactive protocol is used for searching routes to or from a mobile destination.Both approaches are simultaneously implemented in the mesh nodes so that the routing protocols share routing information that optimises the network performance.Aimed at guaranteeing the IP compatibility,the combination of the two protocols in the core routers is carried out in the Medium Access Control(MAC)layer.In contrast to the operation in the IP layer where two routing protocols cannot work concurrently,the transfer of the routing tasks to the MAC layer enables the use of multiple independent forwarding tables.Simulation results show the advantage of the proposal in terms of packet losses and data delay.     

A Security-enhanced Key Distribution Scheme for AODVjr Routing Protocol in ZigBee Networks

ZigBee network is a kind of flexible wireless network technology for control and monitoring applications and new techniques of security measures are essential for high-survivability network. Based on the effectiveness of AODVjr （Ad hoe on-demand distance vector junior） routing protocol in ZigBee networks, in this paper, we proposed a new security-enhanced key distribution scheme for AOD- Vjr routing protocol in ZigBee networks. The key distribution was scheme implemented by combining the parameter exchange of Diffle-Hellman algorithm into the handshake protocol for node＇s joining a ZigBee network. Especially, the major improvement of Diffle-Hellman algorithm is to mix the parameters of key exchange with XOR operation so as to defend against typical man-in-the-middle attacks. Meanwhile, we analyzed the effect of XOR operation on key parameters by deducing the related theorems. Through the security analysis, the key distribution scheme demonstrates stronger security. We can verify that the AODVjr routing protocol with security enhancement has larger flexible application in ZigBee networks.     

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.     

移动自组织网络中能源信息熵的需求多路径路由协议(英文)

This paper provides a critical review of energy entropy theory in Mobile Ad Hoc Networks (MANETs) and proposes an Energy Entropy on Ad Hoc On-demand Distance Vector Multipath (EEAODVM) routing protocol. The essential idea of the protocol is to find every route which can minimize the node residual energy in the process of selecting path. It balances individual node battery energy utilization and hence prolongs the entire network lifetime. The results of simulation show that, with the proposed EEAODVM routing...     

A combined admission control algorithm with DA protocol for satellite ATM networks

Admission control is an important strategy for Quality of Service （QoS） provisioning in Asynchronous Transfer Mode （ATM） networks. Based on a control-theory model of resources on-Demand Allocation （DA） protocol, the paper studies the effect of the protocol on the statistical characteristics of network traffic, and proposes a combined connection admission control algorithm with the DA protocol to achieve full utilization of link resources in satellite communication systems. The proposed algorithm is based on the cross-layer-design approach. Theoretical analysis and system simulation results show that the proposed algorithm can admit more connections within certain admission thresholds than one that does not take into account the DA protocol. Thus, the proposed algorithm can increase admission ratio of traffic sources for satellite ATM networks and improve satellite link utilization.     

Query routing mismatch alleviation architecture for P2P file lookup in MANETs

A cross-layer optimized query routing mismatch alleviation(QRMA)architecture is proposed to mitigate the problem of query routing mismatch(QRM)phenomenon between the structured peer to peer(P2P)overlay and the routing layer in mobile Ad-hoc networks(MANETs),which is an important issue that results in the inefficiency of lookup process in the system.Explicated with the representative Chord protocol,the proposal exploits the information of topologic neighbors in the routing layer of MANETs to find if there is any optimized alternative next hop in P2P overlay during conventional lookup progress.Once an alternative next hop is detected,it will take the shortcut to accelerate the query procedure and therefore alleviate the QRM problem in scalable MANETs without any assistance of affiliation equipments such as GPS device.The probability of finding out such an alternative node is formulated and the factors that could increase the chance are discussed.The simulation results show that the proposed architecture can effectively alleviate the QRM problem and significantly improve the system performance compared with the conventional mechanism.     

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     

MAC Layer Resource Allocation for Wireless Body Area Networks

Wireless body area networks(WBANs) can provide low-cost, timely healthcare services and are expected to be widely used for ehealthcare in hospitals. In a hospital, space is often limited and multiple WBANs have to coexist in an area and share the same channel in order to provide healthcare services to different patients. This causes severe interference between WBANs that could significantly reduce the network throughput and increase the amount of power consumed by sensors placed on the body. Therefore, an efficient channel-resource allocation scheme in the medium access control(MAC) layer is crucial. In this paper, we develop a centralized MAC layer resource allocation scheme for a WBAN. We focus on mitigating the interference between WBANs and reducing the power consumed by sensors. Channel and buffer state are reported by smartphones deployed in each WBAN,and channel access allocation is performed by a central controller to maximize network throughput. Sensors have strict limitations in terms of energy consumption and computing capability and cannot provide all the necessary information for channel allocation in a timely manner. This deteriorates network performance. We exploit the temporal correlation of the body area channel in order to minimize the number of channel state reports necessary. We view the network design as a partly observable optimization problem and develop a myopic policy, which we then simulate in Matlab.     

Systematic and efficient GMPLS-based recovery mechanism with soft-protection using enhanced LMP

generalized multi-protocol label switching （GMPLS- based） protection and restoration technologies will play significant role in next-generation broadband IP network to ensure the survivability. In this article, a systematic GMPLS-based recovery mechanism is proposed using enhanced link management protocol （LMP）, which can support bidirectional fault notification relay more effectively. The major contributions and propositions in this article involve： 1） Soft-protection configuration for higher resource utilization with optimized routing; 2） Intelligent Shift from protection manner to restoration manner for the reduction of recovery latency; and 3） Toggleable revertive mode to increase restoration flexibility and to reduce loss of stability. Additionally, by leveraging valuable legacy including shared risk link group （SRLG） processing and fast reroute technique, the proposed recovery mechanism achieves higher resource utilization, fast and robust operation, satisfactory stability and flexibility, and is convenient in the apphcation over heterogeneous transport networks.     

A New Solution Based on Optimal Link-State Routing for Named Data MANET

NDN is an important instance of Information-Centric Networking.When integrating NDN into MANET,exploring new routing is a necessary task for this research area.The LSAs flooding is a common method to obtain network topology during route establishment.However,the LSAs flooding often results in a broadcast storm in high-density MANET.Using the MPR set proposed in the OLSR can effectively reduce the number of LSAs in the process of route establishment and can further solve the broadcast storm.In this paper,an enhanced neighbor discovery protocol firstly is designed to establish a MPR set.The new protocol can effectively avoid the problem incurred by unidirectional links that impact the network performance in a wireless environment.And then a new and proactive routing NOLSR based on OLSR for NDN-MANET is proposed to support NDN in MANET.And another important work is that NOLSR is implemented on top of NDN Forwarding Daemon NFD.Finally,we make a comparative analysis between NOLSR and the two most relative schemes such as traditional LSA-flooding and the scheme[1]by emulation experiments in the NDN emulator mini-NDN.     

Key MAC Layer Technologies of Cognitive Radio Network

As a smart spectrum sharing technology, Cognitive Radio (CR) is becoming a hot topic in the field of wireless telecommunications. Besides providing traditional services, the cognitive radio network Media Access Control (MAC) layer is required to perform an entirely new set of functions for effective reusing spectrum opportunity, without causing any harmful interference to incumbents. Spectrum sensing management selects and optimizes sensing strategies and parameters by the selection of sensing mode, sensing period, sensing time, sensing channel, and sensing quiet period. Access control avoids collision with primary users mainly by cooperation access and transparent access. Dynamic spectrum allocation optimizes the allocation of uncertain spectrum for binary interference model and accumulative interference model. Security mechanism adds authentication and encryption mechanisms to MAC frame to defense MAC layer security attacks. Cross-layer design combines MAC layer information with physical layer or higher layers information, such as network layer, transmission layer, to achieve global optimization.     

Data-flow in mobile edge computing networks: end-to-end performance analysis using stochastic network calculus

Mobile edge computing (MEC) networks can provide a variety of services for different applications. End-to-end performance analysis of these services serves as a benchmark for the efficient planning of network resource allocation and routing strategies. In this paper, a performance analysis framework is proposed for the end-to-end data-flows in MEC networks based on stochastic network calculus (SNC). Due to the random nature of routing in MEC networks, probability parameters are introduced in the proposed analysis model to characterize this randomness into the derived expressions. Taking actual communication scenarios into consideration, the end-to-end performance of three network data-flows is analyzed, namely, voice over Internet protocol (VoIP), video, and file transfer protocol (FTP). These network data-flows adopt the preemptive priority scheduling scheme. Based on the arrival processes of these three data-flows, the effect of interference on their performances and the service capacity of each node in the MEC networks, closed-form expressions are derived for showing the relationship between delay, backlog upper bounds, and violation probability of the data-flows. Analytical and simulation results show that delay and backlog performances of the data-flows are influenced by the number of hops in the network and the random probability parameters of interference-flow (IF).     

A two-layer recurrent Neural Network based approach for overlay multicast

Overlay multicast has become one of the most promising multicast solutions for IP network, and Neutral Network（NN） has been a good candidate for searching optimal solutions to the constrained shortest routing path in virtue of its powerful capacity for parallel computation. Though traditional Hopfield NN can tackle the optimization problem, it is incapable of dealing with large scale networks due to the large number of neurons. In this paper, a neural network for overlay multicast tree computation is presented to reliably implement routing algorithm in real time. The neural network is constructed as a two-layer recurrent architecture, which is comprised of Independent Variable Neurons （IDVN） and Dependent Variable Neurons （DVN）, according to the independence of the decision variables associated with the edges in directed graph. Compared with the heuristic routing algorithms, it is characterized as shorter computational time, fewer neurons, and better precision.     

Dynamic survivable mapping through reconfiguration in IP over WDM network

A new approach for network survivability problem in Intemet protocol （IP） over wavelength division multiplexing （WDM） optical network is proposed to enhance the IP layer restorability under physical link failure through logical topology reconfiguration. More specifically, after traffic arrival and departure, reconfiguring the logical topology correspondingly is helpful to minimize the traffic disruption after physical link failure. So, in this paper, this problem is proposed for first time and formulated as an integer linear programming （ILP） problem. And then, two heuristic algorithms are proposed. The performance of proposed algorithms have been evaluated through simulations, and the results show that reconfiguring the logical topology dynamically could achieve more than 20% improvement of the restorability of traffic in IP layer, but with acceptable resource cost.