Dynamic Task-Based Anycasting in Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) have received significant attention in the recent past owing to the proliferation in the numbers of tetherless portable devices, and rapid growth in popularity of wireless networking. Most of the MANET research community has remained focused on developing lower layer mechanisms such as channel access and routing for making MANETs operational. However, little focus has been applied on higher layer issues, such as application modeling in dynamic MANET environments. In this paper, we present a novel distributed application framework based on task graphs that enables a large class of resource discovery based applications on MANETs. A distributed application is represented as a complex task comprised of smaller sub-tasks that need to be performed on different classes of computing devices with specialized roles. Execution of a particular task on a MANET involves several logical patterns of data flow between classes of such specialized devices. These data flow patterns induce dependencies between the different classes of devices that need to cooperate to execute the application. Such dependencies yield a task graph (TG) representation of the application.We focus on the problem of executing distributed tasks on a MANET by means of dynamic selection of specific devices that are needed to complete the tasks. In this paper, we present simple and efficient algorithms for dynamic discovery and selection (instantiation) of suitable devices in a MANET from among a number of them providing the same functionality. This is carried out with respect to the proposed task graph representation of the application, and we call this process Dynamic Task-Based Anycasting. Our algorithm periodically monitors the logical associations between the selected devices, and in the event of a disruption in the application owing to failures in any component in the network, it adapts to the situation and dynamically rediscovers the affected parts of the task graph, if possible. We propose metrics for evaluating the performance of these algorithms and report simulation results for a variety of application scenarios differing in complexity, traffic, and device mobility patterns. From our simulation studies, we observed that our protocol was able to instantiate and re-instantiate TG nodes quickly and yielded high effective throughput at low to medium degrees of mobility and not much below 70% effective throughput for high mobility scenarios.     

基于定位辅助和能量有效的超宽带网路由算法

文中在分析了超宽带（Ultra-Wideband，UWB）技术特点的基础上，与Ad Hoc网络已有的路由协议结合，提出了一种基于定位辅助和能量有效的超宽带自组网路由算法。仿真表明，该算法能够显著延长网络生存时间，均衡节点电量消耗。     

Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called Dynamic Source Routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Our modeling effort shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. We perform some simulation experiments which validate these findings.     

A Cross-layer Approach to Channel Assignment in Wireless Ad Hoc Networks

To improve the capacity of wireless ad hoc networks by exploiting multiple available channels, we propose a distributed channel assignment protocol that is based on a cross-layer approach. By combining channel assignment with routing protocols, the proposed channel assignment protocol is shown to require fewer channels and exhibit lower communication, computation, and storage complexity than existing channel assignment schemes. A multi-channel MAC (MC-MAC) protocol that works with the proposed channel assignment protocol is also presented. We prove the correctness of the proposed channel assignment protocol. In addition, through a performance study, we show that the proposed protocol can substantially increase throughput and reduce delay in wireless ad hoc networks, compared to the IEEE 802.11 MAC protocol and an existing multi-channel scheme.

SWAN模型速率控制模块性能分析及改进

SWAN是Ad Hoe网络中的一种无状态网络协议,利用分布式控制算法来传递分类服务。这种QoS模型把数据业务分为两类进行不同处理,即对尽力而为的UDP和TCP业务采用速率控制的策略而对实时的UDP业务采用基于源节点的接纳控制策略。本文修改了SWAN模型的速率控制模块,引入队列调度机制,对从上层来的尽力而为数据包进行排队、调度,使其尽可能公平地占用新到资源。在分析中具体给出了修改后速率控制模块的实现过程。通过仿真分析了AIMD算法的参数对修改后速率控制模块性能的影响。     

An Approach for Modestly Directional Communications in Mobile Ad Hoc Networks

Directional antennas are a promising technology for use in mobile ad hoc environments. By consuming smaller volumes than omni directional antennas, directional antennas enable significant increases in network capacity by allowing more simultaneous transmissions to occur within a multihop wireless network. In this paper, we present some of the challenges that face asynchronous directional channel access schemes and describe how these problems can be avoided by taking a synchronous approach. We describe a communications system architecture that enables modestly directional sectored antennas to be effectively exploited in a mobile ad hoc environment. A key part of this architecture is the Directional Synchronous Unscheduled Multiple Access (DSUMA) protocol. By making intelligent decisions regarding the enabling/disabling of sector antennas, DSUMA provides an increased density of transmissions while insuring that collisions do not occur. Our results indicate how the number of sectors per node affects performance in terms of spatial reuse, the likelihood of collisions, and overall network capacity.     

移动无线ad hoc网络吞吐量的计算

在网络拓扑满足网络各种不同性能指标下,本文提出了一种新的转发策略和功率控制策略来估计ad hoc网络的吞吐量.实验结果证明:该方法能够有效的估算和提高ad hoc网络的吞吐量.     

Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.     

Replication of Routing Tables for Mobility Management in Ad Hoc Networks

Ad Hoc networking is a rather old technology that is gaining new momentum in the research community. It is still an area under development and there are several proposals for the technology regarding routing protocols, addressing, interoperability, etc. Because of the extreme conditions where Ad Hoc networks should operate, it is envisioned that in medium to large scale networks, a hybrid proactive and reactive routing mechanism should be used. Therefore, considering the proactive routing protocols as the most suitable protocol for certain topologies in Ad Hoc networks, this paper proposes a specific layered structure to enable both technologies in a seamless manner. This approach supports both reactive (e.g., AODV, DSR) and proactive link state (e.g., OLSP) protocols. The proposed layered structure divides the routing problem into different parts, where one module performs the routing algorithm, another module takes care of replicating and synchronizing the routing tables, and a third one evaluates the routing information for triggering hand-over signals to the upper layers. The overall responsibility for selecting the appropriate routing schema and for initiating the roaming process resides on a proposed Context Sensitive Roaming Layer. This paper describes the interface and the functions implemented by the Roaming Layer. The paper also analyses replication using the Server Cache Synchronization Protocol (SCSP). Finally, the last part of the paper describes the demand for Ad Hoc networks, which is driven by applications supported with an appropriate billing or bonus mechanism.     

Authenticated Ad Hoc Routing at the Link Layer for Mobile Systems

We have designed an authenticated link-level ad hoc routing protocol and integrated it with the Portland State University implementation of Mobile-IP. The routing protocol addresses link security issues. In our protocol, mobile nodes, as well as agents, broadcast ICMP router discovery packets. The router discovery packets are authenticated and bind the sender's MAC and IP addresses. Problems caused by tying IP subnet schemes to routing on radio links are eliminated. Security problems associated with ARP spoofing are also reduced. This link-level protocol is integrated with Mobile-IP on links where increased security is needed. The protocol replaces ARP, and may be integrated with higher-level multi-hop ad hoc routing protocols.     

MARE: Resource Discovery and Configuration in Ad Hoc Networks

The emergence of personal portable devices, such as PDA's and Mobile phones, with considerable processing and communication capabilities, has led to a desire to use various combinations of these devices together to achieve new and as yet unrealised operations. Not only are mobile devices expected to offer conventional facilities like email and web browsing but also more demanding multimedia applications. Attaining these operations within a fixed network environment with high-power workstations is non-trivial; however, highly dynamic ad hoc environments further complicate this scenario. In particular, a means of discovering available devices and enabling manipulation of them within a highly active environment is required. In this paper we present a novel architecture called MARE that facilitates the detection and manipulation of resources in ad hoc environments.     

Transmission Range-Aware Clustering for Green Cognitive Radio Ad Hoc Networks

The absence of network infrastructure and opportunistic spectrum access in cognitive radio ad hoc networks (CRAHNs) results in connectivity and stability problems. Clustering is known as an effective technique to overcome this problem. Clustering improves network performance by implementing a logical network backbone. Therefore, how to efficiently construct this backbone among CRAHNs is of interest. In this paper, we propose a new clustering algorithm for CRAHNs. Moreover, we model a novel cluster head selection function based on the channel heterogeneity in term of transmission ranges. To the best of our knowledge, this is the first attempt to model the channel heterogeneity into the clustering formation in cognitive radio networks. Simulation results show that the performance of clustering is significantly improved by the channel heterogeneity considerations.     

一种低时延的短波自组网优化链路状态路由协议

优化链路状态路由(Optimized Link State Routing,OLSR)协议是一种先验式路由协议,网络中的所有节点通过周期性地发送控制消息来计算全网路由信息。在短波自组织网络中,节点周期性地发送控制消息会占据大量的信道资源,大幅增加网络的控制开销,浪费短波有限的带宽资源,导致网络通信性能急剧下降。其次,受到地形地貌、天线方向和接收性能的个体差异等影响,造成无线链路不稳定,导致网络中存在非对称链路,增加了通信端到端时延。为此,提出了一种低时延的短波自组网OLSR协议。该协议在执行MPR(Multipoint Relay)选择算法时综合考虑了节点的连接度和链路可靠性,在优化MPR节点个数的同时选择链路可靠性较大的节点作为MPR节点,在进行路由选择时能够利用网络中的非对称链路。仿真结果表明,该协议能优化数据包投递成功率、吞吐量、端到端时延和网络控制开销等性能指标。     

Cross-Layering Approaches in Wireless Ad Hoc Networks

Wireless ad hoc networks are temporary formed, infrastructureless networks. Due to the unstable channel conditions and network connectivity, their characteristics impose serious challenges in front of network designers. The layering approach to network design does not fit the ad hoc environment well. Therefore, various cross-layering approaches, where protocol layers actively interact, exchange inherent layer information and fine tune their parameters according to the network status are becoming increasingly popular. This paper presents an in-depth analysis of the latest cross-layering approaches for wireless ad hoc networks supported by several examples. A special emphasis is put on the link and network layer related cross-layer designs. Several link adaptation and efficient service discovery schemes are elaborated through analytical and simulation studies. Their performance shows the potentials of the cross-layering for boosting system characteristics in wireless ad hoc networks. Liljana Gavrilovska currently holds a position of full professor at Faculty of Electrical Engineering, University “St. Cyril and Metodij” – Skopje, Macedonia. She is chief of Telecommunications Laboratory and teaches undergraduate courses in telecommunication networks, data transmission and switching and traffic theory, and graduate courses in wireless, mobile and personal networks, teletraffic engineering and planning, and broadband multiservices networks. In 2000 she joined the Center for PersonKommunikation, Aalborg University, Denmark, as a visiting professor and during 2001--2002 she held a position of associate research professor at the same university. Currently she holds a part-time position of associated research professor with Center for Teleinfrastructur (CTIF). Prof. Gavrilovska was involved in several EU (ACTS ASAP, IST PACWOMAN, MAGNET, TEMPUS) and national/international projects. She published numerous conference and journal papers and participated in several workshops. At the moment she is working on the book “Ad Hoc Networking Towards Seamless Communications” together with prof. R. Prasad. Her research interests include wireless and personal area networks, ad hoc networking, networking protocols, traffic analysis, QoS, and optimization techniques. She is a senior member of IEEE and serves as a Chair of Macedonian Communication Chapter.     

MIMO链路Ad Hoc网络中线程化的拓扑未知多址接入协议

针对MIMO链路Ad Hoc网络,提出了支持MIMO的线程化拓扑未知多址接入协议(MIMO-T-TTMA).MIMO-T-TTMA将时间扩展多址接入(TSMA)协议和时分多址接入(TDMA)协议以时间交替的方式相结合,进而为网络中节点分配时隙.在MIMO-T-TTMA中,每个节点被分配了若干时隙,每个分配时隙中,节点通过交互请求发送/允许发送(RTS/CTS)分组来确定发送使用的数据流数,而当RTS/CTS交互失败或者当前时隙为未分配时隙时,节点仍依一定的概率发送一个数据流,以提高网络的吞吐量.为了评估协议的性能,推导了MIMO-T-TTMA的吞吐量.数值结果表明,与已有的协议相比,MIMO-T-TTMA在节点度较大时具有较高的吞吐量,并且,吞吐量随节点度的变化比较平稳,因此,MIMO-T-TTMA适用于拓扑常发生剧烈变化的Ad Hoc网络.     

Scalable Routing Protocol for Ad Hoc Networks

In this paper we present a scalable routing protocol for ad hoc networks. The protocol is based on a geographic location management strategy that keeps the overhead of routing packets relatively small. Nodes are assigned home regions and all nodes within a home region know the approximate location of the registered nodes. As nodes travel, they send location update messages to their home regions and this information is used to route data packets. In this paper, we derive theoretical performance results for the protocol and prove that the control packet overhead scales linearly with node speed and as N ^3/2 with increasing number of nodes. These results indicate that our protocol is well suited to relatively large ad hoc networks where nodes travel at high speed. Finally, we use simulations to validate our analytical model.     

一种提高802.11无线Ad Hoc网络公平性的新机制-FFMA

实现多个数据流对无线信道的公平共享是802.11无线Ad Hoc网络中的一个重要议题,但802.11DCF机制在无线Ad Hoc网络中存在严重的公平性问题,甚至有可能出现单个节点或数据流独占信道而其他节点和数据流处于"饥饿"状态的情况.论文提出了一种新颖的保证数据流间公平性的MAC层接入机制FFMA(Flow rate-based Fair Medium Access),通过公平调度和公平竞争的方式,FFMA能够在数据流间公平地分配信道带宽资源.仿真结果表明,在无线Ad Hoc网络中,FFMA可以在保证信道吞吐量的前提下取得远优于802.11 DCF的数据流间的公平性.     

DV Based Positioning in Ad Hoc Networks

Many ad hoc network protocols and applications assume the knowledge of geographic location of nodes. The absolute position of each networked node is an assumed fact by most sensor networks which can then present the sensed information on a geographical map. Finding position without the aid of GPS in each node of an ad hoc network is important in cases where GPS is either not accessible, or not practical to use due to power, form factor or line of sight conditions. Position would also enable routing in sufficiently isotropic large networks, without the use of large routing tables. We are proposing APS – a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.     

基于HELLO机制的MANET与Internet高效互联

文章提出一种基于AODV HELLO机制的移动自组网与Internet互联方案。该方案直接在AODV HELLO分组中包含网关信息以及相邻节点列表．从而在无需引入额外控制分组的前提下进行网关发现并同时避免了在路由计算中引入单向链路。结合使用高效的半隧道转发机制，使得互联性能得到显著提升而开销合理，基于NS2的仿真结果显示了其有效性。     

Extending Global IP Connectivity for Ad Hoc Networks

Ad hoc networks have thus far been regarded as stand-alone networks without assumed connectivity to wired IP networks and the Internet. With wireless broadband communications and portable devices with appropriate CPU, memory and battery performance, ad hoc connectivity will become more feasible and demand for global connectivity through ad hoc networking is likely to rapidly grow. In this paper we propose an algorithm and describe a developed prototype for connectivity between an ad hoc network running the ad hoc on-demand distance-vector protocol and a wired IP network where mobile IP is used for mobility management. Implementation issues and performance metrics are also discussed.