Explore the vast range of titles available.

The paper proposes a mobility handover scheme MHVA for IPv6-based vehicular ad hoc networks. In MHVA, a vehicle is uniquely identified by its home IPv6 address, and it can keep the communication with other nodes without a care-of address during the mobility process. In addition, MHVA adopts an advanced mobility handover mechanism where the mobility handover operation in the network layer is completed before the one in the link layer is performed. As a result, during the advanced mobility handover process, a vehicle can keep the connection with its current associated AP in the link layer, so it can receive the data forwarded by the AP. Therefore, the packet loss rate is reduced, the mobility handover cost is decreased, and the mobility handover delay is shortened. From both the theoretical perspective and simulative perspective, the performance parameters of MHVA are evaluated, and the data results show that the mobility handover cost of MHVA is lower and the mobility handover delay is shorter.

With the scale expands, traditional deployment algorithms are becoming increasingly complicated than before, which are no longer fit for sensor networks. In order to reduce the complexity, we propose a node deployment algorithm based on viscous fluid model. In wireless sensor networks, sensor nodes are abstracted as fluid particles. Similar to the diffusion and self-propagation behavior of fluid particles, sensor nodes realize deployment in unknown region following the motion rules of fluid. Simulation results show that our algorithm archives good coverage rate and homogeneity in large-scale sensor networks.

This paper proposes a distributed address configuration scheme for a Mobile Ad hoc Network (MANET). The architecture for a MANET, the algorithm of constructing a MANET, and the algorithm for calculating a unique address space for the assignment are proposed. In the architecture, a common node has a unique address space for the assignment, and an isolated node can acquire a unique address from a neighboring common node without performing duplicate address detection. In this way, the address configuration task is distributed around common nodes. In this scheme, the control packets used for address configuration are exchanged within a one-hop scope, so the scalability is enhanced. This paper also presents an address recovery algorithm that can effectively retrieve the address resources released by failed nodes and the MANET merging/partitioning algorithm that can ensure a node’s address uniqueness. This paper compares the performance parameters of the proposed scheme and the existing schemes, including strong duplicate address detection and prime dynamic host configuration protocol, and the comparative results show that the address configuration cost of the proposed scheme is lower and the delay is shorter.

In a Mobile Ad hoc Network (MANET), after a mobile node is configured with a unique IP address it can perform the unicast communications. In order to reduce the address configuration cost and shorten the latency, this paper proposes an IPv6 address configuration scheme for a MANET. In the scheme, the cluster-based architecture is proposed. In the architecture, the clustering mechanism is combined with the address configuration process in order to achieve the low-cost and low-latency address configuration for all nodes in a MANET. Based on the architecture, the distributed address configuration algorithm is proposed. In the algorithm, a cluster member acquires an address from a cluster head within one-hop scope, so the address configuration task is distributed around cluster heads. In this way, the address configuration in different clusters can be performed in parallel, so the address configuration delay is shortened and the network scalability is improved. The address reclamation/maintenance algorithm is also proposed so that the address resources released by failed nodes can be rapidly recovered for reuse. Finally, the merging/splitting algorithm is proposed in order to ensure that no address collision happens in a MANET. This paper analyzes the performance parameters of the proposed scheme, and the data results show that the proposed scheme effectively reduces the address configuration cost and shortens the delay.

In this paper a new wireless sensor network localization algorithm, based on a mobile beacon and TSVM (Transductive Support Vector Machines) is proposed, which is referred to as MTSVM. The new algorithm takes advantage of a mobile beacon to generate virtual beacon nodes and then utilizes the beacon vector produced by the communication between the nodes to transform the problem of localization into one of classification. TSVM helps to minimize the error of classification of unknown fixed nodes (unlabeled samples). An auxiliary mobile beacon is designed to save the large volumes of expensive sensor nodes with GPS devices. As shown by the simulation test, the algorithm achieves good localization performance.

In view of the traditional increment localization method, only the heteroscedasticity caused by the error accumulation is considered unilaterally a kind of incremental localization algorithm based on multivariate analysis is proposed. The algorithm combines the feasible weighted least squares (FWLS) in the multianalysis with the canonical correlation regression (CCR) and utilizes the FWLS to solve the heteroscedasticity caused by the error accumulation in the process of incremental localization; in the process of estimation, the CCR is used to solve the topology problems between the original beacon nodes and new beacon nodes. The simulation results show that the method can not only effectively restrain the influence caused by the accumulative errors but also can adapt to the different node topological shapes, so as to improve the positioning accuracy of the nodes.

The paper proposes a communication model of implementing an Anycast service in an Ad Hoc network which is connected to IPv6 networks where IPv6 nodes can obtain the Anycast service provided by the Ad hoc network. In this model when an Anycast mobile member in an Ad hoc network moves it can keep the existing communications with its corresponding nodes to continue providing the Anycast services with good quality of service to IPv6 nodes. This model creates a new kind of IPv6 address autoconfiguration scheme which does not need the address duplication detection. This paper deeply discusses and analyzes the model and the experimental data prove its validity and efficiency. Index Terms-Ad Hoc, IPv6, Mobile IP, Anycast

This paper proposes a deployment algorithm based on the electrostatic field theory for mobile wireless sensor networks. The nodes and obstacles in the deployment area are taken as the charged particles; and the particles will move due to the Coulomb’s force from other particles or obstacles. Finally, the nodes automatically spread to the whole area by the resultant action and complete the deployment. Four metrics, including coverage, uniformity, deployment time and average displacement distance, are used to evaluate the performance of the algorithm. The simulation results show that the proposed algorithm can give full play to its self-adaptive advantages and achieve the desired deployment effect; it is a kind of deployment algorithm with self-adaptive characteristics.

Multipath routing has been considered as one of the most efficient and reliable real-time routing solutions for high-rate streaming in mobile ad hoc networks. Many researches focused on how to construct multiple node-disjoint paths but ignored the interference of using multiple paths simultaneously. In fact, some nodes in the network located in other active paths may interfere with their own communications that degrades the effective throughput. This paper presents a maximally radio-disjoint geographic multipath routing protocol (RD-GMR) which is capable of maximally avoiding the interference among the multiple paths. The forwarding area between the source node and the destination node is divided into three areas and different forwarding strategies are adopted in the corresponding areas. These customized strategies for each area effectively reduce the interferences between each path. Furthermore, the proposed protocol estimates the interference radius of nodes by using the distance between two nodes that increases the accuracy of obtaining the interference range of paths. Simulation results show that the RD-GMR can construct multiple paths with minimum interference that improves the packet delivery rate and the network throughput. Moreover, the end-to-end delay is also reduced.