Identity-Based Attack Detection and Classification Utilizing Reciprocal RSS Variations in Mobile Wireless Networks

To provide ubiquitous services and the same real-time services as those available on the wired networks for mobile users, this paper proposes an efficient and intelligent QoS-aware mobility scheme, coined dynamic point forwarding scheme under mobility scenario in future all-IP wireless networks. Considering dynamic channel characteristics and user mobility in wireless networks, the proposed scheme takes advantage of both the point forwarding scheme in mobility management and dynamic RSVP (DRSVP) in QoS guarantee. Moreover, in order to overcome deficiencies in conventional point forwarding scheme, we develop a new decision criterion for performing forwarding chain update, which achieves a better trade-off between network resource consumed by routing path and signaling load for forwarding chain updates. Based on the performance analyses, our proposed scheme can substantially reduce more resource reservation than the conventional pointer forwarding scheme, thus it can achieve efficient resource utilization and guarantee QoS requirements of multimedia applications in the future wireless all-IP networks.

Human motion in the vicinity of a wireless link causes variations in the link received signal strength (RSS). Device-free localization (DFL) systems, such as variance-based radio tomographic imaging (VRTI) use these RSS variations in a wireless network to detect, locate and track people in the area of the network, even through walls. However, intrinsic motion, such as branches moving in the wind, rotating or vibrating machinery, also causes RSS variations which degrade the performance of a DFL system. In this paper, we propose and evaluate a subspace decomposition method subspace variance-based radio tomography (SubVRT) to reduce the impact of the variations caused by intrinsic motion. Experimental results show that the SubVRT algorithm reduces localization root mean squared error (RMSE) by 41%. In addition, the Kalman filter tracking results from SubVRT have 97% of errors less than 1.4 m, a 65% improvement compared to tracking results from VRTI.

Specific Absorption Rate (SAR) is used to measure the body tissue exposure to electromagnetic fields. This chapter describes how SAR values can be estimated from a deployed Wireless Local Area Network (WLAN). We carried out this work using the Received Signal Strength (RSS) obtained from the access points. This parameter is easily obtained by an ordinary wireless network scanner. RSS variations are measured for a different number of people in the same room and without people. It will allow us to estimate how much energy is absorbed by a group of people and by a single person on average. Moreover, we have included the weight of the people in order to know the RSS lost by kilogram. These measurements were taken at the Higher Polytechnic School of Gandia, Universitat Politècnica de València, Spain, in two placements: the library and inside an anechoic camera.

Wireless networks are vulnerable to many identity-based attacks in which a malicious device uses forged MAC addresses to masquerade as a specific client or to create multiple illegitimate identities. For example, several link-layer services in IEEE 802.11 networks have been shown to be vulnerable to such attacks even when 802.11i/1X and other security mechanisms are deployed. In this paper we show that a transmitting device can be robustly identified by its signalprint, a tuple of signal strength values reported by access points acting as sensors. We show that, different from MAC addresses or other packet contents, attackers do not have as much control regarding the signalprints they produce. Moreover, using measurements in a testbed network, we demonstrate that signalprints are strongly correlated with the physical location of clients, with similar values found mostly in close proximity. By tagging suspicious packets with their corresponding signalprints, the network is able to robustly identify each transmitter independently of packet contents, allowing detection of a large class of identity-based attacks with high probability.

Unnecessary handoff is one of the key issues in mobile wireless network, since it consumes the network's resources that degrades the performance of the network. Handoff appears when the Receive Signal Strength (RSS) of a mobile node becomes below threshold value (i.e., an acceptable level of RSS for ensuring communication). Subsequently, the mobile node starts scanning to discover a new RSS from neighbors Access Point (AP) to keep continuing the communication. However, traditional handoff algorithm is not accurate due to only depend on the RSS. It is affected by many factors (e.g., shadowing, scattering, reflection, etc.) that initiate unnecessary handoff decision. In this paper, a new technique is proposed to mitigate the unnecessary handoff. The simulation result confirms the effectiveness of the proposal.

Fingerprinting is a widely used positioning technology for received signal strength (RSS) based wireless local area network (WLAN) positioning system. Though spatial RSS variation is the key factor of the positioning technology, temporal RSS variation needs to be considered for more accuracy. To deal with the spatial and temporal RSS characteristics within a unified framework, this paper proposes an extended signal propagation mode (ESPM) and a fingerprint generation method. The proposed spatiotemporal fingerprint generation method consists of two algorithms running in parallel; Kalman filtering at several measurement-sampling locations and Kriging to generate location fingerprints at dense reference locations. The two different algorithms are connected by the extended signal propagation model which describes the spatial and temporal measurement characteristics in one frame. An experiment demonstrates that the proposed method provides an improved positioning accuracy.

For wireless sensor networks, received signal strength (RSS) and proximity (also known as connectivity) measurements have been proposed as simple and inexpensive means to estimate range between devices and sensor location. While RSS measurements are recognized to suffer from errors due to the random nature of the fading channel, proximity measurements, ie., knowing only whether or not two devices are in communication range, are often discussed without considering that they are affected by the same fading channel. Proximity measurements are actually just a binary quantization of RSS measurements. We use the Cramér-Rao bound (CRB) to compare the minimal attainable variances of unbiased sensor location estimators for the cases of RSS and proximity measurements. For completeness, we also present the CRB for sensor localization with systems using K-level quantized RSS (QRSS) measurements, of which proximity measurements are the special case: K=2. Examples are presented for the case of one unknown-location sensor, and for the case of a 5 by 5 grid of sensors. These examples show that lower bounds for standard deviation in proximity-based systems are, as a rule of thumb, about 50% higher than the bounds for RSS-based systems. Furthermore, results are presented which show how many bits of quantization are necessary for a QRSS-based system to nearly achieve the bounds of an unquantized RSS system.

Traditional distance learning is based on wire network, such as internet, cable television network, telephone network and so on. With the development of wireless mobile network, there are many advantages such as without time and space limit, so it can bring some chance for distance learning video living and video on demand. In the text, we discussed distance learning history and development, wireless network development, and the designing video living and video on demand based on wireless mobile network, at last, the conclusion was given. The terminal users can get distance learning video living and video on demand service through the wireless network.

The use of directional antennas in mobile wireless networks has emerged recently due to their numerous advantages such as high gain, low interference and low transmission power to reach the same distance as omni antennas. However, directional antennas limit the coverage and connectivity in the network. In this paper, we propose an algorithm to calculate a topology preserving map for wireless sensor networks using directional antennas. In the literature, topology mapping have been proposed for sensor networks equipped with omni antennas; however, to the best of our knowledge none of the existing work has considered the use of directional antennas in sensor network topology mapping. The application of existing algorithms in directional sensor networks will consume significantly high energy, as it requires transmitting the number of sectors times more beacon messages to cover the omini antenna range. Thus in this paper, a novel beacon forwarding algorithm limiting the number of forwarding sectors based on packet received direction is proposed. The simulation results show that it is possible to generate an accurate topology preserving map can be generated by only forwarding beacons in total of 135° angle. Moreover, the energy and the number of edges used to generate the topology map can be reduced by nearly 50% compared to the topology map generation with omni antennas based on received signal strength and hop count.

Network protocols in cellular wireless data networks must update routes as a mobile host moves between cells. These routing updates combined with some associated state changes are called handoffs. Most current handoff schemes in wireless networks result in data loss or large variations in packet delivery times. Unfortunately, many applications, such as real-time multimedia applications and reliable transport protocols, adapt to long term estimates of end-to-end delay and loss. Violations and rapid fluctuations of these estimates caused by handoff processing often result in degraded performance. For example, loss during handoff adversely affects TCP performance [4], and high packet loss and variable delays result in poor real-time multimedia performance. In this paper, we describe a multicast-based protocol that eliminates data loss and incurs negligible delays during a handoff. The basic technique of the algorithm is to anticipate a handoff using wireless network information in the form of received signal strengths and to multicast data destined for the mobile host to nearby base stations in advance. This routing, combined with intelligent buffering techniques at the base stations, enables very rapid routing updates and eliminates data loss without the use of explicit data forwarding. We have implemented this protocol using IP Multicast and Mobile IP-like routing. In our implementation, handoffs typically take between 8 and 15 ms to complete and result in no data loss.

The tremendous demands from social market are pushing the booming development of mobile communications faster than ever before, leading to plenty of new advanced techniques emerging. With the converging of mobile and wireless communications with Internet services, the boundary between mobile personal telecommunications and wireless computer networks is disappearing. Wireless networks of the next generation need the support of all the advances on new architectures, standards, and protocols. Mobility management is an important issue in the area of mobile communications, which can be best solved at the network layer. One of the key features of the next generation wireless networks is all-IP infrastructure. This paper discusses the mobility management schemes for the next generation mobile networks through extending IP's functions with mobility support. A global hierarchical framework model for the mobility management of wireless networks is presented, in which the mobility management is divided into two complementary tasks: macro mobility and micro mobility. As the macro mobility solution, a basic principle of Mobile IP is introduced, together with the optimal schemes and the advances in IPv6. The disadvantages of the Mobile IP on solving the micro mobility problem are analyzed, on the basis of which three main proposals are discussed as the micro mobility solutions for mobile communications, including Hierarchical Mobile IP (HMIP), Cellular IP, and Handoff-Aware Wireless Access Internet Infrastructure (HAWAII). A unified model is also described in which the different micro mobility solutions can coexist simultaneously in mobile networks.

In the 21st Century, each and everyone needs a strong communication pathway to establish their transactions in both commercial and non-commercial manner. Wireless Communication technologies are the gateway to provide such facilities to the users to attain their communication needs in good way. Recently, mobile communication technologies provide a global connectivity to the users to achieve their connections in global manner without any intervention. Wireless Mobile Networks (WMN) provides such facility to the users to communicate between one and another. However, security concerns are always a question in the field of Wireless Communication. There are lots of researches has already done regarding the security enhancement features over the wireless mobile network industry, but all are strucked up with certain limitations such as failed to provide a robust support on high bandwidth requirements and implementation durability. This makes a Wireless Mobile Networks down and lots of hesitations to people mind to use such technology. This paper is intended to provide a robust communication protocol with enhanced security handling nature to attain best communication between users by using such Wireless Mobile Networks. The proposed approach is called as Novel Threat Management Scheme (NTMS), in which it is derived from the combination of two different conventional algorithms such as AODV and Data Hashing algorithms. By combining these two algorithms in a proper way the proposed NTMS is designed as well as once the communication begins by using the proposed algorithm the way of attacking is prohibited at rich level and attains a good communication abilities over WMN. The proposed algorithm assures the logic of security efficiency, data integrity level, access control abilities and bandwidth utilization level in good manner as well as the mentioned things are portrayed into the resulting section of this paper with proper specification.

With the increased use and advances in the field of wireless networking, many issues are being confronted. One major issue is the transmission of video and audio over wireless networks. In wireless mobile networks, the range of possible scenarios, and the traffic load generated by their typical applications give principal key aspects that make challenges to select a given routing protocol. In this paper, the authors evaluate the practicality of realizing a wireless network and investigate on performance issues. The authors have tried to simulate different scenarios for wireless networks and compare their performance based on a number of factors. The authors used ns-2 for all our simulations. They tried to quantify the effects of factors like cluster size, routing protocols, packet size and type of traffic, that affect the performance of wireless networks. The impact of these factors will be evaluated on the following perfomance metrics: throughput, end-to-end delay, fitter, loss across different scenarios. This study centres on investigating the results of simulations to propose a new approach relating to the management of a MPEG flow for a wireless link

Network coding has recently been applied to wireless networks and has achieved some initial success. Researches in wireless network coding have been mostly focusing on utilizing the broadcast nature of the wireless networks. In this paper, we propose a novel network coding framework for wireless relay networks that also takes into consideration the fading and error prone nature of the wireless networks. First, we extend the traditional network coding in lossless networks which operates on 0-1 bits, to a new framework which defines network coding on the posterior probability of each bit. This new framework allows an imperfect decode-recode process at a relay node and avoids possible error propagation when a hard decision is made at the relay node. It implicitly integrates decode-and-forward and estimate-and-forward strategies for wireless network coding to address the technical issues of channel fading and transmission errors. The proposed approach is validated through both theoretical analysis and extensive simulations. Both analysis and simulation confirm that this new framework is able to achieve significant gain over traditional network coding. This new framework also enables the introduction of adaptive scheme into network coding. We demonstrate a basic adaptation scheme and present some preliminary experimental results. The proposed adaptive scheme will lay down an essential foundation in this emerging field of wireless network coding in order to address issues related to link heterogeneity.

In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ad hoc</i> networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.