排序方式: 共有26条查询结果,搜索用时 15 毫秒
1.
2.
阿姆贾德 《上海交通大学学报(英文版)》2002,7(2):231-237
IntroductionWireless ad hoc networks are gaining increas-ing popularity in recent years because of their easeof deployment. No wired base station or infras-tructure is supported,and each hostcommunicatesone anothervia packetradios. In ad hoc networks,routing protocols are challenged with establishingand maintaining multihop routes in the face of mo-bility,bandwidth limitation and power con-straints. In ad hoc networks,each node( host)acts as a router since routes are mostly multihop.Nodes in … 相似文献
3.
LINWei YANGYong-Tian 《船舶与海洋工程学报》2004,3(2):46-49
A routing algorithm called DNH for increasing efficiency of mobile ad hoe network is presented, which is based on a new cflteflon called TSS (Temporarily Steady State), combining with wireless transmission theory that makes networks topology correspondingly stabilization. Also the DNH algorithm has the characteristics of giving up queuing in a node, but selecting another idle node instead of the node for forwarding data packets if the node has a full throughput. Simulation evaluation shows that selecting another node is better than queuing in a full throughout node if some conditions are satisfied, especially during a sea battle, every warship in ad hoe network wants to contest time and increase propagation reliability. The DNH algorithm can help decrease routing time, and raise efficiency of marine ad hoe networks. 相似文献
4.
5.
6.
Mobile ad hoc networks are often deployed in environments where the nodes of the networks are unattended and have little or
no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The networks
are particularly vulnerable to denial of service (DoS) attacks launched through compromised nodes or intruders. In this paper,
we investigated the effects of flooding attacks in network simulation 2 (NS-2) and measured the packet delivery ratio and
packet delay under different flooding frequencies and different numbers of attack nodes. Simulation results show that with
the increase the flooding frequencies and the numbers of attack nodes, network performance drops. But when the frequency of
flooding attacks is greater than a value, the performance decrease gets smooth. Meanwhile the packet delay firstly increases
and then declines to a value of stability at the end. 相似文献
7.
In the past few years, vehicular ad hoc networking (VANET) has attracted significant attention and many fundamental issues have been investigated, such as network connectivity, medium access control (MAC) mechanism, routing protocol, and quality of service (QoS). Nevertheless, most related work has been based on simplified assumptions on the underlying vehicle traffic dynamics, which has a tight interaction with VANET in practice. In this paper, we try to investigate VANET performance from the vehicular cyber-physical system (VCPS) perspective. Specifically, we consider VANET connectivity of platoon-based VCPSs where all vehicles drive in platoon-based patterns, which facilitate better traffic performance as well as information services. We first propose a novel architecture for platoon-based VCPSs, then we derive the vehicle distribution under platoon-based driving patterns on a highway. Based on the results, we further investigate inter-platoon connectivity in a bi-directional highway scenario and evaluate the expected time of safety message delivery among platoons, taking into account the effects of system parameters, such as traffic flow, velocity, platoon size and transmission range. Extensive simulations are conducted which validate the accuracy of our analysis. This study will be helpful to understand the behavior of VCPSs, and will be helpful to improve vehicle platoon design and deployment. 相似文献
8.
针对铁路应急通信网络安全问题,通过对其特征的详细分析,提出了面向铁路应急的移动自组网络安全节点发现协议建模,以达到解决铁路应急通信网络安全节点发现问题的目的.在对铁路应急的移动自组网络规则描述的基础上,给出具体的安全节点建模过程,并对其正确性、安全性、执行效率进行了详细的分析.最后以两类具体的安全节点发现过程为实例进行探讨,表明其与传统加密方式结合后,仍保持其有效性. 相似文献
9.
10.
The neighbor knowledge in mobile ad hoc networks is important information. However, the accuracy of neighbor knowledge is paid in terms of energy consumption. In traditional schemes for neighbor discovery, a mobile node uses fixed period to send HELLO messages to notify its existence. An adaptive scheme was proposed. The objective is that when mobile nodes are distributed sparsely or move slowly, fewer HELLO messages are needed to achieve reasonable accuracy, while in a mutable network where nodes are dense or move quickly, they can adaptively send more HELLO messages to ensure the accuracy. Simulation results show that the adaptive scheme achieves the objective and performs effectively. 相似文献