Throughput and Energy Efficiency in Wireless Ad Hoc Networks With Gaussian Channels

Shpungin, Hanan; Li, Zongpeng

doi:10.1109/tnet.2011.2158237

Cited by 10 publications

(7 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such problem has been studied in traditional topology control algorithm (without CC) [ 3 ]. In [ 3 ], Shpungin and Li developed a static cluster based power assignment algorithm which achieves energy efficiency and also maximizes network capacity in the case of unlimited maximum transmission power of each node.…”

Section: Related Workmentioning

confidence: 99%

“…It is nearly impossible for the battery at nodes to be recharged or replaced; thus, energy efficiency is crucial in wireless ad hoc networks. The key difference between wireless ad hoc networks and conventional communication structures, from the designer's point of view, lies in the power assignment model [ 3 ]. The energy consumption of a single node is proportional to the transmission power it assigned.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Ling

Wang

2014

The Scientific World Journal

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Ling

Wang

2014

The Scientific World Journal

View full text Add to dashboard Cite

show abstract

“…Such problem has been studied in traditional topology control algorithm (without CC). 3 In Ref. [3], Shpungin et al developed a cluster based power assignment algorithm which achieves energy efficiency and also maximizes network capacity in the case of unlimited maximum transmission power of each node.…”

Section: Related Workmentioning

confidence: 99%

“…3 In Ref. [3], Shpungin et al developed a cluster based power assignment algorithm which achieves energy efficiency and also maximizes network capacity in the case of unlimited maximum transmission power of each node. Cluster algorithm is a kind of smart scheduling algorithms [12][13] to improve the network capacity by lowering the interference of concurrent transmissions in a sparse network.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Cooperative Cluster Method Based Power Assignment

Wang¹,

Xiao²,

Xiao-hong³

2013

Jnl of Comp & Theo Nano

View full text Add to dashboard Cite

Cooperative communication (CC) allows relay nodes to help the source node to simultaneously transmit the same data to the destination node which in some way (such as MRC) correctly decodes the received signal. CC is used in topology control as it can reduce the transmission power and expand the transmission range. However, all previous research on the application of CC in topology control ignored the network capacity by focusing only on maintaining network connectivity and minimizing the total transmission power, which will result in poor network performance or even paralysis of the network. In order to solve this problem, we propose a Cooperative Clustering Based Power Assignment (CCPA) algorithm in cooperative ad hoc networks in this paper. In CCPA, the network isn't connected without CC. First we cluster the network and then make the clusters communicate with each other by CC, and then we use MST to reduce redundant links between clusters, and finally do power assignment. The algorithm aims to minimize the total energy consumption and maximize the network capacity. Then the application of this algorithm is discussed in a distributed case. Experimental results show that CCPA can keep the same energy consumption with Coop. Bridges algorithm; meanwhile, it can improve 20% network capacity. With the number of nodes increasing, it can even improve 100% network capacity.

show abstract