In this paper, based on Equivalent Active Flow, we propose a novel technique called Approximate Fairness Dropping, which is able to approximate fairness by containing misbehaving flows' access queue opportunity with low time/space complexity. Unlike most of the existing Active Queue Management schemes (e.g., RED, BLUE, CHOKE), Approximate Fairness Dropping does not drop the packets whose arriving rate is within the maximum admitted rate, so it protects the well-behaving flows against misbehaving ones, moreover, improves the throughput and decreases the queuing delay. Our simulations and analyses demonstrate that this new technique outperforms the existing schemes and closely approximates the "ideal" case, where full state information is needed.

The recognition vector of the decision-theoretic approach and that of cumulant-based classification are combined to compose a higher dimension hyperspace to get the benefits of both methods. The method proposed in this paper can cover more kinds of signals including signals with order higher than 4 in the AWGN channel even under low SNR values, i.e. those down to -5 dB. The composed vector is input into an RBF neural network to get more reasonable reference points. Eleven kinds of signals, say 2ASK, 4ASK, 8ASK, 2PSK, 4PSK, 8PSK, 2FSK 4FSK, 8FSK, 16QAM and 64QAM, are involved in the discussion.

In this letter, a Simple but Effective Congestion Control scheme (SECC) in VANET has been proposed to guarantee the successful transmissions for safety-related nodes. The strategy derive a Maximum Beacon Load Activity Indicator (MBLAI) to restrain the neighboring general periodical beacon load for the investigated safety-related “observation nodes”, i.e., the nodes associated with some emergent events. This mechanism actually reserves some bandwidth for the safety-related nodes to make them have higher priorities than periodical beacons to access channel. Different from the static congestion control scheme in IEEE802.11p, this strategy could provide dynamic control strength for congestion according to tolerant packets drop ratio for different applications.

A novel and compact electro-optic modulator implemented by a combination of a 12 multimode interference (MMI) coupler and an integrated Mach-Zehnder interferometer (MZI) modulator consisting of a microring and a phase modulator (PM) is presented and analyzed theoretically. It is shown that the proposed modulator offers both ultra-linearity and high output RF gain simultaneously, with no requirements for complicated and precise direct current (DC) control.

6DoF pose estimation from a monocular RGB image is a challenging but fundamental task. The methods based on unit direction vector-field representation and Hough voting strategy achieved state-of-the-art performance. Nevertheless, they apply the smooth l1 loss to learn the two elements of the unit vector separately, resulting in which is not taken into account that the prior distance between the pixel and the keypoint. While the positioning error is significantly affected by the prior distance. In this work, we propose a Prior Distance Augmented Loss (PDAL) to exploit the prior distance for more accurate vector-field representation. Furthermore, we propose a lightweight channel-level attention module for adaptive feature fusion. Embedding this Adaptive Fusion Attention Module (AFAM) into the U-Net, we build an Attention Voting Network to further improve the performance of our method. We conduct extensive experiments to demonstrate the effectiveness and performance improvement of our methods on the LINEMOD, OCCLUSION and YCB-Video datasets. Our experiments show that the proposed methods bring significant performance gains and outperform state-of-the-art RGB-based methods without any post-refinement.

The rapid growth of mobile systems and the exponential spread of the Internet have requested technologies for efficient and seamless delivery of IP data to mobile users. However, the Mobile Internet Protocol and the IETF Mobile IPv6 proposal are not scalable and capable of handling real time applications. The Mobile Internet Protocol employs mobility agents to support Internet-wide mobility, and mobile node employs the concept of care-of address to communicate with its correspondent node when it changes its point of attachment to the Internet. This paper proposes a new addressing scheme for mobile node based on IPv6. The concept of Mobile Internet is introduced, which is a logical subnet of IPv6 Internet and supports IP layer mobility. Mobile Internet is geographically overlaid on the Internet. It has a fixed subnet prefix, and each mobile node in it is only identified by its home IP address, regardless of its current location. Some new kinds of mobility agents (LRPC, LRPS/FLR) are defined. The proposed scheme is considered as a long-term solution for the Internet with mobile computers, several defects in the current Mobile IP protocol are solved.

In this letter, a new addressing scheme for hexagonal networks is proposed. Using the new addressing scheme, many routing algorithms designed for networks using square-based topologies such as mesh and torus can also be applied to hexagonal networks. Methods of applying the turn model to hexagonal networks are derived, with some new minimal and partial adaptive routing algorithms obtained. Simulations of the new routing algorithms under different working conditions are carried on hexagonal networks of various sizes. The results show that the proposed algorithms can offer lower packet delay and loss rate than the popular dimension order routing algorithm.

In this paper, a decentralized concurrent transmission strategy in shared channel in Ad Hoc networks is proposed based on game theory. Firstly, a static concurrent transmissions game is used to determine the candidates for transmitting by channel quality threshold and to maximize the overall throughput with consideration of channel quality variation. To achieve NES (Nash Equilibrium Solution), the selfish behaviors of node to attempt to improve the channel gain unilaterally are evaluated. Therefore, this game allows each node to be distributed and to decide whether to transmit concurrently with others or not depending on NES. Secondly, as there are always some nodes with lower channel gain than NES, which are defined as hunger nodes in this paper, a hunger suppression scheme is proposed by adjusting the price function with interferences reservation and forward relay, to fairly give hunger nodes transmission opportunities. Finally, inspired by stock trading, a dynamic concurrent transmission threshold determination scheme is implemented to make the static game practical. Numerical results show that the proposed scheme is feasible to increase concurrent transmission opportunities for active nodes, and at the same time, the number of hunger nodes is greatly reduced with the least increase of threshold by interferences reservation. Also, the good performance on network goodput of the proposed model can be seen from the results.

Memory Sharing Processor Array (MSPA) architecture has been developed as an effective array processing architecture for both reduced data storages and increased processor cell utilization efficiency [1]. In this paper, the MSPA design methodology is extended to the VLSI synthesis of a serial input processor array (Pa). Then, a new bit-serial input multiplier and a new data serial input matrix multiplier are derived from the new PA. These multipliers are superior to the conventional multipliers by their smaller number of logic-gate count.