Ad hoc网络是一种具有高度动态拓扑结构的移动网络。广播服务是其中基本的操作,但使用传统的洪泛法会带来广播风暴问题。提出基于位置的延迟传输算法,根据节点的GPS定位信息选择需要再广播的节点,可以大大减少洪泛带来的广播开销。还就...Ad hoc网络是一种具有高度动态拓扑结构的移动网络。广播服务是其中基本的操作,但使用传统的洪泛法会带来广播风暴问题。提出基于位置的延迟传输算法,根据节点的GPS定位信息选择需要再广播的节点,可以大大减少洪泛带来的广播开销。还就一种典型情况分析了如何取舍再广播节点。提出的算法易实现,有较好的带宽利用率,优于洪泛法。展开更多
The basic mobile IP protocol is simple but only suitable for wide area and low speed networks. In this paper, we propose a novel micro-mobile IP handoff scheme, that is the packet loss avoidance handoff scheme. By usi...The basic mobile IP protocol is simple but only suitable for wide area and low speed networks. In this paper, we propose a novel micro-mobile IP handoff scheme, that is the packet loss avoidance handoff scheme. By using an additional cache at the base station and distinguishing packets with packet IDs, the proposed scheme minimizes the number of lost packets during handoff. Network architecture and detailed handoff procedures are given. We also analyze the cache size at the base station, the associated network load with the handoff procedure, and the handoff delay. The scheme is investigated by computer simulations. Simulation results show that the proposed scheme is suitable for environments with fast mobility and frequent handoff.展开更多
In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated wit...In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.展开更多
An improved on-demand multicast routing protocol(ODMRP), node classification on-demand multicast routing protocol(NC-ODMRP), which is based on node classification in mobile ad hoc networks was proposed. NC-ODMRP class...An improved on-demand multicast routing protocol(ODMRP), node classification on-demand multicast routing protocol(NC-ODMRP), which is based on node classification in mobile ad hoc networks was proposed. NC-ODMRP classifies nodes into such three categories as ordinary node, forwarding group(FG) node, neighbor node of FG node according to their history forwarding information. The categories are distinguished with different weights by a weight table in the nodes. NC-ODMRP chooses the node with the highest weight as an FG node during the setup of forwarding group, which reduces a lot of redundant FG nodes by sharing more FG nodes between different sender and receiver pairs. The simulation results show that NC-ODMRP can reduce more than 20% FG number of ODMRP, thus enhances nearly 14% data forwarding efficiency and 12% energy consumption efficiency when the number of multicast senders is more than 5.展开更多
As a core technology of Intemet of Things （loT）, Wireless Sensor Network （WSN） has become a research hotspot recently. More and more WSNs are being deployed in highly mobile environments. The fast moving sensor no...As a core technology of Intemet of Things （loT）, Wireless Sensor Network （WSN） has become a research hotspot recently. More and more WSNs are being deployed in highly mobile environments. The fast moving sensor nodes bring significant challenges for the routing decision. In this paper, we propose an efficient logical location method, and designe a mobility estimating metric and derive a novel Green Mobility Estirmtion- based Routing protocol （G-MER） for WSNs. We also set up a full framework to evaluate its per- formance. Simulation results illustrate that G-MER achieves a fairly better perforrmnce in terrm of broadcast times and link failures than AODV. What＇s more, it decreases the mean hops by about 0.25 and reduces energy consumption by about 10% during the whole experiment. All the results show that G-MER can be effectively used in fast- moving and limited resource scenarios.展开更多
Transmission Control Protocol （TCP） in infrastructure based vehicular net- works is dedicated to support reliable Intemet services for mobile users. However, an end-to- end TCP flow not only experiences some com- mo...Transmission Control Protocol （TCP） in infrastructure based vehicular net- works is dedicated to support reliable Intemet services for mobile users. However, an end-to- end TCP flow not only experiences some com- mon challenges in wireless mobile networks, such as high packet loss rate, medium access competition, unstable wireless bandwidth, and dynamic topology, etc., but also suffers from performance degradation due to traffic congestion at the Road-Side Units （RSUs） that connect the wireline and wireless networks. In order to address the challenging issues related to reliable TCP transmissions in infrastruc- ture based vehicular networks, we propose an RSU based TCP （R-TCP） scheme. For wireline source nodes, R-TCP adopts a novel flow control mechanism to adjust transmission rates according to the status of bottleneck link. Specifically, during the short wireless connec- tion time in Infrastructure based vehicular net- works, R-TCP quickly chooses an ideal trans- mission rate for data transmissions instead of activating the slow start algorithm after the connection is established, and successfully avoids the oscillation of the transmission rate. Simulation results show that R-TCP achieves great advantages than some relate proposals in terms of throughput, end-to-end delay, and packet loss rate.展开更多
To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared....To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared.The analysis results show that every routing protocol has its own characteristics and competitive environment.No routing protocol is better than others in all aspects.Therefore,based on no free lunch theory,ant routing protocols were decomposed into three key components：route discovery,route maintenance （including route refreshing and route failure handling） and data forwarding.Moreover,component based ant routing protocol （CBAR） was proposed.For purpose of analysis,it only maintained basic ant routing process,and it was simple and efficient with a low overhead.Subsequently,different mechanisms used in every component and their effect on performance were analyzed and tested by simulations.Finally,future research strategies and trends were also summarized.展开更多
In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general i...In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general in DTNs composed of the mobile phones or Pads. This paper proposes a novel opportunistic routing protocol, denoted by Large Opporturioty (LAOP), for the energy and buffer constrained DTNs. The objective of LAOP is to reach many receivers of a message with a small number of transmissions. By LAOP, the sender floods a message when the number of its neighbors is not less than a threshold. We compare the delivery performance of LAOP with other four widely used Delay or Disruption Tolerant Network (DTN) routing protocols, Direct Delivery, Epidemic routing, SprayAndWait and PRoPHET and demonstrate that LAOP can improve the delivery performance and decrease the delivery latency simultaneously.展开更多
A novel decentralized service composition protocol was presented based on quality of service (QoS) for mobile ad hoc networks (MANETs).A service composition in MANETs is considered as a service path discovery in a ser...A novel decentralized service composition protocol was presented based on quality of service (QoS) for mobile ad hoc networks (MANETs).A service composition in MANETs is considered as a service path discovery in a service network.Based on the concept of source routing,the protocol integrates route discovery, service discovery and service composition and utilizes a constrained flooding approach to discover the optimal service path.A service path maintenance mechanism was exploited to recover broken service paths.Simulation experiments demonstrate that the proposed protocol outperforms existing service composition protocols.展开更多
In this paper, a model of translation gateway is proposed. The communications between IPv4 network and IPv6 network are realized by using the Microsoft intermediate driver technology in environment of Windows 2000.
A self-adapting and reconfigurable routing mechanism is proposed according to the average moving speed of the nodes in mobile ad hoc network （MANET）. This mechanism is based on the perception of moving speed and a p...A self-adapting and reconfigurable routing mechanism is proposed according to the average moving speed of the nodes in mobile ad hoc network （MANET）. This mechanism is based on the perception of moving speed and a predesigned selection metric to choose the optimal routing protocol. The routing evaluation and selection metric is derived by OPNET simulations. AODV and OLSR are used as the example to show the process of this mechanism with the moving speed varying. The routing protocol can be configured without central configuration and human management. Besides, the overhead of the mechanism is reasonable and doesnot affect the quality of service （QoS） of the traffic in the network. Results show that the optimal routing protocol can be configured adaptively according to the speed so that better performance than end-to-end delay and packet delivery ratio. a specific protocol can be obtained in terms of展开更多
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.展开更多
To alleviate the localization error introduced by irregular sensor network deployment, a new mo bile path localization based on key nodes （MPLPK） protocol is proposed. It can recognize all con cave/convex nodes in t...To alleviate the localization error introduced by irregular sensor network deployment, a new mo bile path localization based on key nodes （MPLPK） protocol is proposed. It can recognize all con cave/convex nodes in the network as fixed anchor nodes, and simplify the following localization process based on these key nodes. The MPLPK protocol is composed of three steps. After all key nodes are found in the network, a mobile node applying improved minimum spanning tree （MST） algorithm is introduced to traverse and locate them. By taking the concave/convex nodes as anchors, the complexity of the irregular network can be degraded. And the simulation results demonstrate that MPEPK has 20% to 40% accuracy improvements than connectivity-based and anchor-free three-di- mensional localization （CATL） and approximate convex decomposition based localization （ACDL）.展开更多
The authentication and privacy of a group member is important in multicast communication. This paper proposes a privacy-preserving authenticated group-key management protocol for the Mobile Peer-to-Peer Network （ MP2...The authentication and privacy of a group member is important in multicast communication. This paper proposes a privacy-preserving authenticated group-key management protocol for the Mobile Peer-to-Peer Network （ MP2PN ）. The MP2PN contains some super peers and each super peer controls a subgroup composed of regular peers. An efficient attribute-based signature based on Cipertext-Policy Attribute-Based Encryption （CP-ABE） is proposed and used in this group-key rmnagement protocol to authenticate a peer＇s at- tributes and identity. A peer can be described by a set of attributes or one unique special identity at- tribute. Peers that have some attributes in common can form a group and conmmnicate with each other anonymously and securely. Any super peer can initiate a group and act as a group controller. The group controller can authenticate a peer＇s attributes and identity as well as remove malicious peers. Any peer with attributes that rmtches the access structure can join the group and provide its input to form the group key. The proposed protocol pro- vides backward and forward secrecy. The sinmlation results show that this protocol is applicable for mobile devices and can meet the MP2PN requirements of group communication.展开更多
文摘The basic mobile IP protocol is simple but only suitable for wide area and low speed networks. In this paper, we propose a novel micro-mobile IP handoff scheme, that is the packet loss avoidance handoff scheme. By using an additional cache at the base station and distinguishing packets with packet IDs, the proposed scheme minimizes the number of lost packets during handoff. Network architecture and detailed handoff procedures are given. We also analyze the cache size at the base station, the associated network load with the handoff procedure, and the handoff delay. The scheme is investigated by computer simulations. Simulation results show that the proposed scheme is suitable for environments with fast mobility and frequent handoff.
基金supported by Zhejiang Provincial Key Laboratory of Communication Networks and Applications and National Natural Science Foundation of China under Grant No.60872020
文摘In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.
基金Project(90304010) supported by the National Natural Science Foundation of China project supported by the NewCentury Excellent Talents in University
文摘An improved on-demand multicast routing protocol(ODMRP), node classification on-demand multicast routing protocol(NC-ODMRP), which is based on node classification in mobile ad hoc networks was proposed. NC-ODMRP classifies nodes into such three categories as ordinary node, forwarding group(FG) node, neighbor node of FG node according to their history forwarding information. The categories are distinguished with different weights by a weight table in the nodes. NC-ODMRP chooses the node with the highest weight as an FG node during the setup of forwarding group, which reduces a lot of redundant FG nodes by sharing more FG nodes between different sender and receiver pairs. The simulation results show that NC-ODMRP can reduce more than 20% FG number of ODMRP, thus enhances nearly 14% data forwarding efficiency and 12% energy consumption efficiency when the number of multicast senders is more than 5.
基金This paper was partially supported by the National Natural Science Foundation of China under Crants No. 61003283, No. 61001122 Beijing Natural Science Foundation of China under Crants No. 4102064+2 种基金 the Natural Science Foundation of Jiangsu Province under Crant No. BK2011171 the National High-Tech Research and Development Program of China under Crant No. 2011 AA010701 the Fundamental Research Funds for the Cen- tral Universities under Ccants No. 2011RC0507, No. 2012RO3603.
文摘As a core technology of Intemet of Things （loT）, Wireless Sensor Network （WSN） has become a research hotspot recently. More and more WSNs are being deployed in highly mobile environments. The fast moving sensor nodes bring significant challenges for the routing decision. In this paper, we propose an efficient logical location method, and designe a mobility estimating metric and derive a novel Green Mobility Estirmtion- based Routing protocol （G-MER） for WSNs. We also set up a full framework to evaluate its per- formance. Simulation results illustrate that G-MER achieves a fairly better perforrmnce in terrm of broadcast times and link failures than AODV. What＇s more, it decreases the mean hops by about 0.25 and reduces energy consumption by about 10% during the whole experiment. All the results show that G-MER can be effectively used in fast- moving and limited resource scenarios.
基金supported in part by Fundamental Research Funds for the Central Universities of China under Grant(N140405004) partly by National Natural Science Foundation of China(61373159)+1 种基金partly by Educational Committee of Liaoning Province science and technology research projects under Grant (L2013096)partly by Key Laboratory Project Funds of Shenyang Ligong University (4771004kfs03)
文摘Transmission Control Protocol （TCP） in infrastructure based vehicular net- works is dedicated to support reliable Intemet services for mobile users. However, an end-to- end TCP flow not only experiences some com- mon challenges in wireless mobile networks, such as high packet loss rate, medium access competition, unstable wireless bandwidth, and dynamic topology, etc., but also suffers from performance degradation due to traffic congestion at the Road-Side Units （RSUs） that connect the wireline and wireless networks. In order to address the challenging issues related to reliable TCP transmissions in infrastruc- ture based vehicular networks, we propose an RSU based TCP （R-TCP） scheme. For wireline source nodes, R-TCP adopts a novel flow control mechanism to adjust transmission rates according to the status of bottleneck link. Specifically, during the short wireless connec- tion time in Infrastructure based vehicular net- works, R-TCP quickly chooses an ideal trans- mission rate for data transmissions instead of activating the slow start algorithm after the connection is established, and successfully avoids the oscillation of the transmission rate. Simulation results show that R-TCP achieves great advantages than some relate proposals in terms of throughput, end-to-end delay, and packet loss rate.
基金Project(61225012)supported by the National Science Foundation for Distinguished Young Scholars of ChinaProjects(61070162,71071028,70931001)supported by the National Natural Science Foundation of China+4 种基金Project(20120042130003)supported by the Specialized Research Fund of the Doctoral Program of Higher Education for the Priority Development Areas,ChinaProjects(20100042110025,20110042110024)supported by the Specialized Research Fund for the Doctoral Program of Higher Education,ChinaProject(2012)supported by the Specialized Development Fund for the Internet of Things from the Ministry of Industry and Information Technology of ChinaProject(N110204003)supported by the Fundamental Research Funds for the Central Universities of ChinaProject(L2013001)supported by the Scientific Research Fund of Liaoning Provincial Education Department,China
文摘To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared.The analysis results show that every routing protocol has its own characteristics and competitive environment.No routing protocol is better than others in all aspects.Therefore,based on no free lunch theory,ant routing protocols were decomposed into three key components：route discovery,route maintenance （including route refreshing and route failure handling） and data forwarding.Moreover,component based ant routing protocol （CBAR） was proposed.For purpose of analysis,it only maintained basic ant routing process,and it was simple and efficient with a low overhead.Subsequently,different mechanisms used in every component and their effect on performance were analyzed and tested by simulations.Finally,future research strategies and trends were also summarized.
基金This work was supported by the National Natural Science Foundation of China under Grants No. 61100208, No. 61100205 the Natural Science Foundation of Jiangsu under Grant No. BK2011169. Pietro lio was supported by the EU FP7 project RECOGNITION： Relevance and Cognition for Self-Awareness in a Content-Centric Intemet.
文摘In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general in DTNs composed of the mobile phones or Pads. This paper proposes a novel opportunistic routing protocol, denoted by Large Opporturioty (LAOP), for the energy and buffer constrained DTNs. The objective of LAOP is to reach many receivers of a message with a small number of transmissions. By LAOP, the sender floods a message when the number of its neighbors is not less than a threshold. We compare the delivery performance of LAOP with other four widely used Delay or Disruption Tolerant Network (DTN) routing protocols, Direct Delivery, Epidemic routing, SprayAndWait and PRoPHET and demonstrate that LAOP can improve the delivery performance and decrease the delivery latency simultaneously.
基金The National Natural Science Foundation of China(No.60503041)The Shanghai Commission of Science and Technology/International Cooperative Project(No.05SN07114)
文摘A novel decentralized service composition protocol was presented based on quality of service (QoS) for mobile ad hoc networks (MANETs).A service composition in MANETs is considered as a service path discovery in a service network.Based on the concept of source routing,the protocol integrates route discovery, service discovery and service composition and utilizes a constrained flooding approach to discover the optimal service path.A service path maintenance mechanism was exploited to recover broken service paths.Simulation experiments demonstrate that the proposed protocol outperforms existing service composition protocols.
基金Supported by the Natural Science Foundation of Henan Province(0511011400) Supported by the Natural Science Foundation of Education Department of Henan Province(2004520014)
文摘In this paper, a model of translation gateway is proposed. The communications between IPv4 network and IPv6 network are realized by using the Microsoft intermediate driver technology in environment of Windows 2000.
文摘A self-adapting and reconfigurable routing mechanism is proposed according to the average moving speed of the nodes in mobile ad hoc network （MANET）. This mechanism is based on the perception of moving speed and a predesigned selection metric to choose the optimal routing protocol. The routing evaluation and selection metric is derived by OPNET simulations. AODV and OLSR are used as the example to show the process of this mechanism with the moving speed varying. The routing protocol can be configured without central configuration and human management. Besides, the overhead of the mechanism is reasonable and doesnot affect the quality of service （QoS） of the traffic in the network. Results show that the optimal routing protocol can be configured adaptively according to the speed so that better performance than end-to-end delay and packet delivery ratio. a specific protocol can be obtained in terms of
基金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.
基金Supported by the National Natural Science Foundation of China(No.61133016)the Sichuan Science and Technology Support Project(No.2013GZ0022)+1 种基金the Scientific Research Fund of Xinjiang Provincial Education Department(No.XJEDU2013128)the Technology Supporting Xinjiang Project(No.201491121)
文摘To alleviate the localization error introduced by irregular sensor network deployment, a new mo bile path localization based on key nodes （MPLPK） protocol is proposed. It can recognize all con cave/convex nodes in the network as fixed anchor nodes, and simplify the following localization process based on these key nodes. The MPLPK protocol is composed of three steps. After all key nodes are found in the network, a mobile node applying improved minimum spanning tree （MST） algorithm is introduced to traverse and locate them. By taking the concave/convex nodes as anchors, the complexity of the irregular network can be degraded. And the simulation results demonstrate that MPEPK has 20% to 40% accuracy improvements than connectivity-based and anchor-free three-di- mensional localization （CATL） and approximate convex decomposition based localization （ACDL）.
基金This paper was supported by the National Natural Science Foundation of China under Grant No. 61073042 the Fundamental Research Funds for the Central Universities under Grant No HEUCF100606 the Open Foundation of Network and Data Security Key Laboratory of Sichuan Province under Crant No 201107.
文摘The authentication and privacy of a group member is important in multicast communication. This paper proposes a privacy-preserving authenticated group-key management protocol for the Mobile Peer-to-Peer Network （ MP2PN ）. The MP2PN contains some super peers and each super peer controls a subgroup composed of regular peers. An efficient attribute-based signature based on Cipertext-Policy Attribute-Based Encryption （CP-ABE） is proposed and used in this group-key rmnagement protocol to authenticate a peer＇s at- tributes and identity. A peer can be described by a set of attributes or one unique special identity at- tribute. Peers that have some attributes in common can form a group and conmmnicate with each other anonymously and securely. Any super peer can initiate a group and act as a group controller. The group controller can authenticate a peer＇s attributes and identity as well as remove malicious peers. Any peer with attributes that rmtches the access structure can join the group and provide its input to form the group key. The proposed protocol pro- vides backward and forward secrecy. The sinmlation results show that this protocol is applicable for mobile devices and can meet the MP2PN requirements of group communication.
