Self-Adaptive Power Adjustment Routing Based on the Cognitive Radio Ad Hoc Network

2013 ◽  
Vol 443 ◽  
pp. 535-540
Author(s):  
Yu Dong ◽  
Rui Qi Liu ◽  
Cheng Pei Tang
Keyword(s):  
Energy Consumption ◽  
Cognitive Radio ◽  
Network Lifetime ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Power Adjustment ◽  
Extra Energy ◽  
Routing Mechanism ◽  
Adaptive Power ◽  
Self Adaptive

There are usually energy holes caused by uneven energy consumption of transferring data in Cognitive Radio Ad Hoc Network (CRANH), which brings about many difficulties in various applications, as limit the network lifetime. To solve this problem, the major idea so far is based on the real-time routing mechanism. However, the method needs to cost extra energy for be routed again after transferring data, it can decrease network surviving lifetime. Hence, a self-adaptive power adjustment routing mechanism for Cognitive Radio Ad Hoc Network proposed in this paper. The algorithm can be minimum of network energy consumption of transferring data based on self-adaptive power adjustment technique can find different neighbor set to meet different power thresholds. Theoretically and experimentally, it is concluded that the proposed algorithm is able to decrease energy consumption and improve the network lifetime of CRANH.

The Research of Self-Adaptative Power Adjustment Routing

2014 ◽  
Vol 986-987 ◽  
pp. 2082-2085
Author(s):  
Zhi Ping Ding
Keyword(s):  
Cognitive Radio ◽  
Power Consumption ◽  
Energy Saving ◽  
Real Time ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Power Type ◽  
Power Adjustment ◽  
Routing Mechanism ◽  
Internal Capacity

Cognitive Radio Ad Hoc Network (CRAHN), established on the cognitive radio environment, configures the Ad Hoc Network which possesses the internal capacity. How to effectively control the power consumption is an important issue in the CRAHN for CRAHN‘s main power type is battery. At present, the energy-saving routing research in CRAHN is mainly based on the real-time routing mechanism. It means that it should be routed again after transferring an archive. In order to increase the network route’s surviving time and save the power consumption, it introduces a routing mechanism whose purpose is to optimize the communication algorithm’s performance by improving the existing routing mechanism in the Ad Hoc network.

scholarly journals Mathematical formulation of energy efficient routing with constraint in mobile ad hoc network

2018 ◽  
Vol 7 (2) ◽  
pp. 674
Author(s):  
Rakesh Sahu ◽  
Narendra Chaudhari
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mathematical Formulation ◽  
Energy Efficient Routing ◽  
Optimization Function ◽  
Mobile Ad Hoc ◽  
The Mathematical Model

Energy consumption of nodes during the transmission is an important factor for the efficiency and lifetime of a mobile ad hoc network. The reduction in consumption of energy can be achieved, only when its consumption at each step is known. The purpose of this paper is to formulate the mathematical model of energy consumption of network on the basis on links and available nodes in order to formulate the energy optimization function. The probability of link failure in route and innetwork have been taken into consideration as constraints while formulating the objective function of estimated energy consumption, as the low connectivity is one of the challenges due to mobility in ad hoc network.

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.

Sign in / Sign up

Export Citation Format

Share Document