In this paper, the properties of distributed virtual environment (DVE) and the requirements on computer networks is briefly reviewed. A multicast protocol, called sender initiated grouping multicast protocol for DVE...In this paper, the properties of distributed virtual environment (DVE) and the requirements on computer networks is briefly reviewed. A multicast protocol, called sender initiated grouping multicast protocol for DVE (SIGMP), is proposed. This new multicast protocol is based on a novel concept, multicast group (MG), which divides all participants in a DVE system into groups, among which there is a multicast group trustee (MGT) node to manage the group. The protocol provides unreliable/reliable, totally ordered and multiple to multiple multicast transmission service for DVE systems without sacrificing the communication efficiency heavily. At the same time, reliable unicast and one to multiple multicast transmission services are also supported. The performance analysis of the new protocols is also presented. Based on SIGMP, a simple demonstration of DVE system is designed and implemented. This demo system is running on several SGI workstations connected by a FDDI and Ethernet network.展开更多
Secure key distribution among classical parties is impossible both between two parties and in a network. In this paper, we present a quantum key distribution (QKD) protocol to distribute secure key bits among one qu...Secure key distribution among classical parties is impossible both between two parties and in a network. In this paper, we present a quantum key distribution (QKD) protocol to distribute secure key bits among one quantum party and numerous classical parties who have no quantum capacity. We prove that our protocol is completely robust, i.e., any eavesdropping attack should be detected with nonzero probability. Our calculations show that our protocol may be secure against Eve's symmetrically individual attack.展开更多
Coverage holes often appear in wireless sensor networks due to sensor failure or the inheritance of sensor's random distribution. In the hybrid model, mobile sensors in the network are acquired to heal coverage holes...Coverage holes often appear in wireless sensor networks due to sensor failure or the inheritance of sensor's random distribution. In the hybrid model, mobile sensors in the network are acquired to heal coverage holes by their mobifity. When multiple coverage holes appear in the sensor network and each of them has a time requirement (in which the coverage hole has to be healed), conflicts for the requests of the same mobile sensor may arise. A distributed multiple mobile sensor schedufing protocol (DMS) is proposed in this paper to solve this problem by finding mobile sensors in the time response zone defined by the time requirement of each coverage hole. Simulation results show that DMS can well schedule the mobile sensors to move to multiple coverage holes within the time requirement.展开更多
Using a series of quantum correlated photon pairs, we propose a theoretical scheme for any-to-any multi-user quantum key distribution network based on differential phase shift. The differential phase shift and the dif...Using a series of quantum correlated photon pairs, we propose a theoretical scheme for any-to-any multi-user quantum key distribution network based on differential phase shift. The differential phase shift and the different detection time slots ensure the security of our scheme against eavesdropping. We discuss the security under the intercept-resend attack and the source replacement attack.展开更多
Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several domains.Health is a fascinating domain of WBAN for smart monitoring of a patient’s condition.An important factor to con...Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several domains.Health is a fascinating domain of WBAN for smart monitoring of a patient’s condition.An important factor to consider in WBAN is a node’s lifetime.Improving the lifetime of nodes is critical to address many issues,such as utility and reliability.Existing routing protocols have addressed the energy conservation problem but considered only a few parameters,thus affecting their performance.Moreover,most of the existing schemes did not consider traffic prioritization which is critical in WBANs.In this paper,an adaptive multi-cost routing protocol is proposed with a multi-objective cost function considering minimum distance from sink,temperature of sensor nodes,priority of sensed data,and maximum residual energy on sensor nodes.The performance of the proposed protocol is compared with the existing schemes for the parameters:network lifetime,stability period,throughput,energy consumption,and path loss.It is evident from the obtained results that the proposed protocol improves network lifetime and stability period by 30%and 15%,respectively,as well as outperforms the existing protocols in terms of throughput,energy consumption,and path loss.展开更多
Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with s...Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.展开更多
As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels...As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels,broadcasts are carried out on multiple channels.Accordingly,channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting.In this paper,an anticollision selective broadcast protocol,called acSB,is proposed.A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel.Moreover,an anticollision scheme is adopted to avoid simultaneous rebroadcasts.Consequently,the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay,higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.展开更多
The Internet of Things(IoT)consists of interconnected smart devices communicating and collecting data.The Routing Protocol for Low-Power and Lossy Networks(RPL)is the standard protocol for Internet Protocol Version 6(...The Internet of Things(IoT)consists of interconnected smart devices communicating and collecting data.The Routing Protocol for Low-Power and Lossy Networks(RPL)is the standard protocol for Internet Protocol Version 6(IPv6)in the IoT.However,RPL is vulnerable to various attacks,including the sinkhole attack,which disrupts the network by manipulating routing information.This paper proposes the Unweighted Voting Method(UVM)for sinkhole node identification,utilizing three key behavioral indicators:DODAG Information Object(DIO)Transaction Frequency,Rank Harmony,and Power Consumption.These indicators have been carefully selected based on their contribution to sinkhole attack detection and other relevant features used in previous research.The UVM method employs an unweighted voting mechanism,where each voter or rule holds equal weight in detecting the presence of a sinkhole attack based on the proposed indicators.The effectiveness of the UVM method is evaluated using the COOJA simulator and compared with existing approaches.Notably,the proposed approach fulfills power consumption requirements for constrained nodes without increasing consumption due to the deployment design.In terms of detection accuracy,simulation results demonstrate a high detection rate ranging from 90%to 100%,with a low false-positive rate of 0%to 0.2%.Consequently,the proposed approach surpasses Ensemble Learning Intrusion Detection Systems by leveraging three indicators and three supporting rules.展开更多
Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchro...Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchronize tremendous machines in a timing-efficient brings one of the greatest challenge and serves as the foundation for any other network control policies. In this paper, we propose a linear-time synchronization protocol in large M2M networks. Specifically, a closed-form of synchronization rate is provided by developing the statistical bounds of the second smallest eigenvalue of the graph Laplacian matrix. These bounds enable the efficient control of network dynamics, facilitating the timing synchronization in networks. Through a practical study in Metropolis, simulation results confirm our theoretical analysis and provide effective selection of wireless technologies, including Zigbee, Wi-Fi, and cellular systems, with respect to the deployed density of machines. Therefore, this paper successfully demonstrates a practical timing synchronization, to make a breakthrough of network dynamic control in real-world machine systems, such as Internet of Things.展开更多
Active networks is primarily a Defense Advanced Research Projects Agency(DARPA)-funded project focusing on the research of mechanisms, applications, and operating systems to develop a reconfigurable network infrastruc...Active networks is primarily a Defense Advanced Research Projects Agency(DARPA)-funded project focusing on the research of mechanisms, applications, and operating systems to develop a reconfigurable network infrastructure. This letter proposes an Secure Active Tracing System (SATS) to implementing security for active networking in Internet. Unlike currently existing schemes, SATS reduces the computational overloads by executing the filtering operation on selected packet streams only when needed.展开更多
Distributed underwater acoustic sensor networks(UASNs)are envisioned in real-time ocean current velocity estimation.However,UASNs at present are still dominated by post-processing partially due to the complexity of on...Distributed underwater acoustic sensor networks(UASNs)are envisioned in real-time ocean current velocity estimation.However,UASNs at present are still dominated by post-processing partially due to the complexity of on-line detection for travel times and lack of dedicated medium access control(MAC)protocols.In this study,we propose a dedicated MAC protocol package for real-time ocean current velocity estimation using distributed UASNs.First,we introduce the process and requirements of ocean current velocity estimation.Then,we present a series of spatial reuse time division multiple access(TDMA)protocols for each phase of real-time ocean current field estimation using distributed UASNs,followed by numerical analysis.We divide UASNs into two categories according to their computing ability:feature-complete and feature-incomplete systems.The feature-complete systems that have abundant computing ability carry out the presented MAC protocol package in three phases,whereas the feature-incomplete ones do not have enough computing ability and the presented MAC protocol package is reduced to two phases plus an additional downloading phase.Numerical analysis shows that feature-complete systems using mini-slot TDMA have the best real-time performance,in comparison with feature-incomplete systems and other feature-complete counterparts.Feature-incomplete systems are more energy-saving than feature-complete ones,owing to the absence of in-network data exchange.展开更多
在无中心飞行器集群网络中,非直通条件节点间不同的中继路径可能导致较大路径损耗落差,为有限资源前提下网络传输能力的提升带来困难。参考5G移动通信中的终端直通(Device to Device,D2D)技术与中继通信中的虚拟多输入多输出(Multiple-I...在无中心飞行器集群网络中,非直通条件节点间不同的中继路径可能导致较大路径损耗落差,为有限资源前提下网络传输能力的提升带来困难。参考5G移动通信中的终端直通(Device to Device,D2D)技术与中继通信中的虚拟多输入多输出(Multiple-Input Multiple-Output,MIMO)技术,提出一套D2D通信与虚拟MIMO技术结合的无中心飞行器集群网络传输方案。重点研究在正交资源模式下,将不同的协作传输协议与空时编码进行组合,在信噪比、误比特率、接入概率等方面对通信性能的影响。仿真结果表明:D2D通信与虚拟MIMO技术结合的传输方案在不增加资源的前提下,对集群网络的通信性能有明显提升,且引入分布式空时编码可进一步优化误比特率性能,但3种传输协议在不同传输质量评价方向的改善有所不同。展开更多
In order to realize the reduction of equipment cost and the demand of higher capacity, wireless mesh network (WMN) router devices usually have several interfaces and work on multi-channels. Jointing channel allocati...In order to realize the reduction of equipment cost and the demand of higher capacity, wireless mesh network (WMN) router devices usually have several interfaces and work on multi-channels. Jointing channel allocation, interface assignment and routing can efficiently improve the network capacity. This paper presents an efficient channel assignment scheme combined with the multi-radio link quality source routing (MR-LQSR) protocol, which is called channel assignment with MR-LQSR (CA-LQSR). In this scheme, a physical interference model is established: calculated transmission time (CTT) is proposed as the metric of channel assignment, which can reflect the real network environment and channel interference best, and enhanced weighted cumulative expected transmission time (EWCETT) is proposed as the routing metric, which preserves load balancing and bandwidth of links. Meantime, the expression of EWCETT contains the value of CTT, thus the total cost time of channel assignment and routing can be reduced. Simulation results show that our method has advantage of higher throughput, lower end-to-end time delay, and less network cost over some other existing methods.展开更多
文摘In this paper, the properties of distributed virtual environment (DVE) and the requirements on computer networks is briefly reviewed. A multicast protocol, called sender initiated grouping multicast protocol for DVE (SIGMP), is proposed. This new multicast protocol is based on a novel concept, multicast group (MG), which divides all participants in a DVE system into groups, among which there is a multicast group trustee (MGT) node to manage the group. The protocol provides unreliable/reliable, totally ordered and multiple to multiple multicast transmission service for DVE systems without sacrificing the communication efficiency heavily. At the same time, reliable unicast and one to multiple multicast transmission services are also supported. The performance analysis of the new protocols is also presented. Based on SIGMP, a simple demonstration of DVE system is designed and implemented. This demo system is running on several SGI workstations connected by a FDDI and Ethernet network.
基金Project supported by the National Natural Science Foundation of China (Grant No 10774039)
文摘Secure key distribution among classical parties is impossible both between two parties and in a network. In this paper, we present a quantum key distribution (QKD) protocol to distribute secure key bits among one quantum party and numerous classical parties who have no quantum capacity. We prove that our protocol is completely robust, i.e., any eavesdropping attack should be detected with nonzero probability. Our calculations show that our protocol may be secure against Eve's symmetrically individual attack.
基金supported by the National Natural Science Foundation of China under Grant No. 61133016
文摘Coverage holes often appear in wireless sensor networks due to sensor failure or the inheritance of sensor's random distribution. In the hybrid model, mobile sensors in the network are acquired to heal coverage holes by their mobifity. When multiple coverage holes appear in the sensor network and each of them has a time requirement (in which the coverage hole has to be healed), conflicts for the requests of the same mobile sensor may arise. A distributed multiple mobile sensor schedufing protocol (DMS) is proposed in this paper to solve this problem by finding mobile sensors in the time response zone defined by the time requirement of each coverage hole. Simulation results show that DMS can well schedule the mobile sensors to move to multiple coverage holes within the time requirement.
基金Supported by the National Key Basic Research Programme of China under Grant No 2006CB921106, the National Natural Science Foundation of China under Grant Nos 10325521 and 60433050, and the SRFDP Programme of the Ministry of Education of China, and the Key Project of the Ministry of Education of China under Grant No 306020.
文摘Using a series of quantum correlated photon pairs, we propose a theoretical scheme for any-to-any multi-user quantum key distribution network based on differential phase shift. The differential phase shift and the different detection time slots ensure the security of our scheme against eavesdropping. We discuss the security under the intercept-resend attack and the source replacement attack.
文摘Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several domains.Health is a fascinating domain of WBAN for smart monitoring of a patient’s condition.An important factor to consider in WBAN is a node’s lifetime.Improving the lifetime of nodes is critical to address many issues,such as utility and reliability.Existing routing protocols have addressed the energy conservation problem but considered only a few parameters,thus affecting their performance.Moreover,most of the existing schemes did not consider traffic prioritization which is critical in WBANs.In this paper,an adaptive multi-cost routing protocol is proposed with a multi-objective cost function considering minimum distance from sink,temperature of sensor nodes,priority of sensed data,and maximum residual energy on sensor nodes.The performance of the proposed protocol is compared with the existing schemes for the parameters:network lifetime,stability period,throughput,energy consumption,and path loss.It is evident from the obtained results that the proposed protocol improves network lifetime and stability period by 30%and 15%,respectively,as well as outperforms the existing protocols in terms of throughput,energy consumption,and path loss.
基金This work was supported by the Serbian Ministry of Science and Education(project TR-32022)by companies Telekom Srbija and Informatika.
文摘Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.
文摘As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels,broadcasts are carried out on multiple channels.Accordingly,channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting.In this paper,an anticollision selective broadcast protocol,called acSB,is proposed.A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel.Moreover,an anticollision scheme is adopted to avoid simultaneous rebroadcasts.Consequently,the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay,higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.
基金funded by the Deanship of Scientific Research at Najran University for this research through a Grant(NU/RG/SERC/12/50)under the Research Groups at Najran University,Saudi Arabia.
文摘The Internet of Things(IoT)consists of interconnected smart devices communicating and collecting data.The Routing Protocol for Low-Power and Lossy Networks(RPL)is the standard protocol for Internet Protocol Version 6(IPv6)in the IoT.However,RPL is vulnerable to various attacks,including the sinkhole attack,which disrupts the network by manipulating routing information.This paper proposes the Unweighted Voting Method(UVM)for sinkhole node identification,utilizing three key behavioral indicators:DODAG Information Object(DIO)Transaction Frequency,Rank Harmony,and Power Consumption.These indicators have been carefully selected based on their contribution to sinkhole attack detection and other relevant features used in previous research.The UVM method employs an unweighted voting mechanism,where each voter or rule holds equal weight in detecting the presence of a sinkhole attack based on the proposed indicators.The effectiveness of the UVM method is evaluated using the COOJA simulator and compared with existing approaches.Notably,the proposed approach fulfills power consumption requirements for constrained nodes without increasing consumption due to the deployment design.In terms of detection accuracy,simulation results demonstrate a high detection rate ranging from 90%to 100%,with a low false-positive rate of 0%to 0.2%.Consequently,the proposed approach surpasses Ensemble Learning Intrusion Detection Systems by leveraging three indicators and three supporting rules.
基金supported by the Major Research plan of the National Natural Science Foundation of China 9118008National Key Technology R&D Program of the Ministry of Science and Technology 2014BAC16B01
文摘Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchronize tremendous machines in a timing-efficient brings one of the greatest challenge and serves as the foundation for any other network control policies. In this paper, we propose a linear-time synchronization protocol in large M2M networks. Specifically, a closed-form of synchronization rate is provided by developing the statistical bounds of the second smallest eigenvalue of the graph Laplacian matrix. These bounds enable the efficient control of network dynamics, facilitating the timing synchronization in networks. Through a practical study in Metropolis, simulation results confirm our theoretical analysis and provide effective selection of wireless technologies, including Zigbee, Wi-Fi, and cellular systems, with respect to the deployed density of machines. Therefore, this paper successfully demonstrates a practical timing synchronization, to make a breakthrough of network dynamic control in real-world machine systems, such as Internet of Things.
文摘Active networks is primarily a Defense Advanced Research Projects Agency(DARPA)-funded project focusing on the research of mechanisms, applications, and operating systems to develop a reconfigurable network infrastructure. This letter proposes an Secure Active Tracing System (SATS) to implementing security for active networking in Internet. Unlike currently existing schemes, SATS reduces the computational overloads by executing the filtering operation on selected packet streams only when needed.
基金This work was supported by the National Natural Science Foundation of China(No.61531017)the Science and Technology Bureau of Zhoushan(No.2018C41029)the Science and Technology Department of Zhejiang Province(Nos.2018R52046 and LGG18F010005).
文摘Distributed underwater acoustic sensor networks(UASNs)are envisioned in real-time ocean current velocity estimation.However,UASNs at present are still dominated by post-processing partially due to the complexity of on-line detection for travel times and lack of dedicated medium access control(MAC)protocols.In this study,we propose a dedicated MAC protocol package for real-time ocean current velocity estimation using distributed UASNs.First,we introduce the process and requirements of ocean current velocity estimation.Then,we present a series of spatial reuse time division multiple access(TDMA)protocols for each phase of real-time ocean current field estimation using distributed UASNs,followed by numerical analysis.We divide UASNs into two categories according to their computing ability:feature-complete and feature-incomplete systems.The feature-complete systems that have abundant computing ability carry out the presented MAC protocol package in three phases,whereas the feature-incomplete ones do not have enough computing ability and the presented MAC protocol package is reduced to two phases plus an additional downloading phase.Numerical analysis shows that feature-complete systems using mini-slot TDMA have the best real-time performance,in comparison with feature-incomplete systems and other feature-complete counterparts.Feature-incomplete systems are more energy-saving than feature-complete ones,owing to the absence of in-network data exchange.
文摘在无中心飞行器集群网络中,非直通条件节点间不同的中继路径可能导致较大路径损耗落差,为有限资源前提下网络传输能力的提升带来困难。参考5G移动通信中的终端直通(Device to Device,D2D)技术与中继通信中的虚拟多输入多输出(Multiple-Input Multiple-Output,MIMO)技术,提出一套D2D通信与虚拟MIMO技术结合的无中心飞行器集群网络传输方案。重点研究在正交资源模式下,将不同的协作传输协议与空时编码进行组合,在信噪比、误比特率、接入概率等方面对通信性能的影响。仿真结果表明:D2D通信与虚拟MIMO技术结合的传输方案在不增加资源的前提下,对集群网络的通信性能有明显提升,且引入分布式空时编码可进一步优化误比特率性能,但3种传输协议在不同传输质量评价方向的改善有所不同。
基金supported by the Fundamental Research Funds for the Central Universities (2009RC0308)
文摘In order to realize the reduction of equipment cost and the demand of higher capacity, wireless mesh network (WMN) router devices usually have several interfaces and work on multi-channels. Jointing channel allocation, interface assignment and routing can efficiently improve the network capacity. This paper presents an efficient channel assignment scheme combined with the multi-radio link quality source routing (MR-LQSR) protocol, which is called channel assignment with MR-LQSR (CA-LQSR). In this scheme, a physical interference model is established: calculated transmission time (CTT) is proposed as the metric of channel assignment, which can reflect the real network environment and channel interference best, and enhanced weighted cumulative expected transmission time (EWCETT) is proposed as the routing metric, which preserves load balancing and bandwidth of links. Meantime, the expression of EWCETT contains the value of CTT, thus the total cost time of channel assignment and routing can be reduced. Simulation results show that our method has advantage of higher throughput, lower end-to-end time delay, and less network cost over some other existing methods.