系统集成设计 大、中型通信网络集成项目实施 标前调研、技术交流、投标方案编制.doc

Mobility management across hybrid wireless networks: Trends and challengesComputer CommunicationsFuture generation wireless networks are envisioned to be a combination of diverse but complementary access technologies. Internetworking these types of networks will provide mobile users with ubiquitous connectivity across a wide range of networking environments. The integration of existing and emerging heterogeneous wireless networks requires the design of intelligent handoff and location management schemes to enable mobile users to switch network access and experience uninterrupted service continuity anywhere, anytime. Real deployment of such mobility strategies remains a significant challenge. In this article, we focus on handoff management. We discuss in detail handoff decision and implementation procedures and present recent handoff techniques that aim at providing mobility over a wide range of access technologies. We also discuss some of the capabilities of mobile terminals that are necessary to implement seamless mobility over hybrid wireless networks. Furthermore, we also present and discuss limitations of recent handoff design architectures and protocols as well as outstanding challenges that still need to be addressed to achieve portable and scalable handoff solutions for continuous connectivity across wireless access networks.Article Outline1. Introduction2. Wireless overlay networks3. Handoffs in wireless overlay networks 3.1. Horizontal vs. vertical handoff3.2. Upward-vertical handoff vs. downward vertical handoff3.3. Anticipated vs. unanticipated handoff3.4. Hard vs. soft handoff3.5. Mobile-controlled handoff vs. network-controlled handoff vs. mobile-assisted handoff4. Vertical handoff process 4.1. Network discovery4.2. Handoff decision: traditional vs. next generation handoff strategies4.3. Handoff metrics in heterogeneous networks 4.3.1. Cost4.3.2. Network conditions4.3.3. Battery power4.3.4. Application types4.3.5. Mobile node conditions4.3.6. User preferences4.4. Handoff implementation 4.4.1. Context transfer for seamless handoffs in heterogeneous wireless networks4.4.2. Candidate access router discovery and context transfer protocol4.4.3. CARD protocol4.4.4. Context transfer protocol5. Terminal requirements for future heterogeneous wireless networks 5.1. Multimode wireless terminals 5.1.1. Requirements for multimode terminal operation5.1.2. Deployment issues for multimode terminals 5.1.2.1. Network detection5.1.2.2. Network information5.2. Software-defined radios 5.2.1. Motivation for SDR development5.2.2. Key features of SDR technology 5.2.2.1. Reconfigurability5.2.2.2. Multimode operation5.2.2.3. Ubiquitous connectivity5.2.2.4. Interoperability6. Recent vertical handoff management techniques proposed for heterogeneous wireless networks 6.1. Mobile IP6.2. Mobile IPv66.3. Network layer handoff approaches 6.3.1. HOPOVER 6.3.1.1. Handoff Preparation6.3.1.2. Handoff6.3.1.3. Updating mobile IP information6.3.1.4. Limitations of HOPOVER6.3.2. Hierarchical approach 6.3.2.1. Limitations of the hierarchical approach6.3.3. OmniCon 6.3.3.1. Limitations of the Omnicon Approach6.4. Transport layer handoff approaches 6.4.1. SCTP-based vertical handoff 6.4.1.1. Limitations of SCTP-based handoff scheme6.5. Application layer handoff approach 6.5.1. Limitations of SIP6.6. Energy-efficient Handoff Approaches 6.6.1. Adaptive vertical handoff6.6.2. WISE6.7. TCP-based handoff strategies7. Research challenges for mobility management in future heterogeneous wireless networks 7.1. Multimodality7.2. Efficient and seamless roaming 7.2.1. Detection of network coverage7.2.2. Selection of the most appropriate access network7.2.3. Handoffs7.3. Quality of service (QoS) 7.3.1. QoS requirements7.3.2. Security7.4. Billing and pricing7.5. Transfer of contextual information 7.5.1. Context transfer7.5.2. Security of context transfer7.6. Inter-service provider compliance8. ConclusionWireless mesh networks: a surveyComputer NetworksWireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. The integration of WMNs with other networks such as the Internet, cellular, IEEE 802.11, IEEE 802.15, IEEE 802.16, sensor networks, etc., can be accomplished through the gateway and bridging functions in the mesh routers. Mesh clients can be either stationary or mobile, and can form a client mesh network among themselves and with mesh routers. WMNs are anticipated to resolve the limitations and to significantly improve the performance of ad hoc networks, wireless local area networks (WLANs), wireless personal area networks (WPANs), and wireless metropolitan area networks (WMANs). They are undergoing rapid progress and inspiring numerous deployments. WMNs will deliver wireless services for a large variety of applications in personal, local, campus, and metropolitan areas. Despite recent advances in wireless mesh networking, many research challenges remain in all protocol layers. This paper presents a detailed study on recent advances and open research issues in WMNs. System architectures and applications of WMNs are described, followed by discussing the critical factors influencing protocol design. Theoretical network capacity and the state-of-the-art protocols for WMNs are explored with an objective to point out a number of open research issues. Finally, testbeds, industrial practice, and current standard activities related to WMNs are highlighted.Article Outline1. Introduction2. Network architecture3. Characteristics4. Application scenarios5. Critical factors influencing network performance6. Capacity of WMNs 6.1. Capacity analysis6.2. Open research issues7. Physical layer 7.1. Advanced physical layer techniques7.2. Open research issues8. MAC layer 8.1. Single-channel MAC8.2. Multi-channel MAC8.3. Open research issues9. Network layer 9.1. Routing protocols with various performance metrics9.2. Multi-radio routing9.3. Multi-path routing for load balancing and fault tolerance9.4. Hierarchical routing9.5. Geographic routing9.6. Open research issues10. Transport layer 10.1. Protocols for reliable data transport 10.1.1. TCP variants10.1.2. Entirely new transport protocols10.2. Protocols for real-time delivery10.3. Open research issues11. Application layer 11.1. Applications supported by WMNs11.2. Open research issues12. Protocols for network management 12.1. Mobility management12.2. Power management12.3. Network monitoring13. Security14. Timing synchronization15. Cross-layer design16. Testbeds and implementations 16.1. Academic research testbeds16.2. Industrial practice17. Standard activities 17.1. IEEE 802.11 mesh networks17.2. IEEE 802.15 mesh networks17.3. IEEE 802.16 mesh networks18. ConclusionAcknowledgementsReferencesEfficiently reconfigurable backbones for wireless sensor networksWe present the definition and performance evaluation of a protocol for building and maintaining a connected backbone among the nodes of a wireless sensor networks (WSN). Building backbones first, and then coping with network dynamics is typical of protocols for backbone formation. Rules for building the backbone, however, do not take into account the following network dynamics explicitly. This makes maintaining a connected backbone quite costly, especially in terms of reorganization time, overhead and energy consumption. Our protocol includes in the backbone forming operations a fail-safe mechanism for dealing with the addition and the removal of nodes, which are typical events in a WSN. More specifically, the network is kept partitioned into clusters that are cliques, i.e., nodes in each cluster are directly connected to each others. Therefore, removing a node does not disrupt a cluster, and adding one requires simple operations for checking node admission to the cluster. The protocol, termed CC (“double C”, for clique clustering), comprises three phases, each designed to render the operations of the others swift and efficient. The first phase partitions the network into clusters that are cliques. Clusters are then joined to form a backbone that is provably connected. Finally, the third, more on-line phase, maintains the backbone connected in face of node additions and removals. We compare the performance of CC with that of DMAC, a protocol that has been previously proposed for building and maintaining clusters and backbones in presence of network dynamics. Our comparison concerns metrics that are central to WSN research, such as time for clustering and backbone reorganization, corresponding overhead, extent of the reorganization (i.e., number of nodes involved in it), and properties of the resulting backbone, such as its size, backbone route length, number of gateways and nodes per cluster. Our ns2-based simulation results show that the design criteria chosen for CC are effective in producing backbones that can be reconfigured quickly and with remarkably lower overhead.Article Outline1. Introduction2. Related work3. Clique clustering (CC) 3.1. Cluster formation phase 3.1.1. Cluster formation correctness3.2. Cluster interconnection3.3. Backbone reorganization 3.3.1. Removing nodes3.3.2. Backbone reorganization correctness: Nodes removal3.3.3. Adding new nodes3.3.4. Backbone reorganization correctness: Addition of nodes4. DMAC5. Experimental results 5.1. Simulation scenarios, metrics and experiments5.2. Backbone formation: Setting the network up5.3. Maintaining the backbone: Dealing with node removals5.4. Maintaining the backbone: Addition of a node6. ConclusionsOptimization models and methods for planning wireless mesh networksIn this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing full coverage to wireless mesh clients. Our mixed integer linear programming models allow to select the number and positions of mesh routers and access points, while accurately taking into account traffic routing, interference, rate adaptation, and channel assignment. We provide the optimal solutions of three problem formulations for a set of realistic-size instances (with up to 60 mesh devices) and discuss the effect of different parameters on the characteristics of the planned networks. Moreover, we propose and evaluate a relaxation-based heuristic for large-sized network instances which jointly solves the topology/coverage planning and channel assignment problems. Finally, the quality of the planned networks is evaluated under different traffic conditions through detailed system level simulations.Article Outline1. Introduction2. Related work and contributions3. Basic model 3.1. Numerical results4. Interference aware model 4.1. Relaxation-based heuristic5. Multiple channel model 5.1. Two-phase heuristic6. Network performance evaluation via simulation7. ConclusionReferencesObstacles constrained group mobility models in event-driven wireless networks with movable base stationsAd Hoc NetworksIn this paper, we propose a protocol for dynamic reconfiguration of ad-hoc wireless networks with movable base stations in presence of obstacles. Hosts are assigned to base stations according to a probabilistic throughput function based on both the quality of the signal and the base station load. In order to optimize space coverage, base stations cluster hosts using a distributed clustering algorithm. Obstacles may interfere with transmission and obstruct base stations and hosts movement. To overcome this problem, we perform base stations repositioning making use of a motion planning algorithm on the visibility graph based on an extension of the bottleneck matching technique. We implemented the protocol on top of the NS2 simulator as an extension of the AODV. We tested it using both Random Way Point and Reference Point Group mobility models properly adapted to deal with obstacles. Experimental analysis shows that the protocol ensures the total space coverage together with a good throughput on the realistic model (Reference Point Group) outperforming both the standard AODV and DSR.Article Outline1. Introduction2. Related work 2.1. Topology maintenance in wireless networks2.2. Mobility models3. Space coverage optimization 3.1. The Antipole Clustering in mobile wireless network with starred backbone3.2. Distributed Antipole Clustering and base stations repositioning in absence of obstacles3.3. Clustering and base stations repositioning in presence of obstacles4. Throughput optimization and network maintenance5. Implementation in NS2 and experimental analysis6. Conclusions and future workAcknowledgementsReferencesMedium Access Control protocols for ad hoc wireless networks: A surveyStudies of ad hoc wireless networks are a relatively new field gaining more popularity for various new applications. In these networks, the Medium Access Control (MAC) protocols are responsible for coordinating the access from active nodes. These protocols are of significant importance since the wireless communication channel is inherently prone to errors and unique problems such as the hidden-terminal problem, the exposed-terminal problem, and signal fading effects. Although a lot of research has been conducted on MAC protocols, the various issues involved have mostly been presented in isolation of each other. We therefore make an attempt to present a comprehensive survey of major schemes, integrating various related issues and challenges with a view to providing a big-picture outlook to this vast area. We present a classification of MAC protocols and their brief description, based on their operating principles and underlying features. In conclusion, we present a brief summary of key ideas and a general direction for future work.Article Outline1. Introduction 1.1. Applications1.2. Important issues1.3. Need for special MAC protocols2. Classification3. Review of non-QoS MAC protocols 3.1. General MAC protocols 3.1.1. Multiple access collision avoidance (MACA)3.1.2. IEEE 802.11 MAC scheme3.1.3. Multiple access collision avoidance-by invitation (MACA-BI)3.1.4. Group allocation multiple access with packet sensing (GAMA-PS)3.2. Power aware MAC protocols 3.2.1. Power aware medium access control with signaling (PAMAS)3.2.2. Dynamic power saving mechanism (DPSM)3.2.3. Power control medium access control (PCM)3.2.4. Power controlled multiple access (PCMA)3.3. Multiple channel protocols 3.3.1. Dual busy tone multiple access (DBTMA)3.3.2. Multi channel CSMA MAC protocol3.3.3. Hop-reservation multiple access (HRMA)3.3.4. Multi-channel medium access control (MMAC)3.3.5. Dynamic channel assignment with power control (DCA-PC)3.4. Protocols using directional antennas3.5. Unidirectional MAC protocols4. QoS-aware MAC protocols 4.1. Issues affecting QoS4.2. Review of selected QoS-aware MAC protocols 4.2.1. Real-time MAC (RT-MAC)4.2.2. DCF with priority classes4.2.3. Enhanced DCF4.2.4. Black burst (BB) contention4.2.5. Elimination by sieving (ES-DCF) and deadline bursting (DB-DCF)4.2.6. Multiple access collision avoidance with piggyback reservations (MACA/PR)4.2.7. Asynchronous QoS enabled multi-hop MAC4.2.8. Distributed fair scheduling (DFS)5. Summary and future directions 5.1. Future directions 5.1.1. Hidden/exposed terminal problems5.1.2. Interference-limited model5.1.3. Energy conservation5.1.4. Single channel vs. multiple channels5.1.5. Multi-hop networks5.1.6. Fairness among competing nodes5.1.7. Directional antennas5.1.8. QoS issues6. ConclusionReferencesA quadratic optimization method for connectivity and coverage control in backbone-based wireless networksThe use of directional wireless communications to form flexible mesh backbone networks, which provide broadband connectivity to capacity-limited wireless networks or hosts, promises to circumvent the scalability limitations of traditional homogeneous wireless networks. The main challenge in the design of directional wireless backbone (DWB) networks is to assure backbone network requirements such as coverage and connectivity in a dynamic wireless environment. This paper considers the use of mobility control, as the dynamic reposition of backbone nodes, to provide assured coverage-connectivity in dynamic environments. This paper presents a novel approach to the joint coverage-connectivity optimization problem by formulating it as a quadratic minimization problem. Quadratic cost functions for network coverage and backbone connectivity are defined in terms of the square distance between neighbor nodes, which are related to the actual energy usage of the network system. Our formulation allows the design of self-organized network systems which autonomously achieve energy minimizing configurations driven by local forces exerted on network nodes. The net force on a backbone node is defined as the negative energy gradient at the location of the backbone node. A completely distributed algorithm is presented that allows backbone nodes to adjust their positions based on information about neighbors position only. We present initial simulation results that show the effectiveness of our force-based mobility control algorithm to provide network configurations that optimize both network coverage and backbone connectivity in different scenarios. Our algorithm is shown to be adaptive, scalable and self-organized.Article Outline1. Motivation2. Coverage and connectivity optimization3. Optimization algorithm4. Simul