Hand-Off Performance of the Integrated Cellular and Ad Hoc Relaying (iCAR) System

In this paper, we study the hand-off performance of a wireless system with heterogeneous technologies called iCAR (Integrated Cellular and Ad hoc Relaying). In iCAR, hand-offs can occur not only from a Base Transceiver Station (BTS) to another BTS, but also from a BTS to a so-called Ad hoc Relaying Station (ARS) in the form of relaying, as well as from an ARS back to a BTS. The latter two types of hand-offs effectively increase the hand-off buffer time and thus reduce the call dropping probability. We develop an analytical model for the hand-off performance in iCAR. In addition, we verify the analytical model via simulations and quantify the hand-off performance benefits of the iCAR system over conventional cellular systems. It is anticipated that the analytical and simulation models reported in this paper will serve as a guideline to other researches on the inter-system hand-off involving heterogenous wireless technologies.     

On the Use of Multiple Hops in Next Generation Wireless Systems

Traditional cellular networks provide a centralized wireless networking paradigm within the wireless domain with the help of fixed infrastructure nodes such as Base Stations (BSs). On the other hand, Ad hoc wireless networks provide a fully distributed wireless networking scheme with no dependency on fixed infrastructure nodes. Recent studies show that the use of multihop wireless relaying in the presence of infrastructure based nodes improves system capacity of wireless networks. In this paper, we consider three recent wireless network architectures that combine the multihop relaying with infrastructure support – namely Integrated Cellular and Ad hoc Relaying (iCAR) system, Hybrid Wireless Network (HWN) architecture, and Multihop Cellular Networks (MCNs), for a detailed qualitative and quantitative performance evaluation. MCNs use multihop relaying by the Mobile Stations (MSs) controlled by the BS. iCAR uses fixed Ad hoc Relay Stations (ARSs) placed at the boundaries to relay excess traffic from a hot cell to cooler neighbor cells. HWN dynamically switches its mode of operation between a centralized Cellular mode and a distributed Ad hoc mode based on the throughput achieved. An interesting observation derived from these studies is that, none of these architectures is superior to the rest, rather each one performs better in certain conditions. MCN is found to be performing better than the other two architectures in terms of throughput, under normal traffic conditions. At very high node densities, the variable power control employed in HWN architecture is found to be having a superior impact on the throughput. The mobility of relay stations significantly influences the call dropping probability and control overhead of the system and hence at high mobility iCAR which uses fixed ARSs is found to be performing better. This work was supported by Infosys Technologies Ltd., Bangalore, India and the Department of Science and Technology, New Delhi, India. B. S. Manoj received his Ph.D degree in Computer Science and Engineering from the Indian Institute of Technology, Madras, India, in July 2004. He has worked as a Senior Engineer with Banyan Networks Pvt. Ltd., Chennai, India from 1998 to 2000 where his primary responsibility included design and development of protocols for real-time traffic support in data networks. He had been an Infosys doctoral student in the Department of Computer Science and Engineering at the Indian Institute of Technology-Madras, India. He is a recipient of the Indian Science Congress Association Young Scientist Award for the Year 2003. Since the beginning of 2005, he has been a post doctoral researcher in the Department of Electrical and Computer Engineering, University of California, San Diego. His current research interests include ad hoc wireless networks, next generation wireless architectures, and wireless sensor networks. K. Jayanth Kumar obtained his B.Tech degree in Computer Science and Engineering in 2002 from the Indian Institute of Technology, Madras, India. He is currently working towards the Ph.D degree in the department of Computer Science at the University of California, Berkeley. Christo Frank D obtained his B.Tech degree in Computer Science and Engineering in 2002 from the Indian Institute of Technology, Madras, India. He is currently working towards the Ph.D. degree in the department of Computer Science at the University of Illinois at Urbana-Champaign. His current research interests include wireless networks, distributed systems, and operating systems. C. Siva Ram Murthy received the B.Tech. degree in Electronics and Communications Engineering from Regional Engineering College (now National Institute of Technology), Warangal, India, in 1982, the M.Tech. degree in Computer Engineering from the Indian Institute of Technology (IIT), Kharagpur, India, in 1984, and the Ph.D. degree in Computer Science from the Indian Institute of Science, Bangalore, India, in 1988. He joined the Department of Computer Science and Engineering, IIT, Madras, as a Lecturer in September 1988, and became an Assistant Professor in August 1989 and an Associate Professor in May 1995. He has been a Professor with the same department since September 2000. He has held visiting positions at the German National Research Centre for Information Technology (GMD), Bonn, Germany, the University of Stuttgart, Germany, the University of Freiburg, Germany, the Swiss Federal Institute of Technology (EPFL), Switzerland, and the University of Washington, Seattle, USA. He has to his credit over 120 research papers in international journals and over 100 international conference publications. He is the co-author of the textbooks Parallel Computers: Architecture and Programming, (Prentice-Hall of India, New Delhi, India), New Parallel Algorithms for Direct Solution of Linear Equations, (John Wiley & Sons, Inc., New York, USA), Resource Management in Real-time Systems and Networks, (MIT Press, Cambridge, Massachusetts, USA), WDM Optical Networks: Concepts, Design, and Algorithms, (Prentice Hall, Upper Saddle River, New Jersey, USA), and Ad Hoc Wireless Networks: Architectures and Protocols, (Prentice Hall, Upper Saddle River, New Jersey, USA). His research interests include parallel and distributed computing, real-time systems, lightwave networks, and wireless networks. Dr.Murthy is a recipient of the Sheshgiri Kaikini Medal for the Best Ph.D. Thesis from the Indian Institute of Science, the Indian National Science Academy (INSA) Medal for Young Scientists, and Dr. Vikram Sarabhai Research Award for his scientific contributions and achievements in the fields of Electronics, Informatics, Telematics & Automation. He is a co-recipient of Best Paper Awards from the 1st Inter Research Institute Student Seminar (IRISS) in Computer Science, the 5th IEEE International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS), and the 6th and 11th International Conference on High Performance Computing (HiPC). He is a Fellow of the Indian National Academy of Engineering.     

Markov mobility model and registration area optimization in cellular networks

In cellular communication systems, in order for a network to keep track of inactive mobile stations (MSs), each inactive MS has to update its location from time to time, called location registration. To lighten the task of tracking inactive MSs, the network divides its cells into groups, called location areas (LAs) and tracks inactive MSs at the LA level: an inactive MS sends a registration message to the network to update its location only when it travels to a new LA. Obviously, the performance of a location area design depends on network traffic and the mobility of MSs. In the paper, we propose a general Markov mobility model for MSs in cellular networks, provide a procedure to automatically estimate the system parameters according to the network traffic, derive the performance of LA design, and provide a clustering algorithm to optimize LA designs. A numerical example is provided to show the effectiveness of the proposed procedures. Copyright © 2009 John Wiley & Sons, Ltd.     

可任意阶扩展的认知无线Ad Hoc网络频谱共享模型

目前认知无线Ad Hoc网络(CRAHNs)频谱共享模型的研究大多忽视了未被授权频谱被占用过程对授权频谱被一、二级用户占用过程的影响,也有研究同时考虑了一、二级信道被占用的情况,提出了简化的排队模型,但是在进行性能分析时存在较大误差.主要挑战来自于高维马尔可夫状态转移图归纳的复杂性和计算的复杂性.本文研究提出一种新的分...     

An adaptive channel preemption model for small‐cell embedded large‐cellular networks

In this paper, we present an analytical model of adaptive channel preemption (ACP) for small‐cell embedded large‐cellular (SCELC) networks. An SCELC network consists of a fixed base station (FBS) with large coverage and many embedded base stations (EBS) with relatively small coverage. Channel capacity in an FBS cell may become insufficient when traffic is unexpectedly increased particularly in some special occasion. This paper considers two aspects of dynamically allocating channels for an SCELC network. First, by increasing one or more EBS cells within an FBS cell, the proposed ACP can reduce blocking probability of new calls. Second, to reduce dropping probability of handoff calls, the proposed ACP allows a handoff call to preempt an on‐going call, when the latter is located in an EBS cell or in the overlapping area of two adjacent FBS cells. For the purpose of performance evaluation, we build an analytical model with 4‐tuple Markov chains. Numerical results reveal that embedding one or more EBS cells inside an FBS cell needs to be done carefully since it results in a tradeoff between the reduction of new‐call blocking probability and the increase of handoff‐call dropping probability. Copyright © 2011 John Wiley & Sons, Ltd.     

基于路径时延模型的车联网数据分发方案

针对车联网的容迟特性造成通信资源受限的问题,提出了满足副本抑制要求的数据分发方案.方案利用马尔可夫链,通过交通网络的车辆概率分布建立路段的期望传输时延,并结合车辆的轨迹与目标位置的匹配度确定车辆的转发优先级.车辆为转发的每个数据包插入转发参数字段并通过同步反馈机制确定最终的转发车辆,确保由优先级最高的车辆完成转发.考虑到链路的稳定性,还推导了当前丢包率前提下,车辆接收数据包与发送次数之比,避免不必要的发送尝试产生大量副本.实验结果显示,提出的方案与基于轨迹预测的算法相比,有效提高了网络吞吐量和时延性能.     

无线传感器网络路由中的能量预测及算法实现

基于无线传感器网络中路由协议高效合理利用能量的要求,提出一种基于剩余能量预测的地理位置路由(EPGR,energy prediction and geographical routing)算法。算法通过建立传感器网络节点运作模型,及相邻节点剩余能量预测机制,优化路由选择。仿真和分析表明,EPGR算法能够有效地优化数据传输路径,均衡传感器网络节点的能量消耗,延长网络寿命。     

基于NS2的移动自组混合网络模拟平台研究

提出了一种统一的移动自组混合网络模型,并在NS2中实现了该网络模型.首先对NS2中的核心模块进行了扩展,使其支持移动节点的多模通信和多信道;其次,在NS2中添加了新的移动网关选取模块.在扩展后的NS2平台上,通过模拟和比较成组位置更新和传统位置更新,验证了仿真平台的正确性和合理性.研究成果为基于蜂窝Ad hoc混合网络结构的协议研究提供了一个较通用的仿真平台.     

Maintaining Optimal Communication Chains in Robotic Sensor Networks using Mobility Control

This paper presents a decentralized mobility control algorithm for the formation and maintenance of an optimal cascaded communication chain between a lead sensor-equipped robot and a control station, using a team of robotic vehicles acting as communication relays in an unknown and dynamic RF environment. The gradient-based controller presented uses measurements of the signal-to-noise ratio (SNR) field of neighbor communication links, as opposed to relative position between nodes, as input into a localized performance function. By using the SNR field as input into the control system, the controller is reactive to unexpected and unpredictable changes in the RF environment that is not possible with range-based controllers. Since the operating environment is not known a priori to deployment of a robotic sensor network, an adaptive model-free extremum seeking (ES) algorithm, that uses the motion of the relays to estimate the performance function gradient, is presented to control the motion of 2D nonholonomic vehicles acting as communication relays using the gradient-based controller. Even without specific knowledge of the SNR field, simulations show that the ES decentralized chaining controller using measurements of the SNR field, will drive a team of robotic vehicles to locations that achieve the global objective of maximizing capacity of a cascaded communication chain, even in the presence of an active jamming source.

Modeling and Simulation of Mixed Queueing and Loss Systems

In this paper, we investigate a multi-rate network in which wide-band calls are allowed to wait if insufficient resources are available at the time of the call arrival. On the link level, an analytical model is presented and simulations have been carried out on the network level. The results indicate that allowing a few wide-band calls to queue can give a significant improvement in performance in terms of network revenue , as well as a means to level out the blocking probabilities of the different traffic classes. This improvement becomes significant when the service discipline of the waiting calls (of different bandwidth requirements) is adaptive in the sense that longer queues get served first. This observation motivates the investigation of the impact of various buffer space assignment and queueing disciplines on network revenue and call blocking probabilities. The study of such mixed delay and queueing networks is motivated by its possible applications to traffic problems in future Broadband Integrated Services Digital Networks as well as in multi-rate cellular radio networks.