Identity authentication plays an important role in ad hoc networks as a part of the secure mechanism. On the basis of GQ signature scheme, a new GQ threshold group signature scheme was presented, by which a novel dist...Identity authentication plays an important role in ad hoc networks as a part of the secure mechanism. On the basis of GQ signature scheme, a new GQ threshold group signature scheme was presented, by which a novel distributed algorithm was proposed to achieve the multi-hop authentication for mobile ad hoc networks. In addition, a protocol verifying the identity with zero knowledge proofs was designed so that the reuse of certificates comes into truth. Moreover, the security of this algorithm was proved through the random oracle model. With the lower cost of computation and communication, this algorithm is efficient, secure and especially suitable for mobile ad hoc networks characterized by distributed computing, dynamic topology and multi-hop communications.展开更多
This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group...This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using group elliptic curve diffie-hellman (GECDH) Protocol and links with other subgroups in a tree structure using tree-based group elliptic curve diffie-hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group;hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key establishment problem in ad hoc network in terms of memory cost, computation cost and communication cost.展开更多
As the wireless medium is characterized by its lossy nature, reliable communication cannot be assumed in the key management scheme. Therefore self-healing is a good property for key distribution scheme in wireless app...As the wireless medium is characterized by its lossy nature, reliable communication cannot be assumed in the key management scheme. Therefore self-healing is a good property for key distribution scheme in wireless applications. A new self-healing key distribution scheme was proposed, which is optimal in terms of user memory storage and efficient in terms of communication complexity.展开更多
The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range comm...The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.展开更多
An Ad hoc network is composed of wireless mobile nodes.Because there is no other wired infrastructure such as base stations,the ad hoc network,unlike other wireless networks such as Wireless Local Area Network(WLAN),h...An Ad hoc network is composed of wireless mobile nodes.Because there is no other wired infrastructure such as base stations,the ad hoc network,unlike other wireless networks such as Wireless Local Area Network(WLAN),has to face attacks from both the control plane and the data plane.Ad hoc should ensure the routing security on the control plane,and the secure forwarding of packets on the data plane.The distributed network protocol should operate safely,and peer-to-peer nodes should have trusting relations for each other.For this purpose,a complete security solution should include three parts:security on the control plane,security on the data plane,and security of key management.展开更多
Group mobility is prevalent in many mobile ad hoc network (MANET) applications, such as disaster recovery, military operations, searching and rescue activities. Group partition, as an inherent phenomenon in group mobi...Group mobility is prevalent in many mobile ad hoc network (MANET) applications, such as disaster recovery, military operations, searching and rescue activities. Group partition, as an inherent phenomenon in group mobility, may occur when mobile nodes move in diverse mobility patterns and it causes the network to be partitioned into disconnected components. It may result in severe link disconnections, which interrupts network communications. To address this concern, we proposed a novel group mobility model in this paper, namely the Reference Region Group Mobility model, which can be used to mimic group operations in MANETs, i.e. group partitions and mergers. Based on this model, a comprehensive study on the impact of group partitions to the performance of network routing protocols are carried out by evaluating two well-known routing protocols, namely the Ad Hoc On-demand Distance Vector Routing protocol (AODV) and the Dynamic Source Routing protocol (DSR). The simulation results reflect that group partitions have a significant impact to the performance of network routing protocols.展开更多
全面介绍了当前群组移动模型的研究进展,分析了不同群组移动模型的特点和应用范围,针时现有移动模型不能有效反映群组节点运动过程中行为特性的不足,提出了基于Gibbs分布模拟退火的群组移动(Gibbs sampler based simulated annealing gr...全面介绍了当前群组移动模型的研究进展,分析了不同群组移动模型的特点和应用范围,针时现有移动模型不能有效反映群组节点运动过程中行为特性的不足,提出了基于Gibbs分布模拟退火的群组移动(Gibbs sampler based simulated annealing group mobility,简称GGM)模型,并与目前广泛采用的参考点群组移动(reference point group mobility,简称RPGM)模型进行仿真比较,分析了两种群组移动模型对网络协议性能评价与网络拓扑的影响.仿真结果表明,通过选择不同的Gibbs势函数,GGM模型能够有效描述群体运动过程中的聚集行为、分散行为和列队行为;模型比较的结果也表明,不同的移动模型对Ad Hoc网络协议性能具有不同的影响.展开更多
文摘Identity authentication plays an important role in ad hoc networks as a part of the secure mechanism. On the basis of GQ signature scheme, a new GQ threshold group signature scheme was presented, by which a novel distributed algorithm was proposed to achieve the multi-hop authentication for mobile ad hoc networks. In addition, a protocol verifying the identity with zero knowledge proofs was designed so that the reuse of certificates comes into truth. Moreover, the security of this algorithm was proved through the random oracle model. With the lower cost of computation and communication, this algorithm is efficient, secure and especially suitable for mobile ad hoc networks characterized by distributed computing, dynamic topology and multi-hop communications.
文摘This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using group elliptic curve diffie-hellman (GECDH) Protocol and links with other subgroups in a tree structure using tree-based group elliptic curve diffie-hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group;hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key establishment problem in ad hoc network in terms of memory cost, computation cost and communication cost.
基金The Specialized Research Fund for the Doctoral Program of Higher Education of China (No. 20050248043)
文摘As the wireless medium is characterized by its lossy nature, reliable communication cannot be assumed in the key management scheme. Therefore self-healing is a good property for key distribution scheme in wireless applications. A new self-healing key distribution scheme was proposed, which is optimal in terms of user memory storage and efficient in terms of communication complexity.
文摘The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.
基金This work was funded by the National Basic Research Program (973 Program) of China under Grant 2007CB310704.
文摘An Ad hoc network is composed of wireless mobile nodes.Because there is no other wired infrastructure such as base stations,the ad hoc network,unlike other wireless networks such as Wireless Local Area Network(WLAN),has to face attacks from both the control plane and the data plane.Ad hoc should ensure the routing security on the control plane,and the secure forwarding of packets on the data plane.The distributed network protocol should operate safely,and peer-to-peer nodes should have trusting relations for each other.For this purpose,a complete security solution should include three parts:security on the control plane,security on the data plane,and security of key management.
文摘Group mobility is prevalent in many mobile ad hoc network (MANET) applications, such as disaster recovery, military operations, searching and rescue activities. Group partition, as an inherent phenomenon in group mobility, may occur when mobile nodes move in diverse mobility patterns and it causes the network to be partitioned into disconnected components. It may result in severe link disconnections, which interrupts network communications. To address this concern, we proposed a novel group mobility model in this paper, namely the Reference Region Group Mobility model, which can be used to mimic group operations in MANETs, i.e. group partitions and mergers. Based on this model, a comprehensive study on the impact of group partitions to the performance of network routing protocols are carried out by evaluating two well-known routing protocols, namely the Ad Hoc On-demand Distance Vector Routing protocol (AODV) and the Dynamic Source Routing protocol (DSR). The simulation results reflect that group partitions have a significant impact to the performance of network routing protocols.
基金Supported by the National Basic Research Program of China under Grant No.G5130801(国家重点基础研究发展计划(973))the Postgraduate lnnovation Foundation ofthe National University of Defense Technology of China under Grant No.B080304(国防科学技术大学优秀研究生创新基金)
文摘全面介绍了当前群组移动模型的研究进展,分析了不同群组移动模型的特点和应用范围,针时现有移动模型不能有效反映群组节点运动过程中行为特性的不足,提出了基于Gibbs分布模拟退火的群组移动(Gibbs sampler based simulated annealing group mobility,简称GGM)模型,并与目前广泛采用的参考点群组移动(reference point group mobility,简称RPGM)模型进行仿真比较,分析了两种群组移动模型对网络协议性能评价与网络拓扑的影响.仿真结果表明,通过选择不同的Gibbs势函数,GGM模型能够有效描述群体运动过程中的聚集行为、分散行为和列队行为;模型比较的结果也表明,不同的移动模型对Ad Hoc网络协议性能具有不同的影响.
