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, emplo...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%.展开更多
A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is b...A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.展开更多
An ants-based on-demand routing algorithm （AORA） specialized for mobile ad hoc networks is proposed. AORA measures the network＇s traffic information including delivery time, route energy etc. by the continuous deli...An ants-based on-demand routing algorithm （AORA） specialized for mobile ad hoc networks is proposed. AORA measures the network＇s traffic information including delivery time, route energy etc. by the continuous delivery of data packets, then calculates the compositive parameter for each route which can be seen as the stigmity and uses it to choose the comparatively optimal route in real time. To adjust the weight of each traffic information, the algorithm can meet the different demand of the network＇s user. Multipath source self repair routing （MSSRR） algorithm and dynamic source routing （DSR） can be seen as the special samples of AORA. The routing overhead is not increased in this algorithm. By using simulation, it can be seen that the performance of AORA is better than that of DSR in all scenarios obviously, especially the delivery fraction is increased by more than 100 96.展开更多
For the research of mobile Ad hoc network (MANET), hardware in the loop simulation (HILS) is introduced to improve simulation fidelity. The architectures and frameworks of HILS system are discussed. Based on HILS and ...For the research of mobile Ad hoc network (MANET), hardware in the loop simulation (HILS) is introduced to improve simulation fidelity. The architectures and frameworks of HILS system are discussed. Based on HILS and QualNet network simulator, two kinds of simulation frameworks for MANET multicast emergency communication network are proposed. By running simulation under this configuration and doing experiments with on-demand multicast routing protocol (ODMRP), unicast and multicast functions of this protocol are tested. Research results indicate that HILS method can effectively reduce the difficulty of system modeling and improve precision of simulation, and can further accelerate transition from design to system deployment.展开更多
In order to resolve the hidden and exposed terminal problems and improve the probability of concurrent packet transmissions for multihop Mobile Ad Hoc Networks （MANETs）, a novel slotted Asyrmaetric Dual-Channel Medi...In order to resolve the hidden and exposed terminal problems and improve the probability of concurrent packet transmissions for multihop Mobile Ad Hoc Networks （MANETs）, a novel slotted Asyrmaetric Dual-Channel Medium Access Control （ADC-MAC） protocol is proposed. It exploits sirmltaneous reservation with less collisions and conision-flee data packet transmissions, and achieves optimal transmission balance on the Control Channel （CCH） and Data Channel （DCH） by adjusting the relationship between Reservation Slot （RS） on the CCH and the data packet Transmission Slot （TS） on the DCH. Transmission interferences can be avoided by only observing CCH for the transmission time of a data packet. The proposed RS and contention micro-slot backoff mechanisms also greatly improve channel access efficiency. Simulation results show that compared to IFEE 802. 11 DCF and -Mc protocols, the proposed protocol can achieve a throughput gain of 88% in singlehop networks and 151% in nltihop networks at the same total data rate.展开更多
This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shap...This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.展开更多
Jitter is one of the most important issues for multimedia real time services in future mobile ad hoc networks（MANET）. A thorough theoretical analysis of the destination buffer for smoothing the jitter of the real ti...Jitter is one of the most important issues for multimedia real time services in future mobile ad hoc networks（MANET）. A thorough theoretical analysis of the destination buffer for smoothing the jitter of the real time service in MANET is given. The theoretical results are applied in moderate populated ad hoc networks in our simulation, the simulation results show that by predicting and adjusting destination buffer in our way, Jitter will be alleviated in large part and this will contribute much to the quality of service （QOS） in MANET.展开更多
One of the main characteristics of Ad hoc networks is node mobility, which results in constantly changing in network topologies. Consequently, the ability to forecast the future status of mobility nodes plays a key ro...One of the main characteristics of Ad hoc networks is node mobility, which results in constantly changing in network topologies. Consequently, the ability to forecast the future status of mobility nodes plays a key role in QOS routing. We propose a random mobility model based on discretetime Markov chain, called ODM. ODM provides a mathematical framework for calculating some parameters to show the future status of mobility nodes, for instance, the state transition probability matrix of nodes, the probability that an edge is valid, the average number of valid-edges and the probability of a request packet found a valid route. Furthermore, ODM can account for obstacle environment. The state transition probability matrix of nodes can quantify the impact of obstacles. Several theorems are given and proved by using the ODM. Simulation results show that the calculated value can forecast the future status of mobility nodes.展开更多
Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the informa...Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the information of routes planned by vehicular navigation systems. In the clustering algorithm, we design a residual route time function to quantitatively calculate the overlapping time among vehicles based on route information, with which a novel clusterhead selection metric is presented. We further design a mechanism of future-clusterhead, which can help avoid message exchanges at intersections and reduce the overhead of cluster maintenance. The simulation results show that, compared with previous works, our clustering algorithm can achieve higher stability and at the same time lower communication cost.展开更多
文摘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%.
文摘A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.
文摘An ants-based on-demand routing algorithm （AORA） specialized for mobile ad hoc networks is proposed. AORA measures the network＇s traffic information including delivery time, route energy etc. by the continuous delivery of data packets, then calculates the compositive parameter for each route which can be seen as the stigmity and uses it to choose the comparatively optimal route in real time. To adjust the weight of each traffic information, the algorithm can meet the different demand of the network＇s user. Multipath source self repair routing （MSSRR） algorithm and dynamic source routing （DSR） can be seen as the special samples of AORA. The routing overhead is not increased in this algorithm. By using simulation, it can be seen that the performance of AORA is better than that of DSR in all scenarios obviously, especially the delivery fraction is increased by more than 100 96.
文摘For the research of mobile Ad hoc network (MANET), hardware in the loop simulation (HILS) is introduced to improve simulation fidelity. The architectures and frameworks of HILS system are discussed. Based on HILS and QualNet network simulator, two kinds of simulation frameworks for MANET multicast emergency communication network are proposed. By running simulation under this configuration and doing experiments with on-demand multicast routing protocol (ODMRP), unicast and multicast functions of this protocol are tested. Research results indicate that HILS method can effectively reduce the difficulty of system modeling and improve precision of simulation, and can further accelerate transition from design to system deployment.
基金Acknowledgements This work was supported partially by the National Natural Science Foundation of China under Gants No. 60872011, No. 61171074 the National S＆T Major Project of China under Gant No. 2010ZX03003-003-03+1 种基金 the Program for New Century Excellent Talents in University the Fundamental Research Funds for the Central Universities.
文摘In order to resolve the hidden and exposed terminal problems and improve the probability of concurrent packet transmissions for multihop Mobile Ad Hoc Networks （MANETs）, a novel slotted Asyrmaetric Dual-Channel Medium Access Control （ADC-MAC） protocol is proposed. It exploits sirmltaneous reservation with less collisions and conision-flee data packet transmissions, and achieves optimal transmission balance on the Control Channel （CCH） and Data Channel （DCH） by adjusting the relationship between Reservation Slot （RS） on the CCH and the data packet Transmission Slot （TS） on the DCH. Transmission interferences can be avoided by only observing CCH for the transmission time of a data packet. The proposed RS and contention micro-slot backoff mechanisms also greatly improve channel access efficiency. Simulation results show that compared to IFEE 802. 11 DCF and -Mc protocols, the proposed protocol can achieve a throughput gain of 88% in singlehop networks and 151% in nltihop networks at the same total data rate.
文摘This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.
文摘Jitter is one of the most important issues for multimedia real time services in future mobile ad hoc networks（MANET）. A thorough theoretical analysis of the destination buffer for smoothing the jitter of the real time service in MANET is given. The theoretical results are applied in moderate populated ad hoc networks in our simulation, the simulation results show that by predicting and adjusting destination buffer in our way, Jitter will be alleviated in large part and this will contribute much to the quality of service （QOS） in MANET.
基金Acknowledgements This work is supported by the Postdoctoral Science Foundation of China under Grant No.20080431142.
文摘One of the main characteristics of Ad hoc networks is node mobility, which results in constantly changing in network topologies. Consequently, the ability to forecast the future status of mobility nodes plays a key role in QOS routing. We propose a random mobility model based on discretetime Markov chain, called ODM. ODM provides a mathematical framework for calculating some parameters to show the future status of mobility nodes, for instance, the state transition probability matrix of nodes, the probability that an edge is valid, the average number of valid-edges and the probability of a request packet found a valid route. Furthermore, ODM can account for obstacle environment. The state transition probability matrix of nodes can quantify the impact of obstacles. Several theorems are given and proved by using the ODM. Simulation results show that the calculated value can forecast the future status of mobility nodes.
基金partially supported by The National Key Research and Development Program of China(No.2016YFB0200404)National Natural Science Foundation of China(No.61501527,61379157,U1711263)+6 种基金MOE-CMCC Joint Research Fund of China(No.MCM20160104)State’s Key Project of Research and Development Plan(No.2016YFE01229003)the Fundamental Research Funds for the Central Universitiesthe Science,Technology and Innovation Commission of Shenzhen Municipality(JCYJ20160429170032960)Guangdong Science and Technology Project(No.2016B010126003)2016 Major Project of Collaborative Innovation in Guangzhou(No.201604046008)Program of Science and Technology of Guangdong(No.2015B010111001)
文摘Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the information of routes planned by vehicular navigation systems. In the clustering algorithm, we design a residual route time function to quantitatively calculate the overlapping time among vehicles based on route information, with which a novel clusterhead selection metric is presented. We further design a mechanism of future-clusterhead, which can help avoid message exchanges at intersections and reduce the overhead of cluster maintenance. The simulation results show that, compared with previous works, our clustering algorithm can achieve higher stability and at the same time lower communication cost.
