移动实时嵌套事务的并发控制

在移动计算环境中，事务移动性和无线网络固有的缺陷使得传统分布式实时事务管理机制不足以支持移动实时事务的执行，故有必要为移动实时事务研究新的事务处理机制以提高其成功率．该文着重研究移动实时事务的并发控制机制．首先，该文给出了一个考虑事务定时限制以及移动性的嵌套事务模型．然后，为减少移动分布式环境中解决数据冲突的开销，该文研究了一种结合优先级夭折和优先级继承的基于封锁的并发控制协议PAI-2PL．当高优先级事务被低优先级事务阻塞时，对于相同家族事务，采用优先级继承方法解决冲突；而对于不同家族事务，则夭折重启低优先级事务．另外，为减少由于断接所引起的无效阻塞，PAI-2PL允许低优先级事务夭折处于断接状态的高优先级事务．通过性能测试，表明所提出的事务模型及并发控制机制能提高实时事务的成功率．     

基于事件逻辑的无线Mesh网络认证协议安全性证明

无线Mesh网络是一种结合无线局域网和移动自组织网络的新型多跳网络,无线网络的开放性和资源受限性使得无线网络容易遭受重放、伪装等攻击。事件逻辑是一种描述并发与分布式系统中状态迁移和算法的形式化方法,可用于证明网络协议的安全性。以事件逻辑为基础提出一系列性质,其中包含多组合信息交互、不叠加、事件匹配、去重复、去未来,以降低协议分析过程中的冗余度以及复杂度,提高协议分析效率。对无线Mesh网络客户端双向认证协议进行分析,证明该协议能够抵抗中间人发起的重放攻击,无线Mesh客户端双向认证协议是安全的。此理论适用于类似复杂无线网络协议形式化分析。     

无线自组织网络中的IEEE802．11 MAC协议的研究

IEEES02．11 DCF作为无线局域网的MAC层规范被广泛应用于无线自组织网络的仿真和测试中。通过研究发现即使在拓扑不变的条件下，使用表驱动路由协议DSDV，TCP流仍然存在不稳定和不公平现象，本文分析了问题产生的原因，提出了基于网络负载的解决问题方法。     

Efficient Distributed Skyline Queries for Mobile Applications

In this paper, we consider skyline queries in a mobile and distributed environment, where data objects are distributed in some sites (database servers) which are interconnected through a high-speed wired network, and queries are issued by mobile units (laptop, cell phone, etc.) which access the data objects of database servers by wireless channels. The inherent properties of mobile computing environment such as mobility, limited wireless bandwidth, frequent disconnection, make skyline queries more complicated. We show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach, called efficient distributed skyline based on mobile computing (EDS-MC). In EDS-MC, a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication, network delay and query response time. We conduct extensive experiments in a simulated mobile database system, and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing.     

Revealing the problems with 802.11 medium access control protocol in multi-hop wireless ad hoc networks

The IEEE 802.11 medium access control (MAC) protocol is a standard for wireless LANs, it is also widely used in almost all test beds and simulations for the research in wireless mobile multi-hop ad hoc networks. However, this protocol was not designed for multi-hop networks. Although it can support some ad hoc network architecture, it is not intended to support the wireless mobile ad hoc network, in which multi-hop connectivity is one of the most prominent features. In this paper, we focus on the following question: can IEEE 802.11 MAC protocol function well in multi-hop networks? By presenting several serious problems encountered in transmission control protocol (TCP) connections in an IEEE 802.11 based multi-hop network, we show that the current TCP protocol does not work well above the current 802.11 MAC layer. The relevant problems include the TCP instability problem found in this kind of network, the severe unfairness problem, and the incompatibility problem. We illustrate that all these problems are rooted in the MAC layer. Furthermore, by revealing the in-depth cause of these problems, we conclude that the current version of this wireless LAN protocol does not function well in multi-hop ad hoc networks. We thus doubt whether the current WaveLAN based system is workable as a mobile multi-hop ad hoc test bed. All the results shown in this paper are based on NS2 simulations, and are compatible with the results from the OPNET simulations.     

Using feedback in collaborative reinforcement learning to adaptively optimize MANET routing

Designers face many system optimization problems when building distributed systems. Traditionally, designers have relied on optimization techniques that require either prior knowledge or centrally managed runtime knowledge of the system's environment, but such techniques are not viable in dynamic networks where topology, resource, and node availability are subject to frequent and unpredictable change. To address this problem, we propose collaborative reinforcement learning (CRL) as a technique that enables groups of reinforcement learning agents to solve system optimization problems online in dynamic, decentralized networks. We evaluate an implementation of CRL in a routing protocol for mobile ad hoc networks, called SAMPLE. Simulation results show how feedback in the selection of links by routing agents enables SAMPLE to adapt and optimize its routing behavior to varying network conditions and properties, resulting in optimization of network throughput. In the experiments, SAMPLE displays emergent properties such as traffic flows that exploit stable routes and reroute around areas of wireless interference or congestion. SAMPLE is an example of a complex adaptive distributed system.     

Mobile code daemons for networks of embedded systems

Originally implemented to support wireless sensor networks, the lightweight mobile code daemons works on wired networks as well. The mobile code daemon we present is based on a core network protocol called the remote execution and action protocol (REAP), which is responsible for passing messages between nodes within our network. The authors have implemented them to run on multiple operating systems and architectures. The daemons use a peer-to-peer indexing scheme to find mobile code packages as needed. Calls to the daemons are automatically dereferenced to find the proper package for a node's OS and hardware.     

基于IEEE1451的靶场分布式无线传感器网络构建方案

摘要：为了解决兵器试验靶场“异常弹”和散布大的弹箭的弹着点定位问题，提出了基于IEEE1451标准和ZigBee、WiFi通信协议构建一种异构分簇网络的方案。论文首先介绍了IEEE 1451 协议族，阐述了系统总体结构，对比了三中无线通讯协议，优选出ZigBee、WiFi通信协议构建无线传感器网络。针对靶场分布式测试结构，给出了簇头资源分配方案和簇头节点、网关节点硬件设计方案及结构设计方案。最后，分析了IEEE1451协议的实现形式，并详细讨论了服务器端的软件设计、功能模块划分。实验结果表明：该方案实现了靶场上多节点多通信方式的无线传感器网络构建，网络具有良好的稳定性、扩展性及远程控制能力，为其他无线传感器网络构建提供了很好的应用案例     

A novel group key agreement protocol for wireless mesh network

Group key agreement is the core of secure group communication. In wireless networks, the privacy problem becomes more crucial and urgent for mobile users due to the open nature of radio media. In this paper, we proposed a novel group key agreement protocol based on trusted third Party, applied in collaboration between mobile users for wireless Mesh network. The security verification (PCL logic) and performance analysis show that, our protocol not only provides privacy protection for group members, but also authenticates all participants by adopting certificates. More important, in the proposed protocol, the computation cost and traffics for each group member are largely reduced to improve the implementation efficiency of the protocol. Therefore, our protocol is a novel, reliable group key agreement protocol, and it is well suited for wireless mesh network.     

移动自组网中的MAC地址动态分配

减小动态源路由协议DSR的开销、提高无线信道的利用率的关键是在协议运行时,使用1 B的MAC地址对节点进行标识。该文研究了如何为特定IP地址标识的网络节点动态分配MAC地址,实现了一种基于预测的无冲突MAC地址动态分配方法,其中所引入的开销较低。实际应用表明,该分配方法具有较强的适用性、可靠性。     

移动自组网中的MAC地址动态分配

减小动态源路由协议DSR的开销、提高无线信道的利用率的关键是在协议运行时,使用1 B的MAC地址对节点进行标识.该文研究了如何为特定IP地址标识的网络节点动态分配MAC地址,实现了一种基于预测的无冲突MAC地址动态分配方法,其中所引入的开销较低.实际应用表明,该分配方法具有较强的适用性、可靠性.     

An efficient synchronization scheme of multimedia streams in wireless and mobile systems

Recent advances in mobile computing and distributed multimedia systems allow mobile hosts (clients) to access wireless multimedia systems anywhere and at anytime, but not without creating a new set of issues and trade-offs. To the best of our knowledge, there has been very little research in dealing with the synchronization problem in wireless and mobile multimedia systems. In this paper, we propose an efficient distributed synchronization algorithm using quasi-sink for wireless and mobile multimedia systems to ensure and facilitate mobile client access to multimedia objects. We discuss the algorithm and provide its proof of correctness. We also present a set of simulation experiments to evaluate the performance of our scheme using message complexity and buffer usage at each frame arrival time. Our results indicate that our scheme exhibits a significant low message complexity and no underflow and overflow within the bounded delivery time.     

An election protocol based on group membership detection algorithm in mobile ad hoc distributed systems

The election model can be used as a composing element to solve many practical problems such as mutual exclusion, consensus problem and reliable broadcasting in which a control function would be useful. This model has been deeply examined in the study group since the motive for this much interest is that networked computer system paradigms require a coordinator such as leader. In spite of its importance, there is only a few study that has been contributed to this coordinator election model in an ad hoc distributed system. Mobile distributed computing systems are more inclined to faults than traditional computer systems. To build an election protocol in such a mobile computing environment is not trivial. Because it is difficult task to choose a unique process from a group of mobile processes as a coordinator in spite of failures or disconnections of mobile processes. In this paper, we present an election protocol in mobile ad hoc distributed systems and we discuss some simulation results.     

A reliable multicast protocol for distributed mobile systems:design and evaluation

Reliable multicast is a powerful communication primitive for structuring distributed programs in which multiple processes must closely cooperate together. We propose a protocol for supporting reliable multicast in a distributed system that includes mobile hosts and evaluate the performance of our proposal through simulation We consider a scenario in which mobile hosts communicate with a wired infrastructure by means of wireless technology. Our proposal provides several novel features. The sender of each multicast may select among three increasingly strong delivery ordering guarantees: FIFO, causal, total. Movements do not trigger the transmission of any message in the wired network as no notion of hand-off is used. The set of senders and receivers (group) may be dynamic. The size of data structures at mobile hosts, the size of message headers, and the number of messages in the wired network for each multicast are all independent of the number of group members. The wireless network is assumed to provide only incomplete spatial coverage and message losses could occur even within cells. Movements are not negotiated and a mobile host that leaves a cell may enter any other cell, perhaps after a potentially long disconnection. The simulation results show that the proposed protocol has good performance and good scalability properties     

认知中继网络中的功率分配算法

无人机（Unmanned aerial vehicle, UAV）通信是当前无线通信领域的研究热点。为了保证地面移动端与UAV通信的可靠性,提出了基于空时块码（Space-time block code, STBC）的协作中继传输方案。为了提升频谱效率,本文利用认知无线电技术,于协作中继处分别采用放大转发(Amplify-and-forward, AF)和解码转发(Decode-and-forward, DF)两种协议进行传输,在主用户通信服务质量得到保证和认知用户传输功率受限的条件下,建立以认知中继网络的吞吐量最大化为目标函数的优化问题。采取拉格朗日乘子法与Karush-Kuhn-Tucker (KKT)条件相结合的方案来实现优化问题中最优功率的分配。最后,仿真结果不仅验证了所提方案的有效性,还表明了DF中继协议下认知中继网络的吞吐量优于AF中继协议。     

A novel network mobility handoff scheme using SIP and SCTP for multimedia applications

In a heterogeneous wireless environment, seamless mobility is the basis of network support with which mobile users who roam between or among various wireless access networks are able to fully enjoy uninterrupted wireless services. When users are in a mass transportation vehicle, e.g., a bus or a train that provides network service, the vehicle can be regarded as a network which is serving users as it moves from one location to another. The movement of a network is called network mobility (NEMO). The network mobility protocol based on Mobile IPv6 as proposed by the Internet Engineering Task Force (IETF) in 2005 has some fundamental drawbacks, such as header overhead and the pinball problem. In this paper, we propose a novel hybrid method for network mobility called Hybrid-NEMO, which provides a soft handoff scheme at the transport layer basically utilizing SIP and SCTP protocols to ensure a lossless packet-transmission environment and less handoff-delay variation, which are critical in providing QoS voice and multimedia applications. Experimental validation and performance evaluation were also conducted in this study.     

无线Internet的业务质量及其改进

在移动网络中,移动用户对Internet的访问,具有与通常的外部Internet网络不同的特点。移动用户发出的对信息内容的请求(例如询问前方交通情况和路线),以及无线Internet信息提供商主动向移动用户发出的信息(例如移动用户附近的商品信息广告),与移动用户的位置、移动状态(方向、速度)和个人情况(userprofile)等有关。因此,要建立恰当的无线Internet流量模型和实现QoS(业务质量)控制,需要考虑用户的移动特性和在不同移动状态下访问Internet的概率分布。该文将建立一个新的定量分析模型,用半马尔可夫过程和一般的状态空间来描述移动用户的行为;并基于该移动模型,建立相应的移动用户对信息内容的访问模型、描述移动用户请求的到达过程;进而得到无线Internet业务质量参数的估计,即无线Internet对移动用户请求的平均响应时间、对无线侧和有线侧传输带宽的需求等;利用这些结果,可以实现无线资源的动态分配和允入控制。该文还将分析无线代理网关的性能、缓存容量需求,并给出改善平均响应时间的可行方案。最后用计算机模拟对提出的理论分析进行验证。     

EMPOWER: a cluster architecture supporting network emulation

Network research generally requires a simulation or emulation environment to test protocol implementations, to evaluate the performance of a scheme or a system, and to study complicated and highly varying network operations. For large network simulation, simulators consume a large amount of time and memory; and its result is largely based on some modeling assumptions that may not hold in the real world. Emulators are difficult to scale for large network emulation because of the high cost of equipment if a one-to-one mapping scheme is employed. Otherwise, the target network has to be abstracted to a single router modeled with some performance metrics. We present a distributed IP network emulator cluster EMPOWER, which not only can be used to emulate a large network with a limited number of commodity computers, but also can generate user-defined arbitrary network conditions and traffic dynamics at packet level for specific test scenarios. EMPOWER is highly scalable in that each emulator node could be configured to emulate multiple network nodes, and the increment of the number of emulator nodes does not affect emulation validity. Some significant research issues such as network mapping and mobile wireless network emulation are discussed and addressed. Preliminary emulation results show that EMPOWER is capable of assisting the study of both wireline and wireless network protocols and applications.     

The anatomy study of server-initial agreement for general hierarchy wired/wireless networks

The Byzantine Agreement (BA) plays a key role in fault-tolerant distributed system design. A number of solutions to the BA problem based on various network model assumptions have been proposed. However, most existing BA protocols are designed for pure wired or pure wireless networks. In practice, most current networks are combined wired and wireless environments. In this paper, we extend the BA problem over a combined wired/wireless network, consisting of both powerful computing stationary processor and low-power mobile processor. The communication overhead of BA protocol is inherently large and secure group communications are important. The protocols proposed in this paper use the hierarchical model concept to reduce the communication overhead and provide secure group communications well suited for combined wired/wireless networks.     

Intra domain route optimization for ubiquitous network

The main advantage of a wireless network is user mobility, which calls for efficient routing support at the network layer. An architecture combines hierarchical mobile IPv6 and network mobility for a network mobile and mobile nodes move in tandem and make a hierarchy in the wireless network to management of micro-mobility and seamless handoff. But the capability of the architecture for intra domain route optimization is impaired. So we propose functionality in domain nodes to enable intra domain path optimization for ubiquitous network. It is shown that intra domain cost effect is beneficial in every hierarchical domain that spans mesh network topology. We address the key function for our proposed scheme and analyze the usefulness of our proposed method using mathematically. We show that our proposed scheme performs much better than Network Mobility protocol, especially when the number of mobile nodes or mobile routers or correspondent nodes increases in hierarchically nested in ubiquitous networks.