A novel mechanism was specified by which a node in ad hoc network may autoconfigure an IP address which is unique throughout the mobile ad hoc network. This new algorithm imposes less and constant overhead and delay i...A novel mechanism was specified by which a node in ad hoc network may autoconfigure an IP address which is unique throughout the mobile ad hoc network. This new algorithm imposes less and constant overhead and delay in obtaining an IP address, and fully utilizes the available addresses space of an ad hoc network, and independent of the existing routing protocol, and less prone to security threats. Moreover, a new Join/Leave mechanism was proposed as an enhancement to the new IP address autoconfiguration algorithm, to support the overall operation of the existing routing protocol of wireless ad hoc networks.展开更多
This In the past decade there has been an increasing need for designs to address the time and cost efficiency issues from various computer network applications such as general IP address lookup and specific network in...This In the past decade there has been an increasing need for designs to address the time and cost efficiency issues from various computer network applications such as general IP address lookup and specific network intrusion detection. Hashing techniques have been widely adopted for this purpose, among which XOR-operation-based hashing is one of most popular techniques due to its relatively small hash process delay. In most current commonly used XOR-hashing algorithms, each of the hash key bits is usually explicitly XORed only at most once in the hash process, which may limit the amount of potential randomness that can be introduced by the hashing process. In [1] a series of bit duplication techniques are proposed by systematically duplicating one row of key bits. This paper further looks into various ways in duplicating and reusing key bits to maximize randomness needed in the hashing process so as to enhance the overall performance further. Our simulation results show that, even with a slight increase in hardware requirement, a very significant reduction in the amount of hash collision can be obtained by the proposed technique.展开更多
网际互连协议(Internet Protocol,IP)音箱作为一种网络音频播放设备,是公共广播系统的重要组成部分。设计一种基于STM32的IP音箱主控板卡。该板卡使用STM32F407作为主控平台,通过精简介质独立接口(Reduced Media Independent Interface,...网际互连协议(Internet Protocol,IP)音箱作为一种网络音频播放设备,是公共广播系统的重要组成部分。设计一种基于STM32的IP音箱主控板卡。该板卡使用STM32F407作为主控平台,通过精简介质独立接口(Reduced Media Independent Interface,RMII)与LAN8720以太网收发器进行网络数据交互,采用VS1063作为音频编解码芯片,并基于C语言设计和实现了IP扬声器主控软件。该系统具有网络音频实时播放、自动音量调节以及扬声器状态监测功能。通过自研的上位机软件进行测试,主控软件程序运行稳定,实时语音延迟小于100 ms,成功实现了预期设计功能。展开更多
文摘A novel mechanism was specified by which a node in ad hoc network may autoconfigure an IP address which is unique throughout the mobile ad hoc network. This new algorithm imposes less and constant overhead and delay in obtaining an IP address, and fully utilizes the available addresses space of an ad hoc network, and independent of the existing routing protocol, and less prone to security threats. Moreover, a new Join/Leave mechanism was proposed as an enhancement to the new IP address autoconfiguration algorithm, to support the overall operation of the existing routing protocol of wireless ad hoc networks.
文摘This In the past decade there has been an increasing need for designs to address the time and cost efficiency issues from various computer network applications such as general IP address lookup and specific network intrusion detection. Hashing techniques have been widely adopted for this purpose, among which XOR-operation-based hashing is one of most popular techniques due to its relatively small hash process delay. In most current commonly used XOR-hashing algorithms, each of the hash key bits is usually explicitly XORed only at most once in the hash process, which may limit the amount of potential randomness that can be introduced by the hashing process. In [1] a series of bit duplication techniques are proposed by systematically duplicating one row of key bits. This paper further looks into various ways in duplicating and reusing key bits to maximize randomness needed in the hashing process so as to enhance the overall performance further. Our simulation results show that, even with a slight increase in hardware requirement, a very significant reduction in the amount of hash collision can be obtained by the proposed technique.
