Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks

2006 ◽  
Vol 5 (9) ◽  
pp. 1215-1227 ◽  
Author(s):  
Weifa Liang ◽  
Xiaoxing Guo
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Network Capacity ◽  
Capacity Maximization ◽  
Energy Constrained ◽  
Hoc Networks

Improving the Energy Efficiency by Cooperative Transmission in Multi-Hop Wireless Ad-Hoc Networks

2021 ◽  
Author(s):  
Salah Abdulhadi
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Multiple Antennas ◽  
Network Capacity ◽  
Cooperative Relaying ◽  
Cooperative Transmission ◽  
Total Power ◽  
Potential Candidate ◽  
Hoc Networks

Cooperative transmission has been recently proposed as a promising technique to combat multi-path fading and increased link reliability. It represents a potential candidate to exploit the benefits of using multiple antennas system without requiring to implement multiple antennas per terminal. There has been extensive research investigating physical layer issues of such systems; however, higher layer protocols that exploit cooperative links in ad hoc networks are still emerging in cooperative ad hoc networks, and it is important to effectively use cooperation without affecting the performance of the network. In this dissertation, we proposed a novel a characterization of the optimal multi-hop cooperative routing in ad hoc networks, and developed a metric for both evaluation. The key advantages of cooperative links are to minimize the number of hops while maintaining the QoS requirements and to minimize the end-to-end total power for a given rate. Also we showed that energy can be used more efficiently if we determine the joint optimal packet size and the optimal power allocation for both the source and the relay. For multi-flow scenario, we have proposed a clique-based inter-flow interference abstraction, and used the linear programming formulation to study the capacity gain of ad-hoc cooperative network. It is observed that the network capacity in multi-hop multi-flow settings is severely affected by interference between links and this effect increases when the cooperative relaying is imposed.

A Power Optimization Algorithm for Ad Hoc Networks with Variable Rate Control

2013 ◽  
Vol 470 ◽  
pp. 611-616
Author(s):  
Xuan Jie Ning ◽  
Hai Zhao ◽  
Mao Fan Yang ◽  
Dan Wu
Keyword(s):  
Ad Hoc Networks ◽  
Rate Control ◽  
Ad Hoc ◽  
Transmission Rate ◽  
Mac Protocol ◽  
Network Capacity ◽  
Data Rate ◽  
Medium Access ◽  
High Data ◽  
Hoc Networks

This paper is concerned with the capacity of ad hoc networks employing pure ALOHA medium access control (MAC) protocol under the effect of different transmission power levels and variable data rate control. The data rate of a certain link is related to the signal to interference plus noise ratio (SINR), and SINR is, in turn, related to the transmitted power and link distance. The increasing power conducts a high data rate, resulting in the high interference of networks. Consequently, the optimum power that yields maximum network throughput is a tradeoff between transmission rate and network interference. Mathematical model analysis for the ad hoc network capacity are presented in the paper. A revised expression to the approximate calculating of the capture probability in networks is proposed.

scholarly journals Dynamic Cooperative Clustering Based Power Assignment: Network Capacity and Lifetime Efficient Topology Control in Cooperative Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Xiao-Hong Li ◽  
Ling Xiao ◽  
Dong Wang
Keyword(s):  
Energy Consumption ◽  
Ad Hoc Networks ◽  
Network Lifetime ◽  
Topology Control ◽  
Ad Hoc ◽  
Cluster Head ◽  
Network Capacity ◽  
Power Assignment ◽  
Cooperative Clustering ◽  
Hoc Networks

Cooperative communication (CC) is used in topology control as it can reduce the transmission power and expand the transmission range. However, all previous research on topology control under the CC model focused on maintaining network connectivity and minimizing the total energy consumption, which would lead to low network capacity, transmission interruption, or even network paralysis. Meanwhile, without considering the balance of energy consumption in the network, it would reduce the network lifetime and greatly affect the network performance. This paper tries to solve the above problems existing in the research on topology control under the CC model by proposing a power assignment (DCCPA) algorithm based on dynamic cooperative clustering in cooperative ad hoc networks. The new algorithm clusters the network to maximize network capacity and makes the clusters communicate with each other by CC. To reduce the number of redundant links between clusters, we design a static clustering method by using Kruskal algorithm. To maximize the network lifetime, we also propose a cluster head rotating method which can reach a good tradeoff between residual energy and distance for the cluster head reselection. Experimental results show that DCCPA can improve 80% network capacity with Cooperative Bridges algorithm; meanwhile, it can improve 20% network lifetime.

Analysis of Access Delay in Ad Hoc Wireless Networks for Multimedia Applications

2019 ◽  
pp. 93-107
Author(s):  
Arundhati Arjaria
Keyword(s):  
Wireless Networks ◽  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Network Capacity ◽  
Wireless Channel ◽  
Multimedia Applications ◽  
Access Delay ◽  
Hoc Networks ◽  
Exposed Terminal

Mobile ad hoc networks are infrastructure-less wireless networks; all nodes can quickly share information without using any fixed infrastructure like base station or access point. Wireless ad hoc networks are characterized by frequent topology changes, unreliable wireless channel, network congestion, and resource contention. Multimedia applications usually are bandwidth hungry with stringent delay, jitter, and loss requirements. Designing ad hoc networks which support multimedia applications, hence, is considered a hard task. The hidden and exposed terminal problems are the main which consequently reduces the network capacity. Hidden and exposed nodes reduce the performance of the wireless ad hoc networks. Access delay is the major parameter that is to be taken under consideration. Due to hidden and exposed terminal problems, the network suffers from a serious unfairness problem.

scholarly journals Actor–Critic-Algorithm-Based Accurate Spectrum Sensing and Transmission Framework and Energy Conservation in Energy-Constrained Wireless Sensor Network-Based Cognitive Radios

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Hurmat Ali Shah ◽  
Insoo Koo ◽  
Kyung Sup Kwak
Keyword(s):  
Cognitive Radio ◽  
Ad Hoc Networks ◽  
Spectrum Sensing ◽  
Optimization Problem ◽  
Ad Hoc ◽  
Cognitive Radios ◽  
Residual Energy ◽  
Current Time ◽  
Energy Constrained ◽  
Hoc Networks

Spectrum sensing is of the utmost importance to the workings of a cognitive radio network (CRN). The spectrum has to be sensed to decide whether the cognitive radio (CR) user can transmit or not. Transmitting on unoccupied spectrum becomes a hard task if energy-constrained networks are considered. CRNs are ad hoc networks, and thus, they are energy-limited, but energy harvesting can ensure that enough energy is available for transmission, thus enabling the CRN to have a theoretically infinite lifetime. The residual energy, along with the sensing decision, determines the action in the current time slot. The transmission decision has to be grounded on the sensing outcome, and thus, a combined sensing–transmission framework for the CRN has to be considered. The sensing–transmission framework forms a Markov decision process (MDP), and solving the MDP problem exhaustively through conventional methods cannot be a plausible solution for ad hoc networks such as a CRN. In this paper, to solve the MDP problem, an actor–critic-algorithm-based solution for optimizing the action taken in a sensing–transmission framework is proposed. The proposed scheme solves an optimization problem on the basis of the actor–critic algorithm, and the action that brings the highest reward is selected. The optimal policy is determined by updating the optimization problem parameters. The reward is calculated by the critic component through interaction with the environment, and the value function for each state is updated, which then updates the policy function. Simulation results show that the proposed scheme closely follows the exhaustive search scheme and outperforms a myopic scheme in terms of average throughput achieved.

Sign in / Sign up

Export Citation Format

Share Document