An efficient network coded ARQ for multisource multidestination relay networks over mixed flat fading channels

This paper proposes a new reliable automatic repeat request (ARQ) transmission protocol for wireless multisource multidestination relay networks over mixed fading channels. Conventional application of ARQ protocols to retransmit lost or erroneous packets in relay networks can cause considerable delay latency with a significant increase in the number of retransmissions when networks consist of multiple sources and multiple destinations. To address this issue, a new ARQ protocol based on network coding (NC) is proposed where the relay detects packets from different transmission sources, then uses NC to combine and forward lost packets to their destinations. An efficient means for the retransmission of all lost packets is proposed through two packet-combination algorithms for retransmissions at the relay and sources. The paper derives mathematical formulation of transmission bandwidth for this new NC-based ARQ protocol and compares analytical and simulation results with some other ARQ protocols over both mixed Rayleigh and Rician flat fading channel. The mixed fading model permits investigation of two typical fading scenarios where the relay is located in the neighbourhood of either the sources or the destinations. The transmission bandwidth results show that the proposed NC-based ARQ protocol demonstrates superior performance over other existing ARQ schemes.     

On the optimal flow allocation and information theoretically secure network coding design for multiple multicasts

With linear network coding (LNC), the data packets transmitted in a communication network are coded packets, which are linear combinations of original data packets. Since the coded packets can be useful for multiple destinations in multicast, LNC has been shown as a promising technology to improve the network throughput. On the other hand, the original data packets can be encoded with random symbols and transmitted in the network to make sure that a passive attacker cannot obtain the information of these original data packets when the passive attacker cannot obtain enough coded packets. Therefore, LNC also provides secure transmission without using the traditional encryption and decryption. In this paper, we will study an Information Theoretically Secure Multiple Multicasts (ITSMM) problem with the following objectives: (1) maximizing the secure transmission rate (STR), (2) minimizing the random symbol rate (RSR), and (3) minimizing the bandwidth cost (BC), when the data transmission is information theoretically secure. We firstly theoretically analyze the ITSMM problem, which shows that it is equivalent to a problem of network flow with constraints on each intermediate node. We then formulate the ITSMM problem by 3 linear programmings to get the maximum STR, the minimum RSR, and the minimum BC. After that, we prove the sufficient condition for the size of finite field over which the information theoretically secure linear multicast code (ITSLMC) can be designed. At last, we give extensive simulations, which show that the proposed algorithms are effective and efficient.     

Transmission Range Effects on AODV Multicast Communication

As laptop computers begin to dominate the marketplace, wireless adapters with varying bandwidth and range capabilities are being developed by hardware vendors. To provide multihop communication between these computers, ad hoc mobile networking is receiving increasing research interest. While increasing a node's transmission range allows fewer hops between a source and destination and enhances overall network connectivity, it also increases the probability of collisions and reduces the effective bandwidth seen at individual nodes. To enable formation of multihop ad hoc networks, a routing protocol is needed to provide the communication and route finding capability in these networks. The Ad hoc On-Demand Distance Vector Routing protocol (AODV) has been designed to provide both unicast and multicast communication in ad hoc mobile networks. Because AODV uses broadcast to transmit multicast data packets between nodes, the transmission range plays a key role in determining the performance of AODV. This paper studies the effects of transmission range on AODV's multicast performance by examining the results achieved at varying transmission ranges and network configurations.     

Cost analysis and efficient radio bearer selection for multicasting over UMTS

Along with the widespread deployment of the Third Generation (3G) cellular networks, the fast‐improving capabilities of the mobile devices, content, and service providers are increasingly interested in supporting multicast communications over wireless networks and in particular over Universal Mobile Telecommunications System (UMTS). To this direction, the Third Generation Partnership Project (3GPP) is currently standardizing the Multimedia Broadcast/Multicast Service (MBMS) framework of UMTS. In this paper, we present an overview of the MBMS multicast mode of UMTS. We analytically present the multicast mode of the MBMS and analyze its performance in terms of packet delivery cost under various network topologies, cell types, and multicast users' distributions. Furthermore, for the evaluation of the scheme, we consider different transport channels for the transmission of the multicast data over the UMTS Terrestrial Radio‐Access Network (UTRAN) interfaces. Finally, we propose a scheme for the efficient radio bearer selection that minimizes total packet delivery cost. Copyright © 2008 John Wiley & Sons, Ltd.     

A flexible network architecture for data multicasting in“multiservice networks”

The paper describes a canonical model of data-transport architecture that offers a flexible framework for implementations of data multicasting on backbone networks to support multiservice applications (e.g., videoconferencing, digital TV broadcast). The architecture is based on acyclic graph structured communication channels that provide connectivity among data sources and destinations through switches and links in a backbone network. The paper adopts a network-wide logical addressing of communication channels, which allows data multicasting to be realized on specific backbone networks by establishing local bindings between a logical address and the information on network-specific routing of data over switches and links. The approach allows various sources to share the switches and links in a multicast path connecting to destinations. This is a desirable feature in view of the significant reduction in network routing control costs and data transfer costs when dealing with high-volume multisource data (say, in videoconferencing). In addition, logical addressing allows grouping of selected destinations to overlay different “virtual networks” on a base-level multicast channel (e.g., private discussion groups in a conference). As a demonstration of architectural flexibility, the paper describes the embedding of our multicast model on sample backbone networks capable of supporting multiservice applications: interconnected LANs, ATM networks, and high-speed public data networks (viz., SMDS networks)     

一种异构网络多协议并行数据分发方法

跨技术通信迅猛发展推动着单一网络向异构无线网络的转变,该转变极大地提高异构无线设备(如Wi-Fi和ZigBee)的高效共存和协作,但也给异构无线网络中的数据分发问题带来了挑战。由于异构网络节点通信范围差异和低占空比节点周期性睡眠的特点,传统数据分发方法不能高效地利用信道资源而导致较低的分发效率。为了解决这些问题,该文提出一种适用于异构网络的并行数据分发方法。通过数据分发时延和能耗定义新的系统损失函数,并证明了损失函数的合理性,利用信标控制的延迟接收数据包的分发策略,从而实现对周期性睡眠的ZigBee网络进行高效数据分发。进一步地,该文根据动态规划的思想,推导出系统的整体能量损耗和时延的最优值。通过仿真实验证明,在考虑时延和能量损耗的前提下,该文的数据分发方法的性能优于传统的数据分发方法。     

An Efficient Mechanism for Multicast Data Transmission in UMTS

In this paper, we present an efficient scheme for the multicast transmission of the data in the Universal Mobile Telecommunications System (UMTS). We take advantage of the tree topology of the examined network and we introduce the use of Routing Lists (RLs) in the nodes of the UMTS. The adoption of these lists leads to the decrement of the transmitted packets and to the efficient use of network resources in the multicast transmission of the data. We describe in detail the appropriate steps for the successful multicast transfer of data. Furthermore, we analyze the handling of special cases such as user mobility scenarios. Especially, the various handover types are examined along with the Serving Radio Network Subsystem relocation procedure. Finally, we implement our approach in the NS-2 simulator and we present the performance of the multicast mechanism.     

FTR: features tree based routing in mobile social networks

Mobile social networks are among subsets of delay tolerant networks. The nodes of these networks are mobile and the communication between them is done wireless and all nodes have social characteristics. The connection between these nodes is temporary and there is not end to end route between the source and the destination. Therefore, it is difficult to deliver the packets to the destination. One of the best routing methods in such networks is to use the information about the network context. These methods require the process of information collection and replicate the packets based on the context to increase the delivery ratio and enforce great overhead onto the network. Since the nodes have social characteristics and these features exist within the network, it seems that using them within the routing can be useful. In this paper a community based method of delivering is proposed that uses social characteristics of the individual members for routing the packets. Using the predetermined roles for the members that do not need data collection level can improve routing in these networks. In this method a tree is formed and each group of the members is entitled in one branch of it. The transmission of the packets from the source to the destination is done based on the differences between their characteristics and through the route which has the highest number of the nodes. The simulation results show that the delivery ratio of this method has increased regarding the related works and the overhead ratio has decreased.

     

Performance evaluation of CSMA/ID MAC protocol for IP over WDM ring networks

In this paper, a packet pre‐classification media access control protocol based on a carrier sense multiple access with idle detection (CSMA/ID) scheme is investigated for supporting IP packets over all‐optical WDM ring networks. The purpose of the protocol is to increase throughput and to decrease the packet transmission delay of IP packets over optical networks in a metropolitan area network. This protocol avoids both packet collision and packet fragmentation. In order to improve the utilization of the network, the packets transmitted from a local area network are first pre‐classified into various class queues of an access point (AP) according to their length. After checking the available space based on the wavelength received by the receivers of the AP, the packets in the queues are transmitted. An analytical model is developed to evaluate the performance of the protocol, with simulation results showing good network efficiency. The proposed network has short‐term variations that introduce unfairness conditions. This problem could be overcome by assigning a quota on individual queues to allow all queues fair access. Copyright © 2008 John Wiley & Sons, Ltd.     

A multicast mechanism for UMTS

This article aims to investigate multicast deployment issues and requirements in the context of UMTS networks. We propose a multicast mechanism that supports resource-efficient multicast packet delivery. The proposed scheme allows multicast packets to be transferred in an optimal manner on shared links toward multiple destinations. We describe the mechanisms of the proposed scheme in establishing multicast tunnels within the network and performing group management. We explore the differences between the proposed scheme and the multimedia broadcast/multicast service of the 3GPP, and outline the advantages and disadvantages of both multicast schemes.     

Distributed network embedded FEC for real-time multicast applications in multi-hop wireless networks

Multi-hop wireless networks are becoming popular because of their flexibility and low deployment cost. Emerging technologies such as orthogonal frequency division and multiple in and multiple out have significantly increased the bandwidth of a wireless channel. Further, as device cost decreases, a communication terminal can have multiple radios and transmit/receive data simultaneously, which improves the capacity of a wireless network. This makes the support of real-time multicast applications over multi-hop wireless networks viable and practical. Meanwhile, wireless links are prone to random and burst losses due to multipath fading and cross channel interference, real-time multicast over a wireless network remains a challenging problem. Traditional end-to-end FEC is less efficient in multi-hop wireless networks, as packets may suffer from random or burst losses in more than one hop before they arrive at their destination. In this paper, we advocate the deployment of distributed network-embedded FEC (DNEF) for real-time multicast distribution over multi-hop wireless networks. We first develop a packet loss model of multi-hop wireless networks using a system analysis approach. We then propose a distributed codec placement algorithm and evaluate its performance. Our simulation shows that multicast using DNEF significantly outperforms both traditional multicast and application-level peer-to-peer multicast that can be deployed over multi-hop wireless networks.     

The Advantages of Partitioning Multicast Transmissions in a Single-Hop Optical WDM Network*

In a single-hop WDM optical network, a straightforward approach to implementing multicasting is to schedule a single transmission to multiple destinations so that all of the destinations may receive the same transmission by tuning their receivers to the same channel at the same time. Although scheduling a single transmission in this manner reduces the amount of transmitter and channel resources being used, it may also place a burden on the receivers in the network. If all receivers do not become available at the same time, then some receivers may have to wait (and be idle) for significantly long periods of time before receiving the message. In this paper, we investigate methods for partitioning a multicast group into a number of smaller subgroups and for scheduling a separate transmission for each of these subgroups. We show that this approach more effectively conserves and balances the usage of transmitter and receiver resources in the network and may lead to significantly improved system performance over the conventional single-transmission multicast approach.     

Efficient Handover with Load Balancing: A Quality Perspective Approach

The heterogeneous wireless networking environment determined by the latest developments in wireless access technologies promises a high level of communication resources for mobile computational devices. Although the communication resources provided, especially referring to bandwidth, enable multimedia streaming to mobile users, maintaining a high user perceived quality is still a challenging task. The main factors which affect quality in multimedia streaming over wireless networks are mainly the error-prone nature of the wireless channels and the user mobility. These factors determine a high level of dynamics of wireless communication resources, namely variations in throughput and packet loss as well as network availability and delays in delivering the data packets. Under these conditions maintaining a high level of quality, as perceived by the user, requires a quality oriented mobility management scheme. Consequently a proposed smooth adaptive soft-handover algorithm, a novel quality oriented handover management scheme which unlike other similar solutions, smoothly transfer the data traffic from one network to another using multiple simultaneous connections.     

A routing architecture for mobile integrated services networks

A drawback of the conventional Internet routing architecture is that its route computation and packet forwarding mechanisms are poorly integrated with congestion control mechanisms. Any datagram offered to the network is accepted; routers forward packets on a best-effort basis and react to congestion only after the network resources have already been wasted. A number of proposals improve on this to support multimedia applications; a promising example is the Integrated Services Packet Network (ISPN) architecture. However, these proposals are oriented to networks with fairly static topologies and rely on the same conventional Internet routing protocols to operate. This paper presents a routing architecture for mobile integrated services networks in which network nodes (routers) can move constantly while providing end-to-end performance guarantees. In the proposed connectionless routing architecture, packets are individually routed towards their destinations on a hop by hop basis. A packet intended for a given destination is allowed to enter the network if and only if there is at least one path of routers with enough resources to ensure its delivery within a finite time. Once a packet is accepted into the network, it is delivered to its destination, unless resource failures prevent it. Each router reserves resources for each active destination, rather than for each source–destination session, and forwards a received packet along one of multiple loop-free paths towards the destination. The resources and available paths for each destination are updated to adapt to congestion and topology changes. This mechanism could be extended to aggregate dissimilar flows as well. This revised version was published online in June 2006 with corrections to the Cover Date.     

The Effects of Physical Layer on the Routing Wireless Protocol

Mobile ad hoc networks (MANETs) are characterized by multiple entities, a frequently changing network topology and the need for efficient dynamic routing protocols. In MANETs, nodes are usually powered by batteries. Power control is tightly coupled with both the physical and medium access layers (MACs). However, if we increase the transmission power, at the same time we increase the interference to other nodes which diminish the transport capacity of wireless systems. Thus, the routing protocols based on hop count metric suffer from performance degradation when they operate over MANET. Routing in ad hoc wireless networks is not only a problem of finding a route with shortest length, but it is also a problem of finding a stable and good quality communication route in order to avoid any unnecessary packet loss. Cross-layer design of ad hoc wireless networks has been receiving increasing attention recently. Part of these researches suggests that routing should take into account physical layer characteristics. The goal of this paper is to improve the routing reliability in MANET and to reduce power consumption through cross-layer approach among physical, MAC and network layers. The proposed cross-layer approach is based on signal to interference plus noise ratio (SINR) and received signal strength indication (RSSI) coming from the physical layer. This solution performs in one hand the ad hoc on-demand distance vector routing protocol by choosing reliable routes with less interferences using SINR metric and in another hand; it permits to reduce the power transmission when sending the data packets by using RSSI metric.     

NER-DRP: Dissemination-based Routing Protocol with Network-layer Error Control for Intermittently Connected Mobile Networks

Reliable transmission in Intermittently Connected Mobile Networks (ICMNs) is a challenging work because the effective and reliable connection between the source and the destination can not be sustained. To reliably hand over data packets to the destination, many dissemination-based routing protocols are proposed. Dissemination-based routing protocols assure nodes including intermediate nodes and destinations have more chances to receive packets, which will increase the probability that the packets can be correctly received by the destination. However, the existing error recovery mechanisms in network layer use the simple CRC to check the data packets independently, and discard the error packets even if one correct packet can be obtained from more than one partly error packets. In this paper, first we propose a novel Network layer Error Recovery method (abbreviated as NER) based on Forward Error Correction (FEC). NER divides a data packet into Reed Solomon (RS) blocks and insert redundancy to each block. So the intermediate nodes and destinations can recover a correct data packet from multiple partially error copies of the same packet. Then we propose a novel routing protocol named NER-DRP based on the Epidemic routing and NER, which can improve the performance of ICMNs in terms of delivery ratio, end-to-end delay and count of hops.     

Distributed Store-and-Forward Deadlock Detection and Resolution Algorithms

Distributed algorithms for the detection and resolution of deadlocks in store-and-forward computer communication networks are presented and validated. The algorithms use a fixed amount of storage at each node (that is independent of the size of the network). The detection algorithm is simple but requires network-wide coordination. The resolution algorithm is based on earlier approaches, but uses the network-wide coordination to address certain synchronization problems. When the detection and resolution algorithms are merged, it is guaranteed that packets will arrive at their destinations in finite time.     

Hopfield neural‐network‐based dynamic resource allocation scheme for non‐real‐time traffic in wireless networks

Dynamic resource allocation (DRA) plays a fundamental role in current and future wireless networks, including 3G systems. In this paper, a scheduling DRA scheme for non‐real‐time (NRT) packet services in wireless system is proposed based on the use of Hopfield neural networks (HNN). The scheme exploits the fast response time of HNN for solving NP optimization problems and has been particularized for the downlink transmission in a UMTS system, although it could be easily extended to any other radio access technology. The new DRA scheme follows a delay‐centric approach, since it maximizes the overall system resource utilization while minimizing the packet delay. Simulation results confirm that the proposed HNN‐based DRA scheme is effective in supporting different types of NRT services, while achieving efficient utilization of radio resources. Copyright © 2008 John Wiley & Sons, Ltd.     

VLC-WiFi异构网络QoS感知的跨层动态资源分配

VLC-WiFi异构网络已经成为广受欢迎的短距离无线通信方式之一。然而,有限的频谱资源导致VLC-WiFi异构网络容量难以满足井喷式增长的用户数据带宽需求。该文结合物理层的动态链路传输性能以及媒体访问控制层的队列缓冲延迟性能,定义链路传输性能和链路服务质量(QoS)感知等级评估公式,根据用户数据包QoS需求,设计QoS感知的跨层动态资源分配(QoS-CLDRA)方法,并引入非正交多址接入的用户匹配与功率分配策略,进一步提升系统的吞吐量。仿真结果表明:所提方法能够有效提升系统吞吐量和降低缓冲队列长度。     

ACAR: Adaptive Connectivity Aware Routing for Vehicular Ad Hoc Networks in City Scenarios

Multi-hop vehicle-to-vehicle communication is useful for supporting many vehicular applications that provide drivers with safety and convenience. Developing multi-hop communication in vehicular ad hoc networks (VANET) is a challenging problem due to the rapidly changing topology and frequent network disconnections, which cause failure or inefficiency in traditional ad hoc routing protocols. We propose an adaptive connectivity aware routing (ACAR) protocol that addresses these problems by adaptively selecting an optimal route with the best network transmission quality based on statistical and real-time density data that are gathered through an on-the-fly density collection process. The protocol consists of two parts: 1) select an optimal route, consisting of road segments, with the best estimated transmission quality, and 2) in each road segment of the chosen route, select the most efficient multi-hop path that will improve the delivery ratio and throughput. The optimal route is selected using our transmission quality model that takes into account vehicle densities and traffic light periods to estimate the probability of network connectivity and data delivery ratio for transmitting packets. Our simulation results show that the proposed ACAR protocol outperforms existing VANET routing protocols in terms of data delivery ratio, throughput and data packet delay. Since the proposed model is not constrained by network densities, the ACAR protocol is suitable for both daytime and nighttime city VANET scenarios.