Energy efficient geographical key management scheme for authentication in mobile wireless sensor networks

In wireless sensor networks, a sensor node communicates with a small set of neighbour sensor nodes and with the base station through a group leader or a cluster head. However, in some occasions, a sensor node required to move in the sensor networks. The node has to change its own position with the requirement of applications. Considering this phenomena, in this paper, we propose to design an angular function and private key management system authenticated by group leader for the transmission of a node. In the proposed scheme, the group is divided into sectors. The motion of the node is related with the angles to the group leader, which is the basis of our proposal. The nodes movement and activity should be tracked. The proposed scheme attains high connectivity and security with the help of the directional transreceiver. The lifetime of a node is increased, and it enables a node to move through the network and to transmit data to its neighbors.     

An efficient vertical handoff scheme for microcellular and macrocellular interworking

The next generation wireless network environments increasingly become integrated to support anywhere, anytime connectivity for various applications like multimedia, full‐motion video and high data rates with appropriate quality of service (QoS). With these emerging needs, interworking of microcellular and macrocellular networks has been accompanied by service providers. However, these networks have different technologies, which make efficient vertical handoff a challenging issue. In this study, an efficient vertical handoff scheme (EVHS) for interworking between microcellular and macrocellular networks is proposed and analyzed. The handoff decision criteria of the proposed scheme include crucial features like user mobility, network conditions, pricing issues, and user preferences in addition to the received signal strength (RSS). EVHS ensures the selection of the most appropriate network in terms of cost and acceptable QoS according to users' preferences. The results show that EVHS scheme outperforms other proposed schemes in the literature in terms of incompletion probabilities, grade of service (GoS) and cost without causing degradation in system utilization. Besides, although EVHS scheme is mainly intended for user satisfaction, the results show that it does not cause a significant degradation in the revenue of the service provider. Copyright © 2009 John Wiley & Sons, Ltd.     

Priority-determined multiclass handoff scheme with guaranteed mobile QoS in wireless multimedia networks

The provision of multiclass services is gaining wide acceptance and will be more ubiquitous in future wireless and mobile systems. The crucial issue is to provide the guaranteed mobile quality of service (QoS) for arriving multiclass calls. In multimedia cellular networks, we should not only minimize the dropping rate of handoff calls, but also control the blocking rate of new calls at an acceptable level. This paper proposes a novel multiclass call-admission-control mechanism that is based on a dynamic reservation pool for handoff requests. In this paper, we propose the concept of servicing multiclass connections based on priority determination through the combined analysis of mobile movement information and the desired QoS requirements of multimedia traffic. A practical framework is provided to determine the occurrence time of handoff-request reservations. In our simulation experiments, three kinds of timers are introduced for controlling the progress of discrete events. Our simulation results show that the individual QoS criteria of multiclass traffic such as the handoff call-dropping probability can be achieved within a targeted objective and the new-call-blocking probability is constrained to be below a given level. The proposed scheme is applicable to channel allocation of multiclass calls over high-speed wireless multimedia networks.     

无线ATM通信网中一种新的快速越区切换方案

本文根据地无线ATM通信网中快速越区切换问题的研究,提出了一种新的基于虚道路（VP）的快速越区切换方案,并通过建立简化的呼叫模型对该方案的切换性能进行了理论分析和比较,其结果表明,该方案的各项性能均比虚拟连接树（VCT）方案和永久虚连接（PVC）方案优越。     

Low-latency mobile IP handoff for infrastructure-mode wireless LANs

The increasing popularity of IEEE 802.11-based wireless local area networks (LANs) lends them credibility as a viable alternative to third-generation (3G) wireless technologies. Even though wireless LANs support much higher channel bandwidth than 3G networks, their network-layer handoff latency is still too high to be usable for interactive multimedia applications such as voice over IP or video streaming. Specifically, the peculiarities of commercially available IEEE 802.11b wireless LAN hardware prevent existing mobile Internet protocol (IP) implementations from achieving subsecond Mobile IP handoff latency when the wireless LANs are operating in the infrastructure mode, which is also the prevailing operating mode used in most deployed IEEE 802.11b LANs. In this paper, we propose a low-latency mobile IP handoff scheme that can reduce the handoff latency of infrastructure-mode wireless LANs to less than 100 ms, the fastest known handoff performance for such networks. The proposed scheme overcomes the inability of mobility software to sense the signal strengths of multiple-access points when operating in an infrastructure-mode wireless LAN. It expedites link-layer handoff detection and speeds up network-layer handoff by replaying cached foreign agent advertisements. The proposed scheme strictly adheres to the mobile IP standard specification, and does not require any modifications to existing mobile IP implementations. That is, the proposed mechanism is completely transparent to the existing mobile IP software installed on mobile nodes and wired nodes. As a demonstration of this technology, we show how this low-latency handoff scheme together with a wireless LAN bandwidth guarantee mechanism supports undisrupted playback of remote video streams on mobile stations that are traveling across wireless LAN segments.     

基于IPv6的快速切换改进方案

在移动IP网络中,当前的移动性管理方案由于其基本协议的切换时延较大、丢包率较高而不能适应实时业务和移动通信的要求,所以需要改善移动性管理策略的切换性能,尽量实现无缝切换和零丢包率。提出了一种基于移动IPv6的快速切换的改进方案,采用一种新的地址分配方式使得移动节点能够在移动至新的网络后迅速获取新的转交地址,有效地减少了切换所产生的时延和丢包率,具有较好的切换性能。     

An adaptive resource management for mobile terminals on vertical handoff

Mobile communications and wireless networks are developing at a fast pace. The increasing number of mobile subscribers and terminals are the real life evidence of the fast growing development in the area of wireless communication. Wireless communication technology is now pursuing 4G (fourth generation) and seeking a scheme to provide quality of service (QoS) to the various applications continuously even moving to another network. In this paper, we proposed a dynamic resource management architecture which considers vertical handoff situation with minimal disruption of service to the users considering seamless provision of QoS. The proposed scheme efficiently manages resources and provides stable services to the mobile terminal. The simulation results show that resource management enabled mobile terminals utilize system resources, CPU and memory, efficiently improved by 40% and 65%, respectively, rather than mobile terminals without resource tuning.     

移动IP在无线局域网下的一种快速切换方法

针对移动IP在无线局域网下的应用,提出了一种新的基于链路层的移动IP快速切换方法,通过在无线局域网的无线接入点间加入特定的MAC网桥来减少移动节点在切换时产生的切换时延,进而减少移动节点上行和下行方向上的数据包的丢失,达到对移动IP切换进行优化的目的。此方法在无线局域网实际环境中进行了性能测试,结果证明优化后的时延较之原来普通移动IP切换时延有明显降低。     

Performance analysis of a preemptive and priority reservation handoff scheme for integrated service-based wireless mobile networks

We propose an analytical model for integrated real-time and non-real-time services in a wireless mobile network with priority reservation and preemptive priority handoff schemes. We categorize the service calls into four different types, namely, real-time and non-real-time service originating calls, and real-time and non real-time handoff service request calls. Accordingly, the channels in each cell are divided into three parts: one is for real-time service calls only, the second is for non-real-time service calls only, and the last one is for overflow of handoff requests that cannot be served in the first two parts. In the third group, several channels are reserved exclusively for real-time service handoffs so that higher priority can be given to them. In addition, a realtime service handoff request has the right to preempt non-real-time service in the preemptive priority handoff scheme if no free channels are available, while the interrupted non-real-time service call returns to its handoff request queue. The system is modeled using a multidimensional Markov chain and a numerical analysis is presented to estimate blocking probabilities of originating calls, forced termination probability, and average transmission delay. This scheme is also simulated under different call holding time and cell dwell time distributions. It is observed that the simulation results closely match the analytical model. Our scheme significantly reduces the forced termination probability of real-time service calls. The probability of packet loss of non-real-time transmission is shown to be negligibly small, as a non-real-time service handoff request in waiting can be transferred from the queue of the current base station to another one.     

A seamless handoff scheme for IEEE 802.11 wireless networks

The advance of computer network technologies such as IEEE 802.11 wireless local area network has made it possible for users to connect to Internet almost anywhere. A mobile node (MN) is likely to move between different base stations while running applications. The IETF has defined the Mobile IP (MIP) to allow MNs to maintain their communication uninterrupted while roaming across different IP subnets. However, the mechanisms defined in MIP may cause undesired connection disruptions or packet losses, which will significantly degrade the quality of real‐time applications. It is an important and challenging issue to support seamless handoff management. To achieve seamless handoff, we propose a unified scheme to address application quality degradation. Our main contribution is the concept and implementation of utilising buffering and resending method to eliminate the packet losses while keeping the end‐to‐end delay of real‐time traffic flow in an acceptable value. The NS‐2 simulation results show that our proposed scheme can significantly maintain application quality during layer‐2 and ‐3 handoffs. Copyright © 2011 John Wiley & Sons, Ltd.     

An efficient mobile IPv6 handover scheme

Excellent handover performance is essential for deploying real time applications over wireless Internets. In this paper, this study present a novel handover scheme for Mobile IPv6. The proposed scheme is based on an infrastructure, which is called Cross-layer Address Resolution (CAR). A smart message interaction for the Binding Update procedure is also introduced. The prototype is illustrated first and a buffering approach adopted to achieve zero packet loss. The proposed scheme, which is called Seamless Handover for Mobile IPv6 (S-MIPv6), evolved from Fast Handover for Mobile IPv6 (F-MIPv6). The problems in F-MIPv6, such as triangle route and sequence disorder, are solved by the proposed scheme. The S-MIPv6 avoids building tunnels and reduces registration delay. It is capable of cooperating with a Mobility Anchor Point (MAP) to take advantage from hierarchical networks. The S-MIPv6 is modeled and simulated. In a practical case, the disruption duration is close to the Data Link layer handover latency (50–100 ms). We believe that the proposed S-MIPv6 is capable of providing seamless handover for time critical services.     

An efficient location and routing scheme for mobile computingenvironments

One of the most important issues affecting host mobility is the location and routing scheme that allows hosts to move seamlessly from one site to another. This paper presents a method that exploits the locality properties of a host's pattern of movement and access history. Two concepts, “local region” and “patron service” are introduced based on the locality features. For each mobile host, the local region is a set of designated subnetworks within which a mobile host often moves, and the patrons are the hosts from which the majority of traffic for the mobile host originated. These are used to confine the effects of a host moving, so location updates are sent only to its local area, and to those source hosts which are most likely to call again. Our scheme has the advantages of limiting location updates, and providing optimal routing, while increasing network and host scalability     

PowerNap: an efficient power management scheme for mobile devices

We present PowerNap, an OS power management scheme, which can significantly improve the battery life of mobile devices. The key feature of PowerNap is the skipping of the periodic system timer ticks associated with the operating system. On an idle device, this modification increases the time between successive timer interrupts and enables us to put the processor/system into a more efficient low power state. This saves the energy consumed by workless timer interrupts and the excess energy consumed by the processor in less efficient low power states. PowerNap is tightly integrated with the kernel and is designed for optimal control of the latency and energy associated with transitioning in and out of the low power states. We describe an implementation of PowerNap and its impact on system software. Experiments with IBM's WatchPad verify the ability of PowerNap to extend battery life. An analytical model that quantifies the ability of the scheme to reduce power is also presented. The model is in good agreement with experimental results. We apply the model to small form-factor devices which use processors that have a PowerDown state. In such devices, PowerNap may extend battery life by more than 42 percent for small processor workloads and for background power levels below 10 mW.     

A network-layer soft handoff approach for mobile wireless IP-based systems

Handoff is the process during which a mobile node (MN) needs to change its connectivity point to the wireless internetwork from one access node (AN) to another during an ongoing communication. If MNs are allowed to have two or more simultaneous connections to the internetwork through different ANs, then the handoff is said to be soft; otherwise, it is said to be hard. Traditionally, during forward-link soft handoff, multiple identical copies of each packet are simultaneously transmitted to the MN through the associated ANs. At the MN's physical-layer, the received signals are combined on a bit-by-bit basis resulting in improving the bit-error rate. However, this approach requires tight synchronization of the ANs involved in the soft handoff. In addition, as shown in the literature, the capacity often decreases due to the increase of the number of channels used by MNs during soft handoff. In this paper, we propose, analyze, simulate, and implement a soft handoff scheme called soft handoff over IP (SHIP) for forward-link that 1) overcomes the need for synchronization and 2) increases the capacity of the network. Through both analytic and simulation studies, we show that SHIP achieves significant performance improvements. We derive analytic expressions of the power-capacity relationship for two-dimensional (2-D) and one-dimensional (1-D) cell models. By comparing our scheme with the hard handoff, we empirically show that the capacity increases by about 30% and 20%, respectively, for the 2-D and 1-D cell models. Further, the simulation results show that SHIP saves up to 30% of the total power consumed by the ANs.     

Fast handoff with reducing waste rate approach for wireless resources management in UMTS mobile networks

3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.     

Channel carrying: a novel handoff scheme for mobile cellularnetworks

We present a new scheme that addresses the call handoff problem in mobile cellular networks. Efficiently solving the handoff problem is important for guaranteeing quality of service to already admitted calls in the network. Our scheme is based on a new approach called channel carrying: when a mobile user moves from one cell to another, render certain mobility conditions, the user is allowed to carry its current channel into the new cell. We propose a new channel assignment scheme to ensure that this movement of channels will not lead to any extra co-channel interference or channel locking. In our scheme, the mobility of channels relies entirely on localized information, and no global coordination is required. Therefore, the scheme is simple and easy to implement. We further develop a hybrid channel carrying scheme that allows us to maximize performance under various constraints     

Association control algorithms for handoff frequency minimization in mobile wireless networks

As mobile nodes roam in a wireless network, they continuously associate with different access points and perform handoff operations. Frequent handoffs performed by a mobile device may have undesirable consequences, as they can cause interruptions for interactive applications and increase the energy usage of mobile devices. While existing approaches to this issue focus entirely on improving the latency incurred by individual handoffs, in this paper, we initiate a novel approach to association control of mobile devices with the goal of reducing the frequency of handoffs for mobile devices. We study the handoff minimization problem across multiple dimensions: offline versus online where the complete knowledge of mobility patterns of users is known in advance or unknown respectively; capacity constrained versus unconstrained access points, which imposes limits on the number of mobile devices which could be associated with a given access point at any given point in time; group mobility versus arbitrary mobility of users, which are contrasting ways to model the mobility patterns of the mobile users. We consider various combinations of the above dimensions and present the following: (1) optimal algorithms, (2) provably-good online and offline approximation algorithms, (3) complexity (NP-Completeness) results, and (4) a practical heuristic which is demonstrated to work well on real network traces.     

An efficient reliable broadcasting protocol for wireless mobile ad hoc networks

The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to which we refer as the broadcast storm problem. This paper proposes an efficient reliable broadcasting protocol by taking care of the potential broadcast storm problem that could occur in the medium-access level. Existing protocols are either unreliable, or reliable but based on a too costly approach. Our protocol differs from existing protocols by adopting a low-cost broadcast, which does not guarantee reliability, as a basic operation. The reliability is ensured by additional acknowledgement and handshaking. Simulation results do justify the efficiency of the proposed protocol.     

一种基于OFDM系统的无线图像的有效传输方法

本文提出一种基于OFDM多载波系统的无线图像传输的方法。该方法将基于FFT／IFFT变换的OFDM多载波调制与基于小波变换的SPIHT嵌入式零树编码相结合，首先将SPIHT输出码流分成若干数据块，然后根据各数据块视觉重要性的不同，给其分配相应的子信道和发送功率，使视觉重要性高的码流在较低的误比特率下进行传输，实现对视觉重要性不同的码流的不等错误保护。本文在瑞利平坦衰落信道下的仿真结果表明：在低信噪比下，采用本文提出的不等错误保护方法比等错误保护方法的峰值信噪比增益要高出15dB以上。     

An efficient optimistic message logging scheme for recoverable mobile computing systems

A number of checkpointing and message logging algorithms have been proposed to support fault tolerance of mobile computing systems. However, little attention has been paid to the optimistic message logging scheme. Optimistic logging has a lower failure-free operation cost compared to other logging schemes. It also has a lower failure recovery cost compared to the checkpointing schemes. This paper presents an efficient scheme to implement optimistic logging for the mobile computing environment. In the proposed scheme, the task of logging is assigned to the mobile support station so that volatile logging can be utilized. In addition, to reduce the message overhead, the mobile support station takes care of dependency tracking and the potential dependency between mobile hosts is inferred from the dependency between mobile support stations. The performance of the proposed scheme is evaluated by an extensive simulation study. The results show that the proposed scheme requires a small failure-free overhead and the cost of unnecessary rollback caused by the imprecise dependency is adjustable by properly selecting the logging frequency.