共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
3.
DBLAR:A DISTANCE-BASED LOCATION-AIDED ROUTING FOR MANET 总被引:2,自引:0,他引:2
In location-aided routing of Mobile Ad hoc NETworks (MANET), nodes mobility and the inaccuracy of location information may result in constant flooding, which will reduce the network performance. In this paper, a Distance-Based Location-Aided Routing (DBLAR) for MANET has been proposed. By tracing the location information of destination nodes and referring to distance change between nodes to adjust route discovery dynamically, the proposed routing algorithm can avoid flooding in the whole networks. Besides, Distance Update Threshold (DUT) is set up to reach the balance between real-time ability and update overhead of location information of nodes, meanwhile, the detection of relative distance vector can achieve the goal of adjusting forwarding condition. Simulation results reveal that DBLAR performs better than LAR1 in terms of packet successful delivery ratio, average end-to-end delay and routing-load, and the set of DUT and relative distance vector has a significant impact on this algorithm. 相似文献
4.
5.
The capacity of wireless ad hoc networks is constrained by the interference caused by the neighboring nodes. Gupta and Kumar
have shown that the throughput for such networks is only Θ
bits per second per node in a unit area domain when omnidirectional antennas are used [1]. In this paper we investigate the
capacity of ad hoc wireless networks using directional antennas. Using directional antennas reduces the interference area
caused by each node, thus increases the capacity of the network. We will give an expression for the capacity gain and we argue
that in the limit, when the beam-width goes to zero the wireless network behaves like the wired network. In our analysis we
consider both arbitrary networks and random networks where nodes are assumed to be static. We have also analyzed hybrid beamform
patterns that are a mix of omnidirectional/directional and a better model of real directional antennas. Simulations are conducted
for validation of our analytical results.
Su Yi received the B.S. and M.S degrees in automation from Tsinghua University, China, in 1998 and 2001, respectively. She received
her Ph.D. degree in electrical engineering from Rensselaer Polytechnic Institute, in December 2005. Her research interests
include various topics in wireless ad hoc networks, including capacity of wireless networks, error control coding, and multimedia
communications over wireless.
Yong Pei is currently a tenure-track assistant professor in the Computer Science and Engineering Department, Wright State University,
Dayton, OH. Previously he was a visiting assistant professor in the Electrical and Computer Engineering Department, University
of Miami, Coral Gables, FL. He received his B.S. degree in electrical power engineering from Tsinghua University, Beijing,
in 1996, and M.S. and Ph.D. degrees in electrical engineering from Rensselaer Polytechnic Institute, Troy, NY, in 1999 and
2002, respectively. His research interests include information theory, wireless communication systems and networks, and image/video
compression and communications. He is a member of IEEE and ACM.
Shivkumar Kalyanaraman is an Associate Professor at the Department of Electrical, Computer and Systems Engineering at Rensselaer Polytechnic Institute
in Troy, NY. He received a B.Tech degree from the Indian institute of Technology, Madras, India in July 1993, followed by
M.S. and Ph.D. degrees in computer and Information Sciences at the Ohio State University in 1994 and 1997 respectively. His
research interests are in network traffic management topics such as congestion control, reliability, connectionless traffic
engineering, quality of service (QoS), last-mile community wireless networks, low-cost free-space-optical networks, automated
network management using online simulation, multicast, multimedia networking, and performance analysis. His special interest
lies in developing the interdisciplinary connections between network architecture and fields like control theory, economics,
scalable simulation technologies, video compression and optoelectronics. He is a member of ACM and IEEE.
Babak Azimi-Sadjadi received his B.Sc. from Sharif University of Technology in 1989, his M.Sc. from Tehran University in 1992, and his Ph.D.
from the University of Maryland at College Park in 2001 all in Electrical Engineering. He is currently with Intelligent Automation
Inc. where he is a Senior Research Scientist He also has a joint appointment with the department of Electrical, Systems, and
Computer Engineering of Rensselaer Polytechnic Institute where he is a research assistant professor. His research interests
include, nonlinear filtering, networked control systems, and wireless networks. 相似文献
6.
移动Ad-hoc网络(MANETs)具有开放的媒质,动态的拓扑结构,分布式的合作和受限的网络能力等基本特点。网络中移动节点具有匿名性和高度自治的特点,网络通讯依靠在通信路径上的中间节点转发数据包,实现无线传输范围外节点间的正常通信。该文提出了一种独特的MANETs中基于频率下多目标可信路由决策算法,它和现在大多数路由算法都是在时间域下使用单一约束参数选择路由的方式截然不同。利用概率理论分析安全和可信路由,基于概率密度函数的时频相互转化,减小计算复杂度,解决MEANTs中节点间缺乏物理安全以及在低信任水平和节点相互勾结扰乱网络操作情况下,发现可信安全路由难的问题。实例分析证明了此算法的可行性。 相似文献
7.
8.
This paper evaluates the tradeoffs involved in using directional antennas in ad hoc routing. Although problems with utilizing directional antennas have been visited in the past, the research has been confined mostly to medium access control. To determine whether directional antennas are beneficial to ad hoc networks, it is necessary to evaluate the impact of directional antennas on the performance of routing protocols as well. In this paper, we evaluate the performance of DSR (dynamic source routing) using directional antennas. We identify several issues that emerge from executing DSR (originally designed for omnidirectional antennas) over directional antennas. Using insights gained from simulations, we propose routing strategies that adapt the routing protocol to directional communication. Our analysis shows that by using directional antennas, ad hoc networks may achieve better performance. However, scenarios exist in which using omnidirectional antennas may be more appropriate. 相似文献
9.
802.11移动自组网由于其固有的动态拓扑、分布式协作等特点,路由协议普遍采用多播方式以提高无线链接的传输效率,由此带来的拥塞使得移动自组网中多播拥塞控制至关重要。针对移动自组网中节点固有的随机特性,基于802.11 DCF协议,该文提出一种精确描述节点数据产生、排队、发送动态过程的拟生灭模型,并通过矩阵几何方法对其进行稳态分析,得出节点速率阈值方程组,并用OPNET进行了仿真实验,仿真结果与理论值拟合较好,为移动自组网中的拥塞控制提供了一个量化的指标。 相似文献
10.
Robert Christian Christian 《AEUE-International Journal of Electronics and Communications》2006,60(1):3-7
Medium access using the distributed coordination function of IEEE 802.11 is not efficient in wireless multihop networks if the devices are equipped with beamforming antennas. This paper proposes a distributed MAC protocol that goes completely away from the spatial reservation scheme of 802.11. It facilitates the use of beamforming antennas by following an announcement-objection scheme: a potential sender must “simulate” a transmission on a signaling channel before it can access the traffic channel. Based on this simulation, each receiving device estimates the expected interference and objects to the transmission if necessary. This paradigm overcomes the drawback of 802.11-based approaches that neighboring devices are silenced irrespective of whether or not they disturb signal reception. It benefits from a tight interaction of the MAC and physical layer. 相似文献
11.
12.
13.
针对车联网(VANETs)环境下车辆用户数字身份管理问题,该文提出基于区块链的去中心化可撤销隐私保护自主管理身份(SSI)方案。经可信机构(TA)授权后,路侧单元(RSU)组成委员会负责车辆用户身份注册、数字身份凭证颁发及维护。基于门限BLS签名和实用拜占庭容错(PBFT)共识机制实现数字身份凭证创建,解决凭证颁发机构去中心化问题;集成秘密共享和零知识证明技术,解决数字身份凭证颁发和验证过程中隐私保护问题;基于密码学累加器技术,解决分布式存储环境数字身份凭证撤销问题。最后,对该方案安全属性进行了详细分析,证明方案能够满足所提出的安全目标,同时基于本地以太坊私有链平台使用智能合约对所提方案进行了实现及性能分析,实验结果表明了设计的可靠性、可行性和有效性。 相似文献
14.
Winston Khoon-Guan Seah Lu-Yee Yeo Zhi-Ang Eu Hwee-Xian Tan Kean-Soon Tan 《International Journal of Wireless Information Networks》2006,13(2):115-126
The proliferation of mobile wireless computing devices and the increasing usage of wireless networking have motivated substantial research in mobile ad hoc networks (MANETs). In addition, much has also been done to link autonomous MANETs to the Internet, and as MANETs become more prevalent, the need to interconnect multiple MANETs becomes increasingly important too. However, direct interconnection of MANETs has rarely been studied. In this paper, we first report an experimental study on the performance of interconnected MANETs running two different routing protocols, viz., the Ad hoc On-Demand Distance Vector (AODV) and Optimized Link State Routing (OLSR) protocols, which represent the two major categories, and show that with the use of multiple gateways, it is possible to viably interconnect multiple networks running different MANET routing protocols. We then follow with a simulation study to evaluate the performance in large networks, which not only validates the scalability of the proposed scheme, but also helps to identify various problems that were not apparent in small experimental networks. 相似文献
15.
针对飞行自组网(FANET)中无人机(UAVs)快速移动造成的网络拓扑管理困难问题,考虑实际场景中无人机位置变化引起的可用信道差异,该文提出一种自适应蜂鸟算法对网络拓扑进行优化。首先,建立一个针对分簇结构的无人机拓扑模型,并且形成一个以最小化簇数量、负载偏差和簇移动度为目标的优化问题。其次,通过调节人工蜂鸟的觅食动作、加入扰动变异的方式,提出寻优能力更强的自适应蜂鸟算法(ADHA)。然后,设计合理的蜂鸟个体编码方式,将拓扑优化的决策过程转化为自适应蜂鸟算法的寻优过程。最后,通过仿真验证所提算法的收敛性,并与基于其他群智能优化算法的拓扑优化方法进行对比。实验结果表明,所提算法得到的拓扑优化策略不仅能够有效减少网络拓扑的簇数量,而且能够得到负载均衡、结构稳定的簇群。 相似文献
16.
17.
This paper presents adaptive hybrid protocols based on the declarative network and mainly discusses the principle and realization of the Bayesian-estimation based adaptive hybrid protocol in the declarative network, which is well adapted to the Mobile Ad hoc NETwork (MANET). The adaptive hybrid protocol is designed for ad hoc networks which have characteristics like self-organizing, no trusted party, flexibility, etc. The nodes that run the hybrid protocol can automatically select one routing protocol that is suitable for different network environment. The Bayesian-estimation based adaptive strategy, that improves the adaptability and stability of the protocol, succeeds in the Rapidnet, a declarative network engine. The result in the Rapidnet proves that the hybrid protocol and the adaptive strategy are feasible. The experiment on the ns-3 simulator, an emerging discrete-event network simulator, validates that this protocol performs well and reduces communication overheads. 相似文献
18.
R. MurawskiAuthor Vitae E. FelembanAuthor Vitae E. EkiciAuthor VitaeJ. ParkAuthor Vitae Z. Hameed MirAuthor Vitae 《Ad hoc Networks》2012,10(1):1-18
Directional antennas offer many potential advantages for wireless networks such as increased network capacity, extended transmission range and reduced energy consumption. Exploiting these advantages requires new protocols and mechanisms at various communication layers to intelligently control the directional antenna system. With directional antennas, many trivial mechanisms, such as neighbor discovery, become challenging since communicating parties must agree on where and when to point their directional beams to communicate.In this paper, we propose a fully directional neighbor discovery protocol called Sectored-Antenna Neighbor Discovery (SAND) protocol. SAND is designed for sectored-antennas, a low-cost and simple realization of directional antennas, that utilize multiple limited beamwidth antennas. Unlike many proposed directional neighbor discovery protocols, SAND depends neither on omnidirectional antennas nor on time synchronization. SAND performs neighbor discovery in a serialized fashion allowing individual nodes to discover all potential neighbors within a predetermined time. SAND guarantees the discovery of the best sector combination at both ends of a link, resulting in more robust and higher quality links between nodes. Finally, SAND reliably gathers the neighborhood information in a centralized location, if needed, to be used by centralized networking protocols. The effectiveness of SAND has been assessed via simulation studies and real hardware implementation. 相似文献
19.
在Ad hoc网络中邻居节点发现(Neighbor Discovery)是网络初始化中的重要步骤之一,节点邻居的信息对于几乎所有的链路选择和路由算法都有着重要的影响,特别是在采用方向性天线时邻居发现不仅难度更大而且其影响作用也更明显。通过分析在采用方向性天线时的Ad hoc网络中的邻居发现算法,总结出了其一般步骤,即首先通过判断网络规模来进行天线收发模式选择算法和扫描图案的选择,然后再设计相应的通信握手协议。 相似文献
20.
Evolution and future directions of the ad hoc on-demand distance-vector routing protocol 总被引:2,自引:0,他引:2
The ad hoc on-demand distance-vector (AODV) routing protocol has been designed for use in ad hoc networks, which are presently receiving wide interest within many diverse research communities. These networks represent a significant departure from traditional wired networks due to the distinguishing characteristics of both the wireless channel and mobile devices. Consequently, AODV incorporates many novel features for handling mobility, reduced capacity links, and the variable, indeterminate nature of the signaling range of wireless media. Since its initial design, AODV has evolved in a number of ways for improved performance, robustness, and better scalability. Nevertheless, we see many opportunities for continued improvement. This paper describes the current state of AODV, including its base functionality as well as optional features that improve performance and add capabilities. We also offer some direction for the continued evolution of AODV by presenting areas that can be targeted for future enhancements. Many of the described current and planned features are a result of AODV’s history and evolution within the Internet engineering task force. 相似文献