HTML5技术在移动管理驾驶舱中的应用

移动系统平台多样化以及各移动系统开发平台互不兼容,使移动应用开发周期长移植性差。为解决移动应用能够实现一次开发多处运行的问题,提出基于HTML5的移动应用跨平台解决方案。基于HTML5的跨移动平台特性,结合JavaScript、CSS等Web应用开发技术,实现iOS、Android两主流移动系统的跨平台开发,在移动管理驾驶舱系统中验证方案的可行性和实用性。该方案节省开发资源同时又满足移动应用的开发与销售模式。     

蜂窝网络中移动台越区漫游仿真研究

移动性管理(包括位置管理和切换管理)是移动通信领域的一个具有挑战性的问题,而位置管理涉及到位置更新和寻呼操作。在现行蜂窝系统中,一旦移动台越区(从一个位置区LA移动到另一个位置区LA),就需要进行位置更新。因此,移动台越区问题的研究,对蜂窝系统的设计、位置管理策略的制订与性能评价是非常重要的。该文给出越区漫游仿真算法,并对运行结果进行分析,最终得出:越区漫游有局部性。     

Novel route maintenance protocols for the Bluetooth ad hoc network with mobility

Bluetooth technology is specially designed for the wireless personal area networks to replace cable. Several challenges exist in Bluetooth scatternet formation and routing, since nodes can arrive and depart at arbitrary times. In this paper, novel route maintenance algorithms are proposed for the Bluetooth ad hoc networks, where nodes can enter or exit from the piconets time to time. Our protocols guarantee the connectivity among nodes and reconstruct the routes dynamically by considering location information of the nodes. Besides, it is proposed how to reduce the number of hops and to form the shortest route between the source and the destination due to addition of new nodes to a piconet. Performance analysis of our protocols show that they outperform in terms of end to end transmission delay, bandwidth consumption and average hop counts as compared to similar Bluetooth routing protocols that we have considered.     

Scalability of MANET routing protocols for heterogeneous and homogenous networks

In Mobile Ad hoc Network (MANET), mobility, traffic and node density are main network conditions that significantly affect performance of routing protocols. Much of the previous research in MANET routing have focused on developing strategies, which suit one specific networking scenario. Therefore, there is no existing protocol that can work well in all different networking scenarios. This paper reviews characteristics of several different classes of routing protocols. Moreover, most of current routing protocols assume homogeneous networking conditions where all nodes have the same capabilities and resources. This paper presents extensive studies simulations for DSR, AODV, LAR1, FSR and WRP in homogenous and heterogeneous networks that consist of different nodes with different resources. The results showed that while all protocols perform reasonably well in homogenous networking conditions, their performance suffer significantly over heterogonous networks.     

A network-based mobility management scheme for future Internet

The current Internet was originally designed for “fixed” terminals and can hardly support mobility. It is necessary to develop new mobility management schemes for the future Internet. This paper proposes an Identifiers Separating and Mapping Scheme (ISMS), which is a candidate for the future Internet mobility management, and discusses the basic principles and detailed message flow. ISMS is a network-based mobility management scheme that takes advantage of the identity and location separation. The mobility entities in the core network are responsible for the location management. ISMS is designed to satisfy the requirements of faster handover, route optimism, advanced management, location privacy and security. The average handover delay of ISMS is on the order of milliseconds only, which is far smaller than that of Mobile IPv6. Analyses show that ISMS can reduce packet overhead on wireless channels. We build a prototype and perform some experiments. Results verify the feasibility of ISMS.     

Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks

This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay-tolerant wireless sensor networks (DTWSN). These networks inherit their characteristics from both delay tolerant networks (DTN) and traditional wireless sensor networks. After introducing DTWSNs, three main problems in the design space of these networks are discussed: routing, data gathering, and neighbor discovery. A general protocol is proposed for DTWSNs based on opportunistic broadcasting in delay-tolerant networks with radio device on-off periods. Three performance measures are defined in the study: the energy for sending queries to ask for data from possible neighbors (querying energy), data transfer energy, and absorption time (delay). A simple yet accurate approximation for the data-transfer energy is proposed. An analytic model is provided to evaluate the querying energy per contact (epc). Simulation results for the data propagation delay show that the querying energy per contact measure obtained from the analytic model is proportional to the product of the querying energy and the delay. A practical rule of thumb for an optimal query interval in terms of delay and energy is derived from different parts of the study.     

Managing cohort movement of mobile sensors via GPS-free and compass-free node localization

A critical problem in mobile ad hoc wireless sensor networks is each node’s awareness of its position relative to the network. This problem is known as localization. In this paper, we introduce a variant of this problem, directional localization, where each node must be aware of both its position and orientation relative to its neighbors. Directional localization is relevant for applications that require uniform area coverage and coherent movement. Using global positioning systems for localization in large scale sensor networks may be impractical in enclosed spaces, and might not be cost effective. In addition, a set of pre-existing anchors with globally known positions may not always be available. In this context, we propose two distributed algorithms based on directional localization that facilitate the collaborative movement of nodes in a sensor network without the need for global positioning systems, seed nodes or a pre-existing infrastructure such as anchors with known positions. Our first algorithm, GPS-free Directed Localization (GDL) assumes the availability of a simple digital compass on each sensor node. We relax this requirement in our second algorithm termed GPS- and Compass-free Directed Localization (GCDL). Through experimentation, we demonstrate that our algorithms scale well for large numbers of nodes and provide convergent localization over time, despite errors introduced by motion actuators and distance measurements. In addition, we introduce mechanisms to preserve swarm formation during directed sensor network mobility. Our simulations confirm that, in a number of realistic scenarios, our algorithms provide for a mobile sensor network that preserves its formation over time, irrespective of speed and distance traveled. We also present our method to organize the sensor nodes in a polygonal geometric shape of our choice even in noisy environments, and investigate the possible uses of this approach in search-and-rescue type of missions.