共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
3.
4.
This paper proposes a Markov model of link connectivity for mobile ad hoc networks. Under a random behavior, the model provides
a unified approach to describe many different mobility models including entity mobility models and group mobility models.
Using the model, we can predict the time dependence of link connectivity, and estimate a settling time for which node movements
are considered in a transient state. We verify the model with the simulation results of four different mobility models using
a global connectivity and a link duration distribution.
This research was supported in part by the National Science Foundation under grant CCF-0514975.
Seok K. Hwang received the B.S. degree in Control and Instrumentation Engineering from Korea University, Korea in 1998. He received the
M.S. degreeand the Ph.D.degree in Electrical Engineering at POSTECH, Korea in 2000 and 2006, respectively.His research interests
include intelligence controls and computational intelligence for multi-objective optimization problems. He is working on multimedia
communication as a senior researcher at Korea Telecom since 2006.
Dongsoo Stephen Kim received the B.S. degree from Korean University in 1987, the M.S. degree in computer science from the University of Texas
in 1994, and the Ph.D. degree in computer science and engineering from the University of Minnesota in 1998. During 1986–2002,
he was a Research Associate at Electronic and Telecommunication Research Institute, Taejon, Korea. In 1998–2000, he was a
project manager at Megaxess Inc., Germantown, Maryland. He joined the Department of Electrical and Computer Engineering at
Purdue School of Engineering and Technology, IUPUI in 2000. His current research interests include mobile wireless networks,
mobility modeling, traffic modeling, and performance evaluation of communication networks. 相似文献
5.
In city environment, the vehicle communi- cation is affected by the around obstacles due to the espe- cial condition of wireless channels. However, most of prior works adopt the fixed radio range value of vehicles to trans- mit packets. In this paper, we design an optimization for- warding range routing protocol for VANET in urban area. It has an optimized and adjustable forwarding range, which changes with different environments based on the path loss and the city model. And the proposed geo-routing protocol has a novel idea in computing the connectivity of roads and the adjustable strategy in a sparse network. Simulation re- suits indicate that the OFRR enjoys desirable performance in the urban area. 相似文献
6.
7.
利用网络图论中支配集的概念,给出无线Ad hoc网络中虚拟骨干网的数学模型。介绍了目前几种常用的虚拟骨干网设计方案,并从算法的复杂度和所需的邻居信息等方面对其进行比较。 相似文献
8.
9.
与固定有线网络相比,无线ad hoc网络动态的拓扑结构、脆弱的无线信道、网络有限的通信带宽以及节点兼备主机和路由功能等特点,使得网络容易遭受拒绝服务(DOS)攻击。文章针对ad hoc网络的组播应用在抵御DoS攻击方面的不足,提出外部和内部两种组播DoS泛洪攻击模型,同时针对ad hoc网络组播组内的攻击提出相应的两种抵抗策略和具体实现步骤。 相似文献
10.
由于自组网独特的特性,在该网络中支持QoS非常困难,需要进行系统研究。本文首先分析了自组网中QoS支持面临的挑战,接着从系统角度出发,结合自组网的特点,在QoS模型和QoS支持体系以及体系中具体的QoS技术等方面对自组网QoS支持做了详尽的分析与探讨,同时指出:定义自组网QoS模型需要综合考虑应用需求和网络特性;实现QoS模型可以采用分层QoS支持体系或跨层QoS支持体系,而后者将是今后研究的重点;结合路由层、MAC层和物理层的跨层QoS支持体系具有研究价值。 相似文献
11.
无线ad hoc网络中多路径负载平衡性能分析 总被引:4,自引:1,他引:3
提出了一种新颖的分析模型来计算无线ad hoc网络中多路径情况下的负载。该模型考虑到多路径的数目、路由的选取方法以及网络中节点的密度等条件,能够对不同网络条件下的负载进行较好的分析与理论计算。仿真结果与理论计算有良好的一致性,结果表明在无线ad hoc网络中简单地使用多路径路由并不能有效地平衡网络负载。这一结论与目前普遍认定的结论(在无线ad hoc网络中使用多路径路由和在有线网络中使用多路径路由一样,可以很好地平衡网络负载、增加网络的吞吐量)是不一致的。 相似文献
12.
13.
14.
15.
黄成兵 《智能计算机与应用》2016,(5)
介绍移动自组网的特点、发展与现状,并与现有通信手段进行分析对比,指明移动自组网在各类灾后营救中的相比传统通信手段所更能发挥的积极作用,展望移动自组网在各个领域中的应用前景。 相似文献
16.
Poonguzhali Ilango Nagarajan Sivarajan Anitha RaviChandran Rajesh Arunachalam 《International Journal of Communication Systems》2024,37(9):e5758
Flying ad hoc network (FANET) is a technology that has seen tremendous growth in the past years due to its application in various military and civil developments. Conventional topology-aided routing schemes are not suitable for large-scale FANETs. This is because of the higher mobility rate in UAVs with the architecture differences. Hence, several path entries in routing become invalid and the neighboring nodes can be occupied before the interruption. Hence, it is very important to solve the afore-explained issues in FANET. Initially, the task is assigned to the UAVs. These tasks are performed by satisfying the demands such as timing, congestion, and energy to attain the effective load-balancing performance. Then, the optimal clustering and cluster head (CH) selection are performed using the developed Percentage of Circle Search and Spotted Hyena Optimizer (PCSSHO) in the communication path. Here, the feature selection is done based on constraints like position, speed, moving direction, height variation, link quality, and inter- and intra-cluster distance. Then, the developed PCSSHO model performs routing by considering different constraints such as “end-to-end delay, delivery ratio, power consumption, and link quality.” Thus, the recommenced load balancing model in FANET secures an enhanced performance rate than the conventional load balancing frameworks. 相似文献
17.
无源雷达多站TDOA定位时,要求多站同时截获目标雷达的辐射信号,并且为满足定位精度而要求一定的基线长度,然而现代机载雷达采用超低副瓣、降低平均功率等许多低截获措施,使得双接收站配置一般不会被机载雷达主瓣同时覆盖,致使一个接收站处在发射天线的主波束内时,另一接收站处在副瓣或零点位置,因此双接收站之间接收的信号强度相差悬殊,至少差20dB的主副瓣比。为此,利用相关接收理论分析了在雷达主瓣方向的侦察接收机截获的强信号,确定脉冲重复周期、脉内调制等基本信息。并利用该信息及信号协同在雷达副瓣方向的侦收机的微弱信号进行相关接收,推导出独立于截获信号结构的混合积模型,从而使双通道侦收机的信号处理可以直接借鉴传统雷达的相参与非相参等信号积累方法。通过雷达实测信号构建双路信号的仿真验证表明该方法的理论可行性和工程可用性。 相似文献
18.
Data-centric storage is a fundamental data management paradigm in wireless multihop networks. Originally introduced for wireless sensor networks, existing approaches are in principle also applicable in mobile ad hoc networks. However, the mobility of such networks strongly impacts storage performance in general and communication cost in particular. While this is recognized in the research community, a detailed account of the performance in terms of communication cost is lacking.In this article, we provide a detailed study of the communication cost of previously proposed data-centric storage mechanisms that are viable in mobile ad hoc networks. We first introduce a comprehensive analytical model that suitably characterizes the communication cost of data-centric storage mechanisms from the literature. We then use our model to evaluate the considered mechanisms in comparative terms as a function of relevant system parameters, including the amount of considered data, the frequency of data updates and queries, and node speed. Our results give a detailed account of data-centric storage performance and are able to identify the most suitable ranges of operation for each of the considered mechanisms. 相似文献
19.
现有的信任模型大多通过单一信任值来判定节点的好坏,这种方法无法抵抗网络中的某些恶意行为,特别是对于P2P网络中独有的搭便车行为、"公共物品的悲哀"等问题,缺乏有效的抑制。针对这些问题,文中针对P2P网络提出了一种新的多层多维信誉模型,通过节点的信任值、贡献值、资源值等不同维度综合评价节点的信誉,并且按照信誉将节点划分为不同层次。分析可知该模型可以有效抵御多种恶意行为及多种自私行为,并能解决传统信任模型产生的一些性能问题。 相似文献
20.
A core-based forwarding multicast tree is a shortest path tree rooted at core node that distributes multicast packets to all group members via the tree after the packets are sent to the core. Traditionally, the bandwidth cost consumed by transmitting a packet from the core via the tree is evaluated by the total weights of all the edges. And, the bandwidth cost is minimized by constructing the multicast tree that has minimum total weights of edges to span all group members. However, when the local broadcast operation is used to multicast a packet, we found that the bandwidth cost is supposed to be evaluated by the total weights of all senders that include the core and all non-leaves. Since the multicast tree with the number of nodes greater than or equal to three has minimum bandwidth cost only when the core is not a leaf, it leads us to find the multicast tree with the minimum number of non-leaves when each sender node has a unit weight. However, no polynomial time approximation scheme can be found for the minimum non-leaf multicast tree problem unless P = NP since the problem is not only NP-hard but also MAX-SNP hard. Thus, a heuristic is proposed to dynamically reduce the number of non-leaves in the multicast tree. Experimental results show that the multicast tree after the execution of our method has smaller number of non-leaves than others in the geometrically distributed network model. 相似文献