A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers

Bozdağ, Doruk; Çatalyürek, Ümit V.; Gebremedhin, Assefaw H.; Manne, Fredrik; Boman, Erik G.; Özgüner, F.

doi:10.1007/11557654_90

Cited by 26 publications

(22 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A preliminary work we have done on parallel distance-2 coloring is available in [5]. Table A.2 Comparison of algorithms for the application graphs on the Itanium 2 cluster using s = 800…”

Section: Resultsmentioning

confidence: 99%

A framework for scalable greedy coloring on distributed-memory parallel computers

Bozdağ

Gebremedhin

Manne

et al. 2008

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

“…A preliminary work we have done on parallel distance-2 coloring is available in [5]. Table A.2 Comparison of algorithms for the application graphs on the Itanium 2 cluster using s = 800…”

Section: Resultsmentioning

confidence: 99%

A framework for scalable greedy coloring on distributed-memory parallel computers

Bozdağ

Gebremedhin

Manne

et al. 2008

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

“…D Bozdag et.al. [4] presented an efficient parallel distance-2 coloring algorithm suitable for distributed memory computers and experimentally demonstrated its scalability. The main idea of parallel distance-2 coloring algorithm is to color boundary vertices concurrently in a speculative manner and then detect and rectify conflicts.…”

Section: Related Workmentioning

confidence: 99%

Collision Optimized Broadcast Scheduling in Wireless Sensor Network

Ramzi¹,

Fatima²

2015

IJCA

View full text Add to dashboard Cite

Broadcasting plays an important role in the communication protocol design and it acts as a fundamental operation in wireless sensor network (WSN). This paper investigates the Minimum Latency Broadcast Scheduling in Duty Cycled (MLBSDC) problem in WSN. The MLBSDC problem aims to find a broadcast scheduling that minimizes the time in which the last node receives the broadcast message with minimum collision. The focus is mainly on providing minimum collision and finding the lower bound of broadcast latency. In this paper, a novel algorithm Collision Optimized Broadcast Scheduling (COBS) is proposed which is a refinement of Effective Broadcast Scheduling with Optimized Latency (EBSOL) [9] algorithm. COBS allow nodes in different layers of the broadcast tree to transmit the message simultaneously. In EBSOL, the latency is efficiently reduced by layer by layer approach and the broadcast tree is constructed. It is proved that COBS produces a latency of at most 12 |T|, where T denotes the number of time slots in a scheduling period. To prevent collision, each node maintains an effective routing table and only one parent node transmits the message to the child node. The results from extensive simulation show that COBS has a better performance than the existing One To All Broadcast (OTAB) algorithm in terms of reduction in latency, number of transmission and collision.

show abstract

“…Their algorithms achieve an approximation ratio of O(( 2 +1)T) and 24T +1, respectively, where is the maximum degree, and T denotes the number of time slots in a scheduling period. Both algorithms apply the D2-coloring approach [21] to schedule transmissions on a shortest path tree. In [10], Jiao et al show that ELAC can be improved further by using D2-coloring twice at each layer of the shortest path tree.…”

Section: Related Workmentioning

confidence: 99%

Approximation algorithm for data broadcasting in duty cycled multi-hop wireless networks

Zhao

Chin

2013

J Wireless Com Network

View full text Add to dashboard Cite

Broadcast is a fundamental operation in wireless networks. To this end, many past studies have studied the NP-hard, broadcast problem for always-on multi-hop networks. However, in wireless sensor networks, nodes are powered by batteries, meaning, they have finite energy. Consequently, nodes are required to have a low duty cycle, whereby they switch between active and sleep state periodically. This means that a transmission from a node may not reach all of its neighbors simultaneously. Consequently, any developed broadcast protocols must consider collisions and the wakeup times of neighboring nodes. Henceforth, this paper studies the minimum latency broadcast scheduling problem in duty cycled multi-hop wireless networks (MLBSDC), which remains NP hard. The MLBSDC problem aims to find a collision-free schedule that minimizes the time in which the last node receives a broadcast message. We propose a novel algorithm called CFBS that allows nodes in different layers of the broadcast tree to transmit simultaneously. We prove that CFBS produces a latency of at most (T + 1)H + T O(log 2 H). Here, T denotes the number of time slots in a scheduling period, and H is the optimal broadcast latency obtained from the shortest path tree algorithm assuming no collision. We also show that the total number of transmissions is at most 4(T + 2) times larger than the optimal value. The results from extensive simulation show that CFBS has a better performance than OTAB, the best broadcast scheduling algorithm to date. In particular, the broadcast latency achieved by CFBS is up to 3 20 that of OTAB.

show abstract

A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers

Cited by 26 publications

References 13 publications

A framework for scalable greedy coloring on distributed-memory parallel computers

A framework for scalable greedy coloring on distributed-memory parallel computers

Collision Optimized Broadcast Scheduling in Wireless Sensor Network

Approximation algorithm for data broadcasting in duty cycled multi-hop wireless networks

Contact Info

Product

Resources

About