基于部分中继选择的能量收集双跳网络信息年龄优化

针对传统中继协作网络传感器节点能量受限导致信息传输延迟较高的问题,将短包通信（SPC）和能量收集技术相结合,构建了一种双跳中继无线传感器网络模型。网络中源节点和中继均需从专用能量基站收集射频信号能量以保证信息的持续传输,中继采用半双工解码转发协议将源节点发送的状态更新信息以短包形式传递到目的节点,利用中继选择策略与最大比合并技术提出了基于时效性的最早部分中继选择方案。考虑该网络信息的新鲜度,首先,分析了SPC传输性能,推导了中继和目的节点处的平均包错误率。其次,利用顺序统计量描述了源节点到中继端数据包的重传次数,基于更新过程理论推导了网络的平均信息年龄（AoI）表达式,并采用梯度下降方法优化了影响网络平均AoI的部分参数。最后,仿真分析结果表明,优化中继数量和数据包长度可以有效提高网络信息新鲜度,同时,通过对比优化部分参数得到的最优值与贪婪方法得到的最小化平均AoI理论值,可以验证部分中继协作方案在双跳状态更新网络中的可行性。      

Packet scheduling algorithms and performance of a bufferedshufflenet with deflection routing

In a multihop network, packets go through a number of hops before they are absorbed at their destinations. In routing to its destination using minimum path, a packet at a node may have a preferential output link (the so-called “care” packet) or may not (the so-called “don't care” packet). Since each node in an optical multihop network may have limited buffer, when such buffer runs out, contention among packets for the same output link can be resolved by deflection. In this paper, we study packet scheduling algorithms and their performance in a buffered regular network with deflection routing. Using shufflenet as an example, we show that high performance (in terms of throughput and delay) can he achieved if “care” packets can be scheduled with higher priority than “don't care” packets. We then analyze the performance of a shufflenet with this priority scheduling given the buffer size per node. Traditionally, the deflection probability of a packet at a node is solved from a transcendental equation by numerical methods which quickly becomes very cumbersome when the buffer size is greater than one packet per node. By exploiting the special topological properties of the shufflenet, we are able to simplify the analysis greatly and obtain a simple closed-form approximation of the deflection probability. The expression allows us to extract analytically the performance trend of the shufflenet with respect to its buffer and network sizes. We show that a shufflenet indeed performs very well with only one buffer, and can achieve performance close to the store-and-forward case using a buffer size as small as four packets per node     

基于非对称信道状态信息的协作通信：一种契约理论建模方法

In relay-assisted cooperative com-munication, relay nodes help forwarding the information of a source node in case of link failure between the source and a destination. Although user cooperation improves the over-all efficiency of the network, it requires incen-tive to stimulate potential relay nodes to assist the source by forwarding its data to the desti-nation. Moreover, the potential relays are bet-ter informed than the source about their chan-nel conditions to destination, which results in asymmetric information between the source and the relays. In this paper, we study the problem of lack of forwarding incentive in cooperative communication when channel state information of relays is private infor-mation and not known by the source. To tackle this problem, we apply the principle of contract theory to a cooperative wireless system. Source first designs incentive compatible and individually rational contract, consisting of a set of power-credit pairs. Then it broadcasts contract items to nearby nodes. Once the source node receives reply messages from the volunteer relays, it chooses one or more relays based on its re-quirements and communication starts. Simulation results show how credit assignment works in order to stimulate relays to cooperate and prevents relays from cheating behavior.     

Shortest route mobility assisted packet delivery with soft maximum delay guarantees in mobile ad hoc networks

In delay tolerant Mobile Ad hoc Networks (MANETs) node mobility can be exploited in order to reduce the source–destination path lengths in the expense of higher packet delivery delays. This paper addresses the problem of minimizing the average source–destination path length under a maximum delay constraint for packet delivery which is desirable to certain applications. Imposing packet delivery deadlines results in a certain percentage of multi-hop packet transmissions and poses the practical problem of selecting the optimum moment for the transmission. We propose an Optimal Stopping Rule algorithm for solving this problem and show how this algorithm can be extended in the case that a source–destination route is not always available by relaxing the hard delay constraint to a soft (probabilistic) constraint. The performance of this algorithm is compared to the ideal case of scheduling with perfect knowledge of the future and the trade-off between higher allowable delay and lower average path length is illustrated through several Matlab and ns-2 simulation results. As an application of path length minimization we explain how this can lead to energy consumption minimization in a MANET with light traffic loads (low probability of collisions). Finally, we briefly discuss how this path length minimization algorithm can guide the development of cross-layer throughput maximization algorithms with soft maximum delay guarantees.     

Ring Mesh Based Multicast Routing Scheme in MANET Using Bandwidth Delay Product

Quality of Service (QoS) support in Mobile Ad Hoc Networks (MANETs) for group communication necessitates design of reliable networks with multicast support mechanisms. Reliable network connectivity among MANET nodes require high quality links that have much less packet drops and reliable nodes considering node mobility and failures. Reliability of a network can be enhanced by designing an end-to-end network pipe that satisfies the required QoS in terms of in-flight packets from source to a destination as well as by using a path comprising of reliable nodes. In-flight packets may be computed by using bandwidth delay product (BDP) of a network pipe. To meet the QoS requirements of an application, BDP should be maintained stable irrespective of vibrant network conditions. In this paper, we propose a BDP based multicast routing scheme in MANET using reliable ring mesh backbone. The scheme operates in the following sequence. (1) Reliable node pairs are computed based on mobility, remaining battery power and differential signal strength. The node pairs also compute BDP between them. BDP of a reliability pair is assessed using available bandwidth and delay experienced by a packet between them. (2) Backbone ring mesh is constructed using reliable pair nodes and convex hull algorithm. Reliable ring mesh is constructed at an arbitrary distance from the centroid of the MANET area. (3) Multicast paths are found by discovering a path from source to each destination of the group with concatenated set of reliability pairs that satisfy the BDP requirement. (4) The ring mesh maintains high BDP on ring links and can recover in case of node mobility and failures. Results show that there is an improvement in terms of end-to-end delay, packet delivery ratio, control overhead, memory overhead and application rejection ratio as compared to the Enhanced On Demand Multicast Routing Protocol.     

DIR: diagonal-intersection-based routing protocol for vehicular ad hoc networks

In this paper, we present a diagonal-intersection-based routing (DIR) protocol for vehicular ad hoc networks. The DIR protocol constructs a series of diagonal intersections between the source and destination vehicles. The DIR protocol is a geographic routing protocol. Based on the geographic routing protocol, source vehicle geographically forwards data packet toward the first diagonal intersection, second diagonal intersection, and so on, until the last diagonal intersection, and finally geographically reach to the destination vehicle. For given a pair of neighboring diagonal intersections, two or more disjoint sub-paths exist between them. The novel property of DIR protocol is the auto-adjustability, while the auto-adjustability is achieved that one sub-path with low data packet delay, between two neighboring diagonal intersections, is dynamically selected to forward data packets. To reduce the data packet delay, the route is automatically re-routed by the selected sub-path with lowest delay. The proposed DIR protocol allows the mobile source and destination vehicles in the urban VANETs. Experimental results show that the DIR protocol outperforms existing solutions in terms of packet delivery ratio, data packet delay, and throughput.     

Satisfactory content delivery scheme for QoS provisioning in delay tolerant networks

We deal in this article with the content forwarding problem in delay tolerant networks (DTNs). We first formulate the content delivery interaction as a noncooperative satisfaction game. On one hand, the source node seeks to ensure a delivery probability above some given threshold. On the other hand, the relay nodes seek to maximize their own payoffs. The source node offers a reward (virtual coins) to the relay, which caches and forwards the file to the final destination. Each relay has to solve the dilemma of accepting/rejecting to cache the source's file. Cooperation incurs energy cost due to caching, carrying, and forwarding the source's file. Yet when a relay accepts to cooperate, it may receive some reward if it succeeds to be the first relay to forward the content to the destination. Otherwise, the relay may receive some penalty in the form of a constant regret; the latter parameter is introduced to make incentive for cooperation. Next, we introduce the concept of satisfaction equilibrium (SE) as a solution concept to the induced game. Now, the source node is solely interested in reaching a file delivery probability greater than some given threshold, while the relays behave rationally to maximize their respective payoffs. Full characterizations of the SEs for both pure and mixed strategies are derived. Furthermore, we propose two learning algorithms allowing the players (source/relays) to reach the SE strategies. Finally, extensive numerical investigations and some learning simulations are carried out to illustrate the behavior of the interacting nodes and to give some insightful thoughts on how to fine‐tune the network setting.     

Location- and delay-aware cross-layer communication in V2I multihop vehicular networks

Intelligent transportation systems are targeted to improve the traffic safety and driving experience of passengers. Vehicular ad hoc networks are wireless communication networks proposed to be used as parts of ITS. VANETs facilitate communication among vehicles, and between vehicles and roadside equipment. A key challenge in developing such systems is to design routing and MAC protocols that not only provide good end-to-end packet delay but can also quickly adapt to changes in the network topology due to vehicular mobility. In this article we outline a new framework for location- and delayaware cross-layer communication that addresses these challenges. Our framework provides an efficient V2I data delivery system that relays packets over low-delay paths to a fixed base station or access point. Furthermore, an instance of this framework is also presented as a protocol. Our preliminary evaluations show that our design approach is promising, and provides delay predictability, fairness, and a good packet delivery ratio.     

Buffer sizing for synchronous self-routeing broadband packet switches with bursty traffic

Previous studies on the performance of synchronous self-routeing packet switches have assumed that the input traffic is random, i.e. there is no correlation between adjacent packet arrivals. This assumption is generally not valid in the data communication environment (e.g. host-to-host communication) where a file transfer usually generates a string of correlated packets. The consequence is that the random traffic assumption greatly underestimates the buffer requirement of the switch. In this paper, we model each input traffic stream as a binary source as a first step to understand the performance of a packet switch in a bursty traffic environment. We found that, given a fixed traffic load (or switch utilization), the required buffer size increases linearly as the burstiness index (the average burst length) of the traffic increases. In addition, the required buffer size is more sensitive to the burstiness of the traffic, when the average traffic load is higher and when the packet loss requirement is more stringent. Initial applications of broadband packet switches are likely to be the interconnections of LANs and hosts. The results of the study indicate that the high burstiness in certain broadband traffic significantly reduces the allowable switch utilization, given a fixed amount of buffers. To increase the switch utilization, an appropriate congestion control mechanism needs to be implemented.     

Performance of new relay selection scheme for buffer-assisted multihop decode-and-forward networks

In this paper, a new relay selection scheme is proposed to reduce the end-to-end packet delivery delay for buffer-assisted multihop decode-and-forward cooperative networks. The proposed method selects a relay node having more packets in the associated buffer and relay's proximity to the destination node. Mathematical expressions for the outage probability and average packet delay in Rician fading are obtained by modeling the system as a Markov chain. The proposed relay selection scheme has less packet delay as compared to the max-link relay selection scheme with marginally higher outage probability. Thus, the proposed relay selection scheme is a good alternative to low latency wireless applications.     

Power allocation and transmission scheduling for a network with bidirectional relaying links

In this paper, we study packet transmission scheduling for a network with bidirectional relaying links, where the relay station can use network coding to combine packets to multiple receivers and opportunistically decide the number of packets to be combined in each transmission. Two cases are considered, depending on whether nodes are allowed to overhear transmissions of each other. A constrained Markov decision process is first formulated with an objective to minimize the average delay of packet transmissions, subject to the maximum and average transmission power limits of the relay node. The complexity for solving the constrained Markov decision process (MDP) is prohibitively high, although the computational complexity for the no‐overhearing case can be greatly reduced. Heuristic schemes are then proposed, one applies to the general case, and another applies to only the no‐overhearing case. Numerical results demonstrate that the heuristic schemes can achieve close‐to‐optimum average packet transmission delay, and furthermore, the second scheme achieves lower maximum delay while keeping the same average packet transmission delay and relay node power consumption as the first one. Copyright © 2015 John Wiley & Sons, Ltd.     

Byzantine robust trust establishment for mobile ad hoc networks

In a mobile ad hoc network (MANET), the nodes act both as traffic sources and as relays that forward packets from other nodes along multi-hop routes to the destination. Such networks are suited to situations in which a wireless infrastructure is unavailable, infeasible, or prohibitively expensive. However, the lack of a secure, trusted infrastructure in such networks make secure and reliable packet delivery very challenging. A given node acting as a relay may exhibit Byzantine behavior with respect to packet forwarding, i.e., arbitrary, deviant behavior, which disrupts packet transmission in the network. For example, a Byzantine node may arbitrarily choose to drop or misroute a certain percentage of the packets that are passed to it for forwarding to the next hop. In earlier work, we proposed a trust establishment framework, called Hermes, which enables a given node to determine the “trustworthiness” of other nodes with respect to reliable packet delivery by combining first-hand trust information obtained independently of other nodes and second-hand trust information obtained via recommendations from other nodes. A deficiency of the Hermes scheme is that a node can fail to detect certain types of Byzantine behavior, such as packet misforwarding directed at a particular source node. In this paper, we propose new mechanisms to make Hermes robust to Byzantine behavior and introduce a punishment policy that discourages selfish node behavior. We present simulation results that demonstrate the effectiveness of the proposed scheme in a variety of scenarios involving Byzantine nodes that are malicious both with respect to packet forwarding and trust propagation.     

Delay Analysis of Cooperative Truncated HARQ With Opportunistic Relaying

In this paper, we evaluate the delay experienced by Poisson arriving packets for cooperative truncated hybrid automatic repeat request (HARQ) with opportunistic relaying. We derive the theoretical expressions of the expected waiting time and the packet's sojourn time in the queue of truncated opportunistic cooperative ARQ, HARQ I with and without packet combining (PC), and HARQ II with code combining (CC). The analysis is valid for block Nakagami- $m$ fading channels and any number of relays for both amplify-and-forward (AF) and decode-and-forward (DF) relaying. In opportunistic AF cooperative HARQ, packet retransmission is done by the relay offering the highest instantaneous signal-to-noise ratio (SNR) of the relaying link (source–relay–destination). In opportunistic DF cooperative HARQ, retransmission is done by the relay offering the highest instantaneous SNR of the relay–destination link among the relays that have correctly decoded the transmitted packet by the source. If no relay has correctly decoded, the retransmission is made by the source. Simulation results are also provided to verify the tightness of the derived expressions. The results indicate a significant improvement of packet delivery delays when compared with the absence of cooperation.      

On Capacity of Line Networks

We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbitrary complexity, but the intermediate relay nodes are restricted to process only blocks of a fixed length. We investigate how the processing at the relays must be chosen in order to maximize the capacity of the cascade, that is, the maximum achievable end-to-end rate between the source and the destination. For infinite cascades with fixed intermediate processing length at the relays, we prove that this intermediate processing can be chosen to be identical without loss of optimality, and that the capacity of the cascade coincides with the rate of the best zero-error code of length equal to the block length of the intermediate processing. We further show that for fixed and identical intermediate processing at all relays, convergence of capacity as the length of the cascade goes to infinity is exponentially fast. Finally, we characterize how the block length of the intermediate processing must scale with the length of the cascade to guarantee a constant end-to-end rate. We prove that it is sufficient that the block length scales logarithmically with the network length in order to achieve any rate above the zero-error capacity. We show that in many cases of interest logarithmic growth is also necessary.     

基于路径时延模型的车联网数据分发方案

针对车联网的容迟特性造成通信资源受限的问题,提出了满足副本抑制要求的数据分发方案.方案利用马尔可夫链,通过交通网络的车辆概率分布建立路段的期望传输时延,并结合车辆的轨迹与目标位置的匹配度确定车辆的转发优先级.车辆为转发的每个数据包插入转发参数字段并通过同步反馈机制确定最终的转发车辆,确保由优先级最高的车辆完成转发.考虑到链路的稳定性,还推导了当前丢包率前提下,车辆接收数据包与发送次数之比,避免不必要的发送尝试产生大量副本.实验结果显示,提出的方案与基于轨迹预测的算法相比,有效提高了网络吞吐量和时延性能.     

Throughput Analysis of a Cooperative ARQ Scheme in the Presence of Hidden and Exposed Terminals

Cooperative Automatic Retransmission Request (C-ARQ) schemes exploit the broadcast nature of the radio channel by allowing those users which overhear a transmission to act as spontaneous relays when a packet has been received with errors at destination. Transmission takes place in two phases. First, the source transmits to the destination. In the case of error, retransmissions are then executed by the relays, providing the system with cooperative diversity. In this paper we analyze how the addition of these relays to the communication modifies the well-known hidden and exposed terminal problems associated to any medium access control protocol based on carrier sensing. This work is focused on Carrier Sensing Multiple Access (CSMA) protocols, such as the one defined in the IEEE 802.11 Standard. The theoretical study presented in this paper has been supported by computer-based simulations.     

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.     

A slotted access control protocol for metropolitan WDM ring networks

In this study we focus on the serious scalability problems that many access protocols for WDM ring networks introduce due to the use of a dedicated wavelength per access node for either transmission or reception. We propose an efficient slotted MAC protocol suitable for WDM ring metropolitan area networks. The proposed network architecture employs a separate wavelength for control information exchange prior to the data packet transmission. Each access node is equipped with a pair of tunable transceivers for data communication and a pair of fixed tuned transceivers for control information exchange. Also, each access node includes a set of fixed delay lines for synchronization reasons; to keep the data packets, while the control information is processed. An efficient access algorithm is applied to avoid both the data wavelengths and the receiver collisions. In our protocol, each access node is capable of transmitting and receiving over any of the data wavelengths, facing the scalability issues. Two different slot reuse schemes are assumed: the source and the destination stripping schemes. For both schemes, performance measures evaluation is provided via an analytic model. The analytical results are validated by a discrete event simulation model that uses Poisson traffic sources. Simulation results show that the proposed protocol manages efficient bandwidth utilization, especially under high load. Also, comparative simulation results prove that our protocol achieves significant performance improvement as compared with other WDMA protocols which restrict transmission over a dedicated data wavelength. Finally, performance measures evaluation is explored for diverse numbers of buffer size, access nodes and data wavelengths.     

The efficiency of greedy routing in hypercubes and butterflies

We analyze the following problem. Each node of the d-dimensional hypercube independently generates packets according to a Poisson process with rate λ. Each of the packets is to be sent to a randomly chosen destination; each of the nodes at Hamming distance k from a packet's origin is assigned an a priori probability p^k(1-p) ^d-k. Packets are routed under a simple greedy scheme: each of them is forced to cross the hypercube dimensions required in increasing index-order, with possible queueing at the hypercube nodes. Assuming unit packet length and no other communications taking place, we show that this scheme is stable (in steady-state) if ρ<1, where ρ=defλp is the load factor of the network; this is seen to be the broadest possible range for stability. Furthermore, we prove that the average delay T per packet satisfies T⩽dp/(1-ρ), thus showing that an average delay of Θ(d) is attainable for any fixed ρ<1. We also establish similar results in the context of the butterfly network. Our analysis is based on a stochastic comparison with a product-form queueing network     

基于本地缓存的弹性分组环保护机制

本文提出一种基于本地缓存的弹性分组环保护倒换机制(WrapProtectionBasedOnLocalBuffers,简称WP-LB)。其主要思想是当环路上任何位于源节点和故障区域之间的中间节点接收到含有故障信息的控制信令后,就不再向下游转发数据分组,而是在本地缓存这些数据。等到保护通路建立好之后,再把缓存的数据分组经过保护通路发送给目的节点。分析计算表明,与原有的保护倒换(WrapProtection,简称WP)机制相比,WP-LB机制不仅提高带宽利用率,减少平均时延,并且还能避免数据包的丢失和失序。