Self‐adaptive routing protocols for integrating cellular networks,WLANs, and MANETs

A growing need to have ubiquitous connectivity has motivated our research to provide continuous connection between various wireless platforms such as cellular networks, wireless local area networks (WLANs), and mobile ad hoc networks (MANETs). In this paper, we consider integration at the routing layer and propose two adaptable routing protocols (IRP‐RD and IRP‐PD) that exploit topology information stored at the fixed network components (cellular base stations and WLAN access points) for the route discovery and maintenance processes. Our proposed protocols can provide connectivity to the cellular network and/or WLAN hotspots through multihop routing, while differ in the gateway discovery approach used. In IRP‐RD, multihop routes to gateways to the cellular network or WLAN hot spots are discovered on demand, while in IRP‐PD out of coverage users proactively maintain routes to the gateways. Furthermore, proposed protocols can be used in any heterogeneous scenario, combining a cellular network and WLANs operating in infrastructure or ad hoc (MANET) mode. We provide simulation results that demonstrate the effectiveness of the proposed integrated routing protocols and show the advantages and drawbacks of each gateway discovery approach in different heterogeneous scenarios. Copyright © 2006 John Wiley & Sons, Ltd.     

A simple void node and loop‐free three‐dimensional routing protocol for multi‐hop wireless networks

Wireless networks are now very essential part for modern ubiquitous communication systems. The design of efficient routing and scheduling techniques for such networks have gained importance to ensure reliable communication. Most of the currently proposed geographic routing protocols are designed for 2D spatial distribution of user nodes, although in many practical scenarios user nodes may be deployed in 3D space also. In this paper, we propose 3D routing protocols for multihop wireless networks that may be implemented in two different ways depending on how the routing paths are computed. When the routing paths to different user nodes from the base station in the wireless network are computed by the base station, we call it centralized protocol (3DMA‐CS). A distributed routing (3DMA‐DS) protocol is implemented when respective routing path of each user node to the base station is computed by the user node. In both of these protocols, the user (base station) selects the relay node to forward packets in the direction of destination, from the set of its neighbours, which makes minimum angle with the reference line drawn from user (base station) to the base station (user), within its transmission range. The proposed protocols are free from looping problem and can solve the void node problem (VNP) of multihop wireless networks. Performance analysis of the proposed protocol is shown by calculating end‐to‐end throughput, average path length, end‐to‐end delay, and energy consumption of each routing path through extensive simulation under different network densities and transmission ranges.     

A Virtual Topology Based Routing Protocol for Multihop Dynamic Wireless Networks

In this paper, a new hierarchical multihop routing algorithm and its performance evaluation is presented for fully dynamic wireless networks. The routing algorithm operates on a virtual topology obtained by partitioning the routing information for mobile terminals and mobile base stations into a hierarchical, distributed database. Based on the virtual topology, each mobile base station stores a fraction of the routing information to balance the complexity of the location-update and the path-finding operations. Mobility of the network entities changes the load distribution and causes processing and memory bottlenecks in some parts of the network. However, since the network routing elements are also mobile, their movement can be used to distribute the load. Thus, new load balancing schemes are intoduced to distribute the routing overhead uniformly among the mobile base stations. The performance of the hierarchical multihop routing algorithm is investigated through simulations. It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully.     

QoS Routing for Mesh-Based Wireless LANs

Wireless LANs with their increased data rate become an attractive technology for connecting mobile users to the Internet. Efficient deployment of wireless LANs will require the ability to extend the wireless LANs coverage without the need to deploy a very large number of access points. Mesh-based wireless LANs are an attractive solution to this problem. These networks extend wireless LAN coverage by using each node in the network as a router, resulting in a multihop topology. In this paper we introduce a novel routing algorithm, wireless mesh routing (WMR), that provides quality-of-service (QoS) support and accounts for the characteristics of both infrastructure-based wireless LANs and ad hoc networks. The algorithm is validated using the OPNET modeler. The simulation results show that the mesh network using WMR protocol can provide QoS support and react dynamically to the network status changes with low control overheads. Using the proposed software architecture the proposed routing protocol can be implemented with any MAC protocol, resulting in easy implementation in existing wireless nodes.     

Energy Optimization in Multihop Wireless Embedded and Sensor Networks

This paper provides an analytical model for the study of energy consumption in multihop wireless embedded and sensor networks where nodes are extremely power constrained. Low-power optimization techniques developed for conventional ad hoc networks are not sufficient as they do not properly address particular features of embedded and sensor networks. It is not enough to reduce overall energy consumption, it is also important to maximize the lifetime of the entire network, that is, maintain full network connectivity for as long as possible. This paper considers different multihop scenarios to compute the energy per bit, efficiency and energy consumed by individual nodes and the network as a whole. The analysis uses a detailed model for the energy consumed by the radio at each node. Multihop topologies with equidistant and optimal node spacing are studied. Numerical computations illustrate the effects of packet routing, and explore the effects of coding and medium access control. These results show that always using a simple multihop message relay strategy is not always the best procedure.     

Distributed fuzzy approach to unequal clustering and routing algorithm for wireless sensor networks

Due to inherent issue of energy limitation in sensor nodes, the energy conservation is the primary concern for large‐scale wireless sensor networks. Cluster‐based routing has been found to be an effective mechanism to reduce the energy consumption of sensor nodes. In clustered wireless sensor networks, the network is divided into a set of clusters; each cluster has a coordinator, called cluster head (CH). Each node of a cluster transmits its collected information to its CH that in turn aggregates the received information and sends it to the base station directly or via other CHs. In multihop communication, the CHs closer to the base station are burdened with high relay load; as a result, their energy depletes much faster as compared with other CHs. This problem is termed as the hot spot problem. In this paper, a distributed fuzzy logic‐based unequal clustering approach and routing algorithm (DFCR) is proposed to solve this problem. Based on the cluster design, a multihop routing algorithm is also proposed, which is both energy efficient and energy balancing. The simulation results reinforce the efficiency of the proposed DFCR algorithm over the state‐of‐the‐art algorithms, ie, energy‐aware fuzzy approach to unequal clustering, energy‐aware distributed clustering, and energy‐aware routing algorithm, in terms of different performance parameters like energy efficiency and network lifetime.     

无线供电混合多址接入网络的最优能效资源分配研究

在能量受限的通信系统中，能量效率是衡量系统性能的关键指标.本文研究由一个基站和多个分簇用户组成的无线供电混合非正交多址接入系统.在该网络中，基站通过无线能量传输方式给用户供能，用户则利用收集到的能量向基站传输各自的信息.为降低基站的接收解码复杂度，用户采用分簇的方式进行信息传输：簇间用户的信息传输采用时分多址方式，而簇内用户的信息传输采用非正交多址方式.通过联合分配能量传输与信息传输的时间长度以及控制基站和用户的发射功率来实现网络能量效率的最大化.由于涉及的优化问题是非凸的，本文先通过寻找问题最优解的结构，然后根据分式规划理论，提出了一种新的迭代资源分配算法来求解该问题.仿真结果表明，与"吞吐量最大化策略"和 "固定时间分配策略"两种基准策略相比，所提出的算法显著提高了网络的能量效率.     

SMDP-based sleep policy for base stations in heterogeneous cellular networks

A dense heterogeneous cellular network can effectively increase the system capacity and enhance the network coverage. It is a key technology for the new generation of the mobile communication system. The dense deployment of small base stations not only improves the quality of network service, but also brings about a significant increase in network energy consumption. This paper mainly studies the energy efficiency optimization of the Macro-Femto heterogeneous cellular network. Considering the dynamic random changes of the access users in the network, the sleep process of the Femto Base Stations (FBSs) is modeled as a Semi-Markov Decision Process (SMDP) model in order to save the network energy consumption. And further, this paper gives the dynamic sleep algorithm of the FBS based on the value iteration. The simulation results show that the proposed SMDP-based adaptive sleep strategy of the FBS can effectively reduce the network energy consumption.     

载频智能节电技术在TD-LTE通信网络中的应用

在移动通信网络的能耗中,基站的能耗超过了整个通信系统能耗的70%,为了能够实现移动运营商的节能目标,对于无线基站节能减耗技术的研究将是一个非常重要的方面。首先从移动通信基站节能的现状出发,分析了TD-LTE系统中基站主设备智能节电系统设计的必要性。在分析无线网络话务时间规律的基础上,针对移动通信网络话务潮汐的特点,根据TD-LTE系统基站主设备的运行原理,分析了载频关断技术在TD-LTE基站系统中实现节能降耗的方法,提出了载频智能关断技术在TD-LTE基站系统中设计原则和技术方案,并且通过测试验证得出了载频智能关断技术在TD-LTE网络中运行的可行性。最后,对此项技术规模性应用所取得的节能效果进行了总结并提出应用建议。     

5G网络中基于覆盖区域优先级的微基站休眠算法

随着5G移动通信技术日渐成熟，移动终端数量快速增长，5G无线通信系统基站密集能耗问题突出，提出一种微基站区域分级休眠算法。考虑微基站负载、站间距离、层间配合对微基站休眠的影响，宏基站与宏基站之间重叠覆盖区域中微基站状态转换次数少，优先休眠操作节能效果好。仿真结果表明，节能率为23%，能适应不同的网络规模，在大规模网络中节能效果更优越。     

A Pre-Determined Nodes Deployment Strategy of Two-Tiered Wireless Sensor Networks Based on Minimizing Cost

Nodes deployment is a fundamental factor in determining the connectivity, coverage, lifetime and cost of wireless sensor networks. In this paper, a two-tiered wireless sensor networks consisting of sensor clusters and a base station is considered. Within a sensor cluster, there are many sensor nodes and a relay node. We focus on the deployment strategy for sensor nodes and relay nodes to minimize cost under some constraints. Several means are used. The regular hexagonal cell architecture is employed to build networks. Based on the analysis of energy consumption of sensors and cost of network, an integer programming model is presented to minimize the cost. By the model, number of layers of sensor cluster is determined. In order to balance the energy consumption of sensors on the identical layer, a uniform load routing algorithm is used. The numerical analysis and simulation results show that the waste of energy and cost of wireless sensor networks can be effectively reduced by using the strategy.     

AODVCS,a new bio-inspired routing protocol based on cuckoo search algorithm for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are becoming an emerging technology that offer several advantages to users in terms of cost and ease of use. A MANET is a collection of mobile nodes connected by wireless links that form a temporary network topology that operates without a base station and centralized administration. Routing is a method through which information is forwarded from a transmitter to a specific recipient. Routing is a strategy that guarantees, at any time, the connection between any two nodes in a network. In this work, we propose a novel routing protocol inspired by the cuckoo search method. Our routing protocol is implemented using Network simulator 2. We chose Random WayPoint model as our mobility model. To validate our work, we opted for the comparison with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters: packet delivery ratio and end-to-end delay (E2ED).     

Clustering and multi-hop routing with power control in wireless sensor networks

Clustering routing protocols excel in several aspects of wireless sensor networks (WSNs). This article proposes a clustering and multihop routing protocol (CMRP). In CMRP, a node independently makes its decision to compete for becoming a cluster head or join a cluster, according to its residual energy and average broadcast power of all its neighbors. To minimize the power consumption of the cluster head, CMRP sends the data in a power-aware multihop manner to the base station (BS) through a quasi-fixed route (QFR). In addition, CMRP presents a transmission power control algorithm with dynamic intercluster neighbor position estimation (DCNPE) to save energy. Simulation results show that the performance of CMRP is better than the hybrid, energy-efficient, distributed clustering approach (HEED). In the best case, CMRP increases the sensor network lifetime by 150.2%.     

Rate allocation strategies for energy-efficient multipath routing in Ad-hoc networks towards B3G

Wireless mobile Ad-hoc network is a special network that all nodes can self-organize and work together. It is flexible to form a network and extend the coverage area dynamically without infrastructure, so Ad-hoc network is envisioned as cornerstones of future generation networking technologies (B3G or 4G). However, the dynamic network topology makes the communication cost not only the energy of source/destination nodes, but also the relay nodes. Another problem of the Ad-hoc network is it is hard to provide a stable and persistent quality of service (QoS), which is strongly required by the beyond 3rd generation (B3G) system. In this article, the authors establish a scenario that contains B3G cellular base station and Ad-hoc mobile nodes, and propose two algorithms minimum incremental rate algorithm and power feed-back rate allocation algorithm in multipath routing. The algorithms can maintain a constant total transmission rate and bit error ratio (BER) to provide the QoS guarantee and reach the minimum power consumption of the relay nodes by adjusting the rate of each path in the multipath routing.     

Using group mobility and multihomed mobile gateways to connect mobile ad hoc networks to the global IP Internet

Connecting multihop mobile ad hoc wireless networks (MANETs) to the Internet would enable MANET nodes to share wireless Internet access with mobile hosts that are one‐hop away from their foreign networks. The integration of MANETs and the global Internet, however, faces an obstacle due to their network architectural mismatches regarding their infrastructure, topology, and mobility management mechanisms. Solutions to the integration problem should introduce an intermediate facility with hybrid mechanism, enabling it to connect to both networks. The quality of the multihop wireless Internet access service provided to MANET nodes depends on the design quality of this facility in order for MANET nodes to enjoy their Internet connectivity anywhere and anytime without much disconnections. In this paper, we propose hierarchical architecture that uses group mobility and multihomed mobile gateways, and present and analyse different simulations results. A multihomed mobile gateway can simultaneously connect to multiple Mobile IP foreign agents, provided it is located within their overlapping coverage area. It runs updated versions of the destination‐sequenced distance vector (DSDV) and Mobile IP protocols, and is responsible for providing MANET nodes with wireless Internet access though they are multiple wireless hops away from the edge of the Internet. The rationale behind using multihoming is to increase reliability of the Internet access service and enhance performance of the integrated network. Copyright © 2006 John Wiley & Sons, Ltd.     

面向绿色无线通信的基站体系结构

无线网络的耗能主要来自于基站系统。对无线通信系统中的基站系统结构进行有效地规划和部署,能达到降低能源消耗、实现绿色通信的目的。软件无线电技术的发展为无线基站的绿色演进提供了途径。基于软件无线电技术,文章提出一种可以有效提高通信系统能效、更为绿色环保的基站体系结构,能够更好地实现无线通信系统的绿色演进。     

5G基站智能节能方案研究

提出一种5G基站智能节能方案,用于降低5G基站设备能耗、节省5G网络运营成本、实现移动通信行业节能减排.所提方案是基于人工智能技术,从网络层面统一配置4G/5G基站节能策略,根据网络选定区域内小区的历史业务数据,构建基站业务负荷预测模型,并生成最优的网络节能策略,根据网络节能策略分别执行各基站的节能任务.在节能任务执行...     

Pre-Reply Probe and Route Request Tail: Approaches for Calculation of Intra-Flow Contention in Multihop Wireless Networks

Several applications have been envisioned for multihop wireless networks that require different qualities of service from the network. In order to support such applications, the network must control the admission of flows. To make an admission decision for a new flow, the expected bandwidth consumption of the flow must be correctly determined. Due to the shared nature of the wireless medium, nodes along a multihop path contend among themselves for access to the medium. This leads to intra-flow contention; contention between packets of the same flow forwarded by different hops along a multihop path, resulting in an increase in the actual bandwidth consumption of the flow to a multiple of its single hop bandwidth requirement. Determining the amount of intra-flow contention is non-trivial since interfering nodes may not be able to communicate directly if they are outside each other's transmission range. In this paper we examine methods to determine the extent of intra-flow contention along multihop paths in both reactive and proactive routing environments. The highlight of the solutions is that carrier-sensing data is used to deduce information about carrier-sensing neighbors, and no high power transmissions are necessary. Analytical and simulation results show that our methods estimate intra-flow contention with low error, while significantly reducing overhead, energy consumption and latency as compared to previous approaches. Kimaya Sanzgiri is a PhD candidate in the Department of Computer Science at the University of California, Santa Barbara. She is working with Prof. Elizabeth Belding-Royer in the Mobility Management and Networking (MOMENT) Laboratory. Kimaya received her B.E. (Hons.) in Computer Science from the Birla Institute of Technology and Science (BITS), Pilani, India in 1999. Her research interests are in the area of wireless networking, specifically mobility, quality of service support and security. See for more details. Ian D. Chakeres is an Ph.D. student in the Department of Electrical and Computer Engineering at the University of California, Santa Barbara. He is working with Prof. Elizabeth M. Belding-Royer in the Mobile Management and Networking (MOMENT) Laboratory. He completed his B.S. and M.S. in Electrical and Computer Engineering at Ohio State University in 1998 and 1999. He is also a co-chair of the IETF MANET working group. Ian's research interests include wireless communication and mobile networking, specifically routing protocols, MAC protocols, cross-layer coordination and quality of services in mobile wireless networks. See for further details. Elizabeth M. Belding-Royer is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. She completed her Ph.D. in Electrical and Computer Engineering at UC Santa Barbara in 2000. Elizabeth's research focuses on mobile networking, specifically routing protocols, multimedia, monitoring, and advanced service support. Elizabeth is the author of numerous papers related to ad hoc networking and has served on many program committees for networking conferences. Elizabeth is the TPC Co-Chair of ACM MobiCom 2005 and IEEE SECON 2005, and is currently on the editorial board for the Elsevier Science Ad hoc Networks Journal. Elizabeth is the recipient of an NSF CAREER award, and a 2002 Technology Review 100 award, awarded to the world's top young investigators. She is a member of the IEEE, IEEE Communications Society, ACM, and ACM SIGMOBILE. See for further details.     

Ad Hoc中的常用路由算法分析

在传统的移动无线Internet接入方式中，通常是以宽带有线接入网为支撑。无线用户只通过一跳(不需要在无线网中多次转接)就可以接入固定网络。在很多应用场合，如个人区域网、家域网、军事应用、抢险救灾等，无线网络没有固定的基础设施作支撑，移动用户的信息需要通过移动用户之间的多次中转才能到达目的用户，这种网络通常称为分布式或无中心式(Ad hoc)网络。本文首先介绍了Ad Hoc网络。然后介绍了目前运用于Ad Hoc网络中的几种路由算法，并指出其优缺点。     

Energy-efficient and QoS-supported deployment strategy of dense Macro-Femto cellular network

With the exponentially increasing of users’ demand for mobile data traffic,massive small cells have been deployed to satisfy the users’ quality of service (QoS) by operators.However,a significant energy would be consumed caused by dense deployment.To this end,a dense heterogeneous cellular network deployment strategy was proposed with QoS guarantee to decline system energy consumption.Firstly,a dense Macro-Femto biased cellular network was used to build the network model,the two QoS indicators of SINR coverage and user average rate was analyzed by stochastic geometry theory.Then,under the condition of QoS constraint,average spatial power consumption (ASPC) was taken as the optimization goal,optimal deploy density and transmission power of Femto were achieved by using optimization theory.Finally,the experimental results show that,comparing with the traditional strategy which only considering base station density,the proposed strategy has advantages in terms of energy efficiency while QoS guarantee.