Non-coherent distributed space–time coding techniques for two-way wireless relay networks

To overcome the overhead involved with channel estimation, several non-coherent distributed space–time coding (DSTC) strategies for two-way wireless relay networks (TWRNs) using the amplify-and-forward and the decode-and-forward protocol have been recently proposed that do not require channel state information (CSI) at any node to decode the information symbols. In this paper, novel differential DSTC strategies for TWRNs using the two- and three-phase protocol are proposed. In our transmission schemes, the relays do not waste power to transmit information known at the respective destination nodes. This is achieved by combining the symbols from both terminals received at the relays into a single symbol of the unaltered constellation. Furthermore, in our strategies, the direct link between the communicating terminals can be naturally incorporated to further improve the diversity gain. Simulations show a substantially improved performance in terms of bit error rate (BER) of the proposed strategies as compared to the existing strategies.     

Efficient QoS support in a slotted multihop WDM metro ring

A novel distributed access protocol for a slotted wavelength-division-multiplexing (WDM) metro ring employing all-optical packet switching and supporting quality-of-service (QoS) classes is presented and analyzed. Since we assume that there are more nodes than available wavelengths in the network, we obtain a scalable multihop WDM ring as underlying network architecture. By dividing each channel into several time slots and further applying destination release and slot reuse, data packets can be efficiently transmitted and received in a statistically multiplexed manner. In our architecture, each node is equipped with one tunable transmitter and one fixed-tuned receiver. Furthermore, as we generally consider so-called a posteriori access strategies, different packet selection schemes are proposed and compared. An analytical model based on the semi-Markov process methodology is developed to quantify the performance of one of these schemes. As a key element of the protocol, an efficient QoS support access mechanism is proposed and its performance is evaluated. The new QoS control scheme adopts a frame-based slot reservation strategy including connection setup and termination, which only slightly increases the signaling and node processing overhead. Thus, an efficient hybrid protocol combining connectionless and connection-oriented packet transmissions is proposed     

On the power efficiency of cooperative broadcast in dense wireless networks

A fundamental problem in large scale wireless networks is the energy efficient broadcast of source messages to the whole network. The energy consumption increases as the network size grows, and the optimization of broadcast efficiency becomes more important. In this paper, we study the optimal power allocation problem for cooperative broadcast in dense large-scale networks. In the considered cooperation protocol, a single source initiates the transmission and the rest of the nodes retransmit the source message if they have decoded it reliably. Each node is allocated an-orthogonal channel and the nodes improve their receive signal-to-noise ratio (SNR), hence the energy efficiency, by maximal-ratio combining the receptions of the same packet from different transmitters. We assume that the decoding of the source message is correct as long as the receive SNR exceeds a predetermined threshold. Under the optimal cooperative broadcasting, the transmission order (i.e., the schedule) and the transmission powers of the source and the relays are designed so that every node receives the source message reliably and the total power consumption is minimized. In general, finding the best scheduling in cooperative broadcast is known to be an NP-complete problem. In this paper, we show that the optimal scheduling problem can be solved for dense networks, which we approximate as a continuum of nodes. Under the continuum model, we derive the optimal scheduling and the optimal power density. Furthermore, we propose low-complexity, distributed and power efficient broadcasting schemes and compare their power consumptions with those-of-a traditional noncooperative multihop transmission     

Linear network coding

Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data before passing it on, the question involves optimization of the multicast mechanisms at the nodes. Among the simplest coding schemes is linear coding, which regards a block of data as a vector over a certain base field and allows a node to apply a linear transformation to a vector before passing it on. We formulate this multicast problem and prove that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.     

Bandwidth- and power-efficient routing in linear wireless networks

The goal of this paper is to establish which practical routing schemes for wireless networks are most suitable for power-limited and bandwidth-limited communication regimes. We regard channel state information (CSI) at the receiver and point-to-point capacity-achieving codes for the additive white Gaussian noise (AWGN) channel as practical features, interference cancellation (IC) as possible, but less practical, and synchronous cooperation (CSI at the transmitters) as impractical. We consider a communication network with a single source node, a single destination node, and N-1 intermediate nodes placed equidistantly on a line between them. We analyze the minimum total transmit power needed to achieve a desired end-to-end rate for several schemes and demonstrate that multihop communication with spatial reuse performs very well in the power-limited regime, even without IC. However, within a class of schemes not performing IC, single-hop transmission (directly from source to destination) is more suitable for the bandwidth-limited regime, especially when higher spectral efficiencies are required. At such higher spectral efficiencies, the gap between single-hop and multihop can be closed by employing IC, and we present a scheme based upon backward decoding that can remove all interference from the multihop system with an arbitrarily small rate loss. This new scheme is also used to demonstrate that rates of O(logN) are achievable over linear wireless networks even without synchronous cooperation.     

Variable-Range Transmission Power Control in Wireless Ad Hoc Networks

In this paper, we investigate the impact of variable-range transmission power control on the physical and network connectivity, on network capacity, and on power savings in wireless multihop networks. First, using previous work by Steele (1988), we show that, for a path attenuation factor a = 2, the average range of links in a planar random network of A m² having n nodes is ~aradicA/n1. We show that this average range is approximately half the range obtained when common-range transmission control is used. Combining this result and previous work by Gupta and Kumar (2000), we derive an expression for the average traffic carrying capacity of variable-range-based multihop networks. For a = 2, we show that this capacity remains constant even when more nodes are added to the network. Second, we derive a model that approximates the signaling overhead of a routing protocol as a function of the transmission range and node mobility for both route discovery and route maintenance. We show that there is an optimum setting for the transmission range, not necessarily the minimum, which maximizes the capacity available to nodes in the presence of node mobility. The results presented in this paper highlight the need to design future MAC and routing protocols for wireless ad hoc and sensor networks based, not on common-range which is prevalent today, but on variable-range power control     

A distributed protocol for dynamic address assignment in mobile ad hoc networks

A Mobile Ad hoc NETwork (MANET) is a group of mobile nodes that form a multihop wireless network. The topology of the network can change randomly due to unpredictable mobility of nodes and propagation characteristics. Previously, it was assumed that the nodes in the network were assigned IP addresses a priori. This may not be feasible as nodes can enter and leave the network dynamically. A dynamic IP address assignment protocol like DHCP requires centralized servers that may not be present in MANETs. Hence, we propose a distributed protocol for dynamic IP address assignment to nodes in MANETs. The proposed solution guarantees unique IP address assignment under a variety of network conditions including message losses, network partitioning and merging. Simulation results show that the protocol incurs low latency and communication overhead for an IP address assignment.     

Network Lifetime Maximization for Estimation in Multihop Wireless Sensor Networks

We consider the distributed estimation by a network consisting of a fusion center and a set of sensor nodes, where the goal is to maximize the network lifetime, defined as the estimation task cycles accomplished before the network becomes nonfunctional. In energy-limited wireless sensor networks, both local quantization and multihop transmission are essential to save transmission energy and thus prolong the network lifetime. The network lifetime optimization problem includes three components: i) optimizing source coding at each sensor node, ii) optimizing source throughput of each sensor node, and iii) optimizing multihop routing path. Fortunately, source coding optimization can be decoupled from source throughput and multihop routing path optimization, and is solved by introducing a concept of equivalent 1-bit MSE function. Based on the optimal source coding, the source throughput and multihop routing path optimization is formulated as a linear programming (LP) problem, which suggests a new notion of character-based routing. The proposed algorithm is optimal and the simulation results show that a significant gain is achieved by the proposed algorithm compared with heuristic methods.     

移动Ad HOc网络中的公平按需多址接入协议

基于快速、有效竞争预约接入、无冲突轮询传输的思想和带冲突预防的冲突分解策略,本文提出了适于移动Ad Hoc网络的公平按需多址接入(FODA)协议.该协议在分群结构的基础上,利用公平冲突预防算法预约信道资源获得轮询服务,从而完全消除了载波侦听方式下多跳无线网络业务传输中的隐藏终端和暴露终端问题.另外,公平冲突预防算法解决了节点竞争接入时的冲突问题和不公平现象.最后,仿真结果表明,与带冲突避免的载波侦听多址接入(CSMA/CA)和轮询协议相比,FODA协议可以提供较高的信道吞吐量、较低的平均消息丢弃率和平均消息时延.     

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.     

Joint Power Minimization in Wireless Relay Channels

Energy-constrained multihop wireless links are considered, where the total power consumption is minimized under given requirements on the end-to-end bit error rate (BER). As multihop transmissions are known to be able to save transmission energy in a wireless environment, we study the optimal power scheduling schemes over intermediate hops when the source- relays-destination link can be modeled as cascaded binary symmetric channels. The problem is formulated with an end- to-end BER constraint, and the resulting power consumption is compared with that of the individual link requirement strategy where each hop assigns power under a per-link BER constraint. Results show that the proposed joint power scheduling strategy can achieve a maximum power reduction factor of M in an M-hop route.     

Load-balancing routing in multichannel hybrid wireless networks with single network interface

A hybrid wireless network is an extension of an infrastructure network, where a mobile host may connect to an access point (AP) using multihop wireless routes, via other mobile hosts. The APs are configured to operate on one of multiple available channels. Mobile hosts and wireless routers can select its operating channel dynamically through channel switching. In this environment, a routing protocol that finds routes to balance load among channels while maintaining connectivity was proposed. The protocol works with nodes equipped with a single network interface, which distinguishes the work with other multichannel routing protocols that require multiple interfaces per node. The protocol discovers multiple routes to multiple APs, possibly operating on different channels. Based on a traffic load information, each node selects the "best" route to an AP and synchronizes its channel with the AP. With this behavior, the channel load is balanced, removing hot spots and improving channel utilization. The protocol assures every node has at least one route to an AP, where all intermediate nodes are operating on the same channel. The simulation results show that the proposed protocol successfully adapts to changing traffic conditions and improves performance over a single-channel protocol and a multichannel protocol with no load balancing.     

Distributed space-time coding for multihop transmission in power line communication networks

In this paper, we consider transmission in relatively wide-stretched power line communication (PLC) networks, where repeaters are required to bridge the source-to-destination distance. In particular, it is assumed that each network node is a potential repeater and that multihop transmission is accomplished in an ad hoc fashion without the need for complex routing protocols. In such a scenario, due to the broadcasting nature of the power line channel, multiple repeater nodes may receive and retransmit the source message simultaneously. It is shown that, if no further signal processing is applied at the transmitter, simultaneous retransmission often deteriorates performance compared with single-node retransmission. We therefore advocate the application of distributed space-time block codes (DSTBCs) to the problem at hand. More specifically, we propose that each network node is assigned a unique signature sequence, which allows efficient combining at the receiver. Most notably, DSTBC-based retransmission does not require explicit collaboration among network nodes for multihop transmission and detection complexity is not increased compared with single-node retransmission. Numerical results for multihop transmission over PLC networks show that DSTBC-based retransmission achieves a considerably improved performance in terms of required transmit power and multihop delay compared with alternative retransmission strategies.     

Reliable Distributed Local Repair Approach for Maximizing Reliability and Packet Delivery Rate in Wireless on Demand AODV Networks

The most used protocol in Mobile Ad hoc Networks (MANETs) uses the Ad hoc On-Demand Distance Vector (AODV) routing protocol for achieving dynamic, self-organizing, and on-demand multihop routing. In AODV, wireless links may be lost occasionally because the nodes on the routing path are unreachable. Such a problem causes AODV inefficient and unreliable. For solving the problem, AODV provides a local repair mechanism for an intermediate node to find an alternative route to destination when the node detects links broken. The repair mechanism uses the broadcast-type RREQ message for discovering a repair route, which results in a large number of repair control messages and requires a large amount of power consumption for sending these messages. Therefore, in this paper we propose a unicast-type distributed local repair protocol for repairing breaks expeditiously, i.e., achieving high network reliability and utilization, less the number of control messages, and less the repair delay. Furthermore, the optimal number of hops in a neighbor table is analyzed. Numerical results indicate that the proposed approach is superior to other repair approaches in terms of successful fixing rate, control message overhead, and network utilization.     

Power efficiency of user cooperation in multihop wireless networks

In this paper we analyze the power efficiency of a user cooperation scheme for multihop wireless networks. In this scheme, the signals are jointly transmitted by two mobile terminals (MTs), emulating transmit macro diversity. We derive the optimal transmit power assignments for the two transmitting MTs and quantify the power efficiency of the scheme. The results indicate that macro diversity by way of user cooperation can substantially reduce the total consumed power in multihop wireless networks for wide range of topologies of MTs and their distances.     

Multicast routing and wavelength assignment in multihop optical networks

This paper addresses multicast routing in circuit-switched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast communication requests are made and released dynamically over time. A multicast connection is realized by constructing a multicast tree which distributes the message from the source node to all destination nodes such that the wavelengths used on each link and the receivers and transmitters used at each node are not used by existing circuits. We show that the problem of routing and wavelength assignment in this model is, in general, NP-complete. However, we also show that for any given multicast tree, the wavelength assignment problem can be solved in linear time.     

Efficient on-demand routing for mobile ad hoc wireless access networks

In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the gateway via their neighboring nodes over multihop paths. On-demand routing schemes are appealing because of their low routing overhead in bandwidth restricted mobile ad hoc networks, however, their routing control overhead increases exponentially with node density in a given geographic area. To control the overhead of on-demand routing without sacrificing performance, we present a novel extension of the ad hoc on-demand distance vector (AODV) routing protocol, called LB-AODV, which incorporates the concept of load-balancing (LB). Simulation results show that as traffic increases, our proposed LB-AODV routing protocol has a significantly higher packet delivery fraction, a lower end-to-end delay and a reduced routing overhead when compared with both AODV and gossip-based routing protocols.     

A Two-Layer Key Establishment Scheme for Wireless Sensor Networks

In a large scale sensor network, it is infeasible to assign a unique Transport Layer Key (TLK) for each pair of nodes to provide the end-to-end security due to the huge memory cost per node. Thus, conventional key establishment schemes follow a key predistribution approach to establish a Link Layer Key (LLK) infrastructure between neighboring nodes and rely on multihop paths to provide the end-to-end security. Their drawbacks include vulnerability to the node compromise attack, large memory cost, and energy inefficiency in the key establishment between neighboring nodes. In this paper, we propose a novel key establishment scheme, called LAKE, for sensor networks. LAKE uses a t-degree trivariate symmetric polynomial to facilitate the establishment of both TLKs and LLKs between sensor nodes in a two-dimensional space, where each node can calculate direct TLKs and LLKs with some logically neighboring nodes and rely on those nodes to negotiate indirect TLKs and LLKs with other nodes. Any two end nodes can negotiate a TLK on demand directly or with the help of only one intermediate node, which can be determined in advance. As for the LLK establishment, LAKE is more secure under the node compromise attack with much less memory cost than conventional solutions. Due to the location-based deployment, LAKE is also energy efficient in that each node has direct LLKs with most neighbors without spending too much energy on the establishment of indirect LLKs with neighbors through multihop routing.     

Logically rearrangeable multihop lightwave networks

The optimization problem of rearrangeable multihop lightwave networks is considered. The authors formulate the flow and wavelength assignment problem, when minimizing the maximum flow in the network, as a mixed integer optimization problem subject to linear constraints. The problem is decomposed into two independent subproblems, the wavelength assignment (or connectivity problem) and the flow assignment (or routing problem). A simple heuristic provides a meaningful formulation to the connectivity problem, in a form similar to a transportation problem. An algorithm is then proposed which finds a heuristic initial logical connectivity diagram and the corresponding routing, and then iterates from that solution by applying branch-exchange operations to the connectivity diagram. The algorithm was tested on illustrative traffic matrices for an 8 node network with two transmitters and two receivers per node, and an improvement in achievable throughput over the Perfect Shuffle interconnection pattern was shown in all cases     

协作分集系统中基于注水算法的功率分配方案研究

为了提高协作分集系统的信道容量,该文在多中继节点协作背景下提出了基于注水算法的中继节点功率分配方案。首先,对空时矩阵的列序号提出了一种新的映射方案,该方案能够提升中继节点发射信号间的正交性。对于采用线性正交解码算法的GABBA码,列序号重新排布后能够降低误码率。然后,通过对接收信噪比与中继节点发射功率的分析,针对信道容量最大化问题提出了一种应用注水算法的两步求解方案。该文对瑞利平坦慢衰落信道下采用GABBA码的协作分集系统进行仿真,仿真结果表明,与中继节点发射功率均分方案相比,该文提出的功率分配方案能够提升系统抗误码性能,达到满分集增益NtNr。该文提出的方案在不同的仿真条件下对信道容量均有提升,并且信道容量与min{NtNr}log2M成正比。