Location Verification Systems in Emerging Wireless Networks

As location-based techniques and applications have become ubiquitous in emerging wireless networks, the verification of location information has become more important. In recent years, there has been an explosion of activity related to lo- cation-verification techniques in wireless networks. In particular, there has been a specific focus on intelligent transport systems because of the mission-critical nature of vehicle location verification. In this paper, we review recent research on wireless location verification related to vehicular networks. We focus on location verification systems that rely on for- mal mathematical classification frameworks and show how many systems are either partially or fully encompassed by such frameworks.     

Wireless Infrared Communication Systems and Networks

International Journal of Wireless Information Networks -     

UWB Systems for Wireless Sensor Networks

Wireless sensor networks are emerging as an important area for communications. They enable a wealth of new applications including surveillance, building control, factory automation, and in-vehicle sensing. The sensor nodes have to operate under severe constraints on energy consumption and form factor, and provide the ability for precise self-location of the nodes. These requirements can be fulfilled very well by various forms of ultra-wide-band (UWB) transmission technology. We discuss various techniques and tradeoffs in UWB systems and indicate that time-hopping and frequency-hopping impulse radio physical layers combined with simple multiple-access techniques like ALOHA are suitable designs. We also describe the IEEE 802.15.4a standard, an important system that adopts UWB impulse radio to ensure robust data communications and precision ranging. In order to accommodate heterogeneous networks, it uses specific modulation, coding, and ranging waveforms that can be detected well by both coherent and noncoherent receivers.      

Self-Organization of Complex Networks Applied to Wireless World Systems

This paper provides a brief overview of the role that self-organization can play in the next generation wireless networks (S. Dixit, WWRF 8bis Meeting, February 26–27, Beijing, China). First, we present the definition, scope, and applicability of self-organization to wireless world systems. Then we briefly articulate the need for self-organization, and some recent breakthrough advances in this emerging area of research. This is followed by high-level system architecture for future communication systems and some early mechanisms for self-organization. The paper concludes with the challenges in this new field with key research issues.     

Continuous versus Discrete Model in Autodiagnosis Systems for Wireless Networks

In the near future, several radio access technologies will coexist in Beyond 3G mobile networks (B3G), and they will be eventually transformed into one seamless global communication infrastructure. Self-managing systems (i.e., those that self-configure, self-protect, self-heal, and self-optimize) are the solution to tackle the high complexity inherent to these networks. In this context, this paper proposes a system for autodiagnosis in the Radio Access Network (RAN) of wireless systems. The malfunction of the RAN may be due not only to a hardware fault but also (and more difficult to identify) to a bad configuration. The proposed system is based on the analysis of Key Performance Indicators (KPIs) in order to isolate the cause of the network malfunction. In this paper, two alternative probabilistic systems are compared, which differ on how KPIs are modeled (continuous or discrete variables). Experimental results are examined in order to support the theoretical concepts, based on data from a live network. The drawbacks and benefits of both systems are studied, and some conclusions on the scenarios under which each model should be used are presented.     

Asymptotic Connectivity Properties of Cooperative Wireless Ad Hoc Networks

Extensive research has demonstrated the potential improvement in physical layer performance when multiple radios transmit concurrently in the same radio channel. We consider how such cooperation affects the requirements for full connectivity and percolation in large wireless ad hoc networks. Both noncoherent and coherent cooperative transmission are considered. For one-dimensional (1-D) extended networks, in contrast to noncooperative networks, for any path loss exponent less than or equal to one, full connectivity occurs under the noncoherent cooperation model with probability one for any node density. Conversely, there is no full connectivity with probability one when the path loss exponent exceeds one, and the network does not percolate for any node density if the path loss exponent exceeds two. In two-dimensional (2-D) extended networks with noncoherent cooperation, for any path loss exponent less than or equal to two, full connectivity is achieved for any node density. Conversely, there is no full connectivity when the path loss exponent exceeds two, but the cooperative network percolates for node densities above a threshold which is strictly less than that of the noncooperative network. A less conclusive set of results is presented for the coherent case. Hence, even relatively simple noncoherent cooperation improves the connectivity of large ad hoc networks.     

基于跨层设计的无线传感器网络新体系

无线传感器网络是资源受限的网络,网络中节点较简单且差异小,在许多应用背景中对实时性要求较高。而传统的分层网络体系开销较大且灵活性不高,跨层技术的产生可以弥补这些不足。论文分别从实时性、收集信息需要这两方面提出新的基于跨层技术的网络设计方案,以满足不同应用的需求。     

Localization in Wireless Networks with Post-improvement Using Estimation of Distances Between Unknown Nodes: Simulation and Experimental Evaluation

Localization is one of the most crucial issues for many applications. In this paper, several novel algorithms for the a posteriori improvement of the localization results in wireless networks are presented. All introduced algorithms extend the concept of Universal Improvement Scheme (UnIS) presented in our previous work. UnIS uses additional information about the network available during the localization. One concrete solution is represented by distances between couples of mobile nodes being localized. According to our concept, a corresponding mathematical model is being developed and simulated on the appropriate simulation platform. The outcome from the simulations is being validated by the empirical results obtained in a deployed wireless sensor network. Additionally, UnIS refinement is being compared to a well-known Kalman Filter technique.     

Hierarchical Group Location Tracking for Transportation Systems in Wireless Personal Communication Networks

A hierarchical group location tracking (HGLT) based on grouplocation tracking and hierarchical location update is proposed toreduce the location management cost for terrestrialtransportation systems (TSs) in personal communication networks. A global group location update (GGLU) and a local group locationupdate (LGLU) are performed to provide an accurate position for auser. The GGLU informs a virtual visitor location register of thecurrently camped-on location area and the LGLU informs the servingmobile switching center of the currently camped-on cell. Althoughthe LGLU is done each time a TS moves into a new cell, it causessmall increment in the signaling cost due to localized updates andgroup updates compared with the previous group location trackingscheme. The proposed scheme significantly reduces the paging costbecause the scheme pages only a camped-on cell using the LGLUinformation. Compared with the previous schemes, the HGLT reducesthe location management cost, and it is more efficient as thecost for paging a cell increases.     

On Implementation of Logical Time in Distributed Systems Operating over Wireless Data Networks

We address the problem of maintaining logical time in a distributed system operating over a wireless data network. In such a network a group of mobile nodes currently located in a specific area use services of a mobility service agent to communicate with each other and with the rest of the world. The graph model of the network is represented by fully-connected mesh of star-topology subgraphs. We discuss the complementary logical clocks for the wireline and wireless segment of the network and their integration into an isomorphic logical time system.     

First Passage Time Analysis in Wireless Sensor Networks for SPR and MPR Systems

In this paper, we study the performance of Slotted ALOHA in an elementary process in wireless sensor networks, in which sensors are activated by rare events and transmit packets to a single sink node within single hop. The time cost of the process can be viewed as a first passage time and we give the expectation of time and energy cost which is dependent on both the size of active nodes and their transmission rate by a first passage time analysis. Meanwhile, given the size of active nodes n, we demonstrated that the optimal transmission rate λ_min(n) by which the first passage time attains its minimum, is nearly . Our result indicates that time cost of the process in which each node transmits packet with transmission rate λ_min(n) increases nearly linearly with n increasing. We present the maximum likelihood estimate (MLE) of the size of active nodes from the viewpoint of sink nodes so that activated nodes can adjust its transmission rate to improve the performance of the process. Energy dissipation and time cost of the procedure in the channel model of Multi Packet Reception (MPR) are considered also. Numerical results indicate that both time cost and energy consumption of the procedure in MPR channel is superior to that in Single Packet Reception (SPR) channel while the transmission rate near or less than the optimal values with which time costs attain their minimum. Otherwise the energy dissipation in MPR channel is more than that in SPR channel although comparison of time cost in the above two channels reveals the superiority of MPR channel.

Scalability of Wireless Networks

This paper investigates the existence of scalable protocols that can achieve the capacity limit of c/radicN per source-destination pair in a large wireless network of N nodes when the buffer space of each node does not grow with the size of the network N. It is shown that there is no end-to-end protocol capable of carrying out the limiting throughput of c/radicN with nodes that have constant buffer space. In other words, this limit is achievable only with devices whose buffers grow with the size of the network. On the other hand, the paper establishes that there exists a protocol which realizes a slightly smaller throughput of c/radicNlogN when devices have constant buffer space. Furthermore, it is shown that the required buffer space can be very small, capable of storing just a few packets. This is particularly important for wireless sensor networks where devices have limited resources. Finally, from a mathematical perspective, the paper furthers our understanding of the difficult problem of analyzing large queueing networks with finite buffers for which, in general, no explicit solutions are available     

Incremental Redundancy and Link Adaptation in Wireless Local Area Networks Using Residue Number Systems

The paper explores the use of residue number systems (RNS) to incorporate incremental redundancy (IR) and link adaptation (LA) in wireless communication systems. This also explores the use of RNS to increase the transmission data rate and to enhance the privacy of a wireless network. By exploiting IR and LA further, one can design an appropriate coding scheme for transmission at the currently experienced SNR level. The proposed method is implemented in existing wireless local area network (WLAN) standards and simulated extensively to find its suitability. The results of simulation studies are discussed in details.     

A Differential Game-Theoretic Approach for the Intrusion Prevention Systems and Attackers in Wireless Networks

In this paper, we investigate the interactions between the intrusion prevention systems (IPSs) and attackers in wireless networks. We model this interactions as a non-cooperative differential game. In terms of model construction, each node is allowed to choose its optimal cost of resource consumption to contribute to the security problem depending on the state. We derive the optimal strategies for the attackers and the IPSs over time, respectively. Simulation analysis will be given to illustrate that the dynamic evolution of the defense strategy of the IPSs and the trajectory of the attackers based on the proposed scheme.     

校园网中的无线组网方案

文中首先介绍现存的无线网络技术，计论适用佼园网环境的无线组网方法。然后给出校园内局域网间、校园网间及校园网与ＣＥＲＮＥＴ地区网络中心之间的无线互连实例。最后介绍移动计算网络的概念，指出今后校园网中移动计算网络的实现方法。     

Cooperative Localization in Wireless Networks

Location-aware technologies will revolutionize many aspects of commercial, public service, and military sectors, and are expected to spawn numerous unforeseen applications. A new era of highly accurate ubiquitous location-awareness is on the horizon, enabled by a paradigm of cooperation between nodes. In this paper, we give an overview of cooperative localization approaches and apply them to ultrawide bandwidth (UWB) wireless networks. UWB transmission technology is particularly attractive for short- to medium-range localization, especially in GPS-denied environments: wide transmission bandwidths enable robust communication in dense multipath scenarios, and the ability to resolve subnanosecond delays results in centimeter-level distance resolution. We will describe several cooperative localization algorithms and quantify their performance, based on realistic UWB ranging models developed through an extensive measurement campaign using FCC-compliant UWB radios. We will also present a powerful localization algorithm by mapping a graphical model for statistical inference onto the network topology, which results in a net-factor graph, and by developing a suitable net-message passing schedule. The resulting algorithm (SPAWN) is fully distributed, can cope with a wide variety of scenarios, and requires little communication overhead to achieve accurate and robust localization.      

Wireless Technology in Industrial Networks

With the success of wireless technologies in consumer electronics, standard wireless technologies are envisioned for the deployment in industrial environments as well. Industrial applications involving mobile subsystems or just the desire to save cabling make wireless technologies attractive. Nevertheless, these applications often have stringent requirements on reliability and timing. In wired environments, timing and reliability are well catered for by fieldbus systems (which are a mature technology designed to enable communication between digital controllers and the sensors and actuators interfacing to a physical process). When wireless links are included, reliability and timing requirements are significantly more difficult to meet, due to the adverse properties of the radio channels. In this paper, we thus discuss some key issues coming up in wireless fieldbus and wireless industrial communication systems: 1) fundamental problems like achieving timely and reliable transmission despite channel errors; 2) the usage of existing wireless technologies for this specific field of applications; and 3) the creation of hybrid systems in which wireless stations are incorporated into existing wired systems.     

Keyless Security in Wireless Networks

Security and privacy issues in RFID technology gain tremendous popularity recently. However, existing work on RFID authentication problems always make assumptions such as (1) hash function can be fully employed in designing RFID protocols; (2) channels between readers and server are always secure. The first assumption is not suitable for EPC Class-1 Gen-2 tags, which has been challenged in many research work, while the second one cannot be directly adopted in mobile RFID applications where wireless channels between readers and server are always insecure. To solve these problems, in this paper, we propose a novel ultralightweight and privacy-preserving authentication protocol for mobile RFID systems. We only use bitwise XOR, and several special constructed pseudo-random number generators to achieve our aims in the insecure mobile RFID environment. We use GNY logic to prove the security correctness of our proposed protocol. The security and privacy analysis show that our protocol can provide several privacy properties and avoid suffering from a number of attacks, including tag anonymity, tag location privacy, reader privacy, forward secrecy, and mutual authentication, replay attack, desynchronization attack etc. We implement our protocol and compare several parameters with existing work, the evaluation results indicate us that our protocol significantly improves the system performance.